Sciweavers

483 search results - page 58 / 97
» Linear Ranking with Reachability
Sort
View
ICDM
2005
IEEE
134views Data Mining» more  ICDM 2005»
14 years 3 months ago
A Preference Model for Structured Supervised Learning Tasks
The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, su...
Fabio Aiolli
ESANN
2006
13 years 11 months ago
Data mining techniques for feature selection in blood cell recognition
The paper presents and compares the data mining techniques for selection of the diagnostic features in the problem of blood cell recognition in leukemia. Different techniques are c...
Tomasz Markiewicz, Stanislaw Osowski
IJON
2006
103views more  IJON 2006»
13 years 10 months ago
Kernel extrapolation
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled ...
S. V. N. Vishwanathan, Karsten M. Borgwardt, Omri ...
ICML
2006
IEEE
14 years 10 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
DAC
1999
ACM
14 years 2 months ago
Circuit Complexity Reduction for Symbolic Analysis of Analog Integrated Circuits
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
Walter Daems, Georges G. E. Gielen, Willy M. C. Sa...