会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明申请
    • CUSTOM RANKING MODEL SCHEMA
    • 自定义排名模式
    • US20110137893A1
    • 2011-06-09
    • US12630981
    • 2009-12-04
    • Yauhen ShnitkoKaren Beattle MasseyDmitriy MeyerzonVictor Poznanski
    • Yauhen ShnitkoKaren Beattle MasseyDmitriy MeyerzonVictor Poznanski
    • G06F17/30
    • G06F17/30675
    • A customizable ranking model of a search engine using custom ranking model configuration and parameters of a pre-defined human-readable format. The architecture can employ a markup language schema to represent the custom ranking model. In one implementation, the schema developed utilizes XML (extensible markup language) for representing the custom ranking model. Weights for dynamic and static relevance ingredients can be altered per ranking model and new relevance ingredients can be added. Additionally, features are provided for improving relevance such as adding terms to a thesaurus for synonym expansion, for example, the ability to deal with single terms either as compounds, and/or using custom word breaking rules.
    • 使用自定义排名模型配置和预定义的人类可读格式的参数的可定制的搜索引擎排名模型。 该架构可以采用标记语言模式来表示自定义排名模型。 在一个实现中,开发的模式利用XML(可扩展标记语言)来表示自定义排名模型。 动态和静态相关成分的重量可以根据排名模型更改,并可添加新的相关成分。 另外,提供了用于提高相关性的功能,例如将术语添加到同义词扩展的词库中,例如,将单个术语作为化合物处理的能力和/或使用自定义单词断开规则。
    • 24. 发明授权
    • Adaptive web crawling using a statistical model
    • 使用统计模型的自适应网络爬网
    • US07328401B2
    • 2008-02-05
    • US11022054
    • 2004-12-22
    • Kenji C ObataDmitriy Meyerzon
    • Kenji C ObataDmitriy Meyerzon
    • G06F7/00G06F15/16G06F17/00
    • G06F17/30864Y10S707/99931Y10S707/99933
    • A computer based system and method of retrieving information pertaining to documents on a computer network is disclosed. The method includes selecting a set of documents to be accessed during a Web crawl by utilizing a statistical model to determine which previously retrieved documents are most likely to have changed since last accessed. The statistical model is continuously improving its accuracy by training internal probability distributions to reflect the actual experience with change rate patterns of the documents accessed. The decision made whether to access the document is based on the probability of change compared against a desired synchronization level, random selections, maximum limits on the amount of time since the document was last accessed, and other criterion. Once the decision to access is made, the document is checked for changes and this information is used to train the statistical model.
    • 公开了一种基于计算机的系统和检索与计算机网络上的文件有关的信息的方法。 该方法包括通过利用统计模型来选择要在Web爬行期间访问的一组文档,以确定先前检索到的文档最近可能自上次访问以来发生变化。 统计模型通过训练内部概率分布来不断提高其准确性,以反映所访问文件的变化率模式的实际经验。 是否访问文档的决定是基于与所需同步级别进行比较的更改概率,随机选择,自上次访问文档以来的时间量的最大限制以及其他标准。 一旦作出决定,将对文件进行更改检查,并将此信息用于训练统计模型。
    • 28. 发明授权
    • Re-ranking search results
    • 重新排列搜索结果
    • US09495462B2
    • 2016-11-15
    • US13360536
    • 2012-01-27
    • Victor PoznanskiOivind WangFredrik HolmNicolai BoddVladimir TankovichDmitriy Meyerzon
    • Victor PoznanskiOivind WangFredrik HolmNicolai BoddVladimir TankovichDmitriy Meyerzon
    • G06F17/30G06F7/00
    • G06F17/30867
    • Search results obtained from a ranking model are re-ranked based on user-configured ranking rules. For example, a user may desire to: place certain search results at a top/bottom of a ranking of search results; remove some search results; and/or adjust a ranking of some of the search results. A Graphical User Interface (GUI) allows a user to configure the ranking rules (e.g. enter key/value restrictions and to set a boost value) and to preview an application of one or more of the ranking rules. Query language operators that follow a standard operator syntax are created based on the inputs (e.g. a ranking query operator is created that may include multiple user supplied parameters). The user may also specify a portion of the results from which statistics (e.g. standard deviation, average score) are calculated. For example, a user may specify to calculate statistics for the top N number results.
    • 从排名模型获得的搜索结果根据用户配置的排名规则进行重新排名。 例如,用户可能希望:将某些搜索结果放置在搜索结果的排名的顶部/底部; 删除一些搜索结果; 和/或调整某些搜索结果的排名。 图形用户界面(GUI)允许用户配置排序规则(例如输入键/值限制并设置升压值)并预览一个或多个排序规则的应用程序。 基于输入(例如创建可能包括多个用户提供的参数的排名查询运算符)创建遵循标准运算符语法的查询语言运算符。 用户还可以指定计算统计数据(例如标准偏差,平均分数)的结果的一部分。 例如,用户可以指定计算前N个结果的统计。
    • 29. 发明申请
    • NAME SEARCH USING A RANKING FUNCTION
    • 名称使用排名功能搜索
    • US20140222792A1
    • 2014-08-07
    • US14171155
    • 2014-02-03
    • Dirk H. GroeneveldDmitriy MeyerzonDavid MowattJessica A. Alspaugh
    • Dirk H. GroeneveldDmitriy MeyerzonDavid MowattJessica A. Alspaugh
    • G06F17/30
    • G06F17/30657G06F17/30864
    • An approach is described for performing a name search using a name search operation and a ranking operation. The name search operation may take text as input and apply a fuzzy matching operation and a lookup operation to generate a collection of candidate names with respective probability scores. In other cases, speech or handwriting recognition may generate the collection of candidate names and probability scores. The ranking operation may then rank these candidate names using a ranking function. The ranking function may rank the candidate names based on the probability scores associated with the names and at least one other factor. One such factor may reflect whether information provided by a user matches profile information associated with a candidate name under consideration. Another factor may reflect an extent of a nexus between the user and a person associated with the candidate name. Other types of factors can be used.
    • 描述了使用名称搜索操作和排序操作执行姓名搜索的方法。 名称搜索操作可以将文本作为输入并应用模糊匹配操作和查找操作以生成具有相应概率得分的候选名称的集合。 在其他情况下,语音或手写识别可能产生候选名称和概率分数的集合。 然后,排序操作可以使用排序函数对这些候选名称进行排名。 排名函数可以基于与名称和至少一个其他因素相关联的概率分数对候选名称进行排名。 一个这样的因素可以反映用户提供的信息是否匹配与考虑的候选名称相关联的简档信息。 另一个因素可能反映了用户与与候选人名称相关联的人之间的关联程度。 可以使用其他类型的因素。
    • 30. 发明授权
    • Tenantization of search result ranking
    • 搜索结果排名的趋势
    • US08694507B2
    • 2014-04-08
    • US13287656
    • 2011-11-02
    • Dmitriy MeyerzonMihai PetriucNicolai Bodd
    • Dmitriy MeyerzonMihai PetriucNicolai Bodd
    • G06F7/00G06F17/30
    • G06F17/30867G06F17/30011G06F17/30321G06F17/3053G06F17/30864
    • This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph.
    • 本公开描述了用于在多租户托管环境中搜索文档的方法和系统。 根据实施例,为了节省硬件资源,可以将与多个租户相关联的多个文档映射到多租户托管环境中的相同搜索索引。 为了搜索仅在多租户托管环境中与单个租户相关联的文档,预先将租户标识符存储在与单个租户的多个文档相关联的搜索索引中存储的每个密钥。 此外,当一个文档链接到多租户托管环境中的另一个文档时,当源租户标识符与链接的目标租户标识符匹配时,链接被存储在网页图中。 根据实施例,当进行搜索时,仅当链接被存储在网络图中时才解决链接。