A nearest features classifier using a self-organizing map for memory base evaluation

Authors:
Christos Pateritsas;Andreas Stafylopatis
Affiliations:
School of Electrical and Computer Engineering, National Technical University of Athens, Zografou, Athens, Greece;School of Electrical and Computer Engineering, National Technical University of Athens, Zografou, Athens, Greece
Venue:
ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part II
Year:
2006

Citing 12
Cited 1

Toward memory-based reasoning

Communications of the ACM - Special issue on parallelism
Instance-Based Learning Algorithms

Machine Learning
A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features

Machine Learning
Self-organizing maps

Self-organizing maps
Reduction Techniques for Instance-BasedLearning Algorithms

Machine Learning
Classification by Voting Feature Intervals

ECML '97 Proceedings of the 9th European Conference on Machine Learning
Weighting Features

ICCBR '95 Proceedings of the First International Conference on Case-Based Reasoning Research and Development
Proportional k-Interval Discretization for Naive-Bayes Classifiers

EMCL '01 Proceedings of the 12th European Conference on Machine Learning
A Bayesian approach to use emerging patterns for classification

ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Combining a self-organising map with memory-based learning

ConLL '01 Proceedings of the 2001 workshop on Computational Natural Language Learning - Volume 7
Independent Nearest Features Memory-Based Classifier

CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-2 (CIMCA-IAWTIC'06) - Volume 02
Improved heterogeneous distance functions

Journal of Artificial Intelligence Research

Modeling interestingness of streaming association rules as a benefit-maximizing classification problem

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Memory base learning is one of main fields in the area of machine learning. We propose a new methodology for addressing the classification task that relies on the main idea of the k – nearest neighbors algorithm, which is the most important representative of this field. In the proposed approach, given an unclassified pattern, a set of neighboring patterns is found, but not necessarily using all input feature dimensions. Also, following the concept of the naïve Bayesian classifier, we adopt the hypothesis of the independence of input features in the outcome of the classification task. The two concepts are merged in an attempt to take advantage of their good performance features. In order to further improve the performance of our approach, we propose a novel weighting scheme of the memory base. Using the self-organizing maps model during the execution of the algorithm, dynamic weights of the memory base patterns are produced. Experimental results have shown superior performance of the proposed method in comparison with the aforementioned algorithms and their variations.