Possibility Theoretic Clustering

  • Conference paper
Advances in Intelligent Computing (ICIC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3644))

Included in the following conference series:

  • 4346 Accesses

Abstract

Based on the exponential possibility model, the possibility theoretic clustering algorithm is proposed in this paper. The new algorithm is distinctive in determining an appropriate number of clusters for a given dataset while obtaining a quality clustering result. The proposed algorithm can be easily implemented using an alternative minimization iterative procedure and its parameters can be effectively initialized by the Parzon window technique and Yager’s probability-possibility transformation. Our experimental results demonstrate its success in artificial datasets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 85.59
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 106.99
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Pal, N.R., Bezdek, J.C.: Complexity Reduction for Large Image Processing. IEEE Trans. on Systems, Man and Cybernetics - Part B: Cybernetics 32(5), 598–611 (2002)

    Article  Google Scholar 

  2. Kollios, G., Gunopulos, D., Koudas, N., et al.: Efficient Biased Sampling for Approximate Clustering and Outlier Detection in Large Data Sets. IEEE Trans. on Knowledge and Data Engineering 15(5), 1170–1187 (2003)

    Article  Google Scholar 

  3. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithm. Plenum, New York (1981)

    Google Scholar 

  4. Krishnapuram, R., Keller, J.: A Possibilistic Approach to Clustering. IEEE Trans. on Fuzzy Systems 1(2), 98–110 (1993)

    Article  Google Scholar 

  5. Krishnapuram, R., Frigui, H., Nasraoui, O.: Fuzzy and Possibilistic Shell Clustering Algorithms and Their Application to Boundary Detection and Surface Approximation - Part I. IEEE Trans. on Fuzzy Systems 3(1), 29–43 (1995)

    Article  Google Scholar 

  6. Krishnapuram, R., Keller, J.: The Possibilistic C-means Algorithm: Insights and Recommendations. IEEE Trans. on Fuzzy Systems 4(3), 385–393 (1996)

    Article  Google Scholar 

  7. Zadeh, L.A.: Fuzzy Sets as a Basis for a Theory of Possibility. Fuzzy Sets and Systems 1, 3–28 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  8. Tanaka, H., Guo, P.: Possibilistic Data Analysis for Operations Research. Physica-Verlag, New York (1999)

    MATH  Google Scholar 

  9. Yager, R.R.: On the Instantiation of Possibility Distributions. Fuzzy Sets and Systems 128, 261–266 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  10. Sugihara, K., Tanaka, H.: Interval Evaluations in the Analytic Hierarchy Process by Possibility Analysis. Computational Intelligence 17(3), 567–579 (2001)

    Article  Google Scholar 

  11. Tanaka, H., Ishibuch, H.: Evidence Theory of Exponential Possibility Distributions. Int. J. Approximate Reasoning 8, 123–140 (1993)

    Article  MATH  Google Scholar 

  12. Rosenfeld, A., Kak, A.C.: Digital Picture Processing. Academic, New York (1982)

    Google Scholar 

  13. Scott, D.: Multivariate Density Estimation: Theory, practice and visualization. Wiley, New York (1992)

    Book  MATH  Google Scholar 

  14. Wang, H.-Q., Huang, D.S.: A Novel Clustering Analysis Based on PCA and SOMs or Gene _expression Patterns. In: Yin, F.-L., Wang, J., Guo, C. (eds.) ISNN 2004. LNCS, vol. 3174, pp. 476–481. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, S., Chung, Fl., Xu, M., Hu, D., Qing, L. (2005). Possibility Theoretic Clustering. In: Huang, DS., Zhang, XP., Huang, GB. (eds) Advances in Intelligent Computing. ICIC 2005. Lecture Notes in Computer Science, vol 3644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11538059_88

Download citation

  • DOI: https://doi.org/10.1007/11538059_88

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28226-6

  • Online ISBN: 978-3-540-31902-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Navigation