Abstract
dc:descriptionWhile data clustering has a long history and a large amount of research has been devoted to the development of numerous clustering techniques, significant challenges still remain. One of the most important of them is associated with high data dimensionality. A particular class of clustering algorithms has been very successful in dealing with such datasets, utilizing information driven by dimensionality reduction techniques. Projection methods for dimension reduction have enabled the discovery of otherwise unattainable structure in ultra high dimensional data. In this thesis, we try to deepen our understanding on what can be achieved by this kind of approaches in an attempt to theoretically discover the relationship between true clusters in the data and the distribution of their projection. Based on such findings, we propose a series of new hierarchical divisive clustering algorithms. The proposed algorithms require minimal user-defined parameters and have the desirable feature of being able to provide approximations for the number of clusters present in the data. The experimental results indicate that the proposed techniques are effective in simulated data scenarios and as well in real world problems that are affected by high dimensionality.
Degree
thesis:*- Grantor dc:publisher
- University of Thessaly (UTH)
- Year dc:date
- 2013
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Tasouils, Sotirios
- Τασουλής, Σωτήριος
Subjects
dc:subject × 18- Εξόρυξη δεδομένων
- Ομαδοποίηση
- Ιεραρχικοί αλγόριθμοι
- Ανάλυση πρωτευουσών συνιστωσών
- Τυχαίες προβολές
- Εκτίμηση πυκνότητας πυρήνα
- Data mining
- Clustering
- Hierarchical algorithms
- Principal component analysis
- Random projection
- Kernel density estimation
- Φυσικές Επιστήμες
- Μαθηματικά
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Natural Sciences
- Mathematics
- Computer and Information Sciences
Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/29920