ADAPTIVE MATCH INDEXES
    51.
    发明申请

    公开(公告)号:US20210232637A1

    公开(公告)日:2021-07-29

    申请号:US16775611

    申请日:2020-01-29

    Abstract: Determine first count of first records storing first value in first field, second count of second records storing second value in second field, third count of third records storing third value in third field. Determine count threshold using first, second and third counts, dispersion measure based on dispersion of values stored in second field by first records and other dispersion measure based on other dispersion of values stored in third field by first records. Train machine-learning model to determine dispersion measure threshold based on dispersion and other dispersion measures. If first count is greater than count threshold, and dispersion measure is greater than dispersion measure threshold, create match index based on first and second fields. Receive prospective record storing first value in first field, second value in second field. Use match index to identify record storing first value in first field, second value in second field as matching prospective record.

    ADAPTIVE RECOGNITION OF ENTITIES
    52.
    发明申请

    公开(公告)号:US20210224482A1

    公开(公告)日:2021-07-22

    申请号:US16749234

    申请日:2020-01-22

    Abstract: A system receives a record which includes a string and separates the string into a number of tokens, including a token and another token. The system identifies a pattern that includes an entity, another entity, and a number of entities that equals the number of tokens, and another pattern that includes the same number of entities as the number of tokens. The system determines a combined probability that combines a probability based on the number of entries in the entity's dictionary which stores the token, and another probability based on a number of character types in the other entity that match characters in the other token. If the combined probability associated with the pattern is greater than another combined probability associated with the other pattern, the system matches the record to a system record based on recognizing the token as the entity and the other token as the other entity.

    Dense subset clustering
    53.
    发明授权

    公开(公告)号:US10956450B2

    公开(公告)日:2021-03-23

    申请号:US15082267

    申请日:2016-03-28

    Abstract: Some embodiments of the present invention include a method for determining a dense subset from a group of records using a graphical representation of the group of records, the graphical representation having nodes and edges, a node associated with a record from the group of records, an edge connecting two nodes associated with two related records, wherein a node is associated with a weight corresponding to a number of edges connected to the node, wherein a record is added to the dense subset based on its associated node having a highest weight and a density that satisfies a density threshold, the density being based on the content of the dense subset, and wherein the content of the dense subset is to be processed as including duplicate records.

    GENERATING ADAPTIVE MATCH KEYS
    54.
    发明申请

    公开(公告)号:US20200242112A1

    公开(公告)日:2020-07-30

    申请号:US16258217

    申请日:2019-01-25

    Abstract: A system creates graph of nodes connected by edges. Each node represents corresponding value of corresponding attribute and is associated with count of corresponding value. Each edge is associated with count of instances that values represented by corresponding connected nodes are associated with each other. The system identifies each node associated with first count as first set of keys, and deletes each node associated with first count. The system identifies each edge associated with second count as second set of keys, and deletes each edge associated with second count. The system identifies each node associated with third count as third set of keys, and deletes each node associated with third count. The system identifies each edge associated with fourth count as fourth set of keys, and deletes each edge associated with fourth count. The system uses each set of keys to search and match records.

    Software container modeling
    55.
    发明授权

    公开(公告)号:US10467412B2

    公开(公告)日:2019-11-05

    申请号:US15726261

    申请日:2017-10-05

    Abstract: A system determines a first volume of out-calls of a first out-call type made by a software container that is executing an application during a time period. The system determines a second volume of out-calls of a second out-call type made by the software container. The system determines a first ratio of the first volume to a combined volume of out-calls of all out-call types made by the software container. The system determines a second ratio of the second volume to the combined volume of out-calls of all out-call types made by the software container. The system determines a measure by comparing the first ratio to a third ratio associated with the first out-call type, and by comparing the second ratio to a fourth ratio associated with the second out-call type. The system identifies any behavior or any application type associated with the application, based on the measure.

    TRIE-BASED NORMALIZATION OF FIELD VALUES FOR MATCHING

    公开(公告)号:US20190236178A1

    公开(公告)日:2019-08-01

    申请号:US15884732

    申请日:2018-01-31

    CPC classification number: G06F16/2365 G06F16/24575 G06F16/2468

    Abstract: A system tokenizes values stored in a field by multiple records. The system creates a trie from the tokenized values, each branch in the trie labeled with one of the tokenized values, each node storing a count indicating the number of the multiple records associated with a tokenized value sequence beginning from a root of the trie. The system tokenizes a value stored in the field by a prospective record. Beginning from the root of the trie, the system identifies each node corresponding to a token value sequence for the prospective record's tokenized value. Beginning from the most recently identified node for the prospective record's token value sequence, the system identifies each extending node which stores a count that satisfies a threshold, each identified extending node corresponding to another token value sequence. The system uses the other token value sequence to identify one of the multiple records that matches the prospective record.

    Confidently adding snippets of search results to clusters of objects

    公开(公告)号:US09760620B2

    公开(公告)日:2017-09-12

    申请号:US14337505

    申请日:2014-07-22

    Abstract: Systems and methods are provided for matching snippets of search results to clusters of objects. A system adds a data snippet of a search result to a cluster of objects. The system calculates a confidence score for the add based on the recency, a job title, an email address, and/or a phone number associated with the data snippet. The system stores the add in the customer accessible database if the confidence score is sufficiently high for the add to be stored in the customer accessible database. The system generates a notice for review if the confidence score is not sufficiently high for the add to be stored in the customer accessible database.

    System and method for inferring reporting relationships from a contact database
    58.
    发明授权
    System and method for inferring reporting relationships from a contact database 有权
    从联系人数据库推断报告关系的系统和方法

    公开(公告)号:US09477698B2

    公开(公告)日:2016-10-25

    申请号:US13773221

    申请日:2013-02-21

    CPC classification number: G06F17/30312 G06F17/30539

    Abstract: A system and method for inferring reporting relationships from contact records. Contact records from a single company are identified, and each record is ranked based on the title. A probabilistic analysis is used to compare the number of contacts on the current level with the number of contacts on a lower level, and make a guess as to reporting relationships between contacts on the different levels. If a confidence score of a guessed reporting relationship is high enough, the reporting relationship is accepted, and contact records updated.

    Abstract translation: 用于从联系人记录中推断报告关系的系统和方法。 确定来自单个公司的联系记录,并且每个记录基于标题进行排名。 概率分析用于比较当前级别的联系人数量与较低级别的联系人数量,并猜测报告不同级别的联系人之间的关系。 如果猜测报告关系的置信分数足够高,报告关系被接受,并且更新了联系人记录。

    CONFIDENTLY ADDING SNIPPETS OF SEARCH RESULTS TO CLUSTERS OF OBJECTS
    59.
    发明申请
    CONFIDENTLY ADDING SNIPPETS OF SEARCH RESULTS TO CLUSTERS OF OBJECTS 有权
    有意添加搜索结果的目标对象

    公开(公告)号:US20150032738A1

    公开(公告)日:2015-01-29

    申请号:US14337505

    申请日:2014-07-22

    Abstract: Systems and methods are provided for matching snippets of search results to clusters of objects. A system adds a data snippet of a search result to a cluster of objects. The system calculates a confidence score for the add based on the recency, a job title, an email address, and/or a phone number associated with the data snippet. The system stores the add in the customer accessible database if the confidence score is sufficiently high for the add to be stored in the customer accessible database. The system generates a notice for review if the confidence score is not sufficiently high for the add to be stored in the customer accessible database.

    Abstract translation: 提供了系统和方法,用于将搜索结果的片段与对象的集群进行匹配。 系统将搜索结果的数据片段添加到对象集群。 该系统基于与数据片段相关联的新近度,职称,电子邮件地址和/或电话号码来计算添加的置信度分数。 如果置信度得分足够高以使添加存储在客户可访问数据库中,系统将添加存储在客户可访问数据库中。 如果置信度得分不足以使得存储在客户可访问的数据库中,系统将生成通知以进行审查。

    SYSTEM AND METHOD FOR INFERRING REPORTING RELATIONSHIPS FROM A CONTACT DATABASE
    60.
    发明申请
    SYSTEM AND METHOD FOR INFERRING REPORTING RELATIONSHIPS FROM A CONTACT DATABASE 有权
    从联系数据库传达报告关系的系统和方法

    公开(公告)号:US20130218904A1

    公开(公告)日:2013-08-22

    申请号:US13773221

    申请日:2013-02-21

    CPC classification number: G06F17/30312 G06F17/30539

    Abstract: A system and method for inferring reporting relationships from contact records. Contact records from a single company are identified, and each record is ranked based on the title. A probabilistic analysis is used to compare the number of contacts on the current level with the number of contacts on a lower level, and make a guess as to reporting relationships between contacts on the different levels. If a confidence score of a guessed reporting relationship is high enough, the reporting relationship is accepted, and contact records updated.

    Abstract translation: 用于从联系人记录中推断报告关系的系统和方法。 确定来自单个公司的联系记录,并且每个记录基于标题进行排名。 概率分析用于比较当前级别的联系人数量与较低级别的联系人数量,并猜测报告不同级别的联系人之间的关系。 如果猜测报告关系的置信分数足够高,报告关系被接受,并且更新了联系人记录。

Patent Agency Ranking