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

1. 发明授权

US07533085B2 Method for searching deep web services 失效
标题翻译：搜索深度Web服务的方法
公开(公告)号：US07533085B2
公开(公告)日：2009-05-12
申请号：US11503754
申请日：2006-08-14
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/3089 , Y10S707/99933
摘要： A method for searching deep web services is provided. The method in one aspect allows organizing communities, sources and schema attributes in a multi-tier containment relationship; searching representative schema attributes in one or more communities; searching representative services in one or more communities; searching for related schema attributes; and searching for related communities.
摘要翻译：提供了一种用于搜索深度Web服务的方法。该方法在一个方面允许组织多层遏制关系中的社区，源和模式属性; 在一个或多个社区中搜索代表性模式属性; 在一个或多个社区寻找代表服务; 搜索相关的模式属性; 并搜索相关社区。

2. 发明授权

US07529740B2 Method and apparatus for organizing data sources 有权
标题翻译：组织数据源的方法和装置
公开(公告)号：US07529740B2
公开(公告)日：2009-05-05
申请号：US11503713
申请日：2006-08-14
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30705 , Y10S707/99933 , Y10S707/99953
摘要： A method for organizing deep Web services is provided. In one aspect, the method obtains a collection of sources and their associated attributes and/or input modes, for instance, using a crawling algorithm. The method uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.
摘要翻译：提供了组织深度Web服务的方法。在一个方面，该方法获得源及其相关属性和/或输入模式的集合，例如使用爬行算法。该方法使用这些信息将资源组织到社区。使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块，其在本公开中被称为签名。与每个签名相关联的源构成社区，并构建社区的图形表示，其中顶点是社区，边是共享属性。

3. 发明申请

US20080270367A1 SYSTEM AND METHOD FOR SEARCHING DEEP WEB SERVICES 审中-公开
标题翻译：用于搜索深层WEB服务的系统和方法
公开(公告)号：US20080270367A1
公开(公告)日：2008-10-30
申请号：US12173545
申请日：2008-07-15
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F16/958 , Y10S707/99933
摘要： A system and method for searching deep web services are provided. The system and method in one aspect allow organizing communities, sources and schema attributes in a multi-tier containment relationship; searching representative schema attributes in one or more communities; searching representative services in one or more communities; searching for related schema attributes; and searching for related communities.
摘要翻译：提供了一种用于搜索深度Web服务的系统和方法。一方面的系统和方法允许在多层遏制关系中组织社区，来源和模式属性; 在一个或多个社区中搜索代表性模式属性; 在一个或多个社区寻找代表服务; 搜索相关的模式属性; 并搜索相关社区。

4. 发明申请

US20080259084A1 METHOD AND APPARATUS FOR ORGANIZING DATA SOURCES 审中-公开
标题翻译：用于组织数据源的方法和装置
公开(公告)号：US20080259084A1
公开(公告)日：2008-10-23
申请号：US12163485
申请日：2008-06-27
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30 , G06T11/20
CPC分类号： G06F16/35 , Y10S707/99933 , Y10S707/99953
摘要： A method and apparatus for organizing deep Web services are provided. In one aspect, the method and apparatus obtains a collection of sources and their associated attributes and/or input modes, for instance, using a crawling algorithm. The method and apparatus uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.
摘要翻译：提供了一种用于组织深度Web服务的方法和装置。在一个方面，该方法和装置例如使用爬行算法获得源及其相关属性和/或输入模式的集合。该方法和装置使用这些信息将资源组织到社区。使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块，其在本公开中被称为签名。与每个签名相关联的源构成社区，并构建社区的图形表示，其中顶点是社区，边是共享属性。

5. 发明申请

US20080040327A1 System and method for searching deep web services 失效
标题翻译：用于搜索深度Web服务的系统和方法
公开(公告)号：US20080040327A1
公开(公告)日：2008-02-14
申请号：US11503754
申请日：2006-08-14
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/3089 , Y10S707/99933
摘要： A system and method for searching deep web services are provided. The system and method in one aspect allow organizing communities, sources and schema attributes in a multi-tier containment relationship; searching representative schema attributes in one or more communities; searching representative services in one or more communities; searching for related schema attributes; and searching for related communities.
摘要翻译：提供了一种用于搜索深度Web服务的系统和方法。一方面的系统和方法允许在多层遏制关系中组织社区，来源和模式属性; 在一个或多个社区中搜索代表性模式属性; 在一个或多个社区寻找代表服务; 搜索相关的模式属性; 并搜索相关社区。

6. 发明申请

US20080040326A1 Method and apparatus for organizing data sources 有权
标题翻译：组织数据源的方法和装置
公开(公告)号：US20080040326A1
公开(公告)日：2008-02-14
申请号：US11503713
申请日：2006-08-14
申请人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
发明人： Yuan-chi Chang , Lipyeow Lim , Min Wang , Zhen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30705 , Y10S707/99933 , Y10S707/99953
摘要： A method and apparatus for organizing deep Web services are provided. In one aspect, the method and apparatus obtains a collection of sources and their associated attributes and/or input modes, for instance, using a crawling algorithm. The method and apparatus uses this information to organize the sources into communities. A mining algorithm such as the hyperclique mining algorithm is used to obtain cliques of highly correlated attributes. A clustering algorithm such as the hierarchical agglomerative clustering algorithm is used to further cluster the cliques of attributes into larger cliques, which in the present disclosure is referred to as signatures. The sources that are associated with each signature form a community and a graph representation of the communities is constructed, where the vertices are communities and the edges are the shared attributes.
摘要翻译：提供了一种用于组织深度Web服务的方法和装置。在一个方面，该方法和装置例如使用爬行算法获得源及其相关属性和/或输入模式的集合。该方法和装置使用这些信息将资源组织到社区。使用诸如超临界挖掘算法的挖掘算法来获得高度相关属性的集合。使用诸如分层聚类聚类算法的聚类算法进一步将属性集合聚类成更大的团块，其在本公开中被称为签名。与每个签名相关联的源构成社区，并构建社区的图形表示，其中顶点是社区，边是共享属性。

7. 发明申请

US20130097168A1 METHOD TO IDENTIFY COMMON STRUCTURES IN FORMATTED TEXT DOCUMENTS 审中-公开
标题翻译：识别格式文本文档中的公共结构的方法
公开(公告)号：US20130097168A1
公开(公告)日：2013-04-18
申请号：US13440504
申请日：2012-04-05
申请人： Yuan-chi Chang , Debdoot Mukherjee , Vibha Singhal Sinha , Biplav Srivastava
发明人： Yuan-chi Chang , Debdoot Mukherjee , Vibha Singhal Sinha , Biplav Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F16/93 , G06F16/353
摘要： A computer implemented method, computer program product and data processing system, for identifying common structures shared across a plurality of formatted text documents. The common structure is presented as a sequence of landmarks, each of which has a starting and ending marker to describe the borders of text. The common structure is identified by counting the occurrences of repeating text segments across documents. Frequently co-occurred adjacent segments become candidates for markers of landmarks. In addition, styling information of textual content within a landmark is extracted and mapped to rules. The rules are used to merge and summarize content from multiple documents, which gives an advantage over current practice of content concatenation.
摘要翻译：一种计算机实现的方法，计算机程序产品和数据处理系统，用于识别在多个格式化的文本文档之间共享的共同结构。公共结构呈现为一系列地标，每个地标都有一个开始和结束标记来描述文本的边界。通过对跨文档重复文本段的出现进行计数来识别公共结构。经常共同发生的相邻片段成为地标标记的候选者。另外，提取地标内的文本内容的样式信息并映射到规则。这些规则用于合并和汇总来自多个文档的内容，这比现有的内容级联实践更有优势。

8. 发明授权

US08356045B2 Method to identify common structures in formatted text documents 失效
标题翻译：识别格式化文本文档中常见结构的方法
公开(公告)号：US08356045B2
公开(公告)日：2013-01-15
申请号：US12634176
申请日：2009-12-09
申请人： Yuan-chi Chang , Debdoot Mukherjee , Vibha Singhal Sinha , Biplav Srivastava
发明人： Yuan-chi Chang , Debdoot Mukherjee , Vibha Singhal Sinha , Biplav Srivastava
IPC分类号： G06F17/30
CPC分类号： G06F17/30011 , G06F17/30707
摘要： A computer implemented method, computer program product and data processing system, for identifying common structures shared across a plurality of formatted text documents. The common structure is presented as a sequence of landmarks, each of which has a starting and ending marker to describe the borders of text. The common structure is identified by counting the occurrences of repeating text segments across documents. Frequently co-occurred adjacent segments become candidates for markers of landmarks. In addition, styling information of textual content within a landmark is extracted and mapped to rules. The rules are used to merge and summarize content from multiple documents, which gives an advantage over current practice of content concatenation.
摘要翻译：一种计算机实现的方法，计算机程序产品和数据处理系统，用于识别在多个格式化的文本文档之间共享的共同结构。公共结构呈现为一系列地标，每个地标都有一个开始和结束标记来描述文本的边界。通过对跨文档重复文本段的出现进行计数来识别公共结构。经常共同发生的相邻片段成为地标标记的候选者。另外，提取地标内的文本内容的样式信息并映射到规则。这些规则用于合并和汇总来自多个文档的内容，这比现有的内容级联实践更有优势。

9. 发明申请

US20110137900A1 METHOD TO IDENTIFY COMMON STRUCTURES IN FORMATTED TEXT DOCUMENTS 失效
标题翻译：识别格式文本文档中的公共结构的方法
公开(公告)号：US20110137900A1
公开(公告)日：2011-06-09
申请号：US12634176
申请日：2009-12-09
申请人： Yuan-chi Chang , Debdoot Mukherjee , Vibha Singhal Sinha , Biplav Srivastava
发明人： Yuan-chi Chang , Debdoot Mukherjee , Vibha Singhal Sinha , Biplav Srivastava
IPC分类号： G06F17/00 , G06F17/21 , G06F17/30
CPC分类号： G06F17/30011 , G06F17/30707
摘要： A computer implemented method, computer program product and data processing system, for identifying common structures shared across a plurality of formatted text documents. The common structure is presented as a sequence of landmarks, each of which has a starting and ending marker to describe the borders of text. The common structure is identified by counting the occurrences of repeating text segments across documents. Frequently co-occurred adjacent segments become candidates for markers of landmarks. In addition, styling information of textual content within a landmark is extracted and mapped to rules. The rules are used to merge and summarize content from multiple documents, which gives an advantage over current practice of content concatenation.
摘要翻译：一种计算机实现的方法，计算机程序产品和数据处理系统，用于识别在多个格式化的文本文档之间共享的共同结构。公共结构呈现为一系列地标，每个地标都有一个开始和结束标记来描述文本的边界。通过对跨文档重复文本段的出现进行计数来识别公共结构。经常共同发生的相邻片段成为地标标记的候选者。另外，提取地标内的文本内容的样式信息并映射到规则。这些规则用于合并和汇总来自多个文档的内容，这比现有的内容级联实践更有优势。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式