Theory of agglomerative hierarchical clustering / Sadaaki Miyamoto.
2022
QA278.55 .M59 2022
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Theory of agglomerative hierarchical clustering / Sadaaki Miyamoto.
ISBN
9789811904202 (electronic bk.)
9811904200 (electronic bk.)
9789811904219 (electronic bk.)
9811904219 (electronic bk.)
9789811904226 (electronic bk.)
9811904227 (electronic bk.)
9789811904196
9811904197
9811904200 (electronic bk.)
9789811904219 (electronic bk.)
9811904219 (electronic bk.)
9789811904226 (electronic bk.)
9811904227 (electronic bk.)
9789811904196
9811904197
Published
Singapore : Springer, [2022]
Copyright
©2022
Language
English
Description
1 online resource (viii, 109 pages) : illustrations (some color).
Item Number
10.1007/978-981-19-0420-2 doi
Call Number
QA278.55 .M59 2022
Dewey Decimal Classification
519.5/3
Summary
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.-- Provided by publisher.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed April 5, 2022).
Series
Behaviormetrics: quantitative approaches to human behavior ; volume 15. 2524-4035
Available in Other Form
Print version: 9789811904196
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
Introduction
Linkage Methods and Algorithms
Theory of the Single Linkage Method
Positive-Definite Kernels in Agglomerative Hierarchical Clustering
Some Other Topics in Agglomerative Hierarchical Clustering
Miscellanea.
Linkage Methods and Algorithms
Theory of the Single Linkage Method
Positive-Definite Kernels in Agglomerative Hierarchical Clustering
Some Other Topics in Agglomerative Hierarchical Clustering
Miscellanea.