Skip to main content
SpringerLink
Log in

Clustering the Linearly Inseparable Clusters

  • Conference paper
  • First Online:
Proceedings of the European Computing Conference

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 28))

  • 576 Accesses

Abstract

In this paper a new method for clustering is introduced that works fine for linearly inseparable clusters. This algorithm uses the of patterns’ concentration specification. We consider each pattern as a heat source to determine concentration by heat effect. Because of high concentration in clusters, heat in the clusters is higher than out of them, and this fact is used to determine and bound the clusters. CLIC algorithm can be implemented for any linearly inseparable cluster. The classification rate of this algorithm is higher than previously known methods (k-means, fuzzy c-means, etc). Finally, we cluster real iris data by using CLIC algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Osipova N (2004). Classification and clustering methods development and implementation for unstructured documents collections. Department of Programming Technology, Faculty of Applied Mathematics and Control Processes, St. Petersburg State University

    Google Scholar 

  2. Rose K (1998) Deterministic annealing for clustering, compression, classification, regression, and related optimization problems

    Google Scholar 

  3. Wallace M, Kollias S (2004) Robust, generalized, quick and efficient agglomerative clustering

    Google Scholar 

  4. Wolkenhauer Olaf Fuzzy classification, the iris-and-admission data sets

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Biomedical Engineering, Amirkabir University, Iran

    Hamid Reza Shahdoosti & Omid Khayat

Authors
  1. Hamid Reza Shahdoosti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Omid Khayat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Military Institutes of University, Hellenic Naval Academy, Leoforos Chatzikyriakou, Piraeus, 185 39, Greece

    Nikos Mastorakis

  2. Dept. Theoretical Electrical, Technical University of Sofia, Kl. Ohridski St. 8, Sofia, 1000, Bulgaria

    Valeri Mladenov

  3. Roumelis 6, Vrilissia, 152 35, Greece

    Vassiliki T. Kontargyri

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this paper

Cite this paper

Shahdoosti, H.R., Khayat, O. (2009). Clustering the Linearly Inseparable Clusters. In: Mastorakis, N., Mladenov, V., Kontargyri, V. (eds) Proceedings of the European Computing Conference. Lecture Notes in Electrical Engineering, vol 28. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-85437-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-85437-3_17

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-84818-1

  • Online ISBN: 978-0-387-85437-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation