会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Automatic searching for data in a network
    • 自动搜索网络中的数据
    • US06615237B1
    • 2003-09-02
    • US09498055
    • 2000-02-04
    • Fajen M. KyneTheodore L. MichelRay Sun
    • Fajen M. KyneTheodore L. MichelRay Sun
    • G06F1516
    • G06F17/30887
    • A system reads a text string from an address entry location of a web browser and determines whether the text string identifies a web page. If the text string identifies a web page, then the identified web page is retrieved. If the text string does not identify a web page, then the system identifies multiple web pages associated with the text string and identifies a best web page from the multiple web pages associated with the text string. The best web page is displayed in a first pane and at least a portion of the addresses associated with the multiple web pages is displayed in a second pane. The system also determines whether the text string to identifies a resource on a local network. An attempt is made to modify the text string to identify a web page if the text string does not already identify a web page. The best web page can selected from a web directory search, a web page search, or a combination of both.
    • 系统从Web浏览器的地址条目位置读取文本字符串,并确定文本字符串是否识别网页。 如果文本字符串识别网页,则检索所识别的网页。 如果文本字符串不标识网页,则系统识别与文本字符串相关联的多个网页,并从与文本字符串相关联的多个网页中识别最佳网页。 最好的网页显示在第一个窗格中,并且与多个网页相关联的至少一部分地址显示在第二个窗格中。 该系统还确定文本字符串是否标识本地网络上的资源。 如果文本字符串尚未识别网页,则尝试修改文本字符串以识别网页。 最好的网页可以从网络目录搜索,网页搜索或两者的组合中选择。
    • 2. 发明授权
    • Retrieval of relevant information categories
    • 检索相关信息类别
    • US06704729B1
    • 2004-03-09
    • US09575481
    • 2000-05-19
    • Adrian C. KleinFajen M. KyneTheodore L. Michel
    • Adrian C. KleinFajen M. KyneTheodore L. Michel
    • G06F1730
    • G06F17/30864G06F17/30696G06F17/30713Y10S707/99935
    • Large stores of information are often organized in a hierarchical taxonomy to aid a search and retrieval of the information. The hierarchical taxonomy generally consists of related categories of information, called “nodes,” that each may contain information relevant to the search. Each node is addressable according to its path in the hierarchical taxonomy. In information stores where the number of nodes having relevant information is extremely large, such as the Internet, providing a cohesive, intelligent, and organized display of the search results becomes extremely important to the success of a user traversing the store to find relevant information. The invention provides such search results by ranking each node of the taxonomy to determine which nodes are most likely to be relevant to the search request. The invention then creates a conceptually-related “cluster” of nodes by selecting a relevant “seed” node and relevant nodes related to the “seed” node.
    • 信息的大量存储通常以分级分类法组织以帮助搜索和检索信息。 分级分类通常由称为“节点”的相关信息类别组成,每个信息可能包含与搜索相关的信息。 每个节点根据其在分层分类法中的路径可寻址。 在具有相关信息的节点数量非常多的信息存储器中,诸如因特网,提供搜索结果的连贯,智能和有组织的显示对于遍历商店的用户的成功来说是非常重要的,以找到相关信息。 本发明通过对分类法的每个节点进行排序来确定哪些节点最可能与搜索请求相关来提供这样的搜索结果。 然后,本发明通过选择相关“种子”节点和与“种子”节点相关的相关节点来创建概念上相关的节点集群。