Efficiency of complex data clustering

  • Authors:
  • Alicja Wakulicz-Deja;Agnieszka Nowak-Brzeziñska;Tomasz Xięski

  • Affiliations:
  • University of Silesia, Institute of Computer Science, Sosnowiec, Poland;University of Silesia, Institute of Computer Science, Sosnowiec, Poland;University of Silesia, Institute of Computer Science, Sosnowiec, Poland

  • Venue:
  • RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.