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

1. 发明授权

US07240055B2 Method and system for expertise mapping based on user activity in recommender systems 失效
标题翻译：基于推荐系统中用户活动的专业知识绘制方法和系统
公开(公告)号：US07240055B2
公开(公告)日：2007-07-03
申请号：US10733584
申请日：2003-12-11
申请人： Antonietta Grasso , Andre Bergholz
发明人： Antonietta Grasso , Andre Bergholz
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , Y10S707/99935
摘要： The system and method analyzes activities of users in a recommender system to identify experts. Two types of experts may be identified: authoritative experts and hub experts. An authoritative expert is a user who creates items or documents in a given field that are acted upon by a large number of users within a community who are well connected in the given field. A hub expert is a user who is aware of important items or documents within a given field and uses, works or acts upon items or documents produced by authoritative experts. The system and method also identifies authoritative items (e.g., documents). An authoritative item or document is one which has been acted upon by a large number of users within a community who are well connected in the given field (i.e., hub experts).
摘要翻译：系统和方法分析用户在推荐系统中的活动，以识别专家。可以确定两类专家：权威专家和中心专家。权威专家是在给定领域创建项目或文档的用户，该项目或文档由在特定领域中良好连接的社区中的大量用户采取行动。中心专家是知道某一领域中重要项目或文件的用户，并对权威专家制作的项目或文件进行使用，作品或行为。该系统和方法还识别权威项目（例如，文档）。一个权威的项目或文件是被一个社区内大量用户在特定领域（即中心专家）中连接良好的用户所执行的。

2. 发明申请

US20070061319A1 Method for document clustering based on page layout attributes 审中-公开
标题翻译：基于页面布局属性的文档聚类方法
公开(公告)号：US20070061319A1
公开(公告)日：2007-03-15
申请号：US11222881
申请日：2005-09-09
申请人： Andre Bergholz
发明人： Andre Bergholz
IPC分类号： G06F17/30
CPC分类号： G06F16/355
摘要： A method for document clustering based on page layout attributes is disclosed. A method for clustering a document page collection includes obtaining a document page collection, each document page in the collection having one or more features, the one or more features defining a page layout attribute; extracting information from the one or more features on each document page and constructing a feature vector; computing a distance metric based on an assigned feature weight for each feature; and clustering the document page collection using the distance metric.
摘要翻译：公开了一种基于页面布局属性的文档聚类方法。用于聚集文档页面集合的方法包括获得文档页面集合，集合中的每个文档页面具有一个或多个特征，定义页面布局属性的一个或多个特征; 从每个文档页面上的一个或多个特征提取信息并构建特征向量; 基于每个特征的分配的特征权重来计算距离度量; 并使用距离度量对文档页面集合进行聚类。

3. 发明授权

US07007017B2 Method for automatic discovery of query language features of web sites 失效
标题翻译：自动发现网站查询语言功能的方法
公开(公告)号：US07007017B2
公开(公告)日：2006-02-28
申请号：US10361955
申请日：2003-02-10
申请人： Andre Bergholz , Boris Chidlovskii
发明人： Andre Bergholz , Boris Chidlovskii
IPC分类号： G06F17/30
CPC分类号： G06F17/30864 , Y10S707/99934 , Y10S707/99935
摘要： A method for automatically determining query language operators of a Web information source, includes providing a set of known query operators, each known query operator in the set operating according to at least one syntax, wherein for a test query comprising a query operator and a test key word, each syntax of the operator produces a different number of document matches for the test query at a known Web information source; performing the test query on the Web information source, wherein the test query produces a number of document matches on the Web information source; comparing the number of document matches produced by the Web information source with the number of document matches produced by the known operator's different syntaxes; and using an established criteria for determining if comparing results indicate the Web information source supports the known query operator according its matching syntax.
摘要翻译：一种用于自动确定Web信息源的查询语言运算符的方法，包括提供一组已知的查询运算符，所述集合中的每个已知查询运算符根据至少一种语法操作，其中对于包括查询运算符和测试的测试查询关键字，操作员的每个语法在已知的Web信息源处产生用于测试查询的不同数量的文档匹配; 在Web信息源上执行测试查询，其中测试查询在Web信息源上产生多个文档匹配; 将由Web信息源生成的文档匹配的数量与由已知运算符的不同语法产生的文档匹配的数量进行比较; 并且使用建立的标准来确定比较结果是否表明Web信息源根据其匹配语法来支持已知的查询运算符。

4. 发明申请

US20050131897A1 Method and system for expertise mapping based on user activity in recommender systems 失效
标题翻译：基于推荐系统中用户活动的专业知识绘制方法和系统
公开(公告)号：US20050131897A1
公开(公告)日：2005-06-16
申请号：US10733584
申请日：2003-12-11
申请人： Antonietta Grasso , Andre Bergholz
发明人： Antonietta Grasso , Andre Bergholz
IPC分类号： G06Q50/00 , G06F17/30 , G06Q30/00
CPC分类号： G06F17/30867 , Y10S707/99935
摘要： The system and method analyzes activities of users in a recommender system to identify experts. Two types of experts may be identified: authoritative experts and hub experts. An authoritative expert is a user who creates items or documents in a given field that are acted upon by a large number of users within a community who are well connected in the given field. A hub expert is a user who is aware of important items or documents within a given field and uses, works or acts upon items or documents produced by authoritative experts. The system and method also identifies authoritative items (e.g., documents). An authoritative item or document is one which has been acted upon by a large number of users within a community who are well connected in the given field (i.e., hub experts).
摘要翻译：系统和方法分析用户在推荐系统中的活动，以识别专家。可以确定两类专家：权威专家和中心专家。权威专家是在给定领域创建项目或文档的用户，该项目或文档由在特定领域中良好连接的社区中的大量用户采取行动。中心专家是知道某一领域中重要项目或文件的用户，并对权威专家制作的项目或文件进行使用，作品或行为。该系统和方法还识别权威项目（例如，文档）。一个权威的项目或文件是被一个社区内大量用户在特定领域（即中心专家）中连接良好的用户所执行的。

5. 发明申请

US20070150443A1 Document alignment systems for legacy document conversions 有权
标题翻译：用于旧文档转换的文档对齐系统
公开(公告)号：US20070150443A1
公开(公告)日：2007-06-28
申请号：US11315458
申请日：2005-12-22
申请人： Andre Bergholz , Boris Chidlovskii
发明人： Andre Bergholz , Boris Chidlovskii
IPC分类号： G06F17/30
CPC分类号： G06F17/30569
摘要： A method for aligning documents which may be in different XML formats includes inputting source and target leaves of a source and documents in first and second tree structured formats and assigning a cost to each of a plurality of matches. Each match may include a source leaf and a target leaf or be an unmatched source or target leaf. Matches are identified for which a total cost is minimal, wherein each of the leaves is in at least one of the identified matches. From the identified matches, groups of two or more matches are identified which have a leaf in common. From the groups, probable matches are identified in which more that one target leaf is matched with at least one source leaf or more than one source leaf is matched with a target leaf. An alignment between leaves of the target document and leaves of the source document is output which includes the probable matches.
摘要翻译：用于对准可以具有不同XML格式的文档的方法包括以第一和第二树结构格式输入源和文档的源和目标叶，并为多个匹配中的每一个分配成本。每个匹配可以包括源叶和目标叶，或者是不匹配的源或目标叶。识别匹配，其总成本最小，其中每个叶片处于所识别的匹配中的至少一个中。从识别的匹配中，识别出具有共同叶的两个或更多个匹配的组。从组中鉴定出可能的匹配，其中更多的一个目标叶与至少一个源叶匹配或多于一个源叶与目标叶匹配。输出目标文件的叶子和源文档的叶片之间的对齐，其包括可能的匹配。

6. 发明授权

US07882119B2 Document alignment systems for legacy document conversions 有权
标题翻译：用于旧文档转换的文档对齐系统
公开(公告)号：US07882119B2
公开(公告)日：2011-02-01
申请号：US11315458
申请日：2005-12-22
申请人： Andre Bergholz , Boris Chidlovskii
发明人： Andre Bergholz , Boris Chidlovskii
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30569
摘要： A method for aligning documents which may be in different XML formats includes inputting source and target leaves of a source and documents in first and second tree structured formats and assigning a cost to each of a plurality of matches. Each match may include a source leaf and a target leaf or be an unmatched source or target leaf. Matches are identified for which a total cost is minimal, wherein each of the leaves is in at least one of the identified matches. From the identified matches, groups of two or more matches are identified which have a leaf in common. From the groups, probable matches are identified in which more that one target leaf is matched with at least one source leaf or more than one source leaf is matched with a target leaf. An alignment between leaves of the target document and leaves of the source document is output which includes the probable matches.
摘要翻译：用于对准可以具有不同XML格式的文档的方法包括以第一和第二树结构格式输入源和文档的源和目标叶，并为多个匹配中的每一个分配成本。每个匹配可以包括源叶和目标叶，或者是不匹配的源或目标叶。识别匹配，其总成本最小，其中每个叶片处于所识别的匹配中的至少一个中。从识别的匹配中，识别出具有共同叶的两个或更多个匹配的组。从组中鉴定出可能的匹配，其中更多的一个目标叶与至少一个源叶匹配或多于一个源叶与目标叶匹配。输出目标文件的叶子和源文档的叶片之间的对齐，其包括可能的匹配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式