Dimensionality reduction via genetic value clustering

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and machine learning applications. We present a family of genetic algorithms for feature synthesis through clustering of discrete attribute values. The approach uses new compact graph-based encoding for cluster representation, where size of GA search space is reduced exponentially with respect to the number of items in partitioning, as compared to original idea of Park and Song. We apply developed algorithms and study their effectiveness for DNA fingerprinting in population genetics and text categorization. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Topchy, A., & Punch, W. (2003). Dimensionality reduction via genetic value clustering. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2724, 1431–1443. https://doi.org/10.1007/3-540-45110-2_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free