Name
Abstract | ||
|---|---|---|
Concept hierarchies are important in many generalized data mining applications, such as multiple level association rule mining. In literature, concept hierarchy is usually given by domain experts. In this paper, we propose algorithms to automatically build a concept hierarchy from a provided distance matrix. Our approach is modifying the traditional hierarchical clustering algorithms. For the purpose of algorithm evaluation, a distance matrix is derived from the concept hierarchy built by our algorithm. Root mean squared error between the provided distant matrix and the derived distance matrix is used as evaluation criterion. We compare the traditional hierarchical clustering and our modified algorithm under three strategies of computing cluster distance, namely single link, average link, and complete link. Empirical results show that the traditional algorithm under complete link strategy performs better than the other strategies. Our modified algorithms perform almost the same under the three strategies, and our algorithms perform better than the traditional algorithms under various situations. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/3-540-32392-9_10 | INTELLIGENT INFORMATION PROCESSING AND WEB MINING, PROCEEDINGS |
Keywords | Field | DocType |
association rule mining,hierarchical clustering,root mean square error,distance matrix | Hierarchical clustering,k-medians clustering,Data mining,Computer science,Matrix (mathematics),Tree (data structure),Mean squared error,Association rule learning,Artificial intelligence,Distance matrix,Hierarchy,Machine learning | Conference |
ISSN | Citations | PageRank |
1615-3871 | 6 | 0.55 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huang-Cheng Kuo | 1 | 42 | 23.87 |
| Jen-Peng Huang | 2 | 57 | 6.45 |