会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明授权
    • Semi-supervised part-of-speech tagging
    • 半监督的词性标签
    • US08099417B2
    • 2012-01-17
    • US11954216
    • 2007-12-12
    • Sreenivas GollapudiRina Panigrahy
    • Sreenivas GollapudiRina Panigrahy
    • G06F17/30
    • G06F17/30864
    • Relevant search results for a given query may be determined using click data for the query and the number of times the query is issued to a search engine. The number of clicks that a result receives for the given query may provide a feedback mechanism to the search engine on how relevant the result is for the given query. The frequency of a query along with the associated clicks provides the search engine with the effectiveness of the query in producing relevant results. Edges in a graph of queries versus results may be weighted in accordance with the click data and the efficiency to rank the search results provided to a user.
    • 给定查询的相关搜索结果可以使用查询的点击数据和查询发布到搜索引擎的次数来确定。 结果为给定查询获得的点击次数可以向搜索引擎提供关于给定查询的结果的相关性的反馈机制。 查询的频率以及相关的点击次数为搜索引擎提供了生成相关结果时查询的有效性。 可以根据点击数据和提供给用户的搜索结果的效率来加权查询与结果图表中的边。
    • 10. 发明授权
    • Large graph measurement
    • 大图测量
    • US08090729B2
    • 2012-01-03
    • US12396514
    • 2009-03-03
    • Sreenivas Gollapudi
    • Sreenivas Gollapudi
    • G06F17/30G06F7/00
    • G06F17/30876G06F17/30873
    • As provided herein, a pairwise distance between nodes in a large graph can be determined efficiently. URL-sketches are generated for respective nodes in an index by extracting labels from respective nodes, which provide a reference to a link between the nodes, aggregating the labels into sets for respective nodes, and storing the sets of labels as URL-sketches. Neighborhood-sketches are generated for the respective nodes in the index using the URL-sketches, by determining a neighborhood for a node and generating a sketch using labels that are associated with the respective neighboring nodes. A distance between two nodes is determined by computing an approximate number of paths and an approximate path length between the two nodes, using the neighborhood sketches for the two nodes.
    • 如本文所提供的,可以有效地确定大图中的节点之间的成对距离。 通过从相应节点提取标签,提供对节点之间的链接的引用,将标签聚集到各个节点的集合中,并将标签集合存储为URL草图,从而为索引中的相应节点生成URL草图。 通过使用URL草图,通过确定节点的邻域并使用与各个相邻节点相关联的标签生成草图来为索引中的相应节点生成邻域草图。 通过使用两个节点的邻域草图计算两个节点之间的近似路径数和两个节点之间的近似路径长度来确定两个节点之间的距离。