K-Nearest Neighbor Classification Based on Semantic Distance
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Most research on distance metric of kNN classification is focused on how to integrate the differences caused by various attributes, and the semantic difference between values of the same attribute is ignored. In addition, classification accuracy of the traditional approaches is very sensitive to the incomplete data described on different abstract levels. In this paper, a novel kNN approach based on semantic distance——SDkNN (semantic distance based k-nearest neighbor) is presented, which solves the two problems mentioned above. This approach analyzes the semantic difference between values of an attribute and presents how to calculate the semantic distance based on domain ontologies, and the semantic distance is then used to improve the traditional kNN methods. Experiments on the UCI (University of California, Irvine) machine learning repository and real application datasets show that the overall performance of SDkNN outperforms the traditional one, especially when the data is incomplete. SDkNN also has the desirable application value in practice.

    Reference
    Related
    Cited by
Get Citation

杨立,左春,王裕国.基于语义距离的K-最近邻分类方法.软件学报,2005,16(12):2054-2062

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 09,2004
  • Revised:January 24,2005
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063