DocumentCode
2806237
Title
CSOM: self-organizing map for continuous data
Author
Hadzic, Fedja ; Dillon, Tharam S.
Author_Institution
Fac. of Inf. Technol., Univ. of Technol., Sydney, NSW, Australia
fYear
2005
fDate
10-12 Aug. 2005
Firstpage
740
Lastpage
745
Abstract
Nowadays, lots of data is being collected for different industrial and commercial purposes, where the aim is to discover useful patterns from data which leads to discovery of valuable domain knowledge. Unsupervised learning is a useful method for these tasks as it requires no target class and it clusters the feature values that occur frequently together. Clustering methods have been successfully used for this task due to the powerful property of creating spatial representations of the features and the abstractions detected from the input space. Self-organising map (SOM) is one of the most popular clustering techniques where abstractions are formed by mapping high dimensional input patterns into a lower dimensional set of output clusters. Most of the current uses of SOM for this task concentrated on clustering categorical features. fn this paper we present a new learning mechanism for self-organizing map which is useful when the aim is to extract patterns from a data set characterized by continuous input features. Furthermore the method used for network pruning and rule optimization is described.
Keywords
data mining; pattern clustering; self-organising feature maps; unsupervised learning; categorical feature clustering; clustering method; continuous data; knowledge discovery; network pruning; pattern extraction; rule optimization; self-organizing map; unsupervised learning; Accuracy; Clustering methods; Costs; Data mining; Humans; Learning systems; Neural networks; Neurons; Optimization methods; Unsupervised learning;
fLanguage
English
Publisher
ieee
Conference_Titel
Industrial Informatics, 2005. INDIN '05. 2005 3rd IEEE International Conference on
Print_ISBN
0-7803-9094-6
Type
conf
DOI
10.1109/INDIN.2005.1560466
Filename
1560466
Link To Document