Abstract
Clustering is an important task in data mining and machine learning. In this paper, a normalized graph sampling algorithm for clustering that improves the solution of clustering via the incorporation of a priori constraint in a stochastic graph sampling procedure is adopted. The important question of how many clusters exists in the dataset and when to terminate the clustering algorithm is solved via computing the ensemble average change in entropy. Experimental results show the feasibility of the suggested approach.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this chapter
Cite this chapter
Li, C. Cluster Identification Using Maximum Configuration Entropy. In: Young Lin, T., Ohsuga, S., Liau, CJ., Hu, X., Tsumoto, S. (eds) Foundations of Data Mining and knowledge Discovery. Studies in Computational Intelligence, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11498186_15
Download citation
DOI: https://doi.org/10.1007/11498186_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26257-2
Online ISBN: 978-3-540-32408-9
eBook Packages: EngineeringEngineering (R0)