See this document in CiteSeerX!

Margin Analysis of the LVQ Algorithm (2002)  (Make Corrections)  (12 citations)
Koby Crammer Ran Gilad-Bachrach Amir...



  Home/Search   Context   Related

 
View or download:
books.nips.cc/papers/files...LT19.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  books.nips.cc/nips15 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Prototypes based algorithms are commonly used to reduce the computational complexity of Nearest-Neighbour (NN) classifiers. In this paper we discuss theoretical and algorithmical aspects of such algorithms. On the theory side, we present margin based generalization bounds that suggest that these kinds of classifiers can be more accurate then the 1-NN rule. Furthermore, we derived a training algorithm that selects a good set of prototypes using large margin principles. We also show that... (Update)

Similar documents based on text:   More   All
1.0:   Margin Analysis of the LVQ Algorithm - Koby Crammer Kobics (2002)   (Correct)
0.6:   Margin Based Feature Selection - Theory and Algorithms - Ranb   (Correct)
0.4:   Kernel Query By Committee (KQBC) - Ran Gilad-Bachrach Ranb (2003)   (Correct)

BibTeX entry:   (Update)

K.Crammer, R.Gilad-Bachrach, A.Navot, and N.Tishby. Margin analysis of the LVQ algorithm, NIPS'2002. http://citeseer.ist.psu.edu/crammer02margin.html   More

@misc{ crammer02margin,
  author = "K. Crammer and R. Gilad-Bachrach and A. Navot and N. Tishby",
  title = "Margin analysis of the LVQ algorithm",
  text = "K.Crammer, R.Gilad-Bachrach, A.Navot, and N.Tishby. Margin analysis of
    the LVQ algorithm, NIPS'2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/crammer02margin.html" }
Citations (may not include all citations):
1291   The Nature Of Statistical Learning Theory (context) - Vapnik - 1995
1213   Self-Organizing Maps (context) - Kohonen - 1995
509   A decision-theoretic generalization of on-line learning and .. - Freund, Schapire - 1997
296   A Probabilistic Theory of Pattern Recognition (context) - Devroye, Gyorfi et al. - 1996
243   Boosting the margin : A new explanation for the effectivenes.. - Schapire, Freund et al. - 1998
180   Boosting a weak learning algorithm by majority - Freund - 1995
165   Approximate nearest neighbors: towards removing the curse of.. - Indyk, Motwani - 1998
106   Efficient pattern recognition using a new transformation dis.. (context) - Simard, Le Cun et al. - 1993
24   Query learning with large margin classifiers - Campbell, Cristianini et al. - 2000
22   nonparametric discrimination: Consistency properties (context) - Fix, Hodges - 1951
15   Direct optimization of margins improves generalization in co.. - Mason, Bartlett et al. - 1999
8   the learning vector quantization program package (context) - Kohonen, Hynninen et al. - 1995
2   Machine learning for information retrieval: Advanced techniq.. (context) - Singer, Lewis - 2000
2   Lvq is a maximum margin algorithm (context) - Buckingham, Geva - 2000



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://books.nips.cc/nips15.html):   More
Learning Attractor Landscapes for Learning Motor Primitives - Ijspeert, Nakanishi, Schaal (2003)   (Correct)
A Statistical Mechanics Approach to Approximate Analytical.. - Malzahn, Opper (2003)   (Correct)
Going Metric: Denoising Pairwise Data - Roth, Laub, Buhmann, Müller (2002)   (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