Computing Optimal Attribute Weight Settings for Nearest NeighborAlgorithms
Artificial Intelligence Review - Special issue on lazy learning
Artificial Intelligence Review - Special issue on lazy learning
A Multistrategy Approach to Relational Knowledge Discovery inDatabases
Machine Learning - Special issue on multistrategy learning
Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
Incremental Iterative Retrieval and Browsingfor Efficient Conversational CBR Systems
Applied Intelligence
On Comparing Classifiers: Pitfalls toAvoid and a Recommended Approach
Data Mining and Knowledge Discovery
A Survey of Methods for Scaling Up Inductive Algorithms
Data Mining and Knowledge Discovery
Relational Instance-Based Learning with Lists and Terms
Machine Learning
GD: A Measure Based on Information Theory for Attribute Selection
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
Learning Patterns in Multidimensional Space Using Interval Algebra
AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Case Library Reduction Applied to Pile Foundations
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
Identifying and Eliminating Irrelevant Instances Using Information Theory
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
From Theoretical Learnability to Statistical Measures of the Learnable
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
Probability Based Metrics for Nearest Neighbor Classification and Case-Based Reasoning
ICCBR '99 Proceedings of the Third International Conference on Case-Based Reasoning and Development
Data mining tasks and methods: scalability
Handbook of data mining and knowledge discovery
A comparative assessment of classification methods
Decision Support Systems
DeEPs: A New Instance-Based Lazy Discovery and Classification System
Machine Learning
Retrieval strategies for case-based reasoning: a categorised bibliography
The Knowledge Engineering Review
Intelligent decision support for protein crystal growth
IBM Systems Journal - Deep computing for the life sciences
Data Mining for Case-Based Reasoning in High-Dimensional Biological Domains
IEEE Transactions on Knowledge and Data Engineering
Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation
International Journal of Approximate Reasoning
Automatic hardware implementation tool for a discrete Adaboost-based decision algorithm
EURASIP Journal on Applied Signal Processing
Weighted Instance Typicality Search (WITS): A nearest neighbor data reduction algorithm
Intelligent Data Analysis
Prototype induction and attribute selection via evolutionary algorithms
Intelligent Data Analysis
Expert Systems with Applications: An International Journal
A version of the NGE model suitable for fuzzy domains
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Local distance-based classification
Knowledge-Based Systems
Construction of supervised and unsupervised learning systems for multilingual text categorization
Expert Systems with Applications: An International Journal
The application of SOM as a decision support tool to identify AACSB peer schools
Decision Support Systems
Rough Ensemble Classifier: A Comparative Study
WILF '09 Proceedings of the 8th International Workshop on Fuzzy Logic and Applications
A constructivist approach to machine translation
NeMLaP3/CoNLL '98 Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning
An integrated framework for learning and reasoning
Journal of Artificial Intelligence Research
Improved heterogeneous distance functions
Journal of Artificial Intelligence Research
Rule induction and instance-based learning a unified approach
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Improving similarity assessment with entropy-based local weighting
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
Empirical evaluation of the difficulty of finding a good value of k for the nearest neighbor
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Modification of nested hyperrectangle exemplar as a proposition of information fusion method
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Applying electromagnetism-like mechanism for feature selection
Information Sciences: an International Journal
Evolutionary selection of hyperrectangles in nested generalized exemplar learning
Applied Soft Computing
A preliminary study on the selection of generalized instances for imbalanced classification
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
Incremental learning with multi-level adaptation
Neurocomputing
Evolutionary-based selection of generalized instances for imbalanced classification
Knowledge-Based Systems
Right of inference: nearest rectangle learning revisited
ECML'06 Proceedings of the 17th European conference on Machine Learning
An ensemble of case-based classifiers for high-dimensional biological domains
ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
Rule extraction from trained support vector machines
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Experimental comparison of parametric, non-parametric, and hybrid multigroup classification
Expert Systems with Applications: An International Journal
Active refinement of clone anomaly reports
Proceedings of the 34th International Conference on Software Engineering
Ubiquitous positioning: integrated GPS/Wireless LAN positioning for wheelchair navigation system
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
An efficient construction and application usefulness of rectangle greedy covers
Pattern Recognition
Classifying negative and positive points by optimal box clustering
Discrete Applied Mathematics
Large margin principle in hyperrectangle learning
Neurocomputing
Hi-index | 0.00 |
Algorithms based on Nested Generalized Exemplar (NGE) theory (Salzberg, 1991) classify new data points by computing their distance to the nearest “generalized exemplar” (i.e., either a point or an axis-parallel rectangle). They combine the distance-based character of nearest neighbor (NN) classifiers with the axis-parallel rectangle representation employed in many rule-learning systems. An implementation of NGE was compared to the k-nearest neighbor (kNN) algorithm in 11 domains and found to be significantly inferior to kNN in 9 of them. Several modifications of NGE were studied to understand the cause of its poor performance. These show that its performance can be substantially improved by preventing NGE from creating overlapping rectangles, while still allowing complete nesting of rectangles. Performance can be further improved by modifying the distance metric to allow weights on each of the features (Salzberg, 1991). Best results were obtained in this study when the weights were computed using mutual information between the features and the output class. The best version of NGE developed is a batch algorithm (BNGE FWMI) that has no user-tunable parameters. BNGE FWMI's performance is comparable to the first-nearest neighbor algorithm (also incorporating feature weights). However, the k-nearest neighbor algorithm is still significantly superior to BNGE FWMI in 7 of the 11 domains, and inferior to it in only 2. We conclude that, even with our improvements, the NGE approach is very sensitive to the shape of the decision boundaries in classification problems. In domains where the decision boundaries are axis-parallel, the NGE approach can produce excellent generalization with interpretable hypotheses. In all domains tested, NGE algorithms require much less memory to store generalized exemplars than is required by NN algorithms.