Histogram-Based Fuzzy Clustering and Its Comparison to Fuzzy C-Means Clustering in One-Dimensional Data

  • A. Chong
  • T. D. Gedeon
  • K. W. Wong
Conference paper
Part of the Advances in Soft Computing book series (AINSC, volume 14)


In this paper, a histogram fuzzy clustering technique (HFC) has been proposed. The technique is designed specifically for one-dimensional data clustering. HFC is composed of two main components: trapezoidal cluster approximation, and bin width determination. By conducting experiments on two sets of real-world petroleum data, the effectiveness of HFC and the Fuzzy c-Means Clustering technique has been compared. It is found that the performance of HFC and FCMC varies across different sets of data. In some data, HFC can perform significantly better than FCMC. It is concluded that despite its limitation to clustering only one-dimensional data, HFC can be very useful in the rules extraction problem domain, especially in clustering the output space, which can be assumed to be always one-dimensional. Several other advantages of HFC, namely the technique is straightforward and computational efficient, are also discussed in the paper


fuzzy clustering histogram fuzzy c-means clustering 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bezdek, J.C., Pattern Reconition with Fuzzy Objective Function Algorithms. 1981, New York: Plenum Press.CrossRefGoogle Scholar
  2. [2]
    Sugeno, M. and Yasukawa, T., A fuzzy-logic-based approach to qualitative modeling. IEEE Transactions on Fuzzy Systems, 1993. 1 (1): p. 7–31.CrossRefGoogle Scholar
  3. [3]
    Fukuyama, Y. and Sugeno, M. A new method of choosing the number of clusters for fuzzy c-means method. in Proceedings of the 5th Fuzzy System Symposium. 1989.Google Scholar
  4. [4]
    Prewitt, J.S.M. and Mendelsonn, M.L., The analysis of cell images. Annual New York Acad. Sci., 1966. 128: p. 1035–1053.CrossRefGoogle Scholar
  5. [5]
    Glasbey, C.A., An analysis of histogram-based thresholding algorithms. Graphical Models and Image Processing, 1993. 55 (6): p. 532–537.Google Scholar
  6. [6]
    Puzicha, J., Hoftmann, T., and Buhmann, J.M., Histogram clustering for unsupervised segmentation and image retrieval. Pattern Recognition Letters, 1999. 20: p. 899–909.CrossRefGoogle Scholar
  7. [7]
    Sturges, H.A., The choise of a class interval. J. Amer. Statist. Assoc., 1926. 21: p. 6566.Google Scholar
  8. [8]
    Simonoff, J.S., Smoothing Methods in Statistics. 1 ed. 1996, New York:Google Scholar
  9. [9]
    Springer. Turkey, J.W., Exploratory Data Analysis. 1977, US: Addison Wesley.Google Scholar
  10. [10]
    Ruspini, E.H., A new approach to clustering. Information and Control, 1969. 15: p. 2232.Google Scholar
  11. [11]
    Jian, F.X., Chork, C.Y., Taggart, I.J., McKay, D.M., and Barlett, R.M., A genetic approach to the prediction of petrophysical properties. Journal of Petroleum Geology, 1994. 17 (1): p. 71–88.CrossRefGoogle Scholar
  12. [12]
    Chong, A., Koczy, L.T., Gedeon, T.D., Wong, K.W., A Histogram-Based Rule Extraction Technique for Fuzzy Systems, (Submitted to: The 10th IEEE International Conference on Fuzzy Systems), Melbourne, 2 December — 5 December, 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • A. Chong
    • 1
  • T. D. Gedeon
    • 1
  • K. W. Wong
    • 1
  1. 1.School of Information TechnologyMurdoch UniversitySouth St, MurdochWestern Australia

Personalised recommendations