Sciweavers

877 search results - page 74 / 176
» Classifier learning with a new locality regularization metho...
Sort
View
ICML
2006
IEEE
15 years 11 months ago
A DC-programming algorithm for kernel selection
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
KDD
2006
ACM
181views Data Mining» more  KDD 2006»
15 years 10 months ago
Cryptographically private support vector machines
We study the problem of private classification using kernel methods. More specifically, we propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning ...
Helger Lipmaa, Sven Laur, Taneli Mielikäinen
PAKDD
2011
ACM
245views Data Mining» more  PAKDD 2011»
14 years 27 days ago
Finding Rare Classes: Adapting Generative and Discriminative Models in Active Learning
Discovering rare categories and classifying new instances of them is an important data mining issue in many fields, but fully supervised learning of a rare class classifier is pr...
Timothy M. Hospedales, Shaogang Gong, Tao Xiang
TSP
2010
14 years 4 months ago
Testing stationarity with surrogates: a time-frequency approach
An operational framework is developed for testing stationarity relatively to an observation scale, in both stochastic and deterministic contexts. The proposed method is based on a ...
Pierre Borgnat, Patrick Flandrin, Paul Honeine, C&...
CGF
2008
153views more  CGF 2008»
14 years 10 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm