Sciweavers

6833 search results - page 1305 / 1367
» Some two-character sets
Sort
View
NIPS
2001
14 years 11 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
14 years 11 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
UAI
2004
14 years 11 months ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner
NIPS
2003
14 years 11 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
NIPS
2003
14 years 11 months ago
Maximum Likelihood Estimation of a Stochastic Integrate-and-Fire Neural Model
Recent work has examined the estimation of models of stimulus-driven neural activity in which some linear filtering process is followed by a nonlinear, probabilistic spiking stag...
Jonathan Pillow, Liam Paninski, Eero P. Simoncelli
« Prev « First page 1305 / 1367 Last » Next »