A master thesis from Aalborg University
k-divisive hierarchical clustering
Author(s)
Term
4. term
Education
Publication year
2003
Submitted on
2012-02-14
Abstract
In this master thesis, a novel divisive hierarchical clustering algorithm has been proposed. The algorithm is called the $k$-divisive hierarchical clustering algorithm. The aim of this algorithm is to overcome some of the disadvantages of the well-known divisive hierarchical clustering algorithms. The proposed algorithm builds the hierarchy by splitting a cluster into tow sub-clusters. The splitting process is performed by implementing the $k$-means algorithm, and the process of splitting a cluster is stopped by using two proposed stop criteria. The splitting process is halted so as to end up with a high quality dendogram. The algorithm together with the stop criteria are implemented and tested using artificial databases as well as real world databases.
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.