Demo Data from EDBT 2026 / reviewers in the wild / expert
Tania Khalafbeigi
dblp:148/0805
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, 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 mining · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
clustering |
0.2 | 1 | 2015 | GDCluster: A General Decentralized Clustering Algorithm · IEEE Trans. Knowl. Data Eng. 2015 |
Data mining › clustering › large-scale clustering
distributed clustering |
0.2 | 1 | 2015 | GDCluster: A General Decentralized Clustering Algorithm · IEEE Trans. Knowl. Data Eng. 2015 |
Distributed systems
peer-to-peer systems |
0.1 | 1 | 2015 | GDCluster: A General Decentralized Clustering Algorithm · IEEE Trans. Knowl. Data Eng. 2015 |
Methods — techniques the papers use, named apart from their topics
partition-based clustering · 0.4gossip-based communication · 0.4density-based clustering · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | GDCluster: A General Decentralized Clustering AlgorithmabstractIn many popular applications like peer-to-peer systems, large amounts of data are distributed among multiple sources. Analysis of this data and identifying clusters is challenging due to processing, storage, and transmission costs. In this paper, we propose GDCluster, a general fully decentralized clustering method, which is capable of clustering dynamic and distributed data sets. Nodes continuously cooperate through decentralized gossip-based communication to maintain summarized views of the data set. We customize GDCluster for execution of the partition-based and density-based clustering methods on the summarized views, and also offer enhancements to the basic algorithm. Coping with dynamic data is made possible by gradually adapting the clustering model. Our experimental evaluations show that GDCluster can discover the clusters efficiently with scalable transmission cost, and also expose its supremacy in comparison to the popular method LSP2P. Hoda Mashayekhi, Jafar Habibi, Tania Khalafbeigi, Spyros Voulgaris, Maarten van Steen |
IEEE Trans. Knowl. Data Eng. | 3 |