Structural Graph-based Metamodel Matching

[1]  Harold W. Kuhn,et al.  The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[2]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[3]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[6]  Kenneth L. Clarkson,et al.  Schema covering: a step towards enabling reuse in information integration , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[7]  Mirko Seifert,et al.  Derivation and Refinement of Textual Syntax for Models , 2009, ECMDA-FA.

[8]  Ron Shamir,et al.  A clustering algorithm based on graph connectivity , 2000, Inf. Process. Lett..

[9]  Avigdor Gal,et al.  Managing Uncertainty in Schema Matching with Top-K Schema Mappings , 2006, J. Data Semant..

[10]  Soo Dong Kim,et al.  Component identification method with coupling and cohesion , 2001, Proceedings Eighth Asia-Pacific Software Engineering Conference.

[11]  S. Dongen.  A cluster algorithm for graphs , 2000 .

[12]  Patrick Valduriez,et al.  Semi-automatic model integration using matching transformations and weaving models , 2007, SAC '07.

[13]  J. Euzenat,et al.  Ontology Matching , 2007, Springer Berlin Heidelberg.

[14]  Heiner Stuckenschmidt,et al.  Results of the Ontology Alignment Evaluation Initiative , 2007 .

[15]  Yuzhong Qu,et al.  GMO: A Graph Matching for Ontologies , 2005, Integrating Ontologies.

[16]  Willem Jonker,et al.  Using Element Clustering to Increase the Efficiency of XML Schema Matching , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[17]  Shang-Hua Teng,et al.  How Good is Recursive Bisection? , 1997, SIAM J. Sci. Comput..

[18]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[19]  Heiner Stuckenschmidt,et al.  Results of the Ontology Alignment Evaluation Initiative 2007 , 2006, OM.

[20]  Christos Faloutsos,et al.  Graph mining: Laws, generators, and algorithms , 2006, CSUR.

[21]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[22]  Silvana Castano,et al.  Conceptual schema analysis: techniques and applications , 1998, TODS.

[23]  Eugene M. Luks.  Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[24]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[25]  Claudio Gutiérrez,et al.  Bipartite Graphs as Intermediate Model for RDF , 2004, SEMWEB.

[26]  Philip A. Bernstein,et al.  A vision for management of complex models , 2000, SGMD.

[27]  Gerti Kappel,et al.  On models and ontologies - A layered approach for model-based tool integration , 2006 .

[28]  Wei Wang,et al.  Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.

[29]  S. Vavasis,et al.  Geometric Separators for Finite-Element Meshes , 1998, SIAM J. Sci. Comput..

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

[31]  Pasi Fränti,et al.  Fast PNN-based clustering using k-nearest neighbor graph , 2003, Third IEEE International Conference on Data Mining.

[32]  Hristo Djidjev,et al.  A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection , 2007, WAW.

[33]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[34]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[35]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[36]  Tadashi Horiuchi,et al.  Extension of Graph-Based Induction for General Graph Structured Data , 2000, PAKDD.

[37]  Frank Budinsky,et al.  EMF: Eclipse Modeling Framework 2.0 , 2009 .

[38]  Baowen Xu,et al.  Lily: Ontology Alignment Results for OAEI 2008 , 2008, OM.

[39]  Andrés Marzal,et al.  Fast cyclic edit distance computation with weighted edit costs in classification , 2002, Object recognition supported by user interaction for service robots.

[40]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[41]  Yangyong Zhu,et al.  Similarity Metric for XML Documents , 2003 .

[42]  Mansur R. Kabuka,et al.  ASMOV Results for OAEI 2007 , 2007, OM.

[43]  Robert E. Tarjan,et al.  Graph Clustering and Minimum Cut Trees , 2004, Internet Math..

[44]  Jean Bézivin,et al.  Managing Model Adaptation by Precise Detection of Metamodel Changes , 2009, ECMDA-FA.

[45]  Mansur R. Kabuka,et al.  ASMOV: results for OAEI 2010 , 2010, OM.

[46]  Philip A. Bernstein,et al.  Industrial-strength schema matching , 2004, SGMD.

[47]  George Karypis,et al.  Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.

[48]  Cosmin Stroe,et al.  Using AgreementMaker to align ontologies for OAEI 2010 , 2010, OM.

[49]  Frank Budinsky,et al.  Eclipse Modeling Framework , 2003 .

[50]  Jérôme Euzenat,et al.  OLA in the OAEI 2007 Evaluation Contest , 2007, OM.

[51]  Yuzhong Qu,et al.  Falcon-AO: Results for OAEI 2007 , 2007, OM.

[52]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[53]  Andreas Rummler,et al.  MatchBox: combined meta-model matching for semi-automatic mapping generation , 2010, SAC '10.

[54]  C. Kuratowski.  Sur le problème des courbes gauches en Topologie , 1930 .

[55]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[56]  Jaikumar Radhakrishnan,et al.  Greed is good: approximating independent sets in sparse and bounded-degree graphs , 1993, STOC '94.

[57]  Zhi Zhang,et al.  An Algebraic Framework for Schema Matching , 2005, Informatica.

[58]  Erhard Rahm,et al.  Matching large schemas: Approaches and evaluation , 2007, Inf. Syst..

[59]  Clémentine Nebut,et al.  Metamodel Matching for Automatic Model Transformation Generation , 2008, MoDELS.

[60]  Lawrence B. Holder,et al.  Subdue: compression-based frequent pattern discovery in graph data , 2005 .

[61]  Thorsten Meinl,et al.  Edgar: the Embedding-baseD GrAph MineR , 2006 .

[62]  Richard F. Paige,et al.  Different models for model matching: An analysis of approaches to support model differencing , 2009, 2009 ICSE Workshop on Comparison and Versioning of Software Models.

[63]  Horst Bunke,et al.  On Graphs with Unique Node Labels , 2003, GbRPR.

[64]  Horst Bunke,et al.  An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification , 2004, SSPR/SPR.

[65]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[66]  Arnon Rosenthal,et al.  Tuning Schema Matching Software using Synthetic Scenarios , 2005, VLDB.

[67]  Vipin Kumar,et al.  Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.

[68]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[69]  Slimane Hammoudi,et al.  Schema Matching in the Context of Model Driven Engineering: From Theory to Practice , 2006 .

[70]  Michael Altenhofen,et al.  OCL support in an industrial environment , 2006, MoDELS'06.

[71]  George Karypis,et al.  GREW - a scalable frequent subgraph discovery algorithm , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).

[72]  R. Dieng-Kuntz,et al.  A Graph-Based Algorithm for Alignment of OWL Ontologies , 2007, IEEE/WIC/ACM International Conference on Web Intelligence (WI'07).

[73]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[74]  Gerti Kappel,et al.  Matching Metamodels with Semantic Systems - An Experience Report , 2007, BTW Workshops.

[75]  Jean Bézivin,et al.  Weaving Models with the Eclipse AMW plugin , 2006 .

[76]  Henrik Lochmann,et al.  HybridMDSD: multi domain engineering with model-driven software development using ontological foundations , 2009 .

[77]  Lawrence B. Holder,et al.  Journal of Graph Algorithms and Applications Algorithm and Experiments in Testing Planar Graphs for Isomorphism , 2022 .

[78]  Prashant Doshi,et al.  Inexact Matching of Ontology Graphs Using Expectation-Maximization , 2006, AAAI.

[79]  August-Wilhelm Scheer,et al.  Enterprise resource planning: making ERP a success , 2000, CACM.

[80]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[81]  Yuzhong Qu,et al.  Matching large ontologies: A divide-and-conquer approach , 2008, Data Knowl. Eng..

[82]  Jérôme Euzenat,et al.  Similarity-Based Ontology Alignment in OWL-Lite , 2004, ECAI.

[83]  Erhard Rahm,et al.  Generic Schema Matching with Cupid , 2001, VLDB.

[84]  Michael B. Spring,et al.  A Harmony based Adaptive Ontology Mapping Approach , 2008, SWWS.

[85]  Hristo Djidjev,et al.  Partitioning planar graphs with costs and weights , 2002, ALENEX.

[86]  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.

[87]  Giancarlo Guizzardi,et al.  On Ontology, ontologies, Conceptualizations, Modeling Languages, and (Meta)Models , 2007, DB&IS.

[88]  Michael Jünger,et al.  Maximum planar subgraphs and nice embeddings: Practical layout tools , 1996, Algorithmica.

[89]  Guy Melançon,et al.  Software components capture using graph clustering , 2003, 11th IEEE International Workshop on Program Comprehension, 2003..

[90]  Christian Drumm,et al.  Improving schema mapping by exploiting domain knowledge , 2009 .

[91]  Eric Peukert,et al.  Comparing Similarity Combination Methods for Schema Matching , 2010, GI Jahrestagung.

[92]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[93]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[94]  Yuzhong Qu,et al.  FalconAO: Aligning Ontologies with Falcon , 2005, Integrating Ontologies.

[95]  Erhard Rahm,et al.  Quickmig: automatic schema matching for data migration projects , 2007, CIKM '07.

[96]  Masaki Aono,et al.  Anchor-Flood: Results for OAEI 2009 , 2009, OM.

[97]  Erhard Rahm,et al.  COMA - A System for Flexible Combination of Schema Matching Approaches , 2002, VLDB.

[98]  Yong Li,et al.  GeRoMeSuite: A System for Holistic Generic Model Management , 2007, VLDB.

[99]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[100]  George Karypis,et al.  Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[101]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[102]  Heiner Stuckenschmidt,et al.  A Pattern-based Ontology Matching Approach for Detecting Complex Correspondences , 2009, OM.

[103]  Robert E. Tarjan,et al.  An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem , 1992, SIAM J. Comput..

[104]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[105]  Hartmut Ehrig,et al.  Formal integration of inheritance with typed attributed graph transformation for efficient VL definition and model manipulation , 2005, 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05).

[106]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[107]  Kaspar Riesen,et al.  Bipartite Graph Matching for Computing the Edit Distance of Graphs , 2007, GbRPR.

[108]  Thomas S. Heinze,et al.  Metamodel Matching Based on Planar Graph Edit Distance , 2010, ICMT@TOOLS.

[109]  Erhard Rahm,et al.  Frameworks for entity matching: A comparison , 2010, Data Knowl. Eng..

[110]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[111]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[112]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[113]  Erhard Rahm,et al.  A survey of approaches to automatic schema matching , 2001, The VLDB Journal.

[114]  Yi Li,et al.  RiMOM: A Dynamic Multistrategy Ontology Alignment Framework , 2009, IEEE Transactions on Knowledge and Data Engineering.

[115]  D. Spielman,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[116]  Joerg Evermann,et al.  Theories of meaning in schema matching: An exploratory study , 2009, Inf. Syst..

[117]  Mario Piattini,et al.  Ontologies for Software Engineering and Software Technology , 2010 .

[118]  Thorsten Meinl,et al.  A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston , 2005, PKDD.

[119]  Xuelong Li,et al.  A survey of graph edit distance , 2010, Pattern Analysis and Applications.

[120]  Zair Abdelouahab,et al.  A Step Forward in Semi-automatic Metamodel Matching: Algorithms and Tool , 2009, ICEIS.

[121]  Masaki Aono,et al.  An efficient and scalable algorithm for segmented alignment of ontologies of arbitrary size , 2009, J. Web Semant..

[122]  Erhard Rahm,et al.  On Matching Large Life Science Ontologies in Parallel , 2010, DILS.

[123]  Eric Peukert,et al.  Rewrite techniques for performance optimization of schema matching processes , 2010, EDBT '10.

[124]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[125]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .