Filters








12,137 Hits in 7.8 sec

Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs

R. Lempel, S. Moran
2005 Information retrieval (Boston)  
This paper studies the rank-stability and rank-similarity of three link-based ranking algorithms-PageRank, HITS and SALSA-in authority connected graphs.  ...  A link-based search algorithm A is rank-stable if minor changes in the link structure of the input graph, which is usually a subgraph of the Web, do not affect the ranking it produces; algorithms A, B  ...  We now define the terms rank-similarity and rank-stability of link-based ranking algorithms for the Web, and the concept of authority-connected graphs (Borodin et al. 2001 ).  ... 
doi:10.1007/s10791-005-5661-0 fatcat:ohgrrtycjzbe5cpnbsveru3eyq

An Improvement of Link Analysis Algorithm to Mine Pertinent Links: Weighted HITS Algorithm based on additive fusion of graphs by Query Similarity

Hemangini S., Apurva A.
2020 International Journal of Computer Applications  
The proposed algorithm, namely weighted HITs (WHITS) helps to extract a pertinent and valuable links based on similarity of link anchors, titles, and query term.  ...  of graphs.  ...  To integrate the similarity of anchors, titles, and query graph in turn with hyperlink connectivity graph for Web page ranking, it is required to fuse these two flat graphs for the improvement of HITs  ... 
doi:10.5120/ijca2020920232 fatcat:ikqw4ubnjre7jndpcshdqsjbpu

Where to Start Browsing the Web? [chapter]

Dániel Fogaras
2003 Lecture Notes in Computer Science  
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking algorithms.  ...  By calculating the dominations and connectivity decay we compare and analyze the proposed ranking algorithms without the need of human interaction solely from the structure of the Web.  ...  Acknowledgment I wish to thank Katalin Friedl, András Benczúr and András Lőrincz for the valuable discussions and for improving the level of this manuscript.  ... 
doi:10.1007/978-3-540-39884-4_6 fatcat:g7qx3wulvzb7zftp6deiyukgvi

Link analysis ranking: algorithms, theory, and experiments

Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, Panayiotis Tsaparas
2005 ACM Transactions on Internet Technology  
The seminal papers of Kleinberg [1998, 1999] and Brin and Page [1998] introduced Link Analysis Ranking, where hyperlink structures are used to determine the relative authority of a Web page and produce  ...  In this article we work within the hubs and authorities framework defined by Kleinberg and we propose new families of algorithms.  ...  We would also like to thank all the people who participated in the online survey for determining the relevance of the search results.  ... 
doi:10.1145/1052934.1052942 fatcat:egtfvxuehjgjvmzudrhm4ml26i

Stable algorithms for link analysis

Andrew Y. Ng, Alice X. Zheng, Michael I. Jordan
2001 Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '01  
In this paper, we extend the analysis and show how it gives insight into ways of designing stable link analysis methods.  ...  This in turn motivates two new algorithms, whose performance we study empirically using citation data and web hyperlink data.  ...  TWO NEW ALGORITHMS Randomized HITS The preceding discussion suggests a natural way of designing a random-walk based algorithm that is similar in spirit to HITS (and finds both hubs as well as authorities  ... 
doi:10.1145/383952.384003 dblp:conf/sigir/ZhengNJ01 fatcat:s32sbeozwfggfox7lxgam734da

Link-Based Ranking of the Web with Source-Centric Collaboration

James Caverlee, Ling Liu, William B. Rouse
2006 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing  
In this paper we develop a framework for link-based collaborative ranking of the Web by utilizing the strong Web link structure.  ...  Web ranking is one of the most successful and widely used collaborative computing applications, in which Web pages collaborate in the form of varying degree of relationships to assess their relative quality  ...  First, we evaluate the stability of the ranking algorithm as the Web graph evolves, and new pages and sources are discovered.  ... 
doi:10.1109/colcom.2006.361840 dblp:conf/colcom/CaverleeLR06 fatcat:zvsb3iuwfrcvdcwvkorx6bp34i

Finding authorities and hubs from link structures on the World Wide Web

Allan Borodin, Gareth O. Roberts, Jeffrey S. Rosenthal, Panayiotis Tsaparas
2001 Proceedings of the tenth international conference on World Wide Web - WWW '01  
We undertake a comparative study of hypertext link analysis algorithms. Guided by some experimental queries, we propose some formal criteria for evaluating and comparing link analysis algorithms.  ...  Recently, there have b e e n a n umber of algorithms proposed for analyzing hypertext link structure so as to determine the best \authorities" for a given topic or query.  ...  In the de nition of stability w e assumed that the number of links in the graph is !(1).  ... 
doi:10.1145/371920.372096 dblp:conf/www/BorodinRRT01 fatcat:ln2p7h7nhbd53hii4mghcwis5q

PageRank, HITS and a unified framework for link analysis

Chris Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, Horst D. Simon
2002 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '02  
HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight normalization and web surfing based on random walk models.  ...  The ranking framework contains a large algorithm space; HITS and PageRank are two extreme ends in this space.  ...  Department of Energy (Office of Science, Office of Laboratory Policy and Infrastructure through LDRD) under contract DE-AC03-76SF00098.  ... 
doi:10.1145/564437.564440 fatcat:csnq7povrzdpjaxe2xswlj2ssm

PageRank, HITS and a unified framework for link analysis

Chris Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, Horst D. Simon
2002 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '02  
HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight normalization and web surfing based on random walk models.  ...  The ranking framework contains a large algorithm space; HITS and PageRank are two extreme ends in this space.  ...  Department of Energy (Office of Science, Office of Laboratory Policy and Infrastructure through LDRD) under contract DE-AC03-76SF00098.  ... 
doi:10.1145/564376.564440 dblp:conf/sigir/DingHHZS02 fatcat:ynkh7ncrxrcnxn7sd4mhydqrry

PageRank, HITS and a Unified Framework for Link Analysis [chapter]

Chris Ding, Xiaofeng He, Parry Husbands, Hongyuan Zha, Horst Simon
2003 Proceedings of the 2003 SIAM International Conference on Data Mining  
HITS emphasizes mutual reinforcement between authority and hub webpages, while PageRank emphasizes hyperlink weight normalization and web surfing based on random walk models.  ...  The ranking framework contains a large algorithm space; HITS and PageRank are two extreme ends in this space.  ...  Department of Energy (Office of Science, Office of Laboratory Policy and Infrastructure through LDRD) under contract DE-AC03-76SF00098.  ... 
doi:10.1137/1.9781611972733.24 dblp:conf/sdm/DingHHZS03 fatcat:ltaiuqtrc5cjrcioi4i63lk2ay

Perturbation of the Hyper-Linked Environment [chapter]

Hyun Chul Lee, Allan Borodin
2003 Lecture Notes in Computer Science  
After the seminal paper of Kleinberg[1] and the introduction of PageRank[2], there has been a surge of research activity in the area of web mining using link analysis algorithms.  ...  In this paper, we study the stability aspect of various link analysis algorithms concluding that some algorithms are more robust than others.  ...  Also, it would be interesting to extend/refine the notion of similarity between two link analysis algorithms in [3] , and apply this revised notion to study the similarity among link analysis algorithms  ... 
doi:10.1007/3-540-45071-8_29 fatcat:i3mwusrilbcjtmcbfyxiggvsqa

Citation Graph Based Ranking in Invenio [chapter]

Ludmila Marian, Jean-Yves Le Meur, Martin Rajman, Martin Vesely
2010 Lecture Notes in Computer Science  
Within this framework, we present four types of ranking models based on the citation graph that complement the simple approach based on citation counts: time-dependent citation counts, a relevancy ranking  ...  Our main contributions are: (i) a study of the currently available ranking methods based on the citation graph; (ii) the development of new ranking methods that correct some of the identified limitations  ...  counts, and doing an in-depth analysis of the stability of the rankings with respect to the decay factor, and secondly, analyzing time-decayed link-based ranking in the context of our data sets.  ... 
doi:10.1007/978-3-642-15464-5_25 fatcat:ydhkglw6qvd5vkvscspowzqxhy

Reinforcement Ranking [article]

Hengshuai Yao, Dale Schuurmans
2013 arXiv   pre-print
We introduce a new framework for web page ranking -- reinforcement ranking -- that improves the stability and accuracy of Page Rank while eliminating the need for computing the stationary distribution  ...  Second, the method is less sensitive to graph topology and more stable in the presence of dangling pages.  ...  This is tricky for the case of Web, where there are many dangling pages, sinks, and pages without any incoming links.  ... 
arXiv:1303.5988v1 fatcat:f5n3zmplprcd3asovevcearpoq

Estimating PageRank deviations in crawled graphs

Helge Holzmann, Avishek Anand, Megha Khosla
2019 Applied Network Science  
This leads to inaccurate estimates of graph properties based on link analysis such as PAGERANK.  ...  Most real-world graphs collected from the Web like Web graphs and social network graphs are partially discovered or crawled.  ...  The publication of this article was funded by the Open Access Fund of the Leibniz Universität Hannover.  ... 
doi:10.1007/s41109-019-0201-9 fatcat:i3vd5gy2nvhgnc2iq6ujgca6um

A Parameterized Approach to Spam-Resilient Link Analysis of the Web

J. Caverlee, S. Webb, Ling Liu, W.B. Rouse
2009 IEEE Transactions on Parallel and Distributed Systems  
Concretely, we find that the source-centric model supports more effective and robust rankings in comparison with existing Web algorithms such as PageRank.  ...  Link-based analysis of the Web provides the basis for many important applications-like Web search, Web-based data mining, and Web page categorization-that bring order to the massive amount of distributed  ...  NSF) CyberTrust program, an AFOSR grant, and an IBM SUR grant.  ... 
doi:10.1109/tpds.2008.227 fatcat:7r4lunnzsrgyfp6o3q6j3367vi
« Previous Showing results 1 — 15 out of 12,137 results