Fuzzy k-means clustering with crisp regions
暂无分享,去创建一个
A new fuzzy k-means clustering method is proposed by introducing crisp regions of clusters. Boundaries of the regions are determined by hyperbolas and membership values are given by one or zero in each region. The area between crisp regions is a fuzzy region, where membership values are proportional to distances to crisp regions. A new method is a direct extension of the traditional hard k-means.
[1] A Hyperbolic Fuzzt k-Means Clustering and Algorithm for Neural Networks , 2000 .
[2] Sadaaki Miyamoto,et al. Fuzzy Clustering by Quadratic Regularization , 1998 .
[3] Sadaaki Miyamoto,et al. Fuzzy c-means as a regularization and maximum entropy approach , 1997 .
[4] J. C. Peters,et al. Fuzzy Cluster Analysis : A New Method to Predict Future Cardiac Events in Patients With Positive Stress Tests , 1998 .