Anytime Hierarchical Clustering

Loading...
Thumbnail Image
Penn collection
Technical Reports (ESE)
Kod*lab
Degree type
Discipline
Subject
Kodlab
Electrical and Computer Engineering
Engineering
Systems Engineering
Funder
Grant number
License
Copyright date
Distributor
Related resources
Contributor
Abstract

We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of nested partitions that satisfies a natural homogeneity requirement. Each recursive step re-edits the tree so as to improve a local measure of cluster homogeneity that is compatible with a number of commonly used (e.g., single, average, complete) linkage functions. As an alternative to the standard batch algorithms, we present numerical evidence to suggest that appropriate adaptations of this method can yield decentralized, scalable algorithms suitable for distributed/parallel computation of clustering hierarchies and online tracking of clustering trees applicable to large, dynamically changing databases and anomaly detection.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2014-04-13
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
For more information: Kod*Lab (http://kodlab.seas.upenn.edu/Omur/AHCTechReport2014)
Recommended citation
@TECHREPORT{Arslan_Kod_AHC_TechReport2014, author = {Arslan, O. and Koditschek, D. E.}, title = {Anytime Hierarchical Clustering}, institution = {University Of Pennsylvania}, year = {2014} }
Collection