Probabilistic first-order theory revision from examples

• Type: Article in International Conference Proceedings Book
• Date: 2005

Authors

Paes, A (Author) Other; Revoredo, K (Author) Other; Zaverucha, G (Author) Other; Costa, VS (Author) FCUP

Conference proceedings International

Title: Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Pages: 295-311

15th International Conference on Inductive Logic Programming, ILP 2005

Bonn, 10 August 2005 through 13 August 2005

Indexing

Scopus - 9 Citations

Other information

Authenticus ID: P-007-E8B

DOI: 10.1007/11536314_18

Abstract (EN): Recently, there has been significant work in the integration of probabilistic reasoning with first order logic representations. Learning algorithms for these models have been developed and they all considered modifications in the entire structure. In a previous work we argued that when the theory is approximately correct the use of techniques from theory revision to just modify the structure in places that failed in classification can be a more adequate choice. To score these modifications and choose the best one the log likelihood was used. However, this function was shown not to be well-suited in the propositional Bayesian classification task and instead the conditional log likelihood should be used. In the present paper, we extend this revision system showing the necessity of using specialization operators even when there are no negative examples. Moreover, the results of a theory modified only in places that are responsible for the misclassification of some examples are compared with the one that was modified in the entire structure using three databases and considering four probabilistic score functions, including conditional log likelihood. © Springer-Verlag Berlin Heidelberg 2005.

Language: English

Type (Professor's evaluation): Scientific