Skip to main content

Hard and Fuzzy c-means Algorithms with Pairwise Constraints by Non-metric Terms

  • Conference paper
Modeling Decisions for Artificial Intelligence (MDAI 2014)

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

  • 669 Accesses

Abstract

Recently, semi-supervised clustering has been focused, e.g., Refs. [2–5]. The semi-supervised clustering algorithms improve clustering results by incorporating prior information with the unlabeled data. This paper proposes three new clustering algorithms with pairwise constraints by introducing non-metric term to objective functions of the well-known clustering algorithms. Moreover, its effectiveness is verified through some numerical examples.

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. Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Kluwer Academic Publishers, Norwell (1981)

    Google Scholar 

  2. Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained K-means Clustering with Background Knowledge. In: Proceedings of the 18th International Conference on Machine Learning, pp. 577–584 (2001)

    Google Scholar 

  3. Klein, D., Kamvar, D., Manning, C.: From Instance-level Constraints to Space-level Constraints: Making the Most of Prior Knowledge in Data Clustering. In: Proceedings of the 19th International Conference on Machine Learning, pp. 307–314 (2002)

    Google Scholar 

  4. Basu, S., Banerjee, A., Mooney, R.J.: Active Semi-Supervision for Pairwise Constrained Clustering. In: Proceedings of the SIAM International Conference on Data Mining, pp. 333–344 (2004)

    Google Scholar 

  5. Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-Supervised Graph Clustering: A Kernel Approach. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 457–464 (2005)

    Google Scholar 

  6. Roubens, M.: Pattern Classification Problems and Fuzzy Sets. Fuzzy Sets and Systems 1, 239–253 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. MacQueen, I.: Some Methods for Classification and Analysis of Multivariate Observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)

    Google Scholar 

  8. Miyamoto, S., Umayahara, K., Mukaidono, M.: Fuzzy Classification Functions in the Methods of Fuzzy c-means and Regularization by Entropy. Journal of Japan Society for Fuzzy Theory and Systems 10(3), 548–557 (1998) (in Japanese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Endo, Y., Kinoshita, N., Iwakura, K., Hamasuna, Y. (2014). Hard and Fuzzy c-means Algorithms with Pairwise Constraints by Non-metric Terms. In: Torra, V., Narukawa, Y., Endo, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2014. Lecture Notes in Computer Science(), vol 8825. Springer, Cham. https://doi.org/10.1007/978-3-319-12054-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12054-6_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12053-9

  • Online ISBN: 978-3-319-12054-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics