We present a new class of problems, called Resource-bounded Information Gathering for Correlation Clustering. Our goal is to perform correlation clustering on a graph with incomplete information. The missing information can be obtained by querying an external source under constrained resources. The problem is to develop the most effective strategy for querying to achieve optimal clustering. We describe the problem using entity resolution as an example task.