ine
5376/5379
Programa
Links
Bibliografia
Plano
de Ensino
|
Bibliografia Avançada de
Reconhecimento de Padrões
Abaixo você vai encontrar
80 links "avançados" contendo referências a artigos publicados
sobre os mais diversos temas de Reconhecimento de Padrões. Os links
foram ordenados pelo CiteSeer por ordem de freqüência de citação
(os mais citados no começo). Esta bibliografia não é
para quem está iniciando, ela está aqui para você ter
mais referências caso você deseje iniciar um trabalho de pesquisa
envolvendo Reconhecimento de Padrões.
Todos os links referem-se
à cópia dos artigos existente no banco do CiteSeer
(http://citeseer.nj.nec.com/).
O CiteSeer (Copyright © 1997-2001 NEC
Research Institute) é uma máquina
de busca para textos científicos com processamento de linguagem
natural desenvolvida pela NEC, que automaticamente escaneia um texto encontrado
e busca também todas as referências da bibliografia do artigo
que puder encontrar. O CiteSeer é sem dúvida o melhor site
de busca bibliográfica para trabalhos científicos.
Caso você clique num
dos links abaixo e não encontrar mais a referência, simplesmente
busque-a novamente através do CiteSeer da seguinte forma: entre
no site http://citeseer.nj.nec.com/
e digite ali o nome do artigo que você não encontrou ao clicar
no link abaixo. O CiteSeer procurará para você, trazendo-o
em PDF, PS, .doc e também trazendo as referências que encontrar.
-
The
Nature of Statistical Learning Theory - Vapnik - 1995
-
Instance-based
learning algorithms - David Aha, Kibler, Albert - 1991
-
Bagging
predictors - Breiman
-
Bagging
predictors - Breiman - 1994
-
Statistical
Learning Theory - Vapnik - 1996
-
Support-vector
networks - Cortes, Vapnik - 1995
-
Experiments
with a new boosting algorithm - Freund, Schapire
-
A
decision-theoretic generalization of on-line learning and an applica..
- Freund, Schapire - 1995
-
Very
simple classification rules perform well on most commonly used da..
- Holte - 1993
-
The
strength of weak learnability - Schapire - 1990
-
A
weighted nearest neighbor algorithm for learning with symbolic featu..
- Cost, Salzberg - 1993
-
Boosting
a weak learning algorithm by majority - Freund - 1995
-
Multi-interval
discretization of continuous-valued attributes in decis.. - Fayyad,
Irani - 1993
-
How
to use expert advice - Cesa-Bianchi, Freund, Helmbold et al. - 1993
-
How
to use expert advice - Cesa-Bianchi, Freund, Helmbold et al. - 1996
-
Fast
probabilistic algorithms for Hamiltonian circuits and matchings - Angluin,
Valiant - 1979
-
Supervised
and unsupervised discretization of continuous features - Dougherty,
Kohavi, Sahami - 1995
-
A
system for the induction of oblique decision trees - Murthy, Kasif,
Salzberg - 1994
-
Adaptive
Algorithms
and Stochastic Approximations - Benveniste, Metivier, Priouret - 1990
-
Elements
of Machine Learning - Langley - 1996
-
The
context-tree weighting method: Basic properties - Willems, Shtarkov,
Tjalkens - 1995
-
Nearest
Neighbor - Dasarathy - 1991
-
On
changing continuous attributes into ordered discrete attributes - Catlett
- 1991
-
A
further comparison of splitting rules for decision-tree induction -
Buntine, Niblett - 1992
-
Multivariate
decision trees - Brodley, Utgoff - 1995
-
Discriminant
adaptive nearest neighbor classification - Hastie, Tibshirani
-
The
Handbook of Brain Theory and Neural Networks - Arbib - 1995
-
Similarity
metric learning for a variable-kernel classifier - Lowe - 1995
-
Applications
of inductive logic programming - Bratko, Muggleton - 1995
-
Flexible
metric nearest neighbor classification - Friedman - 1994
-
Connectionist
models of face processing: A survey - Valentin, Abdi, O'Toole et al.
- 1994
-
Polynomial
splines and their tensor products in extended linear modeli.. - Stone,
Hansen, Kooperberg et al. - 1997
-
Boosting
performance in neural networks - Drucker, Schapire, Simard - 1993
-
Applications
of machine learning and rule induction - Langley, Simon - 1995
-
Boosting
decision trees - Drucker, Cortes - 1996
-
Perceptron
trees: a case study in hybrid concept representations - Utgoff - 1989
-
IEEE
Transactions on Pattern Analysis and Machine Intelligence - on, Analysis,
Heath et al. - 1993
-
Using
locally weighted regression for robot learning - Atkeson - 1991
-
Circuit
Complexity and Neural Networks - Parberry - 1994
-
The
heuristics of instability in model selection - Breiman
-
Predicting
nearly as well as the best pruning of a decision tree - Helmbold, Schapire
- 1996
-
Decision-theoretic
troubleshooting - Heckerman, Breese, Rommelse - 1995
-
Introduction
to Graphical Modelling - Edwards - 1995
-
Capacity
problems for linear machines - Cover - 1968
-
Robust
trainability of single neurons - Hoffgen, Simon, Van Horn - 1995
-
Improved
use of continuous attributes in C - Quinlan
-
On
pruning and averaging decision trees - Oliver, Hand - 1995
-
Efficient
algorithms for finding multi-way splits for decision trees - Fulton,
Kasif, Salzberg - 1995
-
How
fast can a threshold gate learn - Maass, Turan - 1994
-
Smoothing
spline anova for exponential families - Wahba, Wang, Gu et al. - 1996
-
line
prediction and boosting - Freund, Schapire
-
Polychotomous
regression - Kooperberg, Bose, Stone - 1996
-
variance
and arcing classifiers - Breiman
-
Polynomial
bounds for VC dimension of sigmoidal neural networks - Karpinski, Macintyre
-
Structure
and chance: Melding logic and probability for software debug.. - Burnell,
Horvitz - 1995
-
Tighter
bounds of the VC-dimension of three-layer networks - Sakurai - 1993
-
Multiple
binary decision tree classifiers - Shlien - 1990
-
Applying
Bayesian networks to information retrival - Fung, Del - 1995
-
OC1:
randomized induction of oblique decision tress - Murthy, Kasif, Salzberg
et al. - 1993
-
Theory
of majority decision elements - Muroga, Toda, Takasu - 1961
-
Towards
a better understanding of memory-based and Bayesian classifier.. -
Rachlin, Kasif, Salzberg et al. - 1994
-
Probabilistic
Expert Systems - Shafer - 1996
-
Memory-based
reasoning - Waltz - 1990
-
Flat
minima - Hochreiter, Schmidhuber - 1996
-
Bayesian
networks - Heckerman, Wellman - 1995
-
Backpropagation:
Basics and new developments - Werbos - 1995
-
Simplifying
neural nets by discovering flat minima - Hochreiter, Schmidhuber -
1995
-
Vapnik-Chervonenkis
bounds for generalization - Parrondo, Van der Broeck - 1993
-
Finding
optimal multi-splits for numerical attributes in decision tree.. -
Elomaa, Rousu - 1996
-
Context
tree weighting: A sequential universal source coding procedure.. -
Willems, Shtarkov, Tjalkens - 1993
-
Stochastic
Approximation and Optimization of Random Systems - Ljung, Pflug, Walk
- 1992
-
The
VC dimension and pseudodimension of two-layer neural networks with..
- Bartlett, Williamson - 1996
-
A
new nearest neighbor distance measure - Short, Fukunaga - 1980
-
Random
decision forests - Ho - 1995
-
Lower
bounds of the number of threshold functions and a maximum weight -
Muroga - 1965
-
Fast
decision tree ensembles for optical character recognition - Drucker
- 1996
-
Parallel
Digital Implementation of Neural Networks - Phys, --, Prasanna - 1993
-
Predicting
nearly as well as the best pruning of a decision tree - the, --, Schapire
- 1995
-
Learning
how the world works - Werbos - 1987
-
Linear
function neurons: structure and training - the, --, Volper - 1986
The Cyclops
Project
German-Brazilian Cooperation
Programme on IT
CNPq GMD DLR
|
 |
|
|