ACM Home Page
Please provide us with feedback. Feedback
Object-level ranking: bringing order to Web objects
Full text PdfPdf (888 KB)
Source International World Wide Web Conference archive
Proceedings of the 14th international conference on World Wide Web table of contents
Chiba, Japan
SESSION: Link-based ranking table of contents
Pages: 567 - 574  
Year of Publication: 2005
ISBN:1-59593-046-9
Authors
Zaiqing Nie  Microsoft Research Asia, Beijing, P. R. China
Yuanzhi Zhang  Peking University, Beijing, P. R. China
Ji-Rong Wen  Microsoft Research Asia, Beijing, P. R. China
Wei-Ying Ma  Microsoft Research Asia, Beijing, P. R. China
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 112,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1060745.1060828
What is a DOI?

ABSTRACT

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 PopRank, a domain-independent object-level link analysis model to rank the objects within a specific domain. Specifically we assign a popularity propagation factor to each type of object relationship, study how different popularity propagation factors for these heterogeneous relationships could affect the popularity ranking, and propose efficient approaches to automatically decide these factors. Our experiments are done using 1 million CS papers, and the experimental results show that PopRank can achieve significantly better ranking results than naively applying PageRank on the object graph.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Citeseer. Scientific Literature Digital Library. http://citeseer.ist.psu.edu.
 
2
N. Ashish and C. Knoblock. Wrapper generation for semi-structured internet sources. In Proc. Workshop on Management of Semistructured Data, Tucson, 1997.
 
3
Andrey Balmin, Vagelis Hristidis, and Yannis Papakonstantinou. Authority-based keyword queries in databases using objectrank. In Very Large Data Bases (VLDB), 2004.
 
4
5
6
7
8
 
9
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598), 1983.
10
 
11
Nickolas Kushmerick, Daniel S. Weld, and Robert B. Doorenbos. Wrapper induction for information extraction. In Intl. Joint Conference on Artificial Intelligence (IJCAI), pages 729--737, 1997.
12
 
13
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Libraries, 1998.
14
15
 
16
Jiying Wang, Ji-Rong Wen, Frederick H. Lochovsky, and Wei-Ying Ma. Instance-based schema matching for web databases by domain-specific query probing. In Very Large Data Bases (VLDB), 2004.
17

CITED BY  21

Collaborative Colleagues:
Zaiqing Nie: colleagues
Yuanzhi Zhang: colleagues
Ji-Rong Wen: colleagues
Wei-Ying Ma: colleagues