Skip to main content

Efficiency of Complex Data Clustering

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2011)

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

Included in the following conference series:

Abstract

This work is focused on the matter of clustering complex data using the DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm and searching through such a structure. It presents related problems, focusing primarily on the aspect of choosing the initial parameters of the density based algorithm, as well as various ways of creating valid cluster representatives. What is more, the paper emphasizes the importance of the domain knowledge, as a factor which has a huge impact on the quality of the clustering. Carried out experiments allow to compare the efficiency of finding clusters relevant to the given question, depending on the way of how the cluster representatives were created.

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. Vipin, K., Michael, S., Pang-Ning, T.: Introduction to Data Mining. Addison-Wesley, USA (2006)

    Google Scholar 

  2. Agnieszka, N.-B., Tomasz, J., Tomasz, X.: Choice of the clustering algorithm and the efficiency of finding documents. Studia Informatica 31(2A(89)), 147–162 (2010) (in polish); Scientific Papers of Silesian Technical University

    Google Scholar 

  3. Martin, E., Kriegel, E., Hans-Peter, S., Jorg, S., Xiaowei, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd Conference on Knowledge Discovery, USA (1996)

    Google Scholar 

  4. Zhou, A., Zhou, S., Cao, J., Fan, Y., Hu, Y.: Approaches for scaling DBSCAN algorithm to large spatial databases. Journal of Computer Science and Technology 31(6), 509–526 (2000)

    Article  MATH  Google Scholar 

  5. Tomasz, X.: Clustering complex data. In: Wakulicz-Deja, A. (ed.) Decision Support Systems. Institute of Computer Science of the University of Silesia, Sosnowiec (2011) (in print) (in polish)

    Google Scholar 

  6. Rijsbergen, C.J.: Information retrieval. Butterworth-Heinemann, UK (1979)

    MATH  Google Scholar 

  7. Alicja, W.-D.: Basics of information retrieval systems. Analysis of methods. Academic Publishing House PLJ, Warsaw (1995) (in polish)

    Google Scholar 

  8. John, N.: Megatrends: Ten New Directions Transforming Our Lives. Grand Central Publishing, USA (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wakulicz-Deja, A., Nowak-Brzezińska, A., Xięski, T. (2011). Efficiency of Complex Data Clustering. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds) Rough Sets and Knowledge Technology. RSKT 2011. Lecture Notes in Computer Science(), vol 6954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24425-4_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24425-4_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24424-7

  • Online ISBN: 978-3-642-24425-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics