24. ICML 2007:
Corvalis, Oregon, USA
Arik Azran:
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks.
49-56
Erick Delage,
Shie Mannor:
Percentile optimization in uncertain Markov decision processes with application to efficient exploration.
225-232
Steve Hanneke:
A bound on the label complexity of agnostic active learning.
353-360
Manfred Jaeger:
Parameter learning for relational Bayesian networks.
369-376
Fuxin Li,
Jian Yang,
Jue Wang:
A transductive framework of distance metric learning by spectral dimensionality reduction.
513-520
Chris H. Q. Ding,
Tao Li:
Adaptive dimension reduction using discriminant analysis and K-means clustering.
521-528
Sridhar Mahadevan:
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning.
585-592
Bhaskara Marthi:
Automatic shaping and decomposition of reward functions.
601-608
Chee Wee Phua,
Robert Fitch:
Tracking value function dynamics to improve reinforcement learning with piecewise linear function approximation.
751-758
Mohak Shah:
Sample compression bounds for decision trees.
799-806
Koji Tsuda:
Entire regularization paths for graph data.
919-926
Li Wang,
Ji Zhu,
Hui Zou:
Hybrid huberized support vector machines for microarray classification.
983-990
Tomás Werner:
What is decreased by the max-sum arc consistency algorithm?
1007-1014
Takehisa Yairi:
Map building without localization by dimensionality reduction techniques.
1071-1078
Jieping Ye:
Least squares linear discriminant analysis.
1087-1093
Jian Zhang,
Rong Yan:
On the value of pairwise constraints in classification and consistency.
1111-1118
Kun Zhang,
Laiwan Chan:
Nonlinear independent component analysis with minimal nonlinear distortion.
1127-1134
Zheng Zhao,
Huan Liu:
Spectral feature selection for supervised and unsupervised learning.
1151-1157
data released under the ODC-BY 1.0 license
