Relational Learning via Propositional Algorithms: An Information Extraction Case Study
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 1257-1262.
Abstract
This paper develops a new paradigm for relational learning which allows for the representation and learning of relational information using propositional means. This paradigm suggests different tradeoffs than those in the traditional approach to this problem – the ILP approach – and as a result it enjoys several significant advantages over it. In particular, the new paradigm is more flexible and allows the use of any propositional algorithm, including probabilistic algorithms, within it. We evaluate the new approach on an important and relation-intensive task - Information Extraction - and show that it outperforms existing methods while being orders of magnitude more efficient.
@inproceedings{ijcai2001p166,
title = {Relational Learning via Propositional Algorithms: An Information Extraction Case Study},
author = {Roth, Dan and Yih, Wen-tau},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1257--1262},
year = {2001},
url = {https://ijcai.org/proceedings/2001/166},
}
TY - CPAPER TI - Relational Learning via Propositional Algorithms: An Information Extraction Case Study AU - Roth, Dan AU - Yih, Wen-tau T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 1257 EP - 1262 UR - https://ijcai.org/proceedings/2001/166 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
