Database Paper Browser

Back to papers

Web Scale Taxonomy Cleansing

Summary: Web-scale taxonomy matching using external positive/negative evidence, formulating the task as optimal multi-way graph cuts. A Monte Carlo greedy-cut algorithm yields scalable cleansing; extensive experiments against three baselines demonstrate its advantage. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10193
Venue
VLDB
Year
2011
Pagerank
4.1945683e-05
Overall Rank
12,194 | 15.17%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,066 Probase: A Probabilistic Taxonomy for Text Understanding 2012 SIGMOD 0.0001433416
7,475 Optimizing Index for Taxonomy Keyword Search 2012 SIGMOD 4.7191809e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers