Two New Distance Metrics For K Nearest Neighbor Algorithm
Publish place: Eighth Bioinformatics Conference of Iran
Publish Year: 1397
نوع سند: مقاله کنفرانسی
زبان: English
View: 355
نسخه کامل این Paper ارائه نشده است و در دسترس نمی باشد
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IBIS08_081
تاریخ نمایه سازی: 9 مرداد 1398
Abstract:
Many machine learning algorithms, for example K Nearest Neighbor (KNN), heavily depend on the distance metric for the input data points. Distance Metric learning is to learn a distance for the input space of data from a given set of similar/dissimilar points which preserves the distance relation among the training data. Emerging research demonstrates, both empirically and theoretically, that a learned metric can significantly affect the performance in classification and clustering tasks.Here we have introduced two novel distance metrics for KNN algorithm: Sobolev and Fisher metrics. We applied these new metrics on breast cancer data from repository of UCI . The performance based on the new distance metrics was better than the usual metrics, such as: Euclidean and Manhattan.
Keywords:
Authors
محسن ملاشاهی
۱گروه بیوانفورماتیک دانشکده فن آوری نوین دانشگاه زابل
رضوان احسانی
۲دانشگاه زابل