A Parameterless Method for Efficiently Discovering Clusters of Arbitrary Shape in Large Datasets
- Andrew Foss, University of Alberta
- Osmar R. Zaiane, University of Alberta (Database)
Clustering is the problem of grouping data based on similarity and consists of maximizing the intra-group similarity while minimizing the inter-group similarity. The problem Of clustering data sets is also known as unsupervised classification, since no class labels are given. However, all existing clustering algorithms require some parameters to steer the clustering process, such as the famous k for the number of expected clusters, which constitutes a supervision of a sort. We present in this paper a new, efficient, fast and scalable clustering algorithm that clusters over a range of resolutions and finds a potential optimum clustering without requiring any parameter input. Our experiments show that our algorithm outperforms most existing clustering algorithms in quality and speed for large data sets.
Citation
A. Foss, O. Zaiane. "A Parameterless Method for Efficiently Discovering Clusters of Arbitrary Shape in Large Datasets". IEEE International Conference on Data Mining (ICDM), pp 179-186, December 2002.| Keywords: | |
| Category: | In Conference |
| Web Links: | IEEE |
BibTeX
@incollection{Foss+Zaiane:ICDM02,
author = {Andrew Foss and Osmar R. Zaiane},
title = {A Parameterless Method for Efficiently Discovering Clusters of
Arbitrary Shape in Large Datasets},
Pages = {179-186},
booktitle = {IEEE International Conference on Data Mining (ICDM)},
year = 2002,
}Last Updated: February 03, 2020Submitted by Sabina P
