Dependent nearest neighbor (dNN) method for improving the performance of categorical data classification

Pangesti, Intan Adhelia and Rosadi, Dedi (2024) Dependent nearest neighbor (dNN) method for improving the performance of categorical data classification. In: 6th International Conference on Mathematics and Mathematics Education, ICM2E 2022, 3 September 2022 through 4 September 2022, Padang.

Full text not available from this repository. (Request a copy)

Abstract

Classification analysis is a method used to predict classes or categories based on data class that has been determined previously. The k Nearest Neighbor (kNN) method is one of the most widely used methods in classification analysis due to the ease and simplicity of the algorithm. This strategy, however, is not without flaws; the determination of k, which is difficult to determine, and the determination based on the value of k results in data being classified into a particular class, even though it has a long distance. The Dependent Nearest Neighbor (dNN) method is a method that determines the nearest neighbor based on similarities and dependencies. In the dNN method, the closest selected neighbor is a sample in the Dependency Region (DR). DR is an area formed from the parameters of the radius and an angle. This study compares the performance generated by kNN and dNN using three datasets. Based on the analysis that has been done, the accuracy produced by the dNN method is greater than the kNN method.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Mathematics and Natural Sciences > Mathematics Department
Depositing User: Ismu WIDARTO
Date Deposited: 03 Jun 2025 03:06
Last Modified: 03 Jun 2025 03:06
URI: https://ir.lib.ugm.ac.id/id/eprint/18719

Actions (login required)

View Item
View Item