Sciweavers

43 search results - page 6 / 9
» Partial least squares regression for graph mining
Sort
View
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
14 years 5 days ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
GECCO
2006
Springer
150views Optimization» more  GECCO 2006»
14 years 2 months ago
Evaluation relaxation using substructural information and linear estimation
The paper presents an evaluation-relaxation scheme where a fitness surrogate automatically adapts to the problem structure and the partial contributions of subsolutions to the fit...
Kumara Sastry, Cláudio F. Lima, David E. Go...
ML
2008
ACM
13 years 10 months ago
A linear fit gets the correct monotonicity directions
Let f be a function on Rd that is monotonic in every variable. There are 2d possible assignments to the directions of monotonicity (two per variable). We provide sufficient condit...
Malik Magdon-Ismail, Joseph Sill
CIKM
2011
Springer
12 years 10 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
ICML
2007
IEEE
14 years 11 months ago
Kernelizing PLS, degrees of freedom, and efficient model selection
Kernelizing partial least squares (PLS), an algorithm which has been particularly popular in chemometrics, leads to kernel PLS which has several interesting properties, including ...
Mikio L. Braun, Nicole Krämer