USER QUERY REFORMULATION USING RANDOM WALKS
    1.
    发明申请
    USER QUERY REFORMULATION USING RANDOM WALKS 有权
    用户查询使用随机WALKS进行重构

    公开(公告)号:US20120096042A1

    公开(公告)日:2012-04-19

    申请号:US12907031

    申请日:2010-10-19

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30448

    摘要: There is provided a computer-implemented method for user query reformulation. A graph is created to represent a relationship between previous user query terms. The graph may represent the previous user searches in n-grams that correspond to nodes. A random walk analysis is performed to determine probabilities that various n-grams corresponding to nodes of the graph could be used to effectively alter a user search term. The probabilities represent a quantification of relationships between nodes of the graph. A determination may be made regarding whether to reformulate the user query based on a relationship between a user search term in the user query and a graphed search term represented by a node of the graph. The determination takes into account a relationship between the user search term and the graphed search term.

    摘要翻译: 提供了一种用于用户查询重新设计的计算机实现的方法。 创建一个图表来表示先前的用户查询词之间的关系。 该图可以代表与n个节点对应的先前用户搜索。 执行随机游走分析以确定可以使用对应于图的节点的各种n-gram来有效地改变用户搜索项的概率。 概率表示图的节点之间的关系的量化。 可以基于用户查询中的用户搜索项和由图的节点表示的图形搜索项之间的关系来确定是否重新形成用户查询。 该确定考虑了用户搜索项和图形搜索项之间的关系。

    User query reformulation using random walks
    2.
    发明授权
    User query reformulation using random walks 有权
    用户查询重新配置使用随机游走

    公开(公告)号:US09092483B2

    公开(公告)日:2015-07-28

    申请号:US12907031

    申请日:2010-10-19

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30448

    摘要: There is provided a computer-implemented method for user query reformulation. A graph is created to represent a relationship between previous user query terms. The graph may represent the previous user searches in n-grams that correspond to nodes. A random walk analysis is performed to determine probabilities that various n-grams corresponding to nodes of the graph could be used to effectively alter a user search term. The probabilities represent a quantification of relationships between nodes of the graph. A determination may be made regarding whether to reformulate the user query based on a relationship between a user search term in the user query and a graphed search term represented by a node of the graph. The determination takes into account a relationship between the user search term and the graphed search term.

    摘要翻译: 提供了一种用于用户查询重新设计的计算机实现的方法。 创建一个图表来表示先前的用户查询词之间的关系。 该图可以代表与n个节点对应的先前用户搜索。 执行随机游走分析以确定可以使用对应于图的节点的各种n-gram来有效地改变用户搜索项的概率。 概率表示图的节点之间的关系的量化。 可以基于用户查询中的用户搜索项和由图的节点表示的图形搜索项之间的关系来确定是否重新形成用户查询。 该确定考虑了用户搜索项和图形搜索项之间的关系。