Sciweavers

95 search results - page 9 / 19
» Reduction Techniques for Instance-Based Learning Algorithms
Sort
View
FOCS
2005
IEEE
15 years 3 months ago
Mechanism Design via Machine Learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
NPL
1998
135views more  NPL 1998»
14 years 9 months ago
Local Adaptive Subspace Regression
Abstract. Incremental learning of sensorimotor transformations in high dimensional spaces is one of the basic prerequisites for the success of autonomous robot devices as well as b...
Sethu Vijayakumar, Stefan Schaal
ICCV
2007
IEEE
15 years 3 months ago
Laplacian PCA and Its Applications
Dimensionality reduction plays a fundamental role in data processing, for which principal component analysis (PCA) is widely used. In this paper, we develop the Laplacian PCA (LPC...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
ICML
2010
IEEE
14 years 10 months ago
Local Minima Embedding
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
Minyoung Kim, Fernando De la Torre
CCGRID
2007
IEEE
15 years 3 months ago
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
Hui Li