A Novel Unascertained C-Means Clustering with Application

Using the theory and method of unascertained measure, a novel unascertained C-means clustering model and the clustering weight are established. The basic knowledge of the unascertained sets and concept of unascertained clustering was introduced briefly. Then, the unascertained measure was defined and clustering weight were set up. Experimental results show that the presented algorithm performs more robust to noise than the fuzzy C-means clustering (FCM) algorithm do. Furthermore, the results of stock market board analysis using proposed method that indicates the unascertained C-means clustering model provides a quantitative objective and efficient method of stock market board analysis, and hence is suitable to stock market board analysis.

[1]  Jongwoo Kim,et al.  A note on the Gustafson-Kessel and adaptive fuzzy clustering algorithms , 1999, IEEE Trans. Fuzzy Syst..

[2]  B. Noble,et al.  On certain integrals of Lipschitz-Hankel type involving products of bessel functions , 1955, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[3]  Witold Pedrycz,et al.  Fuzzy clustering with partial supervision , 1997, IEEE Trans. Syst. Man Cybern. Part B.

[4]  Gerardo Beni,et al.  A Validity Measure for Fuzzy Clustering , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Yadong Wang,et al.  Improving fuzzy c-means clustering based on feature-weight learning , 2004, Pattern Recognit. Lett..

[6]  Y. Fukuyama,et al.  A new method of choosing the number of clusters for the fuzzy c-mean method , 1989 .

[7]  Ma Lihua,et al.  Analysis of risk decision of E-Commerce project based on data mining of rough sets , 2007 .

[8]  James C. Bezdek,et al.  Statistical parameters of cluster validity functionals , 1980, International Journal of Computer & Information Sciences.