Academic
Publications
Object-level ranking: bringing order to web objects
Object-level ranking: bringing order to web objects   (Citations: 99)
BibTex | RIS | RefWorks Download
In contrast with the current Web search methods that essentially do document-level ranking and retrieval, we are exploring a new paradigm to enable Web search at the object level. We collect Web information for objects relevant for a specific application domain and rank these objects in terms of their relevance and popularity to answer user queries. Traditional PageRank model is no longer valid for object popularity calculation because of the existence of heterogeneous relationships between objects. This paper introduces can achieve significantly better ranking results than naively applying PageRank on the object graph.
Conference: World Wide Web Conference Series - WWW , pp. 567-574, 2005
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Simulated Annealing including clustering [28, 48], classification [4] and [33] which uses the Simulated Annealing algorithm to rank Web objects...
    • ...The work in [33] calculates the WWW 2011 – Session: Ranking March 28–April 1, 2011, Hyderabad, India...

    Maryam Karimzadehganet al. A stochastic learning-to-rank algorithm and its application to context...

    • ...While the previous work in this area [2] focuses on optimizing the Click Through Rate (CTR) of the related entities alone, we present an approach to jointly learn the relevance among the entities using both the user click data and the editorially assigned relevance grades...

    Changsung Kanget al. Ranking related entities for web search queries

    • ...Libra (Nie et al. 2005) considers papers, authors, and conferences as different objects and utilizes a PopRank (by extending PageRank, Page et al. 1999) to rank the different objects...
    • ...where |V | is the number of nodes in the network; ξ is a random jump parameter; λyx is the transition probability between the type of node y and the type of node x; P( x|y) is the probability between two specific nodes y and x. A similar definition has been previously used for ranking objects in heterogeneous networks (Nie et al. 2005)...
    • ...Nie et al. (2005) propose an object-level link analysis model, called PopRank, to rank the objects within a specific domain...
    • ...We note that some efforts (Xi et al. 2004, 2005; Nie et al. 2005) have also been placed for addressing the heterogeneous networks...

    Jie Tanget al. Topic level expertise search over heterogeneous networks

    • ...PageRank for ranking web pages/documents [6, 13], PopRank for ranking web objects (e.g., products, publications, people) [21], and a mechanism for ranking news articles and news sources [9]...

    Di Wuet al. Leadership discovery when data correlatively evolve

    • ...After that, quite a few link analysis algorithms like TrustRank [7] and PopRank [12] were developed to improve HITS and PageRank to robustly deal with web spam, and to handle heterogeneous graphs...

    Bin Gaoet al. Ranking on large-scale graphs with rich metadata

Order by: