TY  - GEN
N2  - This book discusses recent theoretical developments in agglomerative hierarchical clustering. The general understanding of agglomerative hierarchical clustering is that its theory was completed long ago and there is no room for further methodological studies, at least in its fundamental structure. This book has been planned counter to that view: it will show that there are possibilities for further theoretical studies and they will be not only for methodological interests but also for usefulness in real applications. When compared with traditional textbooks, the present book has several notable features. First, standard linkage methods and agglomerative procedure are described by a general algorithm in which dendrogram output is expressed by a recursive subprogram. That subprogram describes an abstract tree structure, which is used for a two-stage linkage method for a greater number of objects. A fundamental theorem for single linkage using a fuzzy graph is proved, which uncovers several theoretical features of single linkage. Other theoretical properties such as dendrogram reversals are discussed. New methods using positive-definite kernels are considered, and some properties of the Ward method using kernels are studied. Overall, theoretical features are discussed, but the results are useful as well for application-oriented users of agglomerative clustering.--
DO  - 10.1007/978-981-19-0420-2
DO  - doi
AB  - This book discusses recent theoretical developments in agglomerative hierarchical clustering. The general understanding of agglomerative hierarchical clustering is that its theory was completed long ago and there is no room for further methodological studies, at least in its fundamental structure. This book has been planned counter to that view: it will show that there are possibilities for further theoretical studies and they will be not only for methodological interests but also for usefulness in real applications. When compared with traditional textbooks, the present book has several notable features. First, standard linkage methods and agglomerative procedure are described by a general algorithm in which dendrogram output is expressed by a recursive subprogram. That subprogram describes an abstract tree structure, which is used for a two-stage linkage method for a greater number of objects. A fundamental theorem for single linkage using a fuzzy graph is proved, which uncovers several theoretical features of single linkage. Other theoretical properties such as dendrogram reversals are discussed. New methods using positive-definite kernels are considered, and some properties of the Ward method using kernels are studied. Overall, theoretical features are discussed, but the results are useful as well for application-oriented users of agglomerative clustering.--
T1  - Theory of agglomerative hierarchical clustering /
AU  - Miyamoto, Sadaaki,
VL  - volume 15
CN  - QA278.55
ID  - 1445500
KW  - Hierarchical clustering (Cluster analysis)
KW  - Statistics.
KW  - Operations research.
KW  - Business information services.
KW  - Recherche opérationnelle.
KW  - Affaires
SN  - 9789811904202
SN  - 9811904200
SN  - 9789811904219
SN  - 9811904219
SN  - 9789811904226
SN  - 9811904227
TI  - Theory of agglomerative hierarchical clustering /
LK  - https://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-981-19-0420-2
UR  - https://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-981-19-0420-2
ER  -