(Enter summary)
Abstract: With the goal of reducing computational costs
without sacrificing accuracy, we describe two algorithms
to find sets of prototypes for nearest
neighbor classification. Here, the term "prototypes
" refers to the reference instances used in
a nearest neighbor computation --- the instances
with respect to which similarity is assessed in
order to assign a class to a new data item. Both
algorithms rely on stochastic techniques to search
the space of sets of prototypes and are simple to
implement. The ... (Update)
Cited by: More
Unknown - We Introduce New (2003)
(Correct)
A Comparison of Outlier Detection Algorithms for - Machine Learning Jair (2005)
(Correct)
Kernel Based Noise-Aware Machine - Computer Science Department
(Correct)
Similar documents (at the sentence level):
62.2%: Prototype and Feature Selection by Sampling and Random.. - David Skalak Department (1994)
(Correct)
46.8%: Prototype Selection for Composite Nearest Neighbor Classifiers - Skalak (1995)
(Correct)
Active bibliography (related documents): More All
0.2: User's Manual for Environmental programs - Mech, Prusinkiewicz (1998)
(Correct)
0.2: The Omnipresence of Case-Based Reasoning in Science and Application - Aha (1998)
(Correct)
0.1: Feature Selection and Classifier Ensembles: A Study on.. - Yu (2003)
(Correct)
Similar documents based on text: More All
0.2: The Application Of Nearest Neighbor Algorithmon Creating An.. - Shih, Lee
(Correct)
0.1: The Sources of Increased Accuracy for Two Proposed Boosting.. - Skalak (1996)
(Correct)
0.0: Weighted k Nearest Neighbor Classification On Feature Projections - Güvenir, Akkus
(Correct)
Related documents from co-citation: More All
50: Irrelevant Features and the Subset Selection Problem
- John, Kohavi et al. - 1994
40: Programs for machine learning (context) - Quinlan - 1993
37: Instance-Based Learning Algorithms (context) - Aha, Kibler et al. - 1991
BibTeX entry: (Update)
Skalak, D. (1994). Prototype and feature selection by sampling and random mutation hill climbing algorithms. In Proceedings of the Eleventh International Machine Learning Conference (pp. 293--301). New Brunswick, NJ: Morgan Kaufmann. http://citeseer.ist.psu.edu/skalak94prototype.html More
@inproceedings{ skalak94prototype,
author = "David B. Skalak",
title = "Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms",
booktitle = "International Conference on Machine Learning",
pages = "293-301",
year = "1994",
url = "citeseer.ist.psu.edu/skalak94prototype.html" }
Citations (may not include all citations):
2177
Programs for Machine Learning (context) - Quinlan - 1993
2133
Pattern Classification and Scene Analysis (context) - Duda, Hart - 1973
667
UCI repository of machine learning databases (context) - Murphy, Aha - 1994
482
Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
430
Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1985
291
Irrelevant Features and the Subset Selection Problem
- George, Ron et al. - 1994
216
Very Simple Classification Rules Perform Well on Most Common.. (context) - Holte - 1993
125
Learning with Many Irrelevant Features
- Almuallim, Dietterich - 1991
120
Greedy Attribute Selection
- Rich, Dayne - 1994
111
The Feature Selection Problem: Traditional Methods and a New.. (context) - Kenji, Larry - 1992
87
Overfitting Avoidance as Bias
- Schaffer - 1993
80
When Will a Genetic Algorithm Outperform Hill-Climbing
- Mitchell, Holland - 1993
69
The Condensed Nearest Neighbor Rule (context) - Hart - 1968
65
A Study of Instance-Based Algorithms for Supervised Learning.. (context) - Aha - 1990
64
Nearest Neighbor (context) - Belur - 1991
59
Efficient Algorithms for Minimizing Cross Validation Error
- Andrew, Lee - 1994
55
Asymptotic Properties of Nearest Neighbor Rules using Edited.. (context) - Wilson - 1972
55
An Examination of Procedures for Determining the Number of C.. (context) - Milligan, Cooper - 1985
46
Selecting Typical Instances in Instance-Based Learning (context) - Zhang - 1992
34
The Reduced Nearest Neighbor Rule (context) - Gates - 1972
32
Oblivious Decision Trees and Abstract Cases
- Langley, Sage - 1994
26
Exemplar-Based Knowledge Acquisition (context) - Bareiss - 1989
18
Empirical Learning as a Function of Concept Character (context) - Rendell, Cho - 1990
16
Hybridizing the Genetic Algorithm and the K Nearest Neighbor.. (context) - Kelly, Davis - 1991
16
A Dendrite Method for Cluster Analysis (context) - Calinski, Harabasz - 1974
16
Genetic Algorithms as a Tool for Feature Selection in Machin..
- Vafaie, DeJong - 1992
15
Two Case Studies in Cost-Sensitive Concept Acquisition (context) - Tan, Schlimmer - 1990
13
Learning Concept Classification Rules Using Genetic Algorith..
- DeJong, Spears - 1991
9
Using a Genetic Algorithm to Learn Prototypes for Case Retri.. (context) - Skalak - 1993
8
An application of the Multiedit-Condensing technique to the .. (context) - Voisin, Devijver - 1987
8
Feature analysis for symbol recognition by elastic matching (context) - Kurtzberg - 1987
4
Case-Based Retrieval Shell (context) - Systems - 1990
4
The Monte Carlo Method (context) - Sobol' - 1974
1
Generalizing from Case Studies: ACase Study (context) - Aha - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://simon.cs.cornell.edu/Info/People/skalak/): More
Prototype Selection for Composite Nearest Neighbor Classifiers - Skalak (1997)
(Correct)
Prototype Selection for Composite Nearest Neighbor Classifiers - Skalak (1995)
(Correct)
The Sources of Increased Accuracy for Two Proposed Boosting.. - Skalak (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC