Academic Expert Finding via $(k,\mathcal{P})$-Core based Embedding over Heterogeneous Graphs
Finding relevant experts in specified areas is often crucial for a wide range of applications in both academia and industry. Given a user input query and a large amount of academic knowledge (e.g., academic papers), expert finding aims to find and rank the experts who are most relevant to the given query, from the academic knowledge. Existing studies mainly focus on the embedding-based solutions that (1) consider academic papers' textual semantic similarities to a given query through document representation models and (2) extract the top-$n$ experts with the greatest similarities. Beyond the implicit textual semantics of papers, however, the papers’ explicit relationships (e.g., co-authorship, citation, and same-topic relationship) in a heterogeneous academic graph (e.g., DBLP) are critical for document representation, insofar as they help improve the expert finding quality. Despite their importance, the explicit relationships of papers generally have been ignored in the literature. In this paper, we study the academic expert finding on heterogeneous graphs by considering the explicit relationships besides the implicit textual semantics of papers in one representation model. Specifically, we first define the $(k,\mathcal{P})$-core to denote a cohesive community of papers that are closely connected via a meta-path $\mathcal{P}$ ($\mathcal{P}$ indicates the different relationships of papers). We then propose an offline $(k,\mathcal{P})$-core based document embedding model to capture papers' various explicit relationships for representation. Moreover, by using papers' embeddings, we present an online threshold algorithm (TA)-based method to efficiently return top-$n$ experts via a carefully designed proximity graph-based index (PG-Index). We extend our approach to support multiple relationships simultaneously for representation. Extensive experiments over real-world datasets demonstrate the effectiveness and efficiency of our approach.
Code (0)
등록된 구현이 없습니다.
Tasks
Document EmbeddingSimilar Papers 제목 키워드 기반
Effective Distributed Representations for Academic Expert Search
Expert search aims to find and rank experts based on a user's query. In academia, retrieving experts is an efficient way to navigate through a large amount of academic knowledge. Here, we study how different distributed …
NavigateRetrievalSentenceSentence SimilarityEL Embeddings: Geometric construction of models for the Description Logic EL ++
An embedding is a function that maps entities from one algebraic structure into another while preserving certain characteristics. Embeddings are being used successfully for mapping relational data or text into vector spa…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsSemantic Similarity+1An open-source framework for ExpFinder integrating $N$-gram Vector Space Model and $μ$CO-HITS
Finding experts drives successful collaborations and high-quality product development in academic and research domains. To contribute to the expert finding research community, we have developed ExpFinder which is a novel…
Episodic Bandits with Stochastic Experts
We study a version of the contextual bandit problem where an agent can intervene through a set of stochastic expert policies. The agent interacts with the environment over episodes, with each episode having different con…
Learning to Rank for Expert Search in Digital Libraries of Academic Publications
The task of expert finding has been getting increasing attention in information retrieval literature. However, the current state-of-the-art is still lacking in principled approaches for combining different sources of evi…
Information RetrievalLearning-To-RankRetrieval