Nothing Special   »   [go: up one dir, main page]

Skip to main content

General Rough Modeling of Cluster Analysis

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2021)

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

Included in the following conference series:

  • 535 Accesses

Abstract

In this research a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering information in any form to be realized in a situation (and therefore in a semantics). It is well-known that of the limited number of proofs in the theory of hard and soft clustering that are known to exist, most involve statistical assumptions. Many methods seem to work because they seem to work in specific empirical practice. A new general rough method of analyzing clusterings is invented, and this opens the subject to clearer conceptions and contamination-free theoretical proofs. Numeric ideas of validation are also proposed to be replaced by those based on general rough approximation. The essential approach is explained in brief and supported by an example.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.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
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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

Similar content being viewed by others

References

  1. Bouveyron, C., Celeux, G., Murphy, B., Raftery, A.: Model-Based Clustering and Classification for Data Science: With Applications in R. Cambridge University Press, Cambridge (2019)

    Google Scholar 

  2. Hennig, C., Meila, M., Murtagh, F., Rocci, R.: Handbook of Cluster Analysis, 1st edn. CRC Press, Boca Raton (2016). Edited Volume, Chapman and Hall

    Google Scholar 

  3. Haunsperger, D.: Aggregated statistical rankings are arbitrary. Soc. Choice Welf. 20, 261–272 (2003)

    Google Scholar 

  4. Djordjevic, R., Ikodinovic, N., Stojanovic, N.: A propositional metric logic with fixed finite ranges. Fundamenta Informaticae 174, 185–199 (2020)

    Google Scholar 

  5. Mani, A.: Comparative approaches to granularity in general rough sets. In: Bello, R., Miao, D., Falcon, R., Nakata, M., Rosete, A., Ciucci, D. (eds.) IJCRS 2020. LNCS (LNAI), vol. 12179, pp. 500–518. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-52705-1_37

  6. Mani, A.: Algebraic methods for granular rough sets. In: Mani, A., Cattaneo, G., Düntsch, I. (eds.) Algebraic Methods in General Rough Sets. Trends in Mathematics, pp. 157–335. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01162-8_3

  7. Burkhardt, H., Seibt, J., Imaguire, G., Gerogiorgakis, S., eds.: Handbook of Mereology. Philosophia Verlag, Munich (2017)

    Google Scholar 

  8. Gruszczyński, R., Varzi, A.: Mereology then and now. Log. Log. Philos. 24, 409–427 (2015)

    Google Scholar 

  9. Kim, M., Ramakrishna, R.S.: New indices for cluster validity assessment pattern. Pattern Recognit. Lett. 26, 2353–2363 (2005)

    Google Scholar 

  10. Düntsch, I., Gediga, G.: Rough set clustering. In: Hennig, C., Meila, M., Murtagh, F. (eds.) Handbook of Cluster Analysis. CRC Press, Boca Raton, pp. 575–594 (2016)

    Google Scholar 

  11. Peters, G.: Rough clustering utilizing the principle of indifference. Inf. Sci. 277, 358–374 (2014)

    Google Scholar 

  12. Mitra, S.: An evolutionary rough partitive clustering. Pattern Recognit. Lett. 25(12), 1439–1449 (2004)

    Google Scholar 

  13. Zhou, J., Pedrycz, W., Miao, D.: Shadowed Sets in the characterization of rough-fuzzy clustering. Pattern Recognit. 44(8), 1738–1749 (2011)

    Google Scholar 

  14. Concilio, A.D., Guadagni, C., Peters, J., Ramanna, S.: Descriptive proximities. properties and interplay between classical proximities and overlap. Math. Comput. Sci. 12(1), 91–106 (2018)

    Google Scholar 

  15. Mani, A.: Functional extensions of knowledge representation in general rough sets. In: Bello, R., Miao, D., Falcon, R., Nakata, M., Rosete, A., Ciucci, D. (eds.) IJCRS 2020. LNCS (LNAI), vol. 12179, pp. 19–34. Springer, Cham (2020)

    Google Scholar 

Download references

Acknowledgment

This research is supported by a Women Scientist grant of the Department of Science and Technology.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mani, A. (2021). General Rough Modeling of Cluster Analysis. In: Ramanna, S., Cornelis, C., Ciucci, D. (eds) Rough Sets. IJCRS 2021. Lecture Notes in Computer Science(), vol 12872. Springer, Cham. https://doi.org/10.1007/978-3-030-87334-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-87334-9_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-87333-2

  • Online ISBN: 978-3-030-87334-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics