@inbook {13416,
	title = {Active Constrained Clustering by Examining Spectral Eigenvectors},
	booktitle = {Discovery ScienceDiscovery Science},
	series = {Lecture Notes in Computer Science},
	volume = {3735},
	year = {2005},
	month = {2005///},
	pages = {294 - 307},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {This work focuses on the active selection of pairwise constraints for spectral clustering. We develop and analyze a technique for Active Constrained Clustering by Examining Spectral eigenvectorS (ACCESS) derived from a similarity matrix. The ACCESS method uses an analysis based on the theoretical properties of spectral decomposition to identify data items that are likely to be located on the boundaries of clusters, and for which providing constraints can resolve ambiguity in the cluster descriptions. Empirical results on three synthetic and five real data sets show that ACCESS significantly outperforms constrained spectral clustering using randomly selected constraints.},
	isbn = {978-3-540-29230-2},
	url = {http://dx.doi.org/10.1007/11563983_25},
	author = {Xu,Qianjun and desJardins, Marie and Wagstaff,Kiri},
	editor = {Hoffmann,Achim and Motoda,Hiroshi and Scheffer,Tobias}
}
