Skip to main content

Evaluation of Subspace Clustering Quality

  • Conference paper
Book cover Hybrid Artificial Intelligence Systems (HAIS 2008)

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

Included in the following conference series:

  • 1613 Accesses

Abstract

Subspace clustering methods seek to find clusters in different subspaces within a data set instead of searching them in full feature space. In such a case there is a problem how to evaluate the quality of the clustering results. In this paper we present our method of the subspace clustering quality estimation which is based on adaptation of Davies-Bouldin Index to subspace clustering. The assumptions which were made to build the metrics are presented first. Then the proposed metrics is formally described. Next it is verified in an experimental way with the use of our clustering method IBUSCA. The experiments have shown that its value reflects a quality of subspace clustering thus it can be an alternative in the case where there is no expert’s evaluation.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.00
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. Bouveyron, C., Girard, S., Shmid, C.: High-dimensional data clustering. Computational Statistic and Data Analysis 52(1), 502–519 (2007)

    Article  MATH  Google Scholar 

  2. Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Analysis and Machine Intelligence 1, 224–227 (1979)

    Article  Google Scholar 

  3. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226–231 (1996)

    Google Scholar 

  4. Glomba, M., Markowska-Kaczmar, U.: IBUSCA: A Grid-based Bottom-up Subspace Clustering Algorithm. In: Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006). IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  5. Han, J., Kember, M.: Data Mining: Concept and Techniques. In: Cluster Analysis, pp. 335–393. Morgan Kaufman Publishers/ Academic Press (2001)

    Google Scholar 

  6. Newman, S., Hettich, D., Blake, C., Merz, C.: Uci repository of machine learning databases, http://www.ics.uci.edu/mlearn/MLRepository.html

  7. Parsons, L., Haque, E., Liu, H.: Subspace clustering for high dimensional data: a review. SIGKDD Explor. Newsl. 6(1), 90–105 (2004)

    Article  Google Scholar 

  8. Patrikainen, A., Meila, M.: Comparing subspace clusterings. IEEE Transactions on Knowledge and Data Engineering 18(7), 902–916 (2006)

    Article  Google Scholar 

  9. Wand, M.P.: Data-based choice of histogram bin width. The American Statistician 51(1), 59–64 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Markowska-Kaczmar, U., Hurej, A. (2008). Evaluation of Subspace Clustering Quality. In: Corchado, E., Abraham, A., Pedrycz, W. (eds) Hybrid Artificial Intelligence Systems. HAIS 2008. Lecture Notes in Computer Science(), vol 5271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87656-4_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87656-4_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87655-7

  • Online ISBN: 978-3-540-87656-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics