NIPS 2001 - PDF Preprint Papers

NIPS 2001

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NIPS-2001 Paper

click to vote

NIPS
2001

210views Information Technology» more NIPS 2001»

Fast and Robust Classification using Asymmetric AdaBoost and a Detector Cascade

13 years 5 months ago

Download research.microsoft.com

This paper develops a new approach for extremely fast detection in domains where the distribution of positive and negative examples is highly skewed (e.g. face detection or databa...

Paul A. Viola, Michael J. Jones

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	210	Fast and Robust Classification using Asymmetric AdaBoost and a Detector Cascade	claim
2	208	Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering	claim
3	206	Model-Free Least-Squares Policy Iteration	claim
4	204	Global Coordination of Local Linear Models	claim
5	193	Bayesian time series classification	claim
6	192	Categorization by Learning and Combining Object Parts	claim
7	192	Predictive Representations of State	claim
8	185	Probabilistic principles in unsupervised learning of visual structure: human data and a model	claim
9	184	Dynamic Time-Alignment Kernel in Support Vector Machine	claim
10	178	Natural Language Grammar Induction Using a Constituent-Context Model	claim
11	174	K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms	claim
12	163	Partially labeled classification with Markov random walks	claim
13	158	KLD-Sampling: Adaptive Particle Filters	claim
14	158	Multiagent Planning with Factored MDPs	claim
15	157	A General Greedy Approximation Algorithm with Applications	claim
16	155	The Infinite Hidden Markov Model	claim
17	155	Characterizing Neural Gain Control using Spike-triggered Covariance	claim
18	154	The Unified Propagation and Scaling Algorithm	claim
19	153	Estimating Car Insurance Premia: a Case Study in High-Dimensional Data Inference	claim
20	152	A kernel method for multi-labelled classification	claim
21	152	A Variational Approach to Learning Curves	claim
22	152	Speech Recognition with Missing Data using Recurrent Neural Nets	claim
23	150	Eye movements and the maturation of cortical orientation selectivity	claim
24	149	Online Learning with Kernels	claim
25	149	Learning a Gaussian Process Prior for Automatically Generating Music Playlists	claim
26	148	The Fidelity of Local Ordinal Encoding	claim
27	146	Sequential Noise Compensation by Sequential Monte Carlo Method	claim
28	144	Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning	claim
29	143	Latent Dirichlet Allocation	claim
30	142	On the Generalization Ability of On-Line Learning Algorithms	claim
31	142	MIME: Mutual Information Minimization and Entropy Maximization for Bayesian Belief Propagation	claim
32	141	Constructing Distributed Representations Using Additive Clustering	claim
33	140	The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank	claim
34	140	Transform-invariant Image Decomposition with Similarity Templates	claim
35	139	Algorithmic Luckiness	claim
36	139	Covariance Kernels from Bayesian Generative Models	claim
37	138	Infinite Mixtures of Gaussian Process Experts	claim
38	138	Agglomerative Multivariate Information Bottleneck	claim
39	138	Active Learning in the Drug Discovery Process	claim
40	137	The Concave-Convex Procedure (CCCP)	claim
41	134	Spectral Relaxation for K-means Clustering	claim
42	132	Adaptive Sparseness Using Jeffreys Prior	claim
43	131	Model Based Population Tracking and Automatic Detection of Distribution Changes	claim
44	131	The Steering Approach for Multi-Criteria Reinforcement Learning	claim
45	131	Kernel Logistic Regression and the Import Vector Machine	claim
46	130	The Method of Quantum Clustering	claim
47	129	PAC Generalization Bounds for Co-training	claim
48	128	Unsupervised Learning of Human Motion Models	claim
49	127	Matching Free Trees with Replicator Equations	claim
50	126	ACh, Uncertainty, and Cortical Inference	claim
51	125	Bayesian Predictive Profiles With Applications to Retail Transaction Data	claim
52	125	Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms	claim
53	123	Kernel Machines and Boolean Functions	claim
54	123	Quantizing Density Estimators	claim
55	123	Learning Lateral Interactions for Feature Binding and Sensory Segmentation	claim
56	121	Rates of Convergence of Performance Gradient Estimates Using Function Approximation and Bias in Reinforcement Learning	claim
57	121	Hyperbolic Self-Organizing Maps for Semantic Navigation	claim
58	120	Convolution Kernels for Natural Language	claim
59	119	A Parallel Mixture of SVMs for Very Large Scale Problems	claim
60	119	Fast, Large-Scale Transformation-Invariant Clustering	claim
61	119	Active Information Retrieval	claim
62	119	A Quantitative Model of Counterfactual Reasoning	claim
63	117	Distribution of Mutual Information	claim
64	117	An Efficient Clustering Algorithm Using Stochastic Association Model and Its Implementation Using Nanostructures	claim
65	116	Bayesian morphometry of hippocampal cells suggests same-cell somatodendritic repulsion	claim
66	116	Entropy and Inference, Revisited	claim
67	116	Reducing multiclass to binary by coupling probability estimates	claim
68	115	A theory of neural integration in the head-direction system	claim
69	115	Information Geometrical Framework for Analyzing Belief Propagation Decoder	claim
70	115	(Not) Bounding the True Error	claim
71	115	Self-regulation Mechanism of Temporally Asymmetric Hebbian Plasticity	claim
72	114	Active Portfolio-Management based on Error Correction Neural Networks	claim
73	113	TAP Gibbs Free Energy, Belief Propagation and Sparsity	claim
74	112	A Bayesian Model Predicts Human Parse Preference and Reading Times in Sentence Processing	claim
75	111	Boosting and Maximum Likelihood for Exponential Models	claim
76	111	Orientation-Selective aVLSI Spiking Neurons	claim
77	111	Generating velocity tuning by asymmetric recurrent connections	claim
78	110	Prodding the ROC Curve: Constrained Optimization of Classifier Performance	claim
79	109	Fragment Completion in Humans and Machines	claim
80	106	Improvisation and Learning	claim
81	105	Playing is believing: The role of beliefs in multi-agent learning	claim
82	105	Optimising Synchronisation Times for Mobile Devices	claim
83	105	Linear-time inference in Hierarchical HMMs	claim
84	105	On the Convergence of Leveraging	claim
85	104	Switch Packet Arbitration via Queue-Learning	claim
86	104	The g Factor: Relating Distributions on Features to Distributions on Images	claim
87	104	Linking Motor Learning to Function Approximation: Learning in an Unlearnable Force Field	claim
88	104	Correlation Codes in Neuronal Populations	claim
89	104	Risk Sensitive Particle Filters	claim
90	102	Thin Junction Trees	claim
91	102	Minimax Probability Machine	claim
92	101	Reinforcement Learning with Long Short-Term Memory	claim
93	101	Modeling Temporal Structure in Classical Conditioning	claim
94	101	Probabilistic Inference of Hand Motion from Neural Activity in Motor Cortex	claim
95	101	The Emergence of Multiple Movement Units in the Presence of Noise and Feedback Delay	claim
96	100	Small-World Phenomena and the Dynamics of Information	claim
97	99	Grouping and dimensionality reduction by locally linear embedding	claim
98	97	Sampling Techniques for Kernel Methods	claim
99	97	Probabilistic Abstraction Hierarchies	claim
100	97	Spike timing and the coding of naturalistic sounds in a central auditory area of songbirds	claim
101	97	A Neural Oscillator Model of Auditory Selective Attention	claim
102	97	Generalization Performance of Some Learning Problems in Hilbert Functional Spaces	claim
103	96	A Sequence Kernel and its Application to Speaker Recognition	claim
104	95	Discriminative Direction for Kernel Classifiers	claim
105	95	Means, Correlations and Bounds	claim
106	95	A New Discriminative Kernel From Probabilistic Models	claim
107	94	Scaling Laws and Local Minima in Hebbian ICA	claim
108	92	A Rational Analysis of Cognitive Control in a Speeded Discrimination Task	claim
109	90	Learning Hierarchical Structures with Linear Relational Embedding	claim
110	89	Classifying Single Trial EEG: Towards Brain Computer Interfacing	claim
111	89	A Rotation and Translation Invariant Discrete Saliency Network	claim
112	87	Stochastic Mixed-Signal VLSI Architecture for High-Dimensional Kernel Machines	claim
113	87	Novel iteration schemes for the Cluster Variation Method	claim
114	86	A Maximum-Likelihood Approach to Modeling Multisensory Enhancement	claim
115	85	Contextual Modulation of Target Saliency	claim
116	84	Orientational and Geometric Determinants of Place and Head-direction	claim
117	82	Information-Geometrical Significance of Sparsity in Gallager Codes	claim
118	79	Grammatical Bigrams	claim
119	79	Learning Spike-Based Correlations and Conditional Probabilities in Silicon	claim
120	77	Intransitive Likelihood-Ratio Classifiers	claim
121	73	Duality, Geometry, and Support Vector Regression	claim
122	68	Generalizable Relational Binding from Coarse-coded Distributed Representations	claim
123	64	Incremental A*	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers