ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
GA-facilitated classifier optimization with varying similarity measures
Full text PdfPdf (82 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 2005 conference on Genetic and evolutionary computation table of contents
Washington DC, USA
POSTER SESSION: Genetic algorithms table of contents
Pages: 1549 - 1550  
Year of Publication: 2005
ISBN:1-59593-010-8
Authors
Michael R. Peterson  Wright State University, Dayton, OH
Travis E. Doom  Wright State University, Dayton, OH
Michael L. Raymer  Wright State University, Dayton, OH
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 24,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1068009.1068253
What is a DOI?

ABSTRACT

Genetic algorithms are powerful tools for k-nearest neighbors classification. Traditional knn classifiers employ Euclidian distance to assess neighbor similarity, though other measures may also be used. GAs can search for optimal linear weights of features to improve knn performance using both Euclidian distance and cosine similarity. GAs also optimize additive feature offsets in search of an optimal point of reference for assessing angular similarity using the cosine measure. This poster explores weight and offset optimization for knn with varying similarity measures, including Euclidian distance (weights only), cosine similarity, and Pearson correlation. The use of offset optimization here represents a novel technique for enhancing Pearson/knn classification performance. Experiments compare optimized and non-optimized classifiers using public domain datasets. While unoptimized Euclidian knn often outperforms its cosine and Pearson counterparts, optimized Pearson and cosine knn classifiers show equal or improved accuracy compared to weight-optimized Euclidian knn.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. P. S. Brown, W. N. Grundy, D. Lin, N. Cristianini, C. W. Sugnet, T. S. Furey, M. A. Jr., and D. Haussler. Knowledge-based analysis of microarray gene expression data by using support vector machines. Proceedings of the National Academy of Science, 97:262--267, 2000.
 
2
 
3
M. R. Peterson, T. E. Doom, and M. L. Raymer. Ga-facilitated knowledge discovery and pattern recognition optimization applied to the biochemistry of protein solvation. In GECCO 2004 Proceedings, LNCS 3102, pages 426--437, 2004.
 
4
M. L. Raymer, W. F. Punch, E. D. Goodman, L. A. Kuhn, and A. K. Jain. Dimensionality reduction using genetic algorithms. IEEE Trans Evol. Comp., 4(5):164--171, 2000.
 
5


Collaborative Colleagues:
Michael R. Peterson: colleagues
Travis E. Doom: colleagues
Michael L. Raymer: colleagues