Acyclic conjunctive queries form a polynomially evaluable fragment of definite nonrecursive first-order Horn clauses. Labeled graphs, a special class of relational structures, provide a natural way for representing chemical compounds. We propose an algorithm specific to learning acyclic conjunctive queries predicting certain properties of molecules represented by labeled graphs. To compensate for the reduced expressive power of the hypothesis language and thus the potential decrease in classification accuracy, we combine acyclic conjunctive queries with constrained confidence-rated boosting. Preliminary experimental results indicate the potential of the method for problems involving labeled graphs.
|Publication status||Published - Sep 2003|
|Event||Proceedings of the 1st International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003) - Cavtat-Dubrovnik, Croatia|
Duration: 22 Sep 2003 → 23 Sep 2003
|Conference||Proceedings of the 1st International Workshop on Mining Graphs, Trees and Sequences (MGTS-2003)|
|Period||22/09/03 → 23/09/03|