RANKING SEARCH RESULTS USING WEIGHTED TOPOLOGIES

摘要

Identifiers of items generated in response to a query are each ranked in a way that considers the other identified items. Topologies are generated that correspond to features of the identified items. Each topology may be a Markov chain that includes a node for each identified item and directed edges between the nodes. Each directed edge between a node pair has an associated transition probability that represents the likelihood that a hypothetical user would change their preference from a first node in the pair to the second node in the pair when considering the feature associated with the topology. The topologies are weighted according to the relative importance of the features that correspond to the topologies. The weighted topologies are used to generate a stationary distribution of the identified items, and the identified items are ranked using the stationary distribution.