Refinement-Based Similarity Measures for Directed Labeled Graphs

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9969)

Abstract

This paper presents a collection of similarity measures based on refinement operators for directed labeled graphs (DLGs). We build upon previous work on refinement operators for other representation formalisms such as feature terms and description logics. Specifically, we present refinement operators for DLGs, which enable the adaptation of three similarity measures to DLGs: the anti-unification-based, \(S_{\lambda }\), the property-based, \(S_{\pi }\), and the weighted property-based, \(S_{w\pi }\), similarities. We evaluate the resulting measures empirically comparing them to existing similarity measures for structured data.

Keywords

Similarity assessment Refinement operators Labeled graphs 

References

  1. 1.
    Aamodt, A., Plaza, E.: Case-based reasoning: foundational issues, methodological variations, and system approaches. Artif. Intell. Commun. 7(1), 39–59 (1994)Google Scholar
  2. 2.
    Armengol, E., Plaza, E.: Relational case-based reasoning for carcinogenic activity prediction. Artif. Intell. Rev. 20(1–2), 121–141 (2003)CrossRefGoogle Scholar
  3. 3.
    Bergmann, R., Stahl, A.: Similarity measures for object-oriented case representations. In: Smyth, B., Cunningham, P. (eds.) EWCBR 1998. LNCS, vol. 1488, pp. 25–36. Springer, Heidelberg (1998). doi:10.1007/BFb0056319 CrossRefGoogle Scholar
  4. 4.
    Bille, P.: A survey on tree edit distance and related problems. Theoret. Comput. Sci. 337(1), 217–239 (2005)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Bisson, G.: Learing in FOL with a similarity measure. In: Proceedings of AAAI 1992, pp. 82–87 (1992)Google Scholar
  6. 6.
    d’Amato, C.: Similarity-based learning methods for the semantic web. Ph.D. thesis, Università degli Studi di Bari (2007)Google Scholar
  7. 7.
    Emde, W., Wettschereck, D.: Relational instance based learning. In: Saitta, L. (ed.) Machine Learning - Proceedings 13th International Conference on Machine Learning, pp. 122–130. Morgan Kaufmann Publishers (1996)Google Scholar
  8. 8.
    Fanizzi, N., d’Amato, C., Esposito, F.: Induction of optimal semi-distances for individuals based on feature sets. In: Proceedings of 2007 International Workshop on Description Logics, CEUR-WS (2007)Google Scholar
  9. 9.
    Fanizzi, N., d’Amato, C., Esposito, F.: Learning with Kernels in description logics. In: Železný, F., Lavrač, N. (eds.) ILP 2008. LNCS (LNAI), vol. 5194, pp. 210–225. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85928-4_18 CrossRefGoogle Scholar
  10. 10.
    Ferilli, S., Fanizzi, N., Di Mauro, N., Basile, T.M.: Efficient theta-subsumption under object identity. In: Workshop AI*IA 2002, pp. 59–68 (2002)Google Scholar
  11. 11.
    Gabel, T.: Learning similarity measures: strategies to enhance the optimisation process. Diploma thesis, kaiserslautern university of technology (2003)Google Scholar
  12. 12.
    Gärtner, T., Lloyd, J.W., Flach, P.A.: Kernels for structured data. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 66–83. Springer, Heidelberg (2003). doi:10.1007/3-540-36468-4_5 CrossRefGoogle Scholar
  13. 13.
    González-Calero, P.A., Díaz-Agudo, B., Gómez-Albarrán, M.: Applying DLs for retrieval in case-based reasoning. In: Proceedings of the 1999 Description Logics Workshop (DL 1999) (1999)Google Scholar
  14. 14.
    Hutchinson, A.: Metrics on terms and clauses. In: Someren, M., Widmer, G. (eds.) ECML 1997. LNCS, vol. 1224, pp. 138–145. Springer, Heidelberg (1997). doi:10.1007/3-540-62858-4_78 CrossRefGoogle Scholar
  15. 15.
    Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized Kernels between labeled graphs. In: Proceedings of the Twentieth International Conference (ICML 2003), pp. 321–328. AAAI Press (2003)Google Scholar
  16. 16.
    van der Laag, P.R.J., Nienhuys-Cheng, S.H.: Completeness and properness of refinement operators in inductive logic programming. J. Logic Program. 34(3), 201–225 (1998)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Larson, J., Michalski, R.S.: Inductive inference of VL decision rules. SIGART Bull. 63(63), 38–44 (1977)CrossRefGoogle Scholar
  18. 18.
    Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10, 707–710 (1966)MathSciNetMATHGoogle Scholar
  19. 19.
    Nienhuys-Cheng, S.-H.: Distance between herbrand interpretations: a measure for approximations to a target concept. In: Lavrač, N., Džeroski, S. (eds.) ILP 1997. LNCS, vol. 1297, pp. 213–226. Springer, Heidelberg (1997). doi:10.1007/3540635149_50 CrossRefGoogle Scholar
  20. 20.
    Ontanón, S., Plaza, E.: Similarity measures over refinement graphs. Mach. Learn. 87, 57–92 (2012)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Ontañón, S.: RHOG: a refinement-operator library for directed labeled graphs. arXiv preprint cs.AI (2016). http://arxiv.org/abs/1604.06954
  22. 22.
    Ontañón, S., Plaza, E.: Refinement-based disintegration: an approach to re-representation in relational learning. AI Commun. 28(1), 35–46 (2015)MathSciNetGoogle Scholar
  23. 23.
    Ramon, J.: Clustering and instance based learning in first order logic. AI Commun. 15(4), 217–218 (2002)Google Scholar
  24. 24.
    Sánchez, D., Batet, M., Isern, D., Valls, A.: Ontology-based semantic similarity: a new feature-based approach. Expert Syst. Appl. 39(9), 7718–7728 (2012)CrossRefGoogle Scholar
  25. 25.
    Sánchez-Ruiz, A.A., Ontañón, S.: Least common subsumer trees for plan retrieval. In: Lamontagne, L., Plaza, E. (eds.) ICCBR 2014. LNCS (LNAI), vol. 8765, pp. 405–419. Springer, Heidelberg (2014). doi:10.1007/978-3-319-11209-1_29 Google Scholar
  26. 26.
    Sánchez-Ruiz, A.A., Ontañón, S., González-Calero, P.A., Plaza, E.: Refinement-based similarity measure over DL conjunctive queries. In: Delany, S.J., Ontañón, S. (eds.) ICCBR 2013. LNCS (LNAI), vol. 7969, pp. 270–284. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39056-2_20 CrossRefGoogle Scholar
  27. 27.
    Wolf, M., Petridis, M.: Measuring similarity of software designs using graph matching for CBR. In: Workshop Proceedings of AISEW 2008 at ECAI 2008. IOS Press (2008)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Computer Science DepartmentDrexel UniversityPhiladelphiaUSA

Personalised recommendations