Sciweavers

780 search results - page 85 / 156
» Learning Low-Density Separators
Sort
View
TKDE
2008
152views more  TKDE 2008»
13 years 7 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
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Fast and Scalable Local Kernel Machines
A computationally efficient approach to local learning with kernel methods is presented. The Fast Local Kernel Support Vector Machine (FaLK-SVM) trains a set of local SVMs on redu...
Nicola Segata, Enrico Blanzieri
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Beware of the DAG!
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
A. Philip Dawid
ICIP
2001
IEEE
14 years 9 months ago
Image data mining from financial documents based on wavelet features
In this paper, we present a framework for clustering and classifying cheque images according to their payee-line content. The features used in the clustering and classificationpro...
Ossama El Badawy, Mahmoud R. El-Sakka, Khaled Hass...
ALT
2008
Springer
14 years 4 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster