Comparing and Fusing Terrain Network Information

Terrain networks (or complex networks) is a type of relational information that is encountered in many fields. In order to properly answer questions pertaining to the comparison or to the merging of such networks, a method that takes into account the underlying structure of graphs is proposed. The effectiveness of the method is illustrated using real linguistic data networks and artificial networks, in particular.

[1]  C. Fellbaum An Electronic Lexical Database , 1998 .

[2]  Erhard Rahm,et al.  Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.

[3]  Whitman Richards,et al.  Graph Comparison Using Fine Structure Analysis , 2010, 2010 IEEE Second International Conference on Social Computing.

[4]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[5]  Emmanuel Navarro,et al.  Semi-automatic enrichment of crowdsourced synonymy networks: the WISIGOTH system applied to Wiktionary , 2011, Language Resources and Evaluation.

[6]  Ambuj K. Singh,et al.  Closure-Tree: An Index Structure for Graph Queries , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[7]  Jacob Cohen A Coefficient of Agreement for Nominal Scales , 1960 .

[8]  G. W. Stewart Perron-Frobenius theory: a new proof of the basics , 1994 .

[9]  Paul Van Dooren,et al.  A MEASURE OF SIMILARITY BETWEEN GRAPH VERTICES . WITH APPLICATIONS TO SYNONYM EXTRACTION AND WEB SEARCHING , 2002 .

[10]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[11]  Ryutaro Ichise,et al.  Similarity search on supergraph containment , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[12]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[13]  Emmanuel Navarro,et al.  Invariants and Variability of Synonymy Networks: Self Mediated Agreement by Confluence , 2011, Graph-based Methods for Natural Language Processing.

[14]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[15]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[16]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[17]  Philip S. Yu,et al.  Substructure similarity search in graph databases , 2005, SIGMOD '05.

[18]  B. Gaume,et al.  Balades aléatoires dans les Petits Mondes Lexicaux , 2004 .

[19]  Jignesh M. Patel,et al.  TALE: A Tool for Approximate Large Graph Matching , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[20]  Christiane Fellbaum,et al.  Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[21]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[22]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.