Similarity measures over refinement graphs

DOI10.1007/s10994-011-5274-3zbMath1238.68128OpenAlexW2030527928MaRDI QIDQ420926

Santiago Ontañón, Enric Plaza

Publication date: 23 May 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-011-5274-3

zbMATH Keywords

similarity measurescase-based reasoningfeature termslazy learningrefinement graphs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Order-sorted equational generalization algorithm revisited ⋮ Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) ⋮ ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance ⋮ Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention ⋮ Variant-based equational anti-unification ⋮ Speeding up operations on feature terms using constraint programming and variable symmetry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The explanatory power of symbolic similarity in case-based reasoning
• Structured machine learning: the next ten years
• DL-FOIL Concept Learning in Description Logics
• The Logic of Typed Feature Structures
• Order-sorted feature theory unification
• RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs
• A Refinement Operator Based Learning Algorithm for the $\mathcal{ALC}$ Description Logic
• Foundations of Refinement Operators for Description Logics
• Nearest neighbor pattern classification
• Relational instance-based learning with lists and terms

This page was built for publication: Similarity measures over refinement graphs