Feature-weighted CBR with neural network for symbolic features

Sang Chan Park, Jun Woo Kim, Kwang Hyuk Im

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

Case-based reasoning (CBR) is frequently applied to data mining with various objectives. Unfortunately, it suffers from the feature weighting problem. In this framework, similar case retrieval plays an important role, and the k-nearest neighbor (k-nn) method or its variants are widely used as the retrieval mechanism. However, the most important assumption of k-nn is that all of the features presented are equally important, which is not true in many practical applications. Many variants of k-nn have been proposed to assign higher weights to the more relevant features for case retrieval. Though many feature-weighted variants of k-nn have been reported to improve its retrieval accuracy on some tasks, few have been used in conjunction with the neural network learning. We propose CANSY, a feature-weighted CBR with neural network for symbolic features.

Original languageEnglish
Title of host publicationInternational Conference on Intelligent Computing, ICIC 2006, Proceedings
PublisherSpringer Verlag
Pages1012-1020
Number of pages9
ISBN (Print)3540372717, 9783540372714
DOIs
Publication statusPublished - 2006
EventInternational Conference on Intelligent Computing, ICIC 2006 - Kunming, China
Duration: 16 Aug 200619 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4113 LNCS - I
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Intelligent Computing, ICIC 2006
Country/TerritoryChina
CityKunming
Period16/08/0619/08/06

Fingerprint

Dive into the research topics of 'Feature-weighted CBR with neural network for symbolic features'. Together they form a unique fingerprint.

Cite this