公开(公告)号：US09659059B2

公开(公告)日：2017-05-23

申请号：US14847769

申请日：2015-09-08

Applicant: salesforce.com, inc.

Inventor： Matthew Fuchs

IPC: G06F17/30 ,  G06F17/27 ,  G06F3/06

CPC classification number: G06F17/30477 ,  G06F3/0644 ,  G06F3/067 ,  G06F17/2765 ,  G06F17/2795 ,  G06F17/30318 ,  G06F17/3061

Abstract: Word phrases are stored in a phrase structure. Each word is stored as a keyword in a keyword structure. Each keyword is associated with usage attributes identifying use of a word in a word phrase. Any preceding words associated with a keyword, and a mapping from any preceding words to a word phrase, is stored for each word. A word string is input. Match attributes are updated in a match structure if a word in the word string matches any keyword and if any preceding words associated with any matching keyword includes a preceding word which precedes the word in the word string. The match attributes indicate use of the matching word in the word string and in a word phrase. Whether a word phrase is present in the word string is determined based on the usage attributes and the match attributes associated with multiple matching words.

公开(公告)号：US09619458B2

公开(公告)日：2017-04-11

申请号：US13915356

申请日：2013-06-11

Applicant: salesforce.com, inc.

Inventor： Matthew Fuchs ,  Zandro Luis Gonzalez ,  Craig Howland

IPC: G06F17/27 ,  G06F17/30

CPC classification number: G06F17/2775 ,  G06F17/2705 ,  G06F17/2795 ,  G06F17/30017 ,  G06F17/3002 ,  G06F17/3061

Abstract: A system and method for matching phrases having arbitrary text. A first data structure stores a list of common phrases having multiple words. Each unique word is indexed in a hash table and mapped to one or more values that describe attributes of using the word in one or more of the common phrases. Using the hash table and the list of common phrases, a temporary array is defined to keep track of possible matches between words in an input string and the list of common phrases.

公开(公告)号：US20140304279A1

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

申请号：US14244146

申请日：2014-04-03

Applicant: Salesforce.com, inc.

Inventor： Matthew Fuchs ,  Stanislav Georgiev

IPC: G06F17/30

CPC classification number: G06F17/30539 ,  H04B17/00

Abstract: The technology disclosed relates to automatic generation of tuples from a record set for outlier analysis. Applying this new technology, user need not specify which 1-tuples to combine into n-tuples. The tuples are generated from structured records organized into features (that also could be fields, objects or attributes.) Tuples are generated from combinations of feature values in the records. Thresholding is applied to manage the number of tuples generated. The technology disclosed further relates to indexing and searching high dimensional tuple spaces in a computer-implemented system.

Abstract translation: 所公开的技术涉及从用于异常值分析的记录集中自动生成元组。 应用这种新技术，用户不需要指定要组合成n元组的1元组。 元组是从组织成特征的结构化记录（也可以是字段，对象或属性）生成的。元组是从记录中的特征值组合生成的。 应用阈值来管理生成的元组的数量。 所公开的技术还涉及在计算机实现的系统中索引和搜索高维元组空间。

公开(公告)号：US20140025369A1

公开(公告)日：2014-01-23

申请号：US13915356

申请日：2013-06-11

Applicant: salesforce.com, inc.

Inventor： Matthew Fuchs ,  Zandro Luis Gonzalez ,  Craig Howland

IPC: G06F17/27

CPC classification number: G06F17/2775 ,  G06F17/2705 ,  G06F17/2795 ,  G06F17/30017 ,  G06F17/3002 ,  G06F17/3061

Abstract: A system and method for matching phrases having arbitrary text. A first data structure stores a list of common phrases having multiple words. Each unique word is indexed in a hash table and mapped to one or more values that describe attributes of using the word in one or more of the common phrases. Using the hash table and the list of common phrases, a temporary array is defined to keep track of possible matches between words in an input string and the list of common phrases.

Abstract translation: 用于匹配具有任意文本的短语的系统和方法。 第一数据结构存储具有多个单词的常用短语的列表。 每个独特的词在哈希表中进行索引，并映射到描述在一个或多个常见短语中使用单词的属性的一个或多个值。 使用散列表和公共短语列表，定义临时数组来跟踪输入字符串中的单词和常用短语列表之间可能的匹配。

公开(公告)号：US10592955B2

公开(公告)日：2020-03-17

申请号：US14504593

申请日：2014-10-02

Applicant: salesforce.com, inc.

Inventor： Arun Jagota ,  Matthew Fuchs ,  Gregory Haardt

IPC: G06Q30/06 ,  G06Q30/02 ,  G06Q30/00 ,  G06Q10/06 ,  G06Q40/00 ,  G06Q10/10

Abstract: A system creates a graph of nodes connected by arcs, and identifies a first compound attribute associated with contacts purchased by a current user. The first compound attribute includes a first attribute associated with a first value and a second attribute associated with a second value. The system identifies a directed arc from a first node to a second node. The directed arc is associated with a probability that previous users who purchased a first contact associated with the first compound attribute also purchased a second contact associated with a second compound attribute. The second compound attribute includes the first attribute, associated with a third value which matches the first value, and the second attribute, associated with a fourth value, which lacks a match with the second value. The system outputs a recommendation for the current user to purchase contacts associated with the second compound attribute if the probability exceeds a threshold.

公开(公告)号：US10423883B2

公开(公告)日：2019-09-24

申请号：US14821245

申请日：2015-08-07

Applicant: salesforce.com, inc.

Inventor： Matthew Fuchs

IPC: G06N5/04 ,  G06N5/02 ,  G06Q10/00

Abstract: Methods and systems are provided for evaluating standing queries against updated contact entries configured as a stream of facts. The method includes resolving the standing queries into an array of rules, each rule having a first and a second condition; sorting one of the facts into a first property and a second property; comparing the first property of the fact to the first condition of each rule in the array of rules to produce a first subset of matching rules; comparing the second property of the fact to the second condition of each rule in the first subset of rules to produce a second subset of matching rules; and reporting at least one of the second subset of rules to an author of the matching rule. The method further includes populating a first hash with indicia of the first subset, and populating a second hash with the second subset.

公开(公告)号：US20180246754A1

公开(公告)日：2018-08-30

申请号：US15966149

申请日：2018-04-30

Applicant: SALESFORCE.COM, INC.

Inventor： Matthew Fuchs

IPC: G06F9/46

Abstract: The technology disclosed relates to improving parallel functional processing using abstractions and methods defined based on category theory. In particular, the technology disclosed provides a range of useful categorical functions for processing large data sets in parallel. These categorical functions manage all phases of distributed computing, including dividing a data set into subsets of approximately equal size and combining the results of the subset calculations into a final result, while hiding many of the low-level programming details. These categorical functions are extraordinarily well-ordered and have a sophisticated type system and type inference, which allows for generating maps and reducing them in an elegant and succinct way using concise and expressive programs that can significantly efficientize a whole software development process.

公开(公告)号：US09990223B2

公开(公告)日：2018-06-05

申请号：US14822773

申请日：2015-08-10

Applicant: salesforce.com, inc.

Inventor： Matthew Fuchs

IPC: G06F17/30 ,  G06F9/46

CPC classification number: G06F9/46

Abstract: The technology disclosed relates to improving parallel functional processing using abstractions and methods defined based on category theory. In particular, the technology disclosed provides a range of useful categorical functions for processing large data sets in parallel. These categorical functions manage all phases of distributed computing, including dividing a data set into subsets of approximately equal size and combining the results of the subset calculations into a final result, while hiding many of the low-level programming details. These categorical functions are extraordinarily well-ordered and have a sophisticated type system and type inference, which allows for generating maps and reducing them in an elegant and succinct way using concise and expressive programs that can significantly efficientize a whole software development process.

公开(公告)号：US20160267381A1

公开(公告)日：2016-09-15

申请号：US15162505

申请日：2016-05-23

Applicant: salesforce.com, inc.

Inventor： Matthew Fuchs ,  Arun Jagota

IPC: G06N5/02 ,  G06N7/00 ,  G06F17/30

CPC classification number: G06N5/02 ,  G06F17/30292 ,  G06N7/005 ,  G06N99/005 ,  Y04S10/54

Abstract: The technology disclosed relates to methods for partitioning sets of features for a Bayesian classifier, finding a data partition that makes the classification process faster and more accurate, while discovering and taking into account feature dependence among sets of features in the data set. It relates to computing class entropy scores for a class label across all tuples that share the feature-subset and arranging the tuples in order of non-decreasing entropy scores for the class label, and constructing a data partition that offers the highest improvement in predictive accuracy for the data set. Also disclosed is a method for partitioning a complete set of records of features in a batch computation, computing increasing predictive power; and also relates to starting with singleton partitions, and using an iterative process to construct a data partition that offers the highest improvement in predictive accuracy for the data set.

Abstract translation: 所公开的技术涉及用于分配贝叶斯分类器的特征集合的方法，找到使分类处理更快更准确的数据分区，同时发现并考虑数据集中的特征集合之间的特征依赖性。 它涉及跨共享特征子集的所有元组的类标签的计算类熵分数，并且按照类标签的非递减熵分数的顺序排列元组，以及构建提供预测精度最高改进的数据分区 用于数据集。 还公开了一种用于分割批量计算中的特征记录的完整集合的方法，计算增加的​​预测能力; 并且还涉及从单例分区开始，并且使用迭代过程构造提供数据集的预测精度最高改进的数据分区。

公开(公告)号：US20150269647A1

公开(公告)日：2015-09-24

申请号：US14504593

申请日：2014-10-02

Applicant: salesforce.com, inc.

Inventor： Arun Jagota ,  Matthew Fuchs ,  Gregory Haardt

IPC: G06Q30/06

Abstract: A system creates a graph of nodes connected by arcs, and identifies a first compound attribute associated with contacts purchased by a current user. The first compound attribute includes a first attribute associated with a first value and a second attribute associated with a second value. The system identifies a directed arc from a first node to a second node. The directed arc is associated with a probability that previous users who purchased a first contact associated with the first compound attribute also purchased a second contact associated with a second compound attribute. The second compound attribute includes the first attribute, associated with a third value which matches the first value, and the second attribute, associated with a fourth value, which lacks a match with the second value. The system outputs a recommendation for the current user to purchase contacts associated with the second compound attribute if the probability exceeds a threshold.

Abstract translation: 系统创建通过弧连接的节点的图形，并且识别与由当前用户购买的联系人相关联的第一复合属性。 第一复合属性包括与第一值相关联的第一属性和与第二值相关联的第二属性。 系统识别从第一节点到第二节点的有向弧。 定向弧与购买与第一复合属性相关联的第一联系人的先前用户也购买了与第二复合属性相关联的第二联系人的概率相关联。 第二复合属性包括与第一值匹配的第三属性的第一属性和与第二值相关联的第二属性，其与第二值相匹配。 如果概率超过阈值，则系统输出当前用户购买与第二化合物属性相关联的联系人的建议。