Evolutionary Composite Attribute Clustering

  title={Evolutionary Composite Attribute Clustering},
  author={Tzung-Pei Hong and Wei-Ping Song and Chu-Tien Chiu},
  journal={2011 International Conference on Technologies and Applications of Artificial Intelligence},
In this paper, we propose a GA-based clustering method for composite-attribute clustering and feature selection. We have also designed a new chromosome representation, a fitness evaluation function, and an adjustment process in the proposed approach. Experimental results show that the proposed approach with composite attributes performs better than that without composite attributes. 
1 Citations
Efficient Learning for Clustering and Optimizing Context-Dependent Designs.
A dynamic sampling policy is developed to efficiently learn both the global information of each cluster and local information of every design for selecting the best designs in all contexts and achieves the asymptotically optimal sampling ratio. Expand


An evolutionary attribute clustering and selection method based on feature similarity
The previous GA-based clustering method for attribute clustering and feature selection is modified for a better execution performance based on feature similarity and feature dependence. Expand
Attribute Clustering in High Dimensional Feature Spaces
In this paper, we will do clustering for the attributes rather than the objects. Like the conventional clustering for objects, the attributes within the same cluster have high similarity, but withinExpand
An attribute clustering method based on genetic algorithms is proposed for feature selection and feature replacement that combines both the average accuracy of attribute substitution in clusters and the cluster balance as the fitness function. Expand
A rough sets based approach to feature selection
  • M. Zhang, J.T. Yao
  • Mathematics
  • IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04.
  • 2004
Feature selection techniques aim at reducing the number of unnecessary features in classification rules. The features are measured by their necessity in heuristic feature selection techniques. RoughExpand
Clustering with genetic algorithms
A merging operator is developed, which with elite selection, is employed to evolve an initial population with a large number of clusters toward better clusterings, and is more successful than optimisation methods such as simulated annealing. Expand
Efficient Feature Selection via Analysis of Relevance and Redundancy
It is shown that feature relevance alone is insufficient for efficient feature selection of high-dimensional data, and a new framework is introduced that decouples relevance analysis and redundancy analysis. Expand
An Introduction to Variable and Feature Selection
The contributions of this special issue cover a wide range of aspects of variable selection: providing a better definition of the objective function, feature construction, feature ranking, multivariate feature selection, efficient search methods, and feature validity assessment methods. Expand
Selection of Relevant Features and Examples in Machine Learning
This survey reviews work in machine learning on methods for handling data sets containing large amounts of irrelevant information and describes the advances that have been made in both empirical and theoretical work in this area. Expand
Some methods for classification and analysis of multivariate observations
The main purpose of this paper is to describe a process for partitioning an N-dimensional population into k sets on the basis of a sample. The process, which is called 'k-means,' appears to giveExpand
An Introduction to Genetic Algorithms.
An Introduction to Genetic Algorithms is one of the rare examples of a book in which every single page is worth reading. The author, Melanie Mitchell, manages to describe in depth many fascinatingExpand