A measure of similarity between graph vertices: Applications to synonym extraction and web searching

SIAM Review

Volumn 46, Issue 4, 2004, Pages 647-666

  Blondel, Vincent D ^a   Gajardo, Anahí ^b   Heymans, Maureen ^c   Senellart, Pierre ^d   Van Dooren, Paul ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b UNIVERSITY OF CONCEPCIÓN   (Chile)

^c GOOGLE INC   (United States)

^d ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Algorithms; Eigenvalues of graphs; Graph algorithms; Graph theory

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATRIX ALGEBRA; SEARCH ENGINES; WEBSITES;

EIGENVALUES-OF-GRAPHS; GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 11344278195     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144502415960     Document Type: Article

References (21)

1. WordNet 1.6, http://www.cogsci.princeton.edu/~wn/, 1998.
2. The Online Plain Text English Dictionary, http:/ /msowww.anu.edu.au/~ralph/OPTED/, 2000.
3. A. Berman and R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Classics Appl. Math. 9, SIAM, Philadelphia, 1994.
4. N. Biggs, Algebraic Graph Theory, 2nd ed., Cambridge Mathematical Library, Cambridge University Press, Cambridge, UK, 1993.
5. V. D. Blondel and P. P. Senellart, Automatic extraction of synonyms in a dictionary, in Proceedings of the SIAM Text Mining Workshop, Arlington, VA, 2002.
6. V. D. Blondel and P. Van Dooren, Similarity matrices for pairs of graphs, in Proceedings of the ICALP 2003 Conference, J. C. M. Baeten et al., eds., Lecture Notes in Comput. Sci. 2719, Springer-Verlag, New York, 2003, pp. 739-550.
7. B. Bollobas, Random Graphs, Academic Press, New York, 1985.
8. F. R. K. Chung, Spectral Graph Theory, AMS, Providence, RI, 1997.
9. D. Cvetković, P. Rowlinson, and S. Simić, Eigenspaces of Graphs Cambridge University Press, Cambridge, UK, 1997.
10. D. Cvetković M. Doob, and H. Sachs, Spectra of Graphs - Theory and Applications, 3rd ed., Johann Ambrosius Barth Verlag, Leipzig, 1995.
11. F. Harary and C. A. Trauth, Jr., Connectedness of products of two directed graphs, SIAM J. Appl. Math., 14 (1966), pp. 250-254.
12. D. J. Hartfiel and C. J. Maxson, The chainable matrix, a special combinatorial matrix, Discrete Math., 12 (1975), pp. 245-256.
13. M. Heymans, Extraction d'information dans les graphes, et application aux moteurs de recherche sur internet, Engineer's thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, 2001.
14. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, London, 1985.
15. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, London, 1991.
16. J. Jannink and G. Wiederhold, Thesaurus entry extraction from an on-line dictionary, in Proceedings of Fusion 1999, Sunnyvale, CA, 1999.
17. G. Jeh and J. Widom, SimRank: A Measure of Structural-Context Similarity, in Proceedings of the KDD2002 Conference, Edmonton, AB, Canada, 2002.
18. J. M. Kleinberg, Authoritative sources in a hyperlinked environment J. ACM, 46 (1999), pp. 604-632.
19. M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Boston, MA, 1964.
20. S. Melnik, H. Garcia-Molina, and E. Rahm, Similarity flooding: A versatile graph matching algorithm and its application to schema matching, in Proceedings of the 18th ICDE, San Jose, CA, 2002.
21. P. P. Senellart and V. D. Blondel, Automatic discovery of similar words, in A Comprehensive Survey of Text Mining, M. Berry, ed., Springer-Verlag, New York, 2003.