Data-driven theory refinement using KBDistAl

Jihoon Yang, Rajesh Parekh, Vasant Honavar, Drena Dobbs

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

2 Citations (Scopus)

Abstract

Knowledge based artificial neural networks offer an attractive approach to extending or modifying incomplete knowledge bases or domain theories through a process of data-driven theory refinement. We present an efficient algorithm for data-driven knowledge discovery and theory refinement using DistAl, a novel (inter-pattern distance based, polynomial time) constructive neural network learning algorithm. The initial domain theory comprising of propositional rules is translated into a knowledge based network. The domain theory is modified using DistAl which adds new neurons to the existing network as needed to reduce classification errors associated with the incomplete domain theory on labeled training examples. The proposed algorithm is capable of handling patterns represented using binary, nominal, as well as numeric (real-valued) attributes. Results of experiments on several datasets for financial advisor and the human genome project indicate that the performance of the proposed algorithm compares quite favorably with other algorithms for connectionist theory refinement (including those that require substantially more computational resources) both in terms of generalization accuracy and network size.

Original languageEnglish (US)
Title of host publicationAdvances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings
EditorsDavid J. Hand, Joost N. Kok, Michael R. Berthold
PublisherSpringer Verlag
Pages331-342
Number of pages12
ISBN (Print)3540663320, 9783540663324
DOIs
StatePublished - Jan 1 1999
Event3rd International Symposium on Intelligent Data Analysis, IDA 1999 - Amsterdam, Netherlands
Duration: Aug 9 1999Aug 11 1999

Publication series

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

Other

Other3rd International Symposium on Intelligent Data Analysis, IDA 1999
CountryNetherlands
CityAmsterdam
Period8/9/998/11/99

Fingerprint

Domain Theory
Data-driven
Refinement
Knowledge-based
Neural networks
Network Algorithms
Knowledge Discovery
Numerics
Knowledge Base
Learning algorithms
Neurons
Categorical or nominal
Data mining
Artificial Neural Network
Learning Algorithm
Neuron
Polynomial time
Genome
Efficient Algorithms
Genes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yang, J., Parekh, R., Honavar, V., & Dobbs, D. (1999). Data-driven theory refinement using KBDistAl. In D. J. Hand, J. N. Kok, & M. R. Berthold (Eds.), Advances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings (pp. 331-342). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1642). Springer Verlag. https://doi.org/10.1007/3-540-48412-4_28
Yang, Jihoon ; Parekh, Rajesh ; Honavar, Vasant ; Dobbs, Drena. / Data-driven theory refinement using KBDistAl. Advances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings. editor / David J. Hand ; Joost N. Kok ; Michael R. Berthold. Springer Verlag, 1999. pp. 331-342 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f24bcf64af36422f9294ca5aa5cedd90,
title = "Data-driven theory refinement using KBDistAl",
abstract = "Knowledge based artificial neural networks offer an attractive approach to extending or modifying incomplete knowledge bases or domain theories through a process of data-driven theory refinement. We present an efficient algorithm for data-driven knowledge discovery and theory refinement using DistAl, a novel (inter-pattern distance based, polynomial time) constructive neural network learning algorithm. The initial domain theory comprising of propositional rules is translated into a knowledge based network. The domain theory is modified using DistAl which adds new neurons to the existing network as needed to reduce classification errors associated with the incomplete domain theory on labeled training examples. The proposed algorithm is capable of handling patterns represented using binary, nominal, as well as numeric (real-valued) attributes. Results of experiments on several datasets for financial advisor and the human genome project indicate that the performance of the proposed algorithm compares quite favorably with other algorithms for connectionist theory refinement (including those that require substantially more computational resources) both in terms of generalization accuracy and network size.",
author = "Jihoon Yang and Rajesh Parekh and Vasant Honavar and Drena Dobbs",
year = "1999",
month = "1",
day = "1",
doi = "10.1007/3-540-48412-4_28",
language = "English (US)",
isbn = "3540663320",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "331--342",
editor = "Hand, {David J.} and Kok, {Joost N.} and Berthold, {Michael R.}",
booktitle = "Advances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings",
address = "Germany",

}

Yang, J, Parekh, R, Honavar, V & Dobbs, D 1999, Data-driven theory refinement using KBDistAl. in DJ Hand, JN Kok & MR Berthold (eds), Advances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1642, Springer Verlag, pp. 331-342, 3rd International Symposium on Intelligent Data Analysis, IDA 1999, Amsterdam, Netherlands, 8/9/99. https://doi.org/10.1007/3-540-48412-4_28

Data-driven theory refinement using KBDistAl. / Yang, Jihoon; Parekh, Rajesh; Honavar, Vasant; Dobbs, Drena.

Advances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings. ed. / David J. Hand; Joost N. Kok; Michael R. Berthold. Springer Verlag, 1999. p. 331-342 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1642).

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

TY - GEN

T1 - Data-driven theory refinement using KBDistAl

AU - Yang, Jihoon

AU - Parekh, Rajesh

AU - Honavar, Vasant

AU - Dobbs, Drena

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Knowledge based artificial neural networks offer an attractive approach to extending or modifying incomplete knowledge bases or domain theories through a process of data-driven theory refinement. We present an efficient algorithm for data-driven knowledge discovery and theory refinement using DistAl, a novel (inter-pattern distance based, polynomial time) constructive neural network learning algorithm. The initial domain theory comprising of propositional rules is translated into a knowledge based network. The domain theory is modified using DistAl which adds new neurons to the existing network as needed to reduce classification errors associated with the incomplete domain theory on labeled training examples. The proposed algorithm is capable of handling patterns represented using binary, nominal, as well as numeric (real-valued) attributes. Results of experiments on several datasets for financial advisor and the human genome project indicate that the performance of the proposed algorithm compares quite favorably with other algorithms for connectionist theory refinement (including those that require substantially more computational resources) both in terms of generalization accuracy and network size.

AB - Knowledge based artificial neural networks offer an attractive approach to extending or modifying incomplete knowledge bases or domain theories through a process of data-driven theory refinement. We present an efficient algorithm for data-driven knowledge discovery and theory refinement using DistAl, a novel (inter-pattern distance based, polynomial time) constructive neural network learning algorithm. The initial domain theory comprising of propositional rules is translated into a knowledge based network. The domain theory is modified using DistAl which adds new neurons to the existing network as needed to reduce classification errors associated with the incomplete domain theory on labeled training examples. The proposed algorithm is capable of handling patterns represented using binary, nominal, as well as numeric (real-valued) attributes. Results of experiments on several datasets for financial advisor and the human genome project indicate that the performance of the proposed algorithm compares quite favorably with other algorithms for connectionist theory refinement (including those that require substantially more computational resources) both in terms of generalization accuracy and network size.

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

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

U2 - 10.1007/3-540-48412-4_28

DO - 10.1007/3-540-48412-4_28

M3 - Conference contribution

AN - SCOPUS:22644451714

SN - 3540663320

SN - 9783540663324

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

SP - 331

EP - 342

BT - Advances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings

A2 - Hand, David J.

A2 - Kok, Joost N.

A2 - Berthold, Michael R.

PB - Springer Verlag

ER -

Yang J, Parekh R, Honavar V, Dobbs D. Data-driven theory refinement using KBDistAl. In Hand DJ, Kok JN, Berthold MR, editors, Advances in Intelligent Data Analysis - 3rd International Symposium, IDA 1999, Proceedings. Springer Verlag. 1999. p. 331-342. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-48412-4_28