Demo Data from EDBT 2026 / reviewers in the wild / expert
Michelle Teo
dblp:25/1477
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-authorDatabases, 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 · 91% Data mining · 9% | |
| Computer networks
1 paper |
Content delivery and video streaming · 77% Internet architecture and protocols · 23% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning › entity resolution
crowdsourced entity resolution |
0.3 | 1 | 2018 | A Demonstration of PERC: Probabilistic Entity Resolution With Crowd Errors · Proc. VLDB Endow. 2018 |
Data integration and cleaning
entity resolution |
0.3 | 1 | 2018 | A Demonstration of PERC: Probabilistic Entity Resolution With Crowd Errors · Proc. VLDB Endow. 2018 |
Data integration and cleaning › entity resolution
probabilistic entity resolution |
0.3 | 1 | 2018 | A Demonstration of PERC: Probabilistic Entity Resolution With Crowd Errors · Proc. VLDB Endow. 2018 |
Data mining
clustering |
0.1 | 1 | 2018 | A Demonstration of PERC: Probabilistic Entity Resolution With Crowd Errors · Proc. VLDB Endow. 2018 |
Content delivery and video streaming
peer-to-peer file sharing |
0.1 | 1 | 2008 | Achieving high-bandwidth peer-to-peer file distribution · CoNEXT 2008 |
Internet architecture and protocols
overlay networks |
0.0 | 1 | 2008 | Achieving high-bandwidth peer-to-peer file distribution · CoNEXT 2008 |
Methods — techniques the papers use, named apart from their topics
uncertain graph model · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | A Demonstration of PERC: Probabilistic Entity Resolution With Crowd ErrorsabstractThis paper demonstrates PERC --- our system for crowdsourced entity resolution with human errors. Entity Resolution (ER) is a critical step in data cleaning and analytics. Although many machine-based methods existed for ER task, crowdsourcing is becoming increasingly important since humans can provide more insightful information for complex tasks, e.g., clustering of images and natural language processing. However, human workers still make mistakes due to lack of domain expertise or seriousness, ambiguity, or even malicious intent. To this end, we present a system, called PERC (probabilistic entity resolution with crowd errors), which adopts an uncertain graph model to address the entity resolution problem with noisy crowd answers. Using our framework, the problem of ER becomes equivalent to finding the maximum-likelihood clustering. In particular, we propose a novel metric called "reliability" to measure the quality of a clustering, which takes into account both the connected-ness inside and across all clusters. PERC then automatically selects the next question to ask the crowd that maximally increases the "reliability" of the current clustering. This demonstration highlights (1) a reliability-based next crowd-sourcing framework for crowdsourced ER, which does not require any user-defined threshold, and no apriori information about the error rate of the crowd workers, (2) it improves the ER quality by 15% and reduces the crowdsourcing cost by 50% compared to state-of-the-art methods, and (3) its GUI can interact with users to help them compare different crowdsourced ER algorithms, their intermediate ER results as they progress, and their selected next crowdsourcing questions in a user-friendly manner. Our demonstration video is at: https://www.youtube.com/watch?v=rQ7nu3b8zXY. Xiangyu Ke, Michelle Teo, Arijit Khan 0001, Vijaya Krishna Yalavarthi |
Proc. VLDB Endow. | 2 |
| 2008 | Achieving high-bandwidth peer-to-peer file distributionabstractCommercial entities have started using peer-to-peer (P2P) algorithms for file distribution. For example, Sub Pop Records and Blizzard Entertainment use BitTorrent [2] to distribute large files to their clients. Given that last-mile bandwidths to home users are increasing rapidly, a P2P approach is perhaps the only viable solution to avoid a bottleneck at the servers. Furthermore, the fact that P2P algorithms exploit the bandwidth available to the clients and reduces the provisioning costs at the server, makes P2P even more attractive. Michelle Teo, Cristina Carbunaru, Ben Leong, Yashas Nataraj, Hoang Minh Le Vu, Raymond Tan, Yong Meng Teo |
CoNEXT | 1 |