会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明授权
    • Query graphs indicating related queries
    • 查询指示相关查询的图表
    • US07565627B2
    • 2009-07-21
    • US10955122
    • 2004-09-30
    • Eric D. BrillHugo ZaragozaRobert J. RagnoSilviu-Petru Cucerzan
    • Eric D. BrillHugo ZaragozaRobert J. RagnoSilviu-Petru Cucerzan
    • G06F3/00
    • G06F17/30651Y10S707/99933
    • The present invention leverages query-related information based on a query and/or a search intention to provide a systematic means to facilitate a user in locating desired information despite lacking exact search parameters. This allows users to find information without first formulating an optimum search query. The query graph provides a navigable, graphical notion of the query-related information via nodes representative of the query-related information and edges representative of the associations between the information. In one instance of the present invention, the query graph is derived from an information source such as a query log, a query list, and/or a search engine and the like. Additional instances of the present invention utilize visual and/or audible indicators employed with the query graph to facilitate in relaying the query-related information to the user, including, but not limited to, overlays, icons, colors, and dimensional variances and the like.
    • 本发明利用基于查询和/或搜索意图的查询相关信息来提供系统的方式,以便于用户定位所需信息,尽管缺少确切的搜索参数。 这允许用户在没有首先制定最佳搜索查询的情况下查找信息。 查询图通过代表查询相关信息的节点和表示信息之间的关联的边缘提供与查询相关信息的可导航的图形概念。 在本发明的一个实例中,查询图是从诸如查询日志,查询列表和/或搜索引擎等的信息源导出的。 本发明的附加实例利用与查询图一起使用的视觉和/或听觉指示符以便于将查询相关信息中继给用户,包括但不限于叠加,图标,颜色和尺寸方差等 。
    • 22. 发明授权
    • Application programming interface for text mining and search
    • 用于文本挖掘和搜索的应用程序编程接口
    • US07565362B2
    • 2009-07-21
    • US11172638
    • 2005-07-01
    • Eric D. BrillRobert J. Ragno
    • Eric D. BrillRobert J. Ragno
    • G06F17/00
    • G06F17/30902
    • Systems and methods are described that allow programmatic access to search engine results and query logs in a structured form. The search results can be retrieved from the search engine in an intermediary form that contains the information that is in the HTML pages provided to web browsers (potentially with additional information). This intermediary form can then be broken down on the client machine, using local resources, to assemble the structured objects. The library also provides for caching of the search results. This can be provided both on the local machine and on a remote database. When the results for a query exist in the caches, they can be retrieved from such location instead of querying the search engine. Documents and/or web pages can also be cached. The library can also be directed to operate only from the cache, effectively exposing a local data set instead of the remote search engine.
    • 描述了允许以结构化形式对搜索引擎结果进行编程访问和查询日志的系统和方法。 搜索结果可以以包含提供给Web浏览器的HTML页面中的信息(可能包含附加信息)的中间形式从搜索引擎中检索。 然后可以使用本地资源在客户机上分解此中介形式来组合结构化对象。 图书馆还提供了搜索结果的缓存。 这可以在本地机器和远程数据库上提供。 当缓存中存在查询的结果时,可以从这样的位置检索它们,而不是查询搜索引擎。 文档和/或网页也可以缓存。 库也可以被指示仅从缓存操作,有效地暴露本地数据集而不是远程搜索引擎。
    • 25. 发明授权
    • Systems and methods that rank search results
    • 搜索结果排名的系统和方法
    • US07761447B2
    • 2010-07-20
    • US10820947
    • 2004-04-08
    • Eric D. BrillJesper B. LindMarc A. SmithWensi XiDuncan L. Davenport
    • Eric D. BrillJesper B. LindMarc A. SmithWensi XiDuncan L. Davenport
    • G06F7/00
    • G06F17/30675
    • The present invention provides systems and methods that rank search results. Such ranking typically includes determining a relevance of individual search results via one or more feature-based relevance functions. These functions can be tailored to users and/or applications, and typically are based on scoped information (e.g., lexical), digital artifact author related attributes, digital artifact source repository attributes, and/or relationships between features, for example. In addition, relevance functions can be generated via training sets (e.g., machine learning) or initial guesses that are iteratively refined over time. Upon determining relevance, search results can be ordered with respect to one another, based on respective relevances. Additionally, thresholding can be utilized to mitigate returning results likely to be non-relevant to the query, user and/or application.
    • 本发明提供了对搜索结果进行排序的系统和方法。 这种排名通常包括通过一个或多个基于特征的相关性功能来确定各个搜索结果的相关性。 这些功能可以针对用户和/或应用而定制,并且通常基于例如范围限定的信息(例如,词汇),数字人工制品相关属性,数字工件源存储库属性和/或特征之间的关系。 此外,可以通过随时间迭代地改进的训练集(例如,机器学习)或初始猜测来生成相关函数。 在确定相关性之后,可以基于相应的相关性来相对于彼此订购搜索结果。 此外,可以利用阈值来减轻可能与查询,用户和/或应用程序不相关的返回结果。
    • 27. 发明授权
    • Using connectivity distance for relevance feedback in search
    • 使用连接距离搜索相关反馈
    • US07634474B2
    • 2009-12-15
    • US11393480
    • 2006-03-30
    • Serguei VassilvitskiiEric D. Brill
    • Serguei VassilvitskiiEric D. Brill
    • G06F17/30
    • G06F17/30864Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/99936
    • A unique system and method is provided that facilitates improving relevance of search results over the initial searching ranking. The system and method involve obtaining relevancy feedback for at least one search result (user rated) and then generating a connectivity graph or web-graph (for Web searches) for the user rated result. The relative distance between results (or pages) in the graph can indicate relevancy between those results. Thus, results within a particular distance from the rated result can be considered related to the rated result and thus, relevant or irrelevant depending on the particular rating for that result. The connectivity graph can be employed to determine a re-ranking of the search results.
    • 提供了一种独特的系统和方法,其有助于提高搜索结果与初始搜索排名的相关性。 该系统和方法包括获得至少一个搜索结果(用户评级)的相关性反馈,然后为用户评分结果生成连通性图或网络图(用于Web搜索)。 图中的结果(或页面)之间的相对距离可以指示这些结果之间的相关性。 因此,与额定结果特定距离的结果可以被认为与额定结果相关,因此,根据该结果的特定评级,相关或不相关。 可以使用连通性图来确定搜索结果的重新排序。
    • 28. 发明申请
    • Context based search and document retrieval
    • 基于上下文的搜索和文档检索
    • US20080172364A1
    • 2008-07-17
    • US11654324
    • 2007-01-17
    • Silviu P. CucerzanEric D. Brill
    • Silviu P. CucerzanEric D. Brill
    • G06F7/06
    • G06F17/3061
    • A context based search and document retrieval application is disclosed. The application uses context data that is generated by a document analysis component based upon context information from various sources, including for example, document collections available on the world wide web. The context data is provided to a search query generator. The search query generator is configured to generate a contextually annotated search query based upon a user query and context data. Bookmarks having an associated context are generated for documents retrieved in response to the contextually annotated search query. The application then provides access to the bookmarked documents when the user is browsing other documents with similar contexts to the context of the original document for which the context based search was executed and the bookmark created. The bookmarked documents are hyperlinked to terms in the browsed document.
    • 公开了一种基于上下文的搜索和文档检索应用程序。 该应用使用基于来自各种来源的上下文信息由文档分析组件生成的上下文数据,包括例如在万维网上可用的文档集合。 将上下文数据提供给搜索查询生成器。 搜索查询生成器被配置为基于用户查询和上下文数据来生成上下文注释的搜索查询。 生成具有关联上下文的书签,用于响应于上下文注释的搜索查询检索的文档。 当用户正在浏览具有与执行基于上下文的搜索的原始文档的上下文相似的上下文的其他文档并且创建书签时,该应用程序提供对加书签的文档的访问。 书签的文档被超链接到浏览文档中的术语。
    • 29. 发明授权
    • Building and using subwebs for focused search
    • 建立和使用子网进行重点搜索
    • US07392278B2
    • 2008-06-24
    • US10778498
    • 2004-02-13
    • Harr ChenRaman ChandrasekarSimon H. CorstonEric D. Brill
    • Harr ChenRaman ChandrasekarSimon H. CorstonEric D. Brill
    • G06F17/30
    • G06F17/30867Y10S707/99933
    • A system that facilitates performance of a focused search over a collection of sites comprises a subweb that corresponds to a topic and/or user characteristic(s) that are of interest to the user. The subweb includes a plurality of domains and/or paths (e.g. sites) that are related to the topic and/or the user characteristic(s). Each of the sites within the subweb is assigned a weight that indicates relevance of the site to the desirable topic and/or user characteristic(s). A search engine employs the subweb to facilitate focusing a search over a collection of sites. The search engine receives a query, and utilizes the subweb to focus a search over the selection of sites corresponding to the topic and/or user characteristic(s) represented by the subweb. The results from the search are returned to the user based at least in part upon the relevance weights assigned to the sites within the subweb.
    • 有助于在站点集合上进行聚焦搜索的性能的系统包括对应于用户感兴趣的主题和/或用户特征的子网。 子网包括与主题和/或用户特征相关的多个域和/或路径(例如站点)。 子网站中的每个站点都被分配一个权重,指示站点与期望主题和/或用户特征的相关性。 搜索引擎使用子网站来促进将搜索集中在一系列网站上。 搜索引擎接收查询,并利用子网将搜索集中在与由子网站所代表的主题和/或用户特征相对应的站点的选择上。 至少部分地基于分配给子网站内的站点的相关性权重将搜索结果返回给用户。
    • 30. 发明授权
    • Balanced routing of questions to experts
    • 向专家平衡路线问题
    • US08751559B2
    • 2014-06-10
    • US12211113
    • 2008-09-16
    • Matthew RichardsonRyen W. WhiteEric D. Brill
    • Matthew RichardsonRyen W. WhiteEric D. Brill
    • G06F15/16
    • H04L67/306G06Q10/06H04L51/14
    • A question processing system routes questions among participants in a balanced and sustainable manner. Any participant can act as an inquirer (who poses questions) and an expert (who answers questions). In one illustrative case, the question processing system operates by: receiving a question from an inquirer; determining at least one expert that is appropriate to answer the question; and routing the question to the expert. The receiving, determining, and routing are repeated with respect to other inquirers and other experts to achieve a desired balance of information exchange among the plurality of participants of the electronic question processing system.
    • 问题处理系统以平衡和可持续的方式将参与者的问题提交给参与者。 任何参与者都可以作为询问者(提出问题)和专家(谁回答问题)。 在一个说明性情况下,问题处理系统通过以下操作:从查询者接收问题; 决定至少一名适合回答问题的专家; 并将问题路由到专家。 相对于其他查询者和其他专家重复接收,确定和路由以实现电子问题处理系统的多个参与者之间的信息交换的期望的平衡。