Abstract
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in which accuracy may be improved by augmenting the given graph with additional information. This information is obtained by querying an external source under resource constraints. The problem is to develop the most effective query selection strategy to minimize some loss function on the resulting partitioning. We motivate the problem using an entity resolution task.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bansal, N., Chawla, S., Blum, A.: Correlation Clustering. In: Proc. of 43rd FOCS (2002)
Kanani, P., McCallum, A., Pal, C.: Improving Author Coreference by Resource-bounded Information Gathering from the Web. In: Proc. of IJCAI (2007)
Roy, N., McCallum, A.: Toward Optimal Active Learning through Sampling Estimation of Error Reduction. In: Proc. of 18th ICML (2001)
Kapoor, A., Greiner, R.: Learning and Classifying Under Hard Budgets, ECML (2005)
Grass, J., Zilberstein, S.: A Value-Driven System for Autonomous Information Gathering, JIIS, 14 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kanani, P., McCallum, A. (2007). Resource-Bounded Information Gathering for Correlation Clustering. In: Bshouty, N.H., Gentile, C. (eds) Learning Theory. COLT 2007. Lecture Notes in Computer Science(), vol 4539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72927-3_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-72927-3_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72925-9
Online ISBN: 978-3-540-72927-3
eBook Packages: Computer ScienceComputer Science (R0)