CSOM: self-organizing map for continuous data
Access Status
Authors
Date
2005Type
Metadata
Show full item recordCitation
Source Title
Source Conference
ISBN
Collection
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.
Related items
Showing items related by title, author, creator and subject.
-
Zhu, Dengya (2010)Web search results are far from perfect due to the polysemous and synonymous characteristics of nature languages, information overload as the results of information explosion on the Web, and the flat list, “one size fits ...
-
Li, Q.; Ren, Y.; Li, L.; Liu, Wan-Quan (2016)Spectral clustering makes use of spectral-graph structure of an affinity matrix to partition data into disjoint meaningful groups. It requires robust and appropriate affinity graphs as input in order to form clusters with ...
-
Phung, D.; Vo, Ba-Ngu (2014)The goal of data clustering is to partition data points into groups to optimize a given objective function. While most existing clustering algorithms treat each data point as vector, in many applications each datum is not ...