A game-theoretic approach to partial clique enumeration

Image and Vision Computing

Volumn 27, Issue 7, 2009, Pages 911-922

  Rota Bulò, Samuel ^a   Torsello, Andrea ^a   Pelillo, Marcello ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Evolutionary game theory; Evolutionary stable strategy; Maximal clique enumeration; Maximum clique problem

Indexed keywords

BENCHMARKING; COMPUTER VISION; PROBLEM SOLVING;

EVOLUTIONARY GAME THEORY; EVOLUTIONARY STABLE STRATEGY; GRAPH REPRESENTATIONS; GRAPH-BASED REPRESENTATIONS; MAXIMAL CLIQUE ENUMERATION; MAXIMUM CLIQUE PROBLEM; STATE-OF-THE-ART ALGORITHMS;

GAME THEORY;

EID: 64849104947     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.imavis.2008.10.003     Document Type: Article

References (53)

1. A.P. Ambler, H.G. Barrow, C.M. Brown, R.M. Burstall, R.J. Popplestone. A versatile computer-controlled assembly, in: Proc. Third Int. J. Conf. Artif. Intell., Standford, CA, 1982, pp. 298-307.
2. Augustson J.G., and Minker J. An analysis of some graph theoretical cluster techniques. J. ACM 17 4 (1970) 571-588
3. Barrow H.G., and Burstall R.M. Subgraph isomorphism, matching relational structures, and maximal cliques. Inform. Process. Lett. 4 4 (1976) 83-84
4. Baum L.E., and Eagon J.A. An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Amer. Math. Soc. 73 (1967) 360-363
5. Baum L.E., and Sell G.R. Growth transformations for functions on manifolds. Pacific J. Math. 27 (1968) 211-227
6. Bertoni A., Campadelli P., and Grossi G. A neural algorithm for the maximum clique problem: analysis, experiments and circuit implementation. Algorithmica 331 (2002) 71-88
7. Bolles R.C., and Cain R.A. Recognizing and locating partially visible objects: the local-feature-focus method. Int. J. Robot. Res. 1 3 (1982) 57-82
8. Bomze I. Evolution towards the maximum clique. J. Global Optimiz. 10 2 (1997) 143-164
9. Bomze I., Budinich M., Pardalos P.M., and Pelillo M. The maximum clique problem. Handbook Combinat. Optimiz. A Suppl. (1999) 1-74
10. Bomze I., Pelillo M., and Giacomini R. Evolutionary approach to the maximum clique problem: empirical evidence on a larger scale. Dev. Global Optimiz. (1997) 95-108
11. Bomze I.M., Pelillo M., and Stix V. Approximating the maximum weight clique using replicator dynamics. IEEE Trans. Neural Networks 11 6 (2000) 1228-1241
12. Bomze I., Budunich M., Pelillo M., and Rossi C. Annealed replication: a new heuristic for the maximum clique problem. Discrete Appl. Math. 121 (2002) 27-49
13. Bonner R.E. On some clustering techniques. IBM J. Res. Dev. 8 (1964) 22-32
14. Brockington M., and Culberson J.C. Camouflaging independent sets in quasi-random graphs. In: Johnson D., and Trick M. (Eds). Cliques Coloring and Satisfiability: Second DIMACS Implementation Challenge (1996), American Mathematical Society 75-88
15. Bron C., and Kerbosch J. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16 (1973) 575-577
16. Busygin S. A new trust region technique for the maximum weight clique problem. Discrete Appl. Math. 154 15 (2006) 2080-2096
17. Chin R.T., and Dyer C.R. Model-based recognition in robot vision. Comput. Surv. 18 1 (1986) 67-108
18. D. Dmitry, R. Ari. Efficient unsupervised discovery of word categories using symmetric patterns and high frequency words, in: Proc. of the 21st Int. Conf. on Computational Linguistics and 44th Annual Meeting of the ACL, Association for Computational Linguistics, 2006, pp. 297-304.
19. Funabiki N., Takefuji Y., and Lee K.C. A neural network model for finding a near-maximum clique. J. Parallel Distrib. Comput. 14 (1992) 340-344
20. Gibbons L.E., Hearn D.W., Pardalos P.M., and Ramana M.V. Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22 (1997) 754-768
21. J. Hammersley, P. Clifford, Markov fields on finite graphs and lattices, unpublished manuscript, 1971.
22. Harary F., and Ross I.C. A procedure for clique detection using the group matrix. Sociometry 20 3 (1957) 205-215
23. 1 - ε, in: Proc. 37th Ann. Symp. Found. Comput. Sci., 1996, pp. 627-636.
24. Hofbauer J., and Sigmund K. The Theory of Evolution and Dynamical Systems (1988), Cambridge University Press, Cambridge, UK
25. Horaud R., and Skordas T. Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Pattern Anal. Mach. Intell. 11 11 (1989) 1168-1180
26. Jagota A. Approximating maximum clique with a Hopfield neural network. IEEE Trans. Neural Networks 6 (1995) 724-735
27. A. Jagota, L. Sanchis, R. Ganesan, Approximately solving maximum clique using neural networks and related heuristics, in: D. Johnson and M. Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, 1996, pp. 169-204.
28. Jain A.K., and Dubes R.C. Algorithms for Clustering Data (1988), Prentice-Hall, Englewood Cliffs, NJ
29. Johnson D.S., Yannakakis M., and Papadimitriou C.H. On generating all maximal independent sets. Inform. Proc. Lett. 27 (1988) 119-123
30. Kimia B.B., Tannenbaum A., and Zucker S.W. Shape, shocks, and deformations: the components of two-dimensional shape and the reaction-diffusion space. Int. J. Comp. Vis. 15 (1995) 189-224
31. Kopf R., and Ruhe G. A computational study of the weighted independent set problem for general graphs. Found. Control Eng. 12 (1987) 167-180
32. Luenberger D.G. Linear and Nonlinear Programming (1984), Addison Wesley, Reading, MA
33. Motzkin T.S., and Straus E.G. Maxima for graphs and a new proof of a theorem of Turán. Can. J. Math. 17 (1965) 533-540
34. Nina M., Dana R., and Ram S. A new conceptual clustering framework. Mach. Learn. 56 (2004) 115-151
35. Ogawa H. Labeled point pattern matching by Delaunay triangulation and maximal cliques. Pattern Recogn. 19 1 (1986) 35-40
36. Y. Okubo, M. Haraguchi. Creating abstract concepts for classification by finding top-N maximal weighted cliques, in: Proc. Discovery Science, vol. 2843, 2003, pp. 418-425.
37. Pavan M., and Pelillo M. Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Mach. Intell. 29 1 (2007) 167-172
38. Pekergin F., Morgül O., and Güzelis C. A saturated linear dynamical network for approximating maximum clique. IEEE Trans. Circuits Syst. 46 6 (1999) 667-685
39. Pelillo M. Relaxation labeling networks for the maximum clique problem. J. Artif. Neural Networks 2 4 (1995) 313-328
40. Pelillo M. Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11 8 (1999) 2023-2045
41. Pelillo M., and Jagota A. Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Networks 2 (1995) 411-420
42. Pelillo M., and Torsello A. Payoff-monotonic game dynamics and the maximum clique problem. Neural Comput. 18 5 (2006) 1215-1258
43. Pelillo M., Siddiqi K., and Zucker S.W. Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Mach. Intell. 21 11 (1999) 1105-1120
44. Radig B. Image sequence analysis using relational structures. Pattern Recogn. 17 1 (1984) 161-167
45. Shi X., Liang L., Wan Y., and Xu J. A finding maximal clique algorithm for predicting loop of protein structure. Appl. Math. Comput. 180 2 (2006) 676-682
46. Siddiqi K., Shokoufandeh A., Dickinson S., and Zucker S. Shock graphs and shape matching. Int. J. Comp. Vis. 35 (1999) 13-32
47. Suetens P., Fua P., and Hanson A.J. Computational strategies for object recognition. Comput. Surv. 24 1 (1992) 5-61
48. Taylor P., and Jonker L. Evolutionary stable strategies and game dynamics. Math. Biosci. 40 (1978) 145-156
49. Torsello A., and Hancock E.R. Computing approximate tree edit distance using relaxation labeling. Pattern Recogn. Lett. 24 (2003) 1089-1097
50. A. Torsello, S. Rota Bulò, M. Pelillo, Grouping with asymmetric affinities: a game-theoretic perspective, in: Proc. of the 2006 IEEE Comp. Soc. Conf. on Computer Vision and Pattern Recognition, 2006, pp. 292-299.
51. E. Tomita, A. Tanaka, H. Takahashi, The Worst-case Time Complexity for Finding all the Cliques. Technical Report UEC-TR-C5, 1988.
52. Wang R.L., Tang Z., and Cao Q.P. An efficient approximation algorithm for finding a maximum clique using Hopfield network learning. Neural Comput. 15 (2003) 1605-1619
53. Weibull J.W. Evolutionary Game Theory (1995), MIT Press, Cambridge, MA