专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

31. 发明申请

US20090300014A1 MEMBERSHIP CHECKING OF DIGITAL TEXT 有权
标题翻译：会员资料检查数字文本
公开(公告)号：US20090300014A1
公开(公告)日：2009-12-03
申请号：US12132108
申请日：2008-06-03
申请人： Kaushik Chakrabarti , Surajt Chaudhuri , Venkatesh Ganti , Dong Xin
发明人： Kaushik Chakrabarti , Surajt Chaudhuri , Venkatesh Ganti , Dong Xin
IPC分类号： G06F7/06
CPC分类号： G06F17/30707
摘要： The described implementations relate to data analysis, such as membership checking. One technique identifies candidate matches between document sub-strings and database members utilizing signatures. The technique further verifies that the candidate matches are true matches.
摘要翻译：所描述的实现涉及数据分析，例如成员资格检查。一种技术用于识别利用签名的文档子串和数据库成员之间的候选匹配。该技术进一步验证候选匹配是真实匹配。

32. 发明申请

US20070288421A1 EFFICIENT EVALUATION OF OBJECT FINDER QUERIES 失效
标题翻译：有效评估对象查找器
公开(公告)号：US20070288421A1
公开(公告)日：2007-12-13
申请号：US11423303
申请日：2006-06-09
申请人： Kaushik Chakrabarti , Venkatesh Ganti , Dong Xin
发明人： Kaushik Chakrabarti , Venkatesh Ganti , Dong Xin
IPC分类号： G06F17/30
CPC分类号： G06F17/30964
摘要： The subject disclosure pertains to a class of object finder queries that return the best target objects that match a set of given keywords. Mechanisms are provided that facilitate identification of target objects related to search objects that match a set of query keywords. Scoring mechanisms/functions are also disclosed that compute relevance scores of target objects. Further, efficient early termination techniques are provided to compute the top K target objects based on a scoring function.
摘要翻译：主题公开涉及一类对象查找器查询，其返回与一组给定关键字匹配的最佳目标对象。提供了有助于识别与一组查询关键字匹配的搜索对象相关的目标对象的机制。还公开了计算目标对象的相关性分数的评分机制/功能。此外，提供有效的提前终止技术以基于评分功能计算顶部K个目标对象。

33. 发明申请

US20090282012A1 LEVERAGING CROSS-DOCUMENT CONTEXT TO LABEL ENTITY 有权
标题翻译：将交叉文档引向标签实体
公开(公告)号：US20090282012A1
公开(公告)日：2009-11-12
申请号：US12114824
申请日：2008-05-05
申请人： Arnd Christian Konig , Venkatesh Ganti
发明人： Arnd Christian Konig , Venkatesh Ganti
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/278 , G06F17/2785 , Y10S707/962
摘要： Entities, such as people, places and things, are labeled based on information collected across a possibly large number of documents. One or more documents are scanned to recognize the entities, and features are extracted from the context in which those entities occur in the documents. Observed entity-feature pairs are stored either in an in-memory store or an external store. A store manager optimizes use of the limited amount of space for an in-memory store by determining which store to put an entity-feature pair in, and when to evict features from the in-memory store to make room for new pairs. Feature that may be observed in an entity's context may take forms such as specific word sequences or membership in a particular list.
摘要翻译：诸如人物，地点和事物等实体根据可能大量文件收集的信息进行标注。扫描一个或多个文档以识别实体，并且从文档中出现这些实体的上下文提取特征。观察到的实体特征对存储在内存存储或外部存储中。存储管理器通过确定哪个存储放置实体特征对，以及何时从存储器内存存储器中删除特征以为新的对腾出空间来优化对存储器存储器中的有限数量的空间的使用。可能在实体的上下文中观察到的特征可以采取诸如特定单词序列或特定列表中的成员资格的形式。

34. 发明申请

US20090006392A1 DATA PROFILE COMPUTATION 有权
标题翻译：数据配置文件计算
公开(公告)号：US20090006392A1
公开(公告)日：2009-01-01
申请号：US11769050
申请日：2007-06-27
申请人： Zhimin Chen , Venkatesh Ganti , Gunjan Jha , Shriraghav Kaushik , Vivek Narasayya
发明人： Zhimin Chen , Venkatesh Ganti , Gunjan Jha , Shriraghav Kaushik , Vivek Narasayya
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30536
摘要： Architecture that provides a data profile computation technique which employs key profile computation and data pattern profile computation. Key profile computation in a data table includes both exact keys as well as approximate keys, and is based on key strengths. A key strength of 100% is an exact key, and any other percentage in an approximate key. The key strength is estimated based on the number of table rows that have duplicated attribute values. Only column sets that exceed a threshold value are returned. Pattern profiling identifies a small set of regular expression patterns which best describe the patterns within a given set of attribute values. Pattern profiling includes three phases: a first phases for determining token regular expressions, a second phase for determining candidate regular expressions, and a third phase for identifying the best regular expressions of the candidates that match the attribute values.
摘要翻译：提供采用关键轮廓计算和数据模式轮廓计算的数据轮廓计算技术的架构。数据表中的关键轮廓计算包括精密键和近似键，并且基于关键优点。 100％的关键优势是一个确切的关键，其中一个关键的任何其他百分比。基于具有重复的属性值的表行的数量来估计关键强度。只返回超过阈值的列集。模式分析标识一组最佳描述一组给定属性值中的模式的正则表达式模式。模式分析包括三个阶段：用于确定令牌正则表达式的第一阶段，用于确定候选正则表达式的第二阶段，以及用于识别与属性值匹配的候选的最佳正则表达式的第三阶段。

35. 发明申请

US20070294221A1 DESIGNING RECORD MATCHING QUERIES UTILIZING EXAMPLES 有权
标题翻译：设计记录匹配问题应用实例
公开(公告)号：US20070294221A1
公开(公告)日：2007-12-20
申请号：US11424191
申请日：2006-06-14
申请人： Bee-Chung Chen , Venkatesh Ganti , Kaushik Shriraghav
发明人： Bee-Chung Chen , Venkatesh Ganti , Kaushik Shriraghav
IPC分类号： G06F17/30
CPC分类号： G06F17/30489 , Y10S707/99933 , Y10S707/99934
摘要： The subject disclosure pertains to a powerful and flexible framework for record matching. The framework facilitates design of a record matching query or package composed of a set of well-defined primitive operators (e.g., relational, data cleaning . . . ), which can ultimately be executed to match records. To assist design of such packages, a learning technique based on examples is provided. More specifically, a set of matching and non-matching record pairs can be input and employed to facilitate automatic package generation. A generated package can subsequently be transformed manually and/or automatically into a semantically equivalent form optimized for execution.
摘要翻译：主题公开涉及用于记录匹配的强大且灵活的框架。该框架便于设计由一组明确定义的原始运算符（例如，关系数据清理...）组成的记录匹配查询或包，其最终可以被执行以匹配记录。为了协助这样的包装的设计，提供了基于示例的学习技术。更具体地，可以输入并采用一组匹配和非匹配记录对来促进自动包装生成。生成的包可以随后被手动和/或自动地变换成为执行而优化的语义上等同的形式。

36. 发明申请

US20050234906A1 Segmentation of strings into structured records 有权
标题翻译：将字符串分割成结构化记录
公开(公告)号：US20050234906A1
公开(公告)日：2005-10-20
申请号：US10825488
申请日：2004-04-14
申请人： Venkatesh Ganti , Theodore Vassilakis , Yevgeny Agichtein
发明人： Venkatesh Ganti , Theodore Vassilakis , Yevgeny Agichtein
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30569 , Y10S707/99933 , Y10S707/99935
摘要： An system for segmenting strings into component parts for use with a database management system. A reference table of string records are segmented into multiple substrings corresponding to database attributes. The substrings within an attribute are analyzed to provide a state model that assumes a beginning, a middle and an ending token topology for that attribute. A null token takes into account an empty attribute component and copying of states allows for erroneous token insertions and misordering. Once the model is created from the clean data, the process breaks or parses an input record into a sequence of tokens. The process then determines a most probable segmentation of the input record by comparing the tokens of the input record with a state models derived for attributes from the reference table.
摘要翻译：用于将字符串分割成用于数据库管理系统的组件的系统。字符串记录的引用表被分割成与数据库属性对应的多个子字符串。分析属性中的子串以提供假定该属性的开始，中间和结束令牌拓扑的状态模型。空标记考虑了空属性组件，状态复制允许错误的标记插入和错误。一旦从干净的数据创建了模型，该过程会将输入记录分解或解析成令牌序列。该过程然后通过将输入记录的令牌与从参考表导出的属性的状态模型进行比较来确定输入记录的最可能的分割。

37. 发明授权

US09600566B2 Identifying entity synonyms 有权
公开(公告)号：US09600566B2
公开(公告)日：2017-03-21
申请号：US12779964
申请日：2010-05-14
申请人： Venkatesh Ganti , Dong Xin
发明人： Venkatesh Ganti , Dong Xin
IPC分类号： G06F17/00 , G06F17/30 , G06F17/27
CPC分类号： G06F17/30684 , G06F17/2795
摘要： Embodiments for identifying an entity synonym of an entity are described. A query log is stored in a database located on at least one computing device. A candidate generation module can select a candidate query in the query log that shares a click on a URL with the entity. A correlated tag module can generate a set of phrase-tag pairs for the entity and the candidate query and measure a mutual information value for each phrase-tag pair. A candidate filtering module can determine a click similarity value between the candidate query and the entity based on a set of URLs selected in the search engine results and a tag similarity value based on the mutual information values. A candidate query is selected as an entity synonym if the click similarity value and the tag similarity value are greater than predetermined thresholds respectively.

38. 发明授权

US08996559B2 Assisted query formation, validation, and result previewing in a database having a complex schema 有权
公开(公告)号：US08996559B2
公开(公告)日：2015-03-31
申请号：US14058184
申请日：2013-10-18
申请人： Venkatesh Ganti , Aaron Kalb , Feng Niu , Satyen Sangani
发明人： Venkatesh Ganti , Aaron Kalb , Feng Niu , Satyen Sangani
IPC分类号： G06F17/30
CPC分类号： G06F17/30554 , G06F17/30292 , G06F17/30309 , G06F17/30646
摘要： Disclosed are a method, a device and/or a system of assisted query formation, validation, and result previewing in a database having a complex schema. In one aspect, a method of a query editor includes generating a data profile which includes a set of characteristics captured at various granularities of an initial result set generated from an initial query using a processor and a memory. The method determines what a user expects in the initial result set of the initial query and/or a subsequent result set of a subsequent query based on the data profile and/or a heuristically estimated data profile. The method includes enabling the user to evaluate a semantic accuracy of the subsequent query based on the likely expectation of the user as determined through the set of characteristics of the data profile. The set of characteristics may include metadata of the initial query.

39. 发明授权

US08965915B2 Assisted query formation, validation, and result previewing in a database having a complex schema 有权
标题翻译：在具有复杂模式的数据库中辅助查询形成，验证和结果预览
公开(公告)号：US08965915B2
公开(公告)日：2015-02-24
申请号：US14058189
申请日：2013-10-18
申请人： Venkatesh Ganti , Aaron Kalb , Feng Niu , Satyen Sangani
发明人： Venkatesh Ganti , Aaron Kalb , Feng Niu , Satyen Sangani
IPC分类号： G06F17/30
CPC分类号： G06F17/30554 , G06F17/30292 , G06F17/30309 , G06F17/30646
摘要： Disclosed are a method, a device and/or a system of assisted query formation, validation, and result previewing in a database having a complex schema. In one aspect, a method of a query editor includes generating a data profile which includes a set of characteristics captured at various granularities of an initial result set generated from an initial query using a processor and a memory. The method determines what a user expects in the initial result set of the initial query and/or a subsequent result set of a subsequent query based on the data profile and/or a heuristically estimated data profile. The method includes enabling the user to evaluate a semantic accuracy of the subsequent query based on the likely expectation of the user as determined through the set of characteristics of the data profile. The set of characteristics may include metadata of the initial query.
摘要翻译：公开了具有复杂模式的数据库中的辅助查询形成，验证和结果预览的方法，设备和/或系统。一方面，一种查询编辑器的方法包括生成数据简档，其包括使用处理器和存储器从初始查询生成的初始结果集的各种粒度捕获的一组特征。该方法基于数据简档和/或启发式估计的数据简档确定初始查询的初始结果集中的用户期望值和/或后续查询的后续结果集。该方法包括使得用户能够基于通过数据简档的特征集确定的用户的可能期望来评估后续查询的语义准确性。该特征集可以包括初始查询的元数据。

40. 发明授权

US08935272B2 Curated answers community automatically populated through user query monitoring 有权
标题翻译：策略响应社区通过用户查询监控自动填充
公开(公告)号：US08935272B2
公开(公告)日：2015-01-13
申请号：US14058206
申请日：2013-10-18
申请人： Venkatesh Ganti , Aaron Kalb , Feng Niu , Satyen Sangani
发明人： Venkatesh Ganti , Aaron Kalb , Feng Niu , Satyen Sangani
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30554 , G06F17/30292 , G06F17/30309 , G06F17/30646
摘要： In one embodiment, a method of a curated answers system includes automatically populating a profile markup page of a user with information describing an initial query of a database that the user has generated using a processor and a memory, determining that another user of the database has submitted a similar query that is semantically proximate to the initial query of the database that the user has generated, and presenting the profile markup page of the user to the other user. The method of the curated answers system may include enabling the other user to communicate with the user through a communication channel on the profile markup page. A question of the other user may be published to the user on the profile markup page of the user, and/or other profile markup page of the other user. The question may be associated as being posted by the other user.
摘要翻译：在一个实施例中，策展答案系统的方法包括使用描述用户使用处理器和存储器生成的数据库的初始查询的信息自动填充用户的简档标记页面，确定数据库的另一用户具有提交了与用户已经生成的数据库的初始查询语义上接近的类似查询，并将用户的简档标记页面呈现给另一个用户。策展答案系统的方法可以包括允许其他用户通过简档标记页面上的通信通道与用户通信。可以在用户的简档标记页面和/或其他用户的其他简档标记页面上向用户发布另一用户的问题。该问题可能会被另一个用户发布。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式