Skip to main content

A New Possibilistic Clustering Method: The Possibilistic K-Modes

  • Conference paper
AI*IA 2011: Artificial Intelligence Around Man and Beyond (AI*IA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6934))

Included in the following conference series:

Abstract

This paper investigates the problem of clustering data pervaded by uncertainty. Dealing with uncertainty, in particular, using clustering methods can be of great interest since it helps to make a better decision. In this paper, we combine the k-modes method within the possibility theory in order to obtain a new clustering approach for uncertain categorical data; more precisely we develop the so-called possibilistic k-modes method (PKM) allowing to deal with uncertain attribute values of objects where uncertainty is presented through possibility distributions. Experimental results show good performance on well-known benchmarks.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping 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.

References

  1. Dubois, D., Prade, H.: Possibility theory: An approach to computerized processing of uncertainty. Plenium Press, New York (1988)

    Book  MATH  Google Scholar 

  2. Dubois, D., Prade, H.: Possibility theory and data fusion in poorly informed environments. Control Engineering Practice 25, 811–823 (1994)

    Article  Google Scholar 

  3. Dubois, D., Prade, H.: Possibility theory: Qualitative and quantitative aspects. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. I, pp. 169–226. Kluwer Academic Publishers, Netherlands (1998)

    Google Scholar 

  4. Haghighi, M.S., Yazdi, H.S., Vahedian, A.: A hierarchical possibilistic clustering. International Journal of Computer Theory and Engineering 1, 465–472 (2009)

    Article  Google Scholar 

  5. Higashi, M., Klir, G.J.: On the notion of distance representing information closeness: Possibility and probability distributions. International Journal of General Systems 9, 103–115 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  6. Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining Knowl. Discov. 2(2), 283–304 (1998)

    Article  Google Scholar 

  7. Huang, Z., Ng, M.K.: A note on k-modes clustering. Journal of Classification 20(2), 257–261 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jenhani, I., Ben Amor, N., Elouedi, Z., Benferhat, S., Mellouli, K.: Information Affinity: a new similarity measure for possibilistic uncertain information. In: Mellouli, K. (ed.) ECSQARU 2007. LNCS (LNAI), vol. 4724, pp. 840–852. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Jenhani, I., Benferhat, S., Elouedi, Z.: Properties Analysis of Inconsistency-based Possibilistic Similarity Measures. In: Proceedings of IPMU 2008, pp. 173–180 (2008)

    Google Scholar 

  10. Jenhani, I., Benferhat, S., Elouedi, Z.: Possibilistic similarity measures. STUDFUZZ 249, 99–123 (2010)

    MATH  Google Scholar 

  11. Krishnapuram, R., Keller, J.M.: A possibilistic approach to clustering. IEEE Trans. Fuzzy Syst. 1, 98–110 (1993)

    Article  Google Scholar 

  12. Murphy, M.P., Aha, D.W.: Uci repository databases (1996), http://www.ics.uci.edu/mlearn

  13. Sanguesa, R., Cabos, J., Cortes, U.: Possibilistic conditional independence: A similarity based measure and its application to causal network learning. International Journal of Approximate Reasoning, 145–167 (1997)

    Google Scholar 

  14. Yang, M.S., Wu, K.L.: Unsupervised possibilistic clustering. Pattern Recognition 39, 5–21 (2006)

    Article  Google Scholar 

  15. Zadeh, L.A.: Fuzzy sets. Inform. And Control 8, 338–353 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  16. Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1, 3–28 (1978)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ammar, A., Elouedi, Z. (2011). A New Possibilistic Clustering Method: The Possibilistic K-Modes. In: Pirrone, R., Sorbello, F. (eds) AI*IA 2011: Artificial Intelligence Around Man and Beyond. AI*IA 2011. Lecture Notes in Computer Science(), vol 6934. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23954-0_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23954-0_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23953-3

  • Online ISBN: 978-3-642-23954-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics