Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks

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

8 Citations (Scopus)

Abstract

In this paper, we address computational complexity issues of decompositional approaches to if-then rule extraction from feed-forward neural networks. We also introduce a computationally efficient technique based on ordered-attributes. It reduces search space significantly and finds valid and general rules for single nodes in the networks. Empirical results are shown.

Original languageEnglish
Title of host publicationDiscovery Science - 3rd International Conference, DS 2000, Proceedings
PublisherSpringer Verlag
Pages170-181
Number of pages12
Volume1967
ISBN (Print)9783540413523
Publication statusPublished - 2000
Event3rd International Conference on Discovery Science, DS 2000 - Kyoto, Japan
Duration: 2000 Dec 42000 Dec 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1967
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Conference on Discovery Science, DS 2000
CountryJapan
CityKyoto
Period00/12/400/12/6

Fingerprint

Rule Extraction
Feedforward neural networks
Feedforward Neural Networks
Search Space
Computational complexity
Computational Complexity
Attribute
Heuristics
Valid
Vertex of a graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kim, H. (2000). Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks. In Discovery Science - 3rd International Conference, DS 2000, Proceedings (Vol. 1967, pp. 170-181). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1967). Springer Verlag.

Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks. / Kim, Hyeoncheol.

Discovery Science - 3rd International Conference, DS 2000, Proceedings. Vol. 1967 Springer Verlag, 2000. p. 170-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1967).

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

Kim, H 2000, Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks. in Discovery Science - 3rd International Conference, DS 2000, Proceedings. vol. 1967, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1967, Springer Verlag, pp. 170-181, 3rd International Conference on Discovery Science, DS 2000, Kyoto, Japan, 00/12/4.
Kim H. Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks. In Discovery Science - 3rd International Conference, DS 2000, Proceedings. Vol. 1967. Springer Verlag. 2000. p. 170-181. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kim, Hyeoncheol. / Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks. Discovery Science - 3rd International Conference, DS 2000, Proceedings. Vol. 1967 Springer Verlag, 2000. pp. 170-181 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0433dee832db403798591757523e0243,
title = "Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks",
abstract = "In this paper, we address computational complexity issues of decompositional approaches to if-then rule extraction from feed-forward neural networks. We also introduce a computationally efficient technique based on ordered-attributes. It reduces search space significantly and finds valid and general rules for single nodes in the networks. Empirical results are shown.",
author = "Hyeoncheol Kim",
year = "2000",
language = "English",
isbn = "9783540413523",
volume = "1967",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "170--181",
booktitle = "Discovery Science - 3rd International Conference, DS 2000, Proceedings",

}

TY - GEN

T1 - Computationally efficient heuristics for if-then rule extraction from feed-forward neural networks

AU - Kim, Hyeoncheol

PY - 2000

Y1 - 2000

N2 - In this paper, we address computational complexity issues of decompositional approaches to if-then rule extraction from feed-forward neural networks. We also introduce a computationally efficient technique based on ordered-attributes. It reduces search space significantly and finds valid and general rules for single nodes in the networks. Empirical results are shown.

AB - In this paper, we address computational complexity issues of decompositional approaches to if-then rule extraction from feed-forward neural networks. We also introduce a computationally efficient technique based on ordered-attributes. It reduces search space significantly and finds valid and general rules for single nodes in the networks. Empirical results are shown.

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

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

M3 - Conference contribution

AN - SCOPUS:84974666259

SN - 9783540413523

VL - 1967

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

SP - 170

EP - 181

BT - Discovery Science - 3rd International Conference, DS 2000, Proceedings

PB - Springer Verlag

ER -