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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
U. M. Fayyad, K. B. Irani, “Multi-interval Discretization of Continuous-Valued Attributes for Classification Learning,” In Proceedings of the thirteenth International Joint Conference on Artificial Intelligence, 1993, pp. 1002–1027.
V. Ganti, J. Gehrke, and R. Ramakrishnan, “CACTUS-Clustering Categorical Data Using Summaries,” ACM KDD, 1999, pp. 73–83.
J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann Pub., 2001.
J. Han and Y. Fu, “Dynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Databases,” Workshop on Knowledge Discovery in Databases, 1994, pp. 157–168.
J. Han and Y. Fu, “Discovery of Multiple-Level Association Rules from Large Databases,” VLDB Conference, 1995, pp. 420–431.
A. K. Jain, R. C. Dubes, Algorithms for Clustering Data, Prentice-Hall, Inc., 1988.
Huang-Cheng Kuo, Yi-Sen Lin, Jen-Peng Huang, “Distance Preserving Mapping from Categories to Numbers for Indexing,” International Conference on Knowledge-Based Intelligent Information Engineering Systems, Lecture Notes in Artificial Intelligence, Vol. 3214, 2004, pp. 1245–1251.
R. Srikant and R. Agrawal, “Mining Generalized Association Rules,” VLDB Conference, 1995, pp. 407–419.
R. Sibson, “SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method,” Computer Journal, Vol. 16, No. 1, 1972, pp. 30–34.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuo, HC., Huang, JP. (2005). Building a Concept Hierarchy from a Distance Matrix. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32392-9_10
Download citation
DOI: https://doi.org/10.1007/3-540-32392-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25056-2
Online ISBN: 978-3-540-32392-1
eBook Packages: EngineeringEngineering (R0)