Image segmentation is very essential and critical to image processing and pattern recognition. This survey provides a summary of color image segmentation techniques available now. Basically, color segmentation approaches are based on monochrome segmentation approaches operating in di erent color spaces. Therefore, we rst discuss the major segmentation approaches for segmenting monochrome images: histogram thresholding, characteristic feature clustering, edge detection, region-based methods, fuzzy techniques, neural networks, etc. � then review some major color representation methods and their advantages/disadvantages� nally summarize the color image segmentation techniques using di erent color representations. The usage of color models for image segmentation is also discussed. Some novel approaches such as fuzzy method and physics based method are investigated as well.

Several methods to visualize clusters in high-dimensional data sets using the Self-Organizing Map (SOM) have been proposed. However, most of these methods only focus on the information extracted from the model vectors of the SOM. This paper introduces a novel method to visualize the clusters of a SOM based on smoothed data histograms. The method is illustrated using a simple 2-dimensional data set and similarities to other SOM based visualizations and to the posterior probability distribution of the Generative Topographic Mapping are discussed. Furthermore, the method is evaluated on a real world data set consisting of pieces of music.

The present article provides a survey of the available literature on data mining using soft computing. A categorization has been provided based on the different soft computing tools and their hybridizations used, the data mining function implemented, and the preference criterion selected by the model. The utility of the different soft computing methodologies is highlighted. Generally fuzzy sets are suitable for handling the issues related to understandability of patterns, incomplete/noisy data, mixed media information and human interaction, and can provide approximate solutions faster. Neural networks are nonparametric, robust, and exhibit good learning and generalization capabilities in data-rich environments. Genetic algorithms provide efficient search algorithms to select a model, from mixed media data, based on some preference criterion/objective function. Rough sets are suitable for handling different types of uncertainty in data. Some challenges to data mining and the application of soft computing methodologies are indicated. An extensive bibliography is also included.

learning is proposed. It makes use of a multiobjective genetic algorithm where the minimization of the number of features and a validity index that measures the quality of clusters have been used to guide the search towards the more discriminant features and the best number of clusters. The proposed strategy is evaluated using two synthetic data sets and then it is applied to handwritten month word recognition. Comprehensive experiments demonstrate the feasibility and efficiency of the proposed methodology.

Today's information appliances appear very powerful, featuring on-device storage and processing power, communication technology and supporting many different applications. Context awareness is currently considered as one of the key issues for future device generations, with context prediction being the next step in research. The goal is not only to recognize the current context of an information appliance or its user, but also to predict the future context and thus enable the device to become proactive. In this paper, an approach to recognize and predict high level context information from low level sensor data is presented. Targeting a wide range of platforms, this approach has also been implemented in a software framework for on-line, un-supervised context prediction.

Self-Organizing Maps (SOMs) are a prominent tool for exploratory data analysis. One core task within the utilization of SOMs is the identification of the cluster structure on the map for which several visualization methods have been proposed, yet different application domains may require additional representation of the cluster structure. In this paper, we propose such a method based on pairwise distance calculation. It can be plotted on top of the map lattice with arrows that point to the closest cluster center. A parameter is provided that determines the granularity of the clustering. We provide experimental results and discuss the general applicability of our method, along with a comparison to related techniques.

Abstract not found

Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power available nowadays. Several visualization techniques have been developed to study the cluster structure of data, i.e., the existence of distinctive groups in the data and how these clusters are related to each other. However, only few of these techniques lend themselves to studying how this structure changes if the features describing the data are changed. Understanding this relationship between the features and the cluster structure means understanding the features themselves and is thus a useful tool in the feature extraction phase. In this paper we present a novel approach to visualizing how modification of the features with respect to weighting or normalization changes the clusters structure. We demonstrate the application of our approach in two music related data mining projects.

The Self-Organizing Map (SOM) is an efficient tool for visualization and clustering of multidimensional data. It transforms the input vectors on two-dimensional grid of prototype vectors and orders them. The ordered prototype vectors are easier to visualize and explore than the original data. Mobile networks produce a huge amount of spatiotemporal data. The data consists of parameters of base stations (BS) and quality information of calls. There are two alternatives in starting the data analysis. We can build either a general one-cell-model trained using state vectors from all cells, or a model of the network using state vectors with parameters from all mobile cells. In both methods, further analysis is needed to understand the reasons for various operational states of the entire network. 1

The Self-Organizing Map (SOM) is a powerful tool for exploratory data analysis which has been employed in a wide range of data mining applications. We present a novel approach...