A Fuzzy C-Means Approach for Incomplete Data Sets Based on Nearest-Neighbor Intervals

Article Preview

Abstract:

Partially missing data sets are a prevailing problem in pattern recognition. In this paper, the problem of clustering incomplete data sets is considered, and missing attribute values are imputed by the centers of corresponding nearest-neighbor intervals. Firstly, the algorithm estimates the nearest-neighbor intervals of missing attribute values by using the attribute distribution information of the data sets sufficiently. Secondly, the missing attribute values are imputed by the center of the intervals so as to clustering incomplete data sets. The proposed algorithm introduces the nearest neighbor information into incomplete data clustering, and the comparisons of the experimental results for two UCI data sets demonstrate the capability of the proposed algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1108-1111

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] J. C. Bezdek: Pattern Recognition with Fuzzy Objective Function Algorithms (Plenum Press, New York 1981).

Google Scholar

[2] A. Farhangfar, L. A. Kurgan and W. Pedrycz: IEEE Trans. Systems Man Cybernet. Vol. 37 (2007), p.692.

Google Scholar

[3] R. J. Hathaway and J. C. Bezdek: IEEE Trans. Systems Man Cybernet. Vol. 31 (2001), p.735.

Google Scholar

[4] H. Timm, C. Doring and R. Kruse: Int. J. Approx. Reason. Vol. 35 (2004), p.239.

Google Scholar

[5] K. Honda and H. Ichihashi: IEEE Trans. Fuzzy Syst. Vol. 12 (2004), p.183.

Google Scholar

[6] D. Li, H. Gu and L. Y. Zhang: Expert Syst. Appl. Vol. 37 (2010), p.6942.

Google Scholar

[7] G. D. Alessandro: Expert Syst. Appl. Vol. 38 (2011), p.6793.

Google Scholar

[8] D. Li, C. Q. Zhong: ICIC Expr. Lett. Vol. 6 (2012), p.2679.

Google Scholar