Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A Note on Objective-Based Rough Clustering with Fuzzy-Set Representation

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

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

  • 672 Accesses

Abstract

Clustering is a method of data analysis. Rough k-means (RKM) by Lingras et al. is one of rough clustering algorithms [3]. The method does not have a clear indicator to determine the most appropriate result because it is not based on objective function. Therefore we proposed a rough clustering algorithm based on optimization of an objective function [7]. This paper will propose a new rough clustering algorithm based on optimization of an objective function with fuzzy-set representation to obtain better lower approximation, and estimate the effectiveness 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.

Similar content being viewed by others

References

  1. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11(5), 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Lingras, P., Yao, Y.: Data Mining Using Extensions of Rough Set Model. Journal of the American Society for Information Science, 415–422 (1998)

    Google Scholar 

  3. Lingras, P., Peters, G.: Rough clustering. WIREs Data Mining and Knowledge Discovery 1(1), 64–72 (2011)

    Article  Google Scholar 

  4. Hirano, S., Tsumoto, S.: An Indiscernibility-Based Clustering Method with Iterative Refinement of Equivalence Relations. Journal of Advanced Computational Intelligence and Intelligent Informatics 7(2), 169–177 (2003)

    Google Scholar 

  5. Lingras, P., West, C.: Interval Set Clustering of Web Users with Rough K-Means. Journal of Information Systems, 5–16 (2004)

    Google Scholar 

  6. Peters, G.: Some refinements of rough k-means clustering. Pattern Recognition 39, 1481–1491 (2006)

    Article  MATH  Google Scholar 

  7. Endo, Y., Kinoshita, N.: On Objective-Based Rough c-Means Clustering. In: Proc. of the 2012 IEEE International Conference on Granular Computing (2012)

    Google Scholar 

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

    Book  MATH  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

Onishi, K., Kinoshita, N., Endo, Y. (2014). A Note on Objective-Based Rough Clustering with Fuzzy-Set Representation. 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_11

Download citation

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

  • 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