Does “authority” mean quality? predicting expert quality ratings of Web documents

Amento, Brian; Terveen, Loren; Hill, William C.

doi:10.1145/345508.345603

Cited by 163 publications

(139 citation statements)

References 9 publications

Supporting

Mentioning

131

Contrasting

Unclassified

Order By: Relevance

“…This latter has been addressed by a wide range of research approaches that focused, most of them, on the use of citation features as indicators of importance or authority of scientific publications [1]. Citation information and contexts have been used in early stage of IR area according to the principle of bibliographic coupling and co-citation analysis [10,20].…”

Section: Literature Accessmentioning

confidence: 99%

An Exploratory Study on Using Social Information Networks for Flexible Literature Access

Tamine

Jabeur

Bahsoun

2009

Flexible Query Answering Systems

View full text Add to dashboard Cite

Abstract.It is well known that the fundamental intellectual problems of information access are the production and consumption of information. In this paper, we investigate the use of social network of information producers (authors) within relations in data (co-authorship and citation) in order to improve the relevance of information access. Relevance is derived from the network by levraging the usual topical similarity between the query and the document with the target author's authority. We explore various social network based measures for computing social information importance and show how this kind of contextual information can be incorporated within an information access model. We experiment with a collection issued from SIGIR 1 proceedings and show that combining topical, author and citation based evidences can significantly improve retrieval access precision, measured in terms of mean reciprocal rank.

show abstract

Section: Literature Accessmentioning

confidence: 99%

An Exploratory Study on Using Social Information Networks for Flexible Literature Access

Tamine

Jabeur

Bahsoun

2009

Flexible Query Answering Systems

View full text Add to dashboard Cite

show abstract

“…The proof has three parts: first we give two alternate formulations for the term Ú Ì Ì in Equation (1) Proof. We can write Å À Ì À Ë Ì À · Ë Ì , we know that Ù Ì Å…”

Section: A Appendix: Proof Of Theorem 31mentioning

confidence: 99%

“…Kleinberg's seminal paper [20] on hubs and authorities introduced a natural paradigm for classifying and ranking web pages, setting off an avalanche of subsequent work [7,8,10,15,22,9,3,12,19,2,5,27,1,13]. Kleinberg's ideas were implemented in HITS as part of the CLEVER project [7,10].…”

Section: Introductionmentioning

confidence: 99%

Web Search via Hub Synthesis

Achlioptas

Fiat

Karlin

et al. 2001

Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques

View full text Add to dashboard Cite

show abstract

“…HITS (Kleinberg, 1999) and the ensuing CLEVER project (Chakrabarti et al, 1999a;Chakrabarti et al, 1999b;Chakrabarti et al, 1998b;Chakrabarti et al, 1998a), PageRank (Brin and Page, 1998;Haveliwala, 2002), SALSA (Lempel and Moran, 2001b)). These algorithms demonstrated empirically that link-structure analysis can improve search and rank techniques on the Web (Amento et al, 2000;Silva et al, 2000). Accordingly, search engines (such as Google 1 and AltaVista 2 ) nowadays incorporate extensive link analysis in their ranking algorithms, that determine the order in which the search results are displayed to the user (Brin and Page, 1998;Arasu et al, 2001).…”

Section: Introductionmentioning

confidence: 99%

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

Lempel

Moran

2005

Inf Retrieval

View full text Add to dashboard Cite

Abstract. Web search algorithms that rank Web pages by examining the link structure of the Web are attractive from both theoretical and practical aspects. Today's prevailing link-based ranking algorithms rank Web pages by using the dominant eigenvector of certain matrices -like the co-citation matrix or variations thereof. Recent analyses of ranking algorithms have focused attention on the case where the corresponding matrices are irreducible, thus avoiding singularities of reducible matrices. Consequently, rank analysis has been concentrated on authority connected graphs, which are graphs whose co-citation matrix is irreducible (after deleting zero rows and columns). Such graphs conceptually correspond to thematically related collections, in which most pages pertain to a single, dominant topic of interest.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 are rank-similar if they produce similar rankings. These concepts were introduced and studied recently for various existing search algorithms.This paper studies the rank-stability and rank-similarity of three link-based ranking algorithms -PageRank, HITS and SALSA -in authority connected graphs. For this class of graphs, we show that neither HITS nor PageRank is rank stable. We then show that HITS and PageRank are not rank similar on this class, nor is any of them rank similar to SALSA.

show abstract

Does “authority” mean quality? predicting expert quality ratings of Web documents

Cited by 163 publications

References 9 publications

An Exploratory Study on Using Social Information Networks for Flexible Literature Access

An Exploratory Study on Using Social Information Networks for Flexible Literature Access

Web Search via Hub Synthesis

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

Contact Info

Product

Resources

About