Incremental clustering of mixed data based on distance hierarchy

被引:42
作者
Hsu, Chung-Chian [1 ]
Huang, Yan-Ping [1 ,2 ]
机构
[1] Natl Yunlin Univ Sci & Technol, Dept Informat Management, Yunlin, Taiwan
[2] Chin Min Inst Technol, Dept Informat Management, Toufen, Taiwan
关键词
adaptive resonance theory networks; conceptual hierarchy; clustering algorithm; unsupervised neural network; data mining;
D O I
10.1016/j.eswa.2007.08.049
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering is an important function in data mining. Its typical application includes the analysis of consumer's materials. Adaptive resonance theory network (ART) is 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. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1177 / 1185
页数:9
相关论文
共 26 条