Sciweavers

44 search results - page 4 / 9
» Visual Learning Given Sparse Data of Unknown Complexity
Sort
View
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 11 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
ICML
2004
IEEE
14 years 11 months ago
The Bayesian backfitting relevance vector machine
Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art...
Aaron D'Souza, Sethu Vijayakumar, Stefan Schaal
ICML
2006
IEEE
14 years 11 months ago
Regression with the optimised combination technique
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
Jochen Garcke
OSDI
2008
ACM
14 years 11 months ago
An Internet Protocol Address Clustering Algorithm
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
Robert Beverly, Karen R. Sollins
SAC
2004
ACM
14 years 4 months ago
Statistical properties of transactional databases
Most of the complexity of common data mining tasks is due to the unknown amount of information contained in the data being mined. The more patterns and correlations are contained ...
Paolo Palmerini, Salvatore Orlando, Raffaele Pereg...