A bayesian method for matching two similar graphs without seeds

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

Volumn , Issue , 2013, Pages 1598-1607

  Pedarsani, Pedram ^a   Figueiredo, Daniel R ^b   Grossglauser, Matthias ^a  

^a EPFL   (Switzerland)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; MAPPING; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; SOCIAL NETWORKING (ONLINE);

APPROXIMATE GRAPH MATCHING; BAYESIAN FRAMEWORKS; BAYESIAN METHODS; COMPUTATIONAL COSTS; GRAPH STRUCTURES; POLYNOMIAL-TIME ALGORITHMS; RANDOM GRAPH MODELS; SIDE INFORMATION;

GRAPH THEORY;

EID: 84897734719     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2013.6736720     Document Type: Conference Paper

References (20)

1. L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore Art Thou R3579X': Anonymized Social Networks, Hidden Patterns, and Structural Steganography. In WWW, 2007.
2. T. S. Caetano, J. J. McAuley, L. Cheng, Q. V. Le, and A. J. Smola. Learning Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell., 31(6), 2009.
3. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty Years of Graph Matching in Pattern Recognition. International Journal of Pattern Recognition and Artificial Intelligence, 18(03):265-298, 2004.
4. L. Cordella, P. Foggia, C. Sansone, and M. Vento. A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. IEEE Trans. Pattern Anal. Mach. Intell., 26(10), 2004.
5. O. Duchenne, F. Bach, I.-S. Kweon, and J. Ponce. A Tensor-Based Algorithm for High-Order Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell., 33(12), 2011.
6. M. Garey and D. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman &Co., New York, NY, USA, 1990.
7. M. Gori, M. Maggini, and L. Sarti. Exact and Approximate Graph Matching Using Random Walks. IEEE Trans. Pattern Anal. Mach. Intell., 27(7), 2005.
8. M. Hay, G. Miklau, D. Jensen, D. Towsley, and C. Li. Resisting Structural Re-Identification in Anonymized Networks. VLDB Journal, 19(6), 2010.
9. B. Luo and E. Hancock. Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition. IEEE Trans. Pattern Anal. Mach. Intell., 23(10), 2001.
10. R. Myers, R. Wilson, and E. Hancock. Bayesian Graph Edit Distance. IEEE Trans. Pattern Anal. Mach. Intell., 22(6), 2000.
11. A. Narayanan, E. Shi, and B. Rubinstein. Link prediction by deanonymization: How We Won the Kaggle Social Network Challenge. In IJCNN, 2011.
12. A. Narayanan and V. Shmatikov. De-anonymizing Social Networks. Security and Privacy, IEEE Symposium on, 2009.
13. P. Pedarsani and M. Grossglauser. On the Privacy of Anonymized Networks. In SIGKDD, 2011.
14. N. Quadrianto, A. J. Smola, L. Song, and T. Tuytelaars. Kernelized Sorting. IEEE Trans. Pattern Anal. Mach. Intell., 32(10), 2010.
15. Y. Tian and J. Patel. TALE: A Tool for Approximate Large Graph Matching. Data Engineering, International Conference on, 0:963-972, 2008.
16. J. Ullmann. An Algorithm for Subgraph Isomorphism. J. ACM, 23(1), 1976.
17. G. Wondracek, T. Holz, E. Kirda, and C. Kruegel. A Practical Attack to De-Anonymize Social Network Users. In IEEE Symposium on Security &Privacy, 2010.
18. L. Yartseva and M. Grossglauser. On the Performance of Percolation Graph Matching. In ACM Conference on Online Social Networks (COSN), 2013.
19. M. Zaslavskiy, F. R. Bach, and J.-P. Vert. A Path Following Algorithm for the Graph Matching Problem. IEEE Trans. Pattern Anal. Mach. Intell., 31(12), 2009.
20. S. Zhang, J. Yang, and W. Jin. SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs. PVLDB, 3(1):1185-1194, 2010.