Proceedings of the 13th ACM/IEEE-CS Joint Conference on Digital Libraries 2013
DOI: 10.1145/2467696.2467707
|View full text |Cite
|
Sign up to set email alerts
|

Ranking experts using author-document-topic graphs

Abstract: Expert search or recommendation involves the retrieval of people (experts) in response to a query and on occasion, a given set of constraints. In this paper, we address expert recommendation in academic domains that are different from web and intranet environments studied in TREC. We propose and study graph-based models for expertise retrieval with the objective of enabling search using either a topic (e.g. "Information Extraction") or a name (e.g. "Bruce Croft"). We show that graph-based ranking schemes despi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
22
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 30 publications
(22 citation statements)
references
References 25 publications
0
22
0
Order By: Relevance
“…By surveying different ranking methods and evaluating question and answer relevance, we can better understand how ranking can assist with CQA question and answer relationships. Gollapalli, Mitra, and Giles () rank the users with a graph‐based method, but it does not clearly demonstrate how to rank the answers based on the users. The neural network is also deployed to rank the content in CQA (Iyyer, Boyd‐Graber, Claudino, Socher, & Daumé, ; Qiu & Huang, ).…”
Section: Background and Related Workmentioning
confidence: 99%
“…By surveying different ranking methods and evaluating question and answer relevance, we can better understand how ranking can assist with CQA question and answer relationships. Gollapalli, Mitra, and Giles () rank the users with a graph‐based method, but it does not clearly demonstrate how to rank the answers based on the users. The neural network is also deployed to rank the content in CQA (Iyyer, Boyd‐Graber, Claudino, Socher, & Daumé, ; Qiu & Huang, ).…”
Section: Background and Related Workmentioning
confidence: 99%
“…However, as motivated in Section 3, this simple quantitative metric as well as other standard indices based on citations counts, i.e., Hirsch index and variants [9,3,14], are not discriminative enough to identify authoritative researchers. Graph-based models, largely based on random walk [20], are often used to identify important nodes in networks and the correlation between centrality and expertise in organizational networks have been extensively studied [12,4,17,11,21,23,13,8,6]. The value of the co-citation graph has been proven for web pages [12].…”
Section: Related Workmentioning
confidence: 99%
“…In organizational networks, graph-based models, largely based on random walk [23], are widely used to estimate individual authority. In this field, extensive researches have demonstrated strong correlations between centrality and authority [10,16,26,27]. The famous PageRank algorithm proposed by L. Page et al [18] and later the Topic-sensitive Pagerank [11] have proven the value of the citation graph for web pages.…”
Section: Related Workmentioning
confidence: 99%