In the paper, new modified agglomerative algorithms for hierarchical clustering are suggested. The clustering process is targeted to generating a cluster hierarchy which can contain the same items in different clusters. The algorithms are based on the following additional operations: (i) building an ordinal item pair proximity ('distance') including the usage of multicriteria approaches; (ii) integration of several item pair at each stage of the algorithms; and (iii) inclusion of the same items into different integrated item pairs/clusters. The suggested modifications above are significant from the viewpoints of practice, e.g., design of systems architecture for engineering and computer systems. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Levin, M. S. (2007). Towards hierarchical clustering (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4649 LNCS, pp. 205–215). Springer Verlag. https://doi.org/10.1007/978-3-540-74510-5_22
Mendeley helps you to discover research relevant for your work.