A self-organizing neural tree for large-set pattern classification

Hee Heon Song, Seong Whan Lee

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

5 Citations (Scopus)

Abstract

Neural networks have been successfully applied to various pattern classification problems owing to their learning ability, high discrimination power, and excellent generalization ability. However, for the case of classifying patterns which are large-set and require complex decision boundaries in high-dimensional pattern space, the greater part of conventional neural networks suffer from some of difficult problems to solve, such as the structure and size of the network, the computational complexity, and so on. In this paper, to cope with these difficulties, we propose a new self-organizing neural tree and its learning algorithm. The basic idea is to partition pattern space hierarchically using the tree-structured network composed of subnetworks with topology-preserving mapping ability.

Original languageEnglish
Title of host publicationProceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995
PublisherIEEE Computer Society
Pages1111-1114
Number of pages4
ISBN (Electronic)0818671289
DOIs
Publication statusPublished - 1995 Jan 1
Event3rd International Conference on Document Analysis and Recognition, ICDAR 1995 - Montreal, Canada
Duration: 1995 Aug 141995 Aug 16

Publication series

NameProceedings of the International Conference on Document Analysis and Recognition, ICDAR
Volume2
ISSN (Print)1520-5363

Conference

Conference3rd International Conference on Document Analysis and Recognition, ICDAR 1995
CountryCanada
CityMontreal
Period95/8/1495/8/16

Fingerprint

Pattern recognition
Neural networks
Learning algorithms
Computational complexity
Topology

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Cite this

Song, H. H., & Lee, S. W. (1995). A self-organizing neural tree for large-set pattern classification. In Proceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995 (pp. 1111-1114). [602110] (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR; Vol. 2). IEEE Computer Society. https://doi.org/10.1109/ICDAR.1995.602110

A self-organizing neural tree for large-set pattern classification. / Song, Hee Heon; Lee, Seong Whan.

Proceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995. IEEE Computer Society, 1995. p. 1111-1114 602110 (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR; Vol. 2).

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

Song, HH & Lee, SW 1995, A self-organizing neural tree for large-set pattern classification. in Proceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995., 602110, Proceedings of the International Conference on Document Analysis and Recognition, ICDAR, vol. 2, IEEE Computer Society, pp. 1111-1114, 3rd International Conference on Document Analysis and Recognition, ICDAR 1995, Montreal, Canada, 95/8/14. https://doi.org/10.1109/ICDAR.1995.602110
Song HH, Lee SW. A self-organizing neural tree for large-set pattern classification. In Proceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995. IEEE Computer Society. 1995. p. 1111-1114. 602110. (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR). https://doi.org/10.1109/ICDAR.1995.602110
Song, Hee Heon ; Lee, Seong Whan. / A self-organizing neural tree for large-set pattern classification. Proceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995. IEEE Computer Society, 1995. pp. 1111-1114 (Proceedings of the International Conference on Document Analysis and Recognition, ICDAR).
@inproceedings{5caa02f43dbc4745badef1ac295cd7d5,
title = "A self-organizing neural tree for large-set pattern classification",
abstract = "Neural networks have been successfully applied to various pattern classification problems owing to their learning ability, high discrimination power, and excellent generalization ability. However, for the case of classifying patterns which are large-set and require complex decision boundaries in high-dimensional pattern space, the greater part of conventional neural networks suffer from some of difficult problems to solve, such as the structure and size of the network, the computational complexity, and so on. In this paper, to cope with these difficulties, we propose a new self-organizing neural tree and its learning algorithm. The basic idea is to partition pattern space hierarchically using the tree-structured network composed of subnetworks with topology-preserving mapping ability.",
author = "Song, {Hee Heon} and Lee, {Seong Whan}",
year = "1995",
month = "1",
day = "1",
doi = "10.1109/ICDAR.1995.602110",
language = "English",
series = "Proceedings of the International Conference on Document Analysis and Recognition, ICDAR",
publisher = "IEEE Computer Society",
pages = "1111--1114",
booktitle = "Proceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995",

}

TY - GEN

T1 - A self-organizing neural tree for large-set pattern classification

AU - Song, Hee Heon

AU - Lee, Seong Whan

PY - 1995/1/1

Y1 - 1995/1/1

N2 - Neural networks have been successfully applied to various pattern classification problems owing to their learning ability, high discrimination power, and excellent generalization ability. However, for the case of classifying patterns which are large-set and require complex decision boundaries in high-dimensional pattern space, the greater part of conventional neural networks suffer from some of difficult problems to solve, such as the structure and size of the network, the computational complexity, and so on. In this paper, to cope with these difficulties, we propose a new self-organizing neural tree and its learning algorithm. The basic idea is to partition pattern space hierarchically using the tree-structured network composed of subnetworks with topology-preserving mapping ability.

AB - Neural networks have been successfully applied to various pattern classification problems owing to their learning ability, high discrimination power, and excellent generalization ability. However, for the case of classifying patterns which are large-set and require complex decision boundaries in high-dimensional pattern space, the greater part of conventional neural networks suffer from some of difficult problems to solve, such as the structure and size of the network, the computational complexity, and so on. In this paper, to cope with these difficulties, we propose a new self-organizing neural tree and its learning algorithm. The basic idea is to partition pattern space hierarchically using the tree-structured network composed of subnetworks with topology-preserving mapping ability.

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

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

U2 - 10.1109/ICDAR.1995.602110

DO - 10.1109/ICDAR.1995.602110

M3 - Conference contribution

T3 - Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

SP - 1111

EP - 1114

BT - Proceedings of the 3rd International Conference on Document Analysis and Recognition, ICDAR 1995

PB - IEEE Computer Society

ER -