Sciweavers

147 search results - page 19 / 30
» Very sparse random projections
Sort
View
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ICML
2007
IEEE
14 years 8 months ago
Solving multiclass support vector machines with LaRank
Optimization algorithms for large margin multiclass recognizers are often too costly to handle ambitious problems with structured outputs and exponential numbers of classes. Optim...
Antoine Bordes, Jason Weston, Léon Bottou, ...
CVPR
2010
IEEE
14 years 3 months ago
Rapid Face Recognition Using Hashing
We propose a face recognition approach based on hashing. The approach yields comparable recognition rates with the random 1 approach [18], which is considered the stateof-the-art....
Qinfeng Shi, Hanxi Li, Chunhua Shen
ICANN
2009
Springer
14 years 11 days ago
Empirical Study of the Universum SVM Learning for High-Dimensional Data
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...
Vladimir Cherkassky, Wuyang Dai
NIPS
2007
13 years 9 months ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell