Nominal feature is one type of symbolic features, whose feature values are completely unordered. The most often used existing similarity metrics for symbolic features is the Hamming metric, where similarity computation is coarse-grained and may affect the performance of case retrieval and then the classification accuracy. This paper presents a GA-based approach for learning similarity measure of nominal features for CBR classifiers. Based on the learned similarities, the classification accuracy can be improved, and the importance of each nominal feature can be analyzed to enhance the understanding of the used data sets.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||1st International Conference on Pattern Recognition and Machine Intelligence, PReMI 2005|
|Period||20/12/05 → 22/12/05|
- Theoretical Computer Science
- Computer Science(all)