@inproceedings{07a677503f614075a3187e16e800d066,
title = "Classification using normalized compression distance",
abstract = "Classification algorithms that use the NCD (Normalized Compression Distance) as a similarity metric are proposed. This way of measuring similarity allows either skipping the feature selection and feature extraction phases or extracting features in a more objective way than common feature extraction methods, and so makes the classification algorithms less biased This work consists of several classification experiments of images, voice samples and ECG signals using a weighted k nearest neighbor algorithm and support vector machines. Our results are comparative to those achieved by more complicated, parameter laden learning algorithms that do use feature selection and extraction.",
keywords = "Classification, Compression, Feature selection, Similarity",
author = "Uri Shaham and Yael Edan",
year = "2008",
language = "אנגלית",
isbn = "9781615677184",
series = "International Conference on Artificial Intelligence and Pattern Recognition 2008, AIPR 2008",
pages = "63--69",
booktitle = "International Conference on Artificial Intelligence and Pattern Recognition 2008, AIPR 2008",
note = "2008 International Conference on Artificial Intelligence and Pattern Recognition 2008, AIPR 2008 ; Conference date: 07-07-2008 Through 10-07-2008",
}