Graph-Based relational learning with a polynomial time projection algorithm

Authors:
Brahim Douar;Michel Liquiere;Chiraz Latiri;Yahya Slimani
Affiliations:
LIRMM, Montpellier, France,URPAH Team, Faculty of Sciences of Tunis, Tunisia;LIRMM, Montpellier, France,IUT Béziers, France;URPAH Team, Faculty of Sciences of Tunis, Tunisia;URPAH Team, Faculty of Sciences of Tunis, Tunisia
Venue:
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Year:
2011

Citing 10
Cited 0

C4.5: programs for machine learning

C4.5: programs for machine learning
Conceptual graphs summary

Conceptual structures
Robust Classification for Imprecise Environments

Machine Learning
Frequent Subgraph Discovery

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Discovering Associations between Spatial Objects: An ILP Application

ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Mining Graph Data

Mining Graph Data
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Arc Consistency Projection: A New Generalization Relation for Graphs

ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
A quantitative comparison of the subgraph miners mofa, gspan, FFSM, and gaston

PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a new projection operator, named AC- projection, which exhibits good complexity properties as opposed to the graph isomorphism operator typically used in graph mining. We study the size and structure of the search space and some practical properties of the projection operator. These properties give us a specialization algorithm using simple local operations. Then we prove experimentally that we can achieve an important performance gain without or with non-significant loss of discovered patterns quality.