Power iterated color refinement

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2014, Pages 1904-1910

  Kersting, Kristian ^a   Mladenov, Martin ^a   Garnett, Roman ^b   Grohe, Martin ^c  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF BONN   (Germany)

^c RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84908181412     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Ahmadi, B.; Kersting, K.; Mladenov, M.; and Natarajan, S. 2013. Exploiting symmetries for scaling loopy belief propagation and relational training. Machine Learning Journal 92(1):91-132.
2. Berkholz, C.; Bonsma, P.; and Grohe, M. 2013. Tight lower and upper bounds for the complexity of canonical colour refinement. In 21st Annual European Symposium on Algorithms (ESA), 145-156.
3. Boldi, P.; Lonati, V.; and Vigna, M. S. S. 2006. Graph fibrations, graph isomorphism, and pagerank. Theoretical Informatics and Applications 40(2):227-253.
4. Dasgupta, A.; Hopcroft, J.; Kannan, R.; and Mitra, P. 2006. Spectral clustering by recursive partitioning. In 14th Annual European Symposium on Algorithms (ESA-2006), 256-267.
5. Godsil, C. 1997. Compact graphs and equitable partitions. Linear Algebra and its Applications 255:259-266.
6. Gori, M.; Maggini, M.; and Sarti, L. 2005. Exact and approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell. 27(7):1100-1111.
7. Grohe, M.; Kersting, K.; Mladenov, M.; and Selman, E. 2013. Dimension reduction via colour refinement. In arXiv: 1307.5697.
8. Jaggi, M. 2013. Revisiting frank-wolfe: Projection-free sparse convex optimization. In Proceedings of the 30th International Conference on Machine Learning (ICML); J MLR Proceedings vol. 28, 427-35.
9. Jonker, R., and Volgenant, A. 1987. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38:325-340.
10. Kannan, R.; Vempala, S.; and Vetta, A. 2004. On clusterings: Good, bad and spectral. J. ACM 51(3):497-515.
11. Katebi, H.; Sakallah, K.; and Markov, I. 2012. Graph symmetry detection and canonical labeling: Differences and synergies. In Voronkov, A., ed., Turing-100, volume 10 of EPiC Series, 181-195.
12. Kyrola, A.; Blelloch, G.; and Guestrin, C. 2012. Graphchi: Large-scale graph computation on just a pc. In USENIX Symposium on Operating Systems Design and Implementation (OSDI).
13. Lin, F., and Cohen, W. 2010. Power iteration clustering. In Proceedings of the 27th International Conference on Machine Learning (ICML), 655-662.
14. Mahoney, M.; Orecchia, L.; and Vishnoi, N. 2012. Local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J. Machine Learning Research 13:2339-2365.
15. Mladenov, M.; Ahmadi, B.; and Kersting, K. 2012. Lifted linear programming. In 15th Int. Conf. on Artificial Intelligence and Statistics (AISTATS 2012), 788-797. Volume 22 of JMLR: W&CP 22.
16. Quadrianto, N.; Smola, A.; Song, L.; and Tuytelaars, T. 2010. Kernelized sorting. IEEE Trans. Pattern Anal. Mach. Intell. 32(10):1809-1821.
17. Ramana, M.; Scheinerman, E.; and Ullman, D. 1994. Fractional isomorphism of graphs. Discrete Mathematics 132:247-265.
18. Shervashidze, N., and Borgwardt, K. 2009. Fast subtree kernels on graphs. In Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS), 1660-1668.
19. Shervashidze, N.; Schweitzer, P.; van Leeuwen, E.; Mehlhorn, K.; and Borgwardt, K. 2011. Weisfeiler-Lehman Graph Kernels. Journal of Machine Learning Research 12:2539-2561.
20. Shi, Q.; Petterson, J.; Dror, G.; Langford, J.; Smola, A.; and Vishwanathan, S. V. N. 2009. Hash kernels for structured data. Journal of Machine Learning Research 10:2615-2637.
21. Tinhofer, G. 1991. A note on compact graphs. Discrete Applied Mathematics 30:253-264.
22. Zaslavskiy, M.; Bach, F.; and Vert, J.-P. 2009. A path following algorithm for the graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 31(12):2227-2242.