Sciweavers

539 search results - page 56 / 108
» Learning Monotonic Linear Functions
Sort
View
COLT
2007
Springer
14 years 3 months ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
PKDD
2009
Springer
138views Data Mining» more  PKDD 2009»
14 years 4 months ago
Margin and Radius Based Multiple Kernel Learning
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
Huyen Do, Alexandros Kalousis, Adam Woznica, Melan...
ICML
2007
IEEE
14 years 10 months ago
A kernel path algorithm for support vector machines
The choice of the kernel function which determines the mapping between the input space and the feature space is of crucial importance to kernel methods. The past few years have se...
Gang Wang, Dit-Yan Yeung, Frederick H. Lochovsky
TKDE
2008
152views more  TKDE 2008»
13 years 9 months ago
SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
Deng Cai, Xiaofei He, Jiawei Han
ICIP
2001
IEEE
14 years 11 months ago
Higher order autocorrelations for pattern classification
The use of higher-order local autocorrelations as features for pattern recognition has been acknowledged since many years, but their applicability was restricted to relatively low...
Vlad Popovici, Jean-Philippe Thiran