@conference {14447,
	title = {Collective graph identification},
	booktitle = {Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining},
	series = {KDD {\textquoteright}11},
	year = {2011},
	month = {2011///},
	pages = {87 - 95},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Data describing networks (communication networks, transaction networks, disease transmission networks, collaboration networks, etc.) is becoming increasingly ubiquitous. While this observational data is useful, it often only hints at the actual underlying social or technological structures which give rise to the interactions. For example, an email communication network provides useful insight but is not the same as the "real" social network among individuals. In this paper, we introduce the problem of graph identification, i.e., the discovery of the true graph structure underlying an observed network. We cast the problem as a probabilistic inference task, in which we must infer the nodes, edges, and node labels of a hidden graph, based on evidence provided by the observed network. This in turn corresponds to the problems of performing entity resolution, link prediction, and node labeling to infer the hidden graph. While each of these problems have been studied separately, they have never been considered together as a coherent task. We present a simple yet novel approach to address all three problems simultaneously. Our approach, called C3, consists of Coupled Collective Classifiers that are iteratively applied to propagate information among solutions to the problems. We empirically demonstrate that C3 is superior, in terms of both predictive accuracy and runtime, to state-of-the-art probabilistic approaches on three real-world problems.},
	keywords = {collective classification, entity resolution, link prediction, semi-supervised learning},
	isbn = {978-1-4503-0813-7},
	doi = {10.1145/2020408.2020429},
	url = {http://doi.acm.org/10.1145/2020408.2020429},
	author = {Namata,Galileo Mark and Kok,Stanley and Getoor, Lise}
}
