Authors:
Anna Hristoskova
1
;
Elena Tsiporkova
2
;
Tom Tourwé
2
;
Simon Buelens
1
;
Mattias Putman
1
and
Filip De Turck
1
Affiliations:
1
Ghent University, Belgium
;
2
Sirris, Belgium
Keyword(s):
Author Disambiguation, Expert Finding, Clustering, Data Processing, Graph Data Model.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Collaboration and e-Services
;
Data Mining
;
Databases and Information Systems Integration
;
e-Business
;
Enterprise Engineering
;
Enterprise Information Systems
;
Enterprise Ontologies
;
Formal Methods
;
Knowledge Engineering and Ontology Development
;
Knowledge Representation and Reasoning
;
Knowledge-Based Systems
;
Model-Based Reasoning
;
Ontologies
;
Semantic Web
;
Sensor Networks
;
Signal Processing
;
Simulation and Modeling
;
Soft Computing
;
Symbolic Systems
Abstract:
The paper describes a dynamic framework for the construction and maintenance of an expert-finding repository through the continuous gathering and processing of online information. An initial set of online sources, relevant to the topic of interest, is identified to perform an initial collection of author profiles and publications. The extracted information is used as a seed to further enrich the expert profiles by considering other, potentially complementary, online data sources. The resulting expert repository is represented as a graph, where related author profiles are dynamically clustered together via a complex author disambiguation process leading to continuous merging and splitting of author nodes. Several rules are developed that assign weights to the links in the graph based on author similarities such as name, affiliation, e-mail, co-authors, and interests. Dynamic clustering of the authors depending on these weights results in the identification of unique experts
for a spec
ific domain.
The developed disambiguation and author clustering algorithms are validated on several authors with varying name notations showing an improvement on the identification of unique profiles of 28% compared to the results from DBLP.
(More)