Modified adaptive resonance theory network for mixed data based on distance hierarchy

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Clustering of data is a fundamental data analysis step that has been widely studied across in data mining. Adaptive resonance theory network (ART) is an important algorithm in Clustering. ART is also very popular in the unsupervised neural network. Type I adaptive resonance theory network (ART1) deals with the binary numerical data, whereas type II adaptive resonance theory network (ART2) deals with the general numerical data. Several information systems collect the mixing type attitudes, which included numeric attributes and categorical attributes. However, ART1 and ART2 do not deal with mixed data. If the categorical data attributes are transferred to the binary data format, the binary data do not reflect the similar degree. It influences the clustering quality. Therefore, this paper proposes a modified adaptive resonance theory network (M-ART) and the conceptual hierarchy tree to solve similar degrees of mixed data. This paper utilizes artificial simulation materials and collects a piece of actual data about the family income to do experiments. The results show that the M-ART algorithm can process the mixed data and has a great effect on clustering. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Hsu, C. C., Huang, Y. P., & Hsiao, C. M. (2006). Modified adaptive resonance theory network for mixed data based on distance hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3994 LNCS-IV, pp. 757–764). Springer Verlag. https://doi.org/10.1007/11758549_102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free