Agglomerative clustering and collectiveness measure via exponent generating function

The key in agglomerative clustering is to define the affinity measure between two sets. A novel agglomerative clustering method is proposed by utilizing the path integral to define the affinity measure. Firstly, the path integral descriptor of an edge, a node and a set is computed by path integral and exponent generating function. Then, the affinity measure between two sets is obtained by path integral descriptor of sets. Several good properties of the path integral descriptor is proposed in this paper. In addition, we give the physical interpretation of the proposed path integral descriptor of a set. The proposed path integral descriptor of a set can be regard as the collectiveness measure of a set, which can be a moving system such as human crowd, sheep herd and so on. Self-driven particle (SDP) model is used to test the ability of the proposed method in measuring collectiveness.

[1]  H. Kleinert Path Integrals in Quantum Mechanics, Statistics, Polymer Physics, and Financial Markets , 2006 .

[2]  Robert Tibshirani,et al.  The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd Edition , 2001, Springer Series in Statistics.

[3]  Deli Zhao,et al.  Graph Degree Linkage: Agglomerative Clustering on a Directed Graph , 2012, ECCV.

[4]  Doug Beeferman,et al.  Agglomerative clustering of a search engine query log , 2000, KDD '00.

[5]  Nick Chater,et al.  Herding in humans , 2009, Trends in Cognitive Sciences.

[6]  Xiaogang Wang,et al.  Measuring Crowd Collectiveness , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[8]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[9]  G. L. Bon,et al.  Scientific Literature: The Crowd. A Study of the Popular Mind , 1897 .

[10]  R. Feynman Space-Time Approach to Non-Relativistic Quantum Mechanics , 1948 .

[11]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[12]  D. Ruppert The Elements of Statistical Learning: Data Mining, Inference, and Prediction , 2004 .

[13]  George H. Weiss,et al.  Book Review: Elements of the Random Walk: An Introduction for Advanced Students and Researchers , 2005 .

[14]  H. Swinney,et al.  Collective motion and density fluctuations in bacterial colonies , 2010, Proceedings of the National Academy of Sciences.

[15]  M. Liou A novel method of evaluating transient response , 1966 .

[16]  Deli Zhao,et al.  Cyclizing Clusters via Zeta Function of a Graph , 2008, NIPS.

[17]  S. S. Ravi,et al.  Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results , 2005, PKDD.

[18]  J. Gillon,et al.  Group dynamics , 1996 .

[19]  Deli Zhao,et al.  Agglomerative clustering via maximum incremental path integral , 2013, Pattern Recognit..

[20]  Joseph J. Hale,et al.  From Disorder to Order in Marching Locusts , 2006, Science.