Fast Most Similar Neighbor (MSN) classifiers for Mixed Data

the k nearest neighbor (k-nn) classifier has been extensively used in pattern recognition because of its simplicity and its good performance. however, in large datasets applications, the exhaustive k-nn classifier becomes impractical. therefore, many fast k-nn classifiers have been developed; most of them rely on metric properties (usually the triangle inequality) to reduce the number of prototype comparisons. hence, the existing fast k-nn classifiers are applicable only when the comparison function is a metric (commonly for numerical data). however, in some sciences such as medicine, geology, sociology, etc., the prototypes are usually described by qualitative and quantitative features (mixed data). in these cases, the comparison function does not necessarily satisfy metric properties. for this reason, it is important to develop fast k most similar neighbor (k-msn) classifiers for mixed data, which use non metric comparisons functions. in this thesis, four fast k-msn classifiers, following the most successful approaches, are proposed. the experiments over different datasets show that the proposed classifiers significantly reduce the number of prototype comparisons.