Alternative axiomatic constructions for hierarchical clustering of asymmetric networks

The authors have introduced an axiomatic construction for hierarchical clustering of asymmetric - i.e. weighted and directed - networks. In such construction, nodes in a two-node network cluster together at the largest of the two dissimilarities. This paper introduces two alternative constructions requiring clustering at the smallest dissimilarity and being agnostic at whether the minimum or maximum is the proper choice. Within the first framework, unilateral clustering is defined and shown to be the unique method that satisfies the proposed axioms. Within the second framework, uniform bounds are established in the minimum and maximum resolution at which clusters are formed. Unilateral clustering is used to study internal migration in the United States.

[1]  Marc J. Perry,et al.  State-to-State Migration Flows: 1995 to 2000 , 2003 .

[2]  Santiago Segarra,et al.  Axiomatic construction of hierarchical clustering in asymmetric networks , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[3]  G. N. Lance,et al.  A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems , 1967, Comput. J..

[4]  Santiago Segarra,et al.  Hierarchical clustering methods and algorithms for asymmetric networks , 2013, 2013 Asilomar Conference on Signals, Systems and Computers.

[5]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[6]  Facundo Mémoli,et al.  Department of Mathematics , 1894 .

[7]  Facundo Mémoli,et al.  Classifying Clustering Schemes , 2010, Foundations of Computational Mathematics.

[8]  Jon M. Kleinberg,et al.  An Impossibility Theorem for Clustering , 2002, NIPS.

[9]  Marina Meila,et al.  Clustering by weighted cuts in directed graphs , 2007, SDM.

[10]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[11]  Shai Ben-David,et al.  Measures of Clustering Quality: A Working Set of Axioms for Clustering , 2008, NIPS.

[12]  Thomas Hofmann,et al.  Semi-supervised Learning on Directed Graphs , 2004, NIPS.

[13]  Marina Meila,et al.  Spectral Clustering of Biological Sequence Data , 2005, AAAI.