Building a Concept Hierarchy by Hierarchical Clustering with Join/Merge Decision
Huang-Cheng Kuo 0, Tsung-Han Tsai, Huang Jen-Peng
0Department of CSIE, National Chiayi University
Available Online October 2006.
- https://doi.org/10.2991/jcis.2006.142How to use a DOI?
- Concept Hierarchy, Data Mining, Hierarchical Clustering
- Concept hierarchies are important for generalization in many data mining applications. We propose a method to automatically build a concept hierarchy from a provided distance matrix. The method is a modification of traditional agglomerative hierarchical clustering algorithm. When two closest clusters are selected for combining into a new cluster, the algorithm either creates a new cluster with the two original clusters as its sub-clusters, or let a cluster join the other without creating a new cluster at the higher level of the hierarchy. For the purpose of algorithm evaluation, a distance matrix is derived from the concept hierarchy built by algorithm. Root mean squared error between the provided distant matrix and the derived distance matrix is used as evaluation criterion. Empirical results show that the traditional algorithm under complete link strategy performs better than the other strategies, our algorithms perform almost the same under the three strategies, and our algorithms perform better than the traditional algorithms under various situations.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Huang-Cheng Kuo AU - Tsung-Han Tsai AU - Huang Jen-Peng PY - 2006/10 DA - 2006/10 TI - Building a Concept Hierarchy by Hierarchical Clustering with Join/Merge Decision BT - 9th Joint International Conference on Information Sciences (JCIS-06) PB - Atlantis Press SN - 1951-6851 UR - https://doi.org/10.2991/jcis.2006.142 DO - https://doi.org/10.2991/jcis.2006.142 ID - Kuo2006/10 ER -