The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2013 vol.35)
pp: 1312-1327
Samuel Rota Bulò , Universita Ca Foscari di Venezia, Venezia Mestre
Marcello Pelillo , Universita Ca Foscari di Venezia, Venezia Mestre
ABSTRACT
Hypergraph clustering refers to the process of extracting maximally coherent groups from a set of objects using high-order (rather than pairwise) similarities. Traditional approaches to this problem are based on the idea of partitioning the input data into a predetermined number of classes, thereby obtaining the clusters as a by-product of the partitioning process. In this paper, we offer a radically different view of the problem. In contrast to the classical approach, we attempt to provide a meaningful formalization of the very notion of a cluster and we show that game theory offers an attractive and unexplored perspective that serves our purpose well. To this end, we formulate the hypergraph clustering problem in terms of a noncooperative multiplayer “clustering game,” and show that a natural notion of a cluster turns out to be equivalent to a classical (evolutionary) game-theoretic equilibrium concept. We prove that the problem of finding the equilibria of our clustering game is equivalent to locally optimizing a polynomial function over the standard simplex, and we provide a discrete-time high-order replicator dynamics to perform this optimization, based on the Baum-Eagon inequality. Experiments over synthetic as well as real-world data are presented which show the superiority of our approach over the state of the art.
INDEX TERMS
Sociology, Statistics, Game theory, Games, Standards, Clustering algorithms, Partitioning algorithms,high-order replicator dynamics, Hypergraph clustering, evolutionary game theory, polynomial optimization, Baum-Eagon inequality
CITATION
Samuel Rota Bulò, Marcello Pelillo, "A Game-Theoretic Approach to Hypergraph Clustering", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.35, no. 6, pp. 1312-1327, June 2013, doi:10.1109/TPAMI.2012.226
REFERENCES
[1] A.K. Jain, "Data Clustering: 50 Years Beyond K-Means," Pattern Recognition Letters, vol. 31, no. 8, pp. 651-666, 2010.
[2] S. Agarwal, J. Lim, L. Zelnik-Manor, P. Perona, D. Kriegman, and S. Belongie, "Beyond Pairwise Clustering," Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 838-845, 2005.
[3] V.M. Govindu, "A Tensor Decomposition for Geometric Grouping and Segmentation," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 1150-1157, 2005.
[4] A. Shashua, R. Zass, and T. Hazan, "Multi-Way Clustering Using Super-Symmetric Non-Negative Tensor Factorization," Proc. European Conf. Computer Vision, vol. 3954, pp. 595-608, 2006.
[5] Y. Huang, Q. Liu, F. Lv, Y. Gong, and D.N. Metaxas, "Unsupervised Image Categorization by Hypergraph Partition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 33, no. 6, pp. 1266-1273, June 2011.
[6] J.Y. Zien, M.D.F. Schlag, and P.K. Chan, "Multilevel Spectral Hypergraph Partitioning with Arbitrary Vertex Sizes," IEEE Trans. Computer-Aided Design of Integration Circuits and Systems, vol. 18, no. 9, pp. 1389-1399, Sept. 1999.
[7] M. Bolla, "Spectral, Euclidean Representations and Clusterings of Hypergraphs," Discrete Math., vol. 117, pp. 19-39, 1993.
[8] J. Rodrìguez, "On the Laplacian Spectrum and Walk-Regular Hypergraphs," Linear and Multilinear Algebra, vol. 51, pp. 285-297, 2003.
[9] D. Zhou, J. Huang, and B. Schölkopf, "Learning with Hypergraphs: Clustering, Classification, Embedding," Proc. Advances in Neural Information Processing Systems, vol. 19, pp. 1601-1608, 2006.
[10] J. Shi and J. Malik, "Normalized Cuts and Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[11] S. Agarwal, K. Branson, and S. Belongie, "Higher Order Learning with Graphs," Proc. Int'l Conf. Machine Learning, vol. 148, pp. 17-24, 2006.
[12] G. Karypis and V. Kumar, "Multilevel K-Way Hypergraph Partitioning," VLSI Design, vol. 11, no. 3, pp. 285-300, 2000.
[13] L. Herault and R. Horaud, "Figure-Ground Discrimination: A Combinatorial Optimization Approach," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9, pp. 899-914, Sept. 1993.
[14] A. Shashua and S. Ullman, "Structural Saliency: The Detection of Globally Salient Features Using a Locally Connected Network," Proc. IEEE Int'l Conf. Computer Vision, 1988.
[15] G. Gupta and J. Ghosh, "Robust One-Class Clustering Using Hybrid Global and Local Search," Proc. Int'l Conf. Machine Learning, 2005.
[16] K. Crammer, P.P. Talukdar, and F. Pereira, "A Rate-Distortion One-Class Model and Its Applications to Clustering," Proc. Int'l Conf. Machine Learning), 2008.
[17] N. Jardine and R. Sibson, "The Construction of Hierarchic and Non-Hierarchic Classifications," Computer J., vol. 11, pp. 177-184, 1968.
[18] A. Banerjee, C. Krumpelman, S. Basu, R.J. Mooney, and J. Ghosh, "Model-Based Overlapping Clustering," Proc. Int'l Conf. Knowledge Discovery and Data Mining, pp. 532-537, 2005.
[19] K. Heller and Z. Ghahramani, "A Nonparametric Bayesian Approach to Modeling Overlapping Clusters," Proc. Int'l Conf. AI and Statistics, 2007.
[20] M. Pavan and M. Pelillo, "Dominant Sets and Pairwise Clustering," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 1, pp. 167-172, Jan. 2007.
[21] A. Torsello, S. Rota Bulò, and M. Pelillo, "Grouping with Asymmetric Affinities: A Game-Theoretic Perspective," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 292-299, 2006.
[22] J.W. Weibull, Evolutionary Game Theory. Cambridge Univ. Press, 1995.
[23] J. Hofbauer and K. Sigmund, Evolutionary Games and Population Dynamics. Cambridge Univ. Press, 1998.
[24] S. Rota Bulò and M. Pelillo, "A Game-Theoretic Approach to Hypergraph Clustering," Proc. Advances in Neural Information Processing Systems, vol. 22, pp. 1571-1579, 2009.
[25] D. Fudenberg and J. Tirole, Game Theory. MIT Press, 1991.
[26] J. Maynard Smith, Evolution and the Theory of Games. Cambridge Univ. Press, 1982.
[27] M. Broom, C. Cannings, and G.T. Vickers, "Multi-Player Matrix Games," Bull. Math. Biology, vol. 59, no. 5, pp. 931-952, 1997.
[28] C. Berge, Hypergraphs: Combinatorics of Finite Sets. North-Holland, 1989.
[29] P. Frankl and V. Rödl, "Hypergraphs Do Not Jump," Combinatorica, vol. 4, pp. 149-159, 1984.
[30] K. Etessami and A. Lochbihler, "The Computational Complexity of Evolutionarily Stable Strategies," Int'l J. Game Theory, vol. 37, no. 1, pp. 93-113, 2007.
[31] N. Nisan, "A Note on the Computational Hardness of Evolutionary Stable Strategies," Electronic Colloquium on Computational Complexity, 2006.
[32] D.G. Luenberger, Linear and Nonlinear Programming. Addison Wesley, 1984.
[33] L.E. Baum and J.A. Eagon, "An Inequality with Applications to Statistical Estimation for Probabilistic Functions of Markov Processes and to a Model for Ecology," Bull. Am. Math. Soc., vol. 73, pp. 360-363, 1967.
[34] G.R. Blakley, "Homogeneous Nonnegative Symmetric Quadratic Transformations," Bull. Am. Math. Soc., vol. 70, pp. 712-715, 1964.
[35] L.E. Baum and G.R. Sell, "Growth Transformations for Functions on Manifolds," Pacific J. Math., vol. 27, pp. 221-227, 1968.
[36] D.G. Luenberger, Introduction to Dynamic Systems. Wiley, 1979.
[37] J.P. LaSalle, The Stability and Control of Discrete Processes. Springer-Verlag, 1986.
[38] L.E. Baum, T. Petrie, G. Soules, and N. Weiss, "A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains," Ann. Math. Statistics, vol. 41, pp. 164-171, 1970.
[39] M. Pelillo, "The Dynamics of Nonlinear Relaxation Labeling Processes," J. Math. Imaging and Vision, vol. 7, no. 4, pp. 309-323, 1997.
[40] P. Perona and W. Freeman, "A Factorization Approach to Grouping," Proc. European Conf. Computer Vision, pp. 655-670, 1998.
[41] S. Sarkar and K.L. Boyer, "Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors," Computer Vision and Image Understanding, vol. 71, no. 1, pp. 110-136, 1998.
[42] A. Torsello, S. Rota Bulò, and M. Pelillo, "Beyond Partitions: Allowing Overlapping Groups in Pairwise Clustering," Proc. Int'l Conf. Pattern Recognition, 2008.
[43] O.D. Faugeras and M. Berthod, "Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, no. 4, pp. 412-424, Apr. 1981.
[44] J.L. Mohammed, R.A. Hummel, and S.W. Zucker, "A Gradient Projection Algorithm for Relaxation Labeling Methods," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 3, pp. 330-332, May 1983.
[45] S. Rota Bulò, M. Pelillo, and I.M. Bomze, "Graph-Based Quadratic Optimization: A Fast Evolutionary Approach," Computer Vision and Image Understanding, vol. 115, pp. 984-995, 2011.
[46] M. Pelillo and A. Torsello, "Payoff-Monotonic Game Dynamics and the Maximum Clique Problem," Neural Computation, vol. 18, no. 5, pp. 1215-1258, 2006.
[47] T. Hu and K. Moerder, "Multiterminal Flows in Hypergraphs," Proc. VLSI Circuit Layout: Theory and Design, pp. 87-93, 1985.
[48] D. Gibson, J.M. Kleinberg, and P. Raghavan, "Clustering Categorical Data: An Approach Based on Dynamical Systems," Proc. 24th Int'l Conf. Very Large Data Bases, pp. 311-322, 1998.
[49] A. Albarelli, A. Torsello, S. Rota Bulò, and M. Pelillo, "Matching as a Non-Cooperative Game," Proc. IEEE Int'l Conf. Computer Vision, 2009.
[50] K.P. Horn, "Closed-Form Solution of Absolute Orientation Using Unit Quaternions," J. Optical Soc. of Am. A, vol. 4, pp. 629-642, 1987.
[51] P. Belhumeur and D. Kriegman, "What Is the Set of Images of an Object under All Possible Lighting Conditions," Int'l J. Computer Vision, vol. 28, no. 3, pp. 245-260, 1998.
[52] A.S. Georghiades, P.N. Belhumeur, and D.J. Kriegman, "From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 6, pp. 643-660, June 2001.
[53] K.C. Lee, J. Ho, and D. Kriegman, "Acquiring Linear Subspaces for Face Recognition under Variable Lighting," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 5, pp. 684-698, May 2005.
[54] H. Liu, L.J. Latecki, and S. Yan, "Robust Clustering as Ensembles of Affinity Relations," Proc. Advances in Neural Information Processing Systems, vol. 23, pp. 1414-1422, 2010.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool