Demo Data from EDBT 2026 / reviewers in the wild / expert
Bingduan Lin
dblp:140/9474
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data integration and cleaning · 87% Information retrieval · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning › entity resolution
alias detection |
0.2 | 1 | 2013 | GRIAS: An Entity-Relation Graph Based Framework for Discovering Entity Aliases · ICDM 2013 |
Data integration and cleaning
entity resolution |
0.2 | 1 | 2013 | GRIAS: An Entity-Relation Graph Based Framework for Discovering Entity Aliases · ICDM 2013 |
Information retrieval
web search |
0.0 | 1 | 2013 | GRIAS: An Entity-Relation Graph Based Framework for Discovering Entity Aliases · ICDM 2013 |
Methods — techniques the papers use, named apart from their topics
graph-based similarity · 0.2entity-relation graph · 0.2candidate selection · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | GRIAS: An Entity-Relation Graph Based Framework for Discovering Entity AliasesabstractRecognizing the various aliases of an entity is a critical task for many applications, including Web search, recommendation system, and e-discovery. The goal of this paper is to accurately identify entity aliases, especially the long tail ones in the unstructured data. Our solution GRIAS (abbr. for a Graph-based framework for discovering entity Aliases) is motivated by the entity relationships collected from both the structured and unstructured data. These relationships help to build an entity-relation graph, and the graph-based similarity is calculated between an entity and its alias candidates which are first chosen by our proposed candidate selection method. Extensive experimental results on two real-world datasets demonstrate both the effectiveness and efficiency of the proposed framework. Lili Jiang 0002, Ping Luo 0001, Jianyong Wang 0001, Yuhong Xiong, Bingduan Lin, Min Wang 0001, Ning An 0001 |
ICDM | 5 |