Cluster number selection for a small set of samples using the Bayesian Ying-Yang model

Authors:
Ping Guo;C. L.P. Chen;M. R. Lyu
Affiliations:
Dept. of Comput. Sci., Beijing Normal Univ.;-;-
Venue:
IEEE Transactions on Neural Networks
Year:
2002

Citing 0
Cited 6

On Rival Penalization Controlled Competitive Learning for Clustering with Automatic Cluster Number Selection

IEEE Transactions on Knowledge and Data Engineering
Sequential clustering by statistical methodology

Pattern Recognition Letters
A study of regularized Gaussian classifier in high-dimension small sample set case based on MDL principle with application to spectrum recognition

Pattern Recognition
Underdetermined convolutive blind source separation via time-frequency masking

IEEE Transactions on Audio, Speech, and Language Processing
A gradient-descent-based approach for transparent linguistic interface generation in fuzzy models

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Software metrics data clustering for quality prediction

ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

One major problem in cluster analysis is the determination of the number of clusters. In this paper, we describe both theoretical and experimental results in determining the cluster number for a small set of samples using the Bayesian-Kullback Ying-Yang (BYY) model selection criterion. Under the second-order approximation, we derive a new equation for estimating the smoothing parameter in the cost function. Finally, we propose a gradient descent smoothing parameter estimation approach that avoids complicated integration procedure and gives the same optimal result