Abstract. Instance-based learning methods such as the nearest neigh-bor classifier have proven to perform well in pattern classification in sev-eral fields. Despite their high classification accuracy, they suffer from a high storage requirement, computational cost, and sensitivity to noise. In this paper, we present a data reduction method for instance-based learn-ing, based on entropy-based partitioning and representative instances. Experimental results show that the new algorithm achieves a high data reduction rate as well as classification accuracy.
This dissertation introduces a framework for specifying instance-based algorithms that can solve sup...
The paper proposes a heuristic instance reduction algorithm as an approach to machine learning and k...
Instance-based learning (IBL) methods predict the class label of a new instance based directly on th...
Storing and using specific instances improves the performance of several supervised learning algorit...
Several published results show that instance-based learning algorithms record high classification ac...
The use of entropy as a distance measure has several benefits. Amongst other things it provides a co...
The goal of our research is to understand the power and appropriateness of instance-based representa...
The nearest neighbor algorithm and its derivatives are often quite successful at learning a concept ...
Following basic principles of information-theoretic learning, in this paper, we propose a novel appr...
Instance-based learning is a machine learning method that classifies new examples by comparing them ...
ii Instance-based learning is a machine learning method that classifies new examples by comparing th...
In this paper, entropy term is used in the learning phase of a neural network. As learning progresse...
The basic nearest-neighbor rule generalizes well in many domains but has several shortcomings, inclu...
Classification is a machine learning technique whose objective is the prediction of the class member...
Instance-based learning algorithms make prediction/generalization based on the stored instances. Sto...
This dissertation introduces a framework for specifying instance-based algorithms that can solve sup...
The paper proposes a heuristic instance reduction algorithm as an approach to machine learning and k...
Instance-based learning (IBL) methods predict the class label of a new instance based directly on th...
Storing and using specific instances improves the performance of several supervised learning algorit...
Several published results show that instance-based learning algorithms record high classification ac...
The use of entropy as a distance measure has several benefits. Amongst other things it provides a co...
The goal of our research is to understand the power and appropriateness of instance-based representa...
The nearest neighbor algorithm and its derivatives are often quite successful at learning a concept ...
Following basic principles of information-theoretic learning, in this paper, we propose a novel appr...
Instance-based learning is a machine learning method that classifies new examples by comparing them ...
ii Instance-based learning is a machine learning method that classifies new examples by comparing th...
In this paper, entropy term is used in the learning phase of a neural network. As learning progresse...
The basic nearest-neighbor rule generalizes well in many domains but has several shortcomings, inclu...
Classification is a machine learning technique whose objective is the prediction of the class member...
Instance-based learning algorithms make prediction/generalization based on the stored instances. Sto...
This dissertation introduces a framework for specifying instance-based algorithms that can solve sup...
The paper proposes a heuristic instance reduction algorithm as an approach to machine learning and k...
Instance-based learning (IBL) methods predict the class label of a new instance based directly on th...