Version space algorithms on hierarchies with exceptions

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we present version space algorithms working on hierarchies with exceptions, exceptions meaning that some nodes may not be covered by some of their predecessors. Such representations are known from nonmonotonic reasoning. We give formal definitions and correctness results for the algorithms. Then we discuss what happens when the background knowledge is slightly modified by introduction of a new exception. Here lies the major advantage of our approach: when the knowledge is dynamically (nonmonotonically) modified, it is still possible to save almost all of the learned information instead of having to restart the version space learning method from scratch. Finally, we discuss the version space method in case several hierarchy trees (with or without exceptions) are combined to form a conjunctive concept.

Original languageEnglish
Title of host publicationProgress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings
EditorsMiguel Filgueiras, Luis Damas
PublisherSpringer Verlag
Pages136-149
Number of pages14
ISBN (Print)9783540572879
DOIs
Publication statusPublished - 1 Jan 1993
Externally publishedYes
Event6th Portuguese Conference on Artificial Intelligence - Porto, Portugal
Duration: 6 Oct 19938 Oct 1993
Conference number: 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume727 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th Portuguese Conference on Artificial Intelligence
Abbreviated titleEPIA 1993
CountryPortugal
CityPorto
Period6/10/938/10/93

Fingerprint

Exception
Nonmonotonic Reasoning
Restart
Correctness
Hierarchy
Vertex of a graph
Knowledge

Cite this

Antoniou, G. (1993). Version space algorithms on hierarchies with exceptions. In M. Filgueiras, & L. Damas (Eds.), Progress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings (pp. 136-149). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 727 LNAI). Springer Verlag. https://doi.org/10.1007/3-540-57287-2_43
Antoniou, Grigoris. / Version space algorithms on hierarchies with exceptions. Progress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings. editor / Miguel Filgueiras ; Luis Damas. Springer Verlag, 1993. pp. 136-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a4774c26bc2b49a197efbc4f4b6b1def,
title = "Version space algorithms on hierarchies with exceptions",
abstract = "In this paper, we present version space algorithms working on hierarchies with exceptions, exceptions meaning that some nodes may not be covered by some of their predecessors. Such representations are known from nonmonotonic reasoning. We give formal definitions and correctness results for the algorithms. Then we discuss what happens when the background knowledge is slightly modified by introduction of a new exception. Here lies the major advantage of our approach: when the knowledge is dynamically (nonmonotonically) modified, it is still possible to save almost all of the learned information instead of having to restart the version space learning method from scratch. Finally, we discuss the version space method in case several hierarchy trees (with or without exceptions) are combined to form a conjunctive concept.",
author = "Grigoris Antoniou",
year = "1993",
month = "1",
day = "1",
doi = "10.1007/3-540-57287-2_43",
language = "English",
isbn = "9783540572879",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "136--149",
editor = "Miguel Filgueiras and Luis Damas",
booktitle = "Progress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings",

}

Antoniou, G 1993, Version space algorithms on hierarchies with exceptions. in M Filgueiras & L Damas (eds), Progress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 727 LNAI, Springer Verlag, pp. 136-149, 6th Portuguese Conference on Artificial Intelligence, Porto, Portugal, 6/10/93. https://doi.org/10.1007/3-540-57287-2_43

Version space algorithms on hierarchies with exceptions. / Antoniou, Grigoris.

Progress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings. ed. / Miguel Filgueiras; Luis Damas. Springer Verlag, 1993. p. 136-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 727 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Version space algorithms on hierarchies with exceptions

AU - Antoniou, Grigoris

PY - 1993/1/1

Y1 - 1993/1/1

N2 - In this paper, we present version space algorithms working on hierarchies with exceptions, exceptions meaning that some nodes may not be covered by some of their predecessors. Such representations are known from nonmonotonic reasoning. We give formal definitions and correctness results for the algorithms. Then we discuss what happens when the background knowledge is slightly modified by introduction of a new exception. Here lies the major advantage of our approach: when the knowledge is dynamically (nonmonotonically) modified, it is still possible to save almost all of the learned information instead of having to restart the version space learning method from scratch. Finally, we discuss the version space method in case several hierarchy trees (with or without exceptions) are combined to form a conjunctive concept.

AB - In this paper, we present version space algorithms working on hierarchies with exceptions, exceptions meaning that some nodes may not be covered by some of their predecessors. Such representations are known from nonmonotonic reasoning. We give formal definitions and correctness results for the algorithms. Then we discuss what happens when the background knowledge is slightly modified by introduction of a new exception. Here lies the major advantage of our approach: when the knowledge is dynamically (nonmonotonically) modified, it is still possible to save almost all of the learned information instead of having to restart the version space learning method from scratch. Finally, we discuss the version space method in case several hierarchy trees (with or without exceptions) are combined to form a conjunctive concept.

UR - http://www.scopus.com/inward/record.url?scp=33747624972&partnerID=8YFLogxK

U2 - 10.1007/3-540-57287-2_43

DO - 10.1007/3-540-57287-2_43

M3 - Conference contribution

SN - 9783540572879

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 136

EP - 149

BT - Progress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings

A2 - Filgueiras, Miguel

A2 - Damas, Luis

PB - Springer Verlag

ER -

Antoniou G. Version space algorithms on hierarchies with exceptions. In Filgueiras M, Damas L, editors, Progress in Artificial Intelligence - 6th Portuguese Conference on AI, EPIA 1993, Proceedings. Springer Verlag. 1993. p. 136-149. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-57287-2_43