Using Hellinger distance in a nearest neighbour classifier for relational databases Export

@article{citeulike:2386555, abstract = {Nearest neighbour algorithms classify a previously unseen input case by finding similar cases to make predictions about the unknown features of the input case. The usefulness of the nearest neighbour algorithms has been demonstrated in many real-world domains. Unfortunately, most of the similarity measures discussed in the current nearest neighbour learning literature handle only limited data types, thus limiting their applicability to relational database applications. In this paper, we propose an enhanced nearest neighbour learning algorithm that is applicable to relational databases. The proposed method allows one to define similarity on a wide spectrum of attribute types. It automatically assigns to each attribute a weight of its importance with respect to the target attribute. The method has been implemented as a computer program and its effectiveness has been tested on four publicly available machine learning databases. Its performance is compared to another well-known machine learning method, C4.5. Our experimentation with the system demonstrates that the classification accuracy of the proposed system was superior to that of C4.5 in most cases.}, author = {Lee, Chang-Hwan and Shin, Dong-Guk}, citeulike-article-id = {2386555}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0950-7051(99)00041-6}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V0P-3XT0F00-4/2/0ae161fc36b02ec17765a2492fc2ba60}, doi = {10.1016/S0950-7051(99)00041-6}, journal = {Knowledge-Based Systems}, keywords = {hellingerdistance}, month = {November}, number = {7}, pages = {363--370}, posted-at = {2008-02-15 15:13:57}, priority = {3}, title = {Using Hellinger distance in a nearest neighbour classifier for relational databases}, url = {http://dx.doi.org/10.1016/S0950-7051(99)00041-6}, volume = {12}, year = {1999} }

TY - JOUR ID - citeulike:2386555 L3 - citeulike-article-id:2386555 N2 - Nearest neighbour algorithms classify a previously unseen input case by finding similar cases to make predictions about the unknown features of the input case. The usefulness of the nearest neighbour algorithms has been demonstrated in many real-world domains. Unfortunately, most of the similarity measures discussed in the current nearest neighbour learning literature handle only limited data types, thus limiting their applicability to relational database applications. In this paper, we propose an enhanced nearest neighbour learning algorithm that is applicable to relational databases. The proposed method allows one to define similarity on a wide spectrum of attribute types. It automatically assigns to each attribute a weight of its importance with respect to the target attribute. The method has been implemented as a computer program and its effectiveness has been tested on four publicly available machine learning databases. Its performance is compared to another well-known machine learning method, C4.5. Our experimentation with the system demonstrates that the classification accuracy of the proposed system was superior to that of C4.5 in most cases. IS - 7 JF - Knowledge-Based Systems EP - 370 TI - Using Hellinger distance in a nearest neighbour classifier for relational databases VL - 12 SP - 363 KW - hellingerdistance AU - Lee, Chang-Hwan AU - Shin, Dong-Guk PY - 1999/11// UR - http://dx.doi.org/10.1016/S0950-7051(99)00041-6 ER -