公开(公告)号：US20140279732A1

公开(公告)日：2014-09-18

申请号：US13826188

申请日：2013-03-14

Applicant: XEROX CORPORATION

Inventor： Kirk J. Ocke ,  Dale E. Gaucas ,  Michael D. Shepherd

IPC: G06N99/00

CPC classification number: G06N99/005

Abstract: The present disclosure provides for categorization of lists of words. The method comprises querying DBpedia to find the resources related to the given list of words. Once the resources are found, the corresponding media Wikipedia categories can be retrieved, as well as their ancestors, generating a graph of categories. A number of graph analysis algorithms can then be applied to the graph, each returning a selected category. For each algorithm a classifier is trained to decide whether the output of the algorithm is indeed the “best” category. An ensemble weighted majority voting can then be used to select the best category based on votes cast by each classifier. The disclosure demonstrates a more accurate selection of the best category and can include an ensemble majority rated voting algorithm comprising all voting members initially casting one vote; i.e., highest frequency, most frequently occurring word, least common ancestor and centrality measures.

Abstract translation: 本公开提供了词语列表的分类。 该方法包括查询DBpedia以查找与给定列表单词相关的资源。 一旦找到资源，可以检索相应的媒体维基百科类别，以及其祖先，生成类别图。 然后可以将许多图分析算法应用于图，每个返回所选类别。 对于每个算法，分类器被训练以决定算法的输出是否确实是“最佳”类别。 然后可以根据每个分类器投票的投票来使用合奏加权多数投票来选择最佳类别。 披露表明更精确地选择最佳类别，并且可以包括包含所有投票成员最初投一票的合奏多数评级投票算法; 即最高频率，最常出现的词，最不常见的祖先和中心性度量。

公开(公告)号：US09171267B2

公开(公告)日：2015-10-27

申请号：US13826188

申请日：2013-03-14

Applicant: Xerox Corporation

Inventor： Kirk J. Ocke ,  Dale E. Gaucas ,  Michael D. Shepherd

IPC: G06F15/18 ,  G06N99/00

CPC classification number: G06N99/005

Abstract: The present disclosure provides for categorization of lists of words. The method comprises querying DBpedia to find the resources related to the given list of words. Once the resources are found, the corresponding media Wikipedia categories can be retrieved, as well as their ancestors, generating a graph of categories. A number of graph analysis algorithms can then be applied to the graph, each returning a selected category. For each algorithm a classifier is trained to decide whether the output of the algorithm is indeed the “best” category. An ensemble weighted majority voting can then be used to select the best category based on votes cast by each classifier. The disclosure demonstrates a more accurate selection of the best category and can include an ensemble majority rated voting algorithm comprising all voting members initially casting one vote; i.e., highest frequency, most frequently occurring word, least common ancestor and centrality measures.

Abstract translation: 本公开提供了词语列表的分类。 该方法包括查询DBpedia以查找与给定列表单词相关的资源。 一旦找到资源，可以检索相应的媒体维基百科类别，以及其祖先，生成类别图。 然后可以将许多图分析算法应用于图，每个返回所选类别。 对于每个算法，分类器被训练以决定算法的输出是否确实是“最佳”类别。 然后可以根据每个分类器投票的投票来使用合奏加权多数投票来选择最佳类别。 披露表明更精确地选择最佳类别，并且可以包括包含所有投票成员最初投一票的合奏多数评级投票算法; 即最高频率，最常出现的词，最不常见的祖先和中心性度量。

公开(公告)号：US20150025958A1

公开(公告)日：2015-01-22

申请号：US13943244

申请日：2013-07-16

Applicant: XEROX CORPORATION

Inventor： Dale Ellen Gaucas ,  Kirk J. Ocke ,  Michael David Shepherd

IPC: G06Q30/02

CPC classification number: G06Q30/0244

Abstract: The present invention generally relates to systems and methods for assessing a multi-media marketing campaign under development. The techniques presented assess, for example, whether pairs of touchpoints of the campaign are compatible in terms of best practices related to content and style and whether contributors to the touchpoints are effectively collaborating.

Abstract translation: 本发明一般涉及用于评估正在开发的多媒体营销活动的系统和方法。 所提出的技术可以评估，例如，广告活动的接触点是否与内容和风格相关的最佳做法兼容，以及接触点的贡献者是否有效协作。

公开(公告)号：US20140279057A1

公开(公告)日：2014-09-18

申请号：US13826438

申请日：2013-03-14

Applicant: XEROX CORPORATION

Inventor： Michael David Shepherd ,  Dale Ellen Gaucas ,  Kirk J. Ocke

IPC: G06Q30/02

CPC classification number: G06Q30/0276

Abstract: A method of automatically visualizing the content and messaging of documents in a marketing campaign design environment are provided. The exemplary method includes receiving an identification of a specified Touchpoint of the plurality of Touchpoints in a campaign; instantiating the specified Touchpoint and its elements into a knowledge model; executing semantic inferencing engine to determine inferences based on the plurality of Touchpoints instantiated into the knowledge model; transforming inferences into implicit requirements about the contents for each of the Touchpoints; displaying a representation of the specified Touchpoint; and including within the representation of the specified Touchpoint the Touchpoint contents as described by the explicit and implicit requirements.

Abstract translation: 提供了一种在营销活动设计环境中自动可视化文档内容和消息传递的方法。 该示例性方法包括：在一个活动中接收多个接触点的指定的接触点的标识; 将指定的Touchpoint及其元素实例化为知识模型; 执行语义推理引擎以基于实例化到知识模型中的多个接触点来确定推论; 将推论转化为对每个接触点的内容的隐含需求; 显示指定的Touchpoint的表示; 并且在指定的Touchpoint的表示内包括由显式和隐式要求描述的Touchpoint内容。