Sciweavers

130 search results - page 17 / 26
» Learning Subjective Functions with Large Margins
Sort
View
JMLR
2002
106views more  JMLR 2002»
13 years 8 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
DATAMINE
2006
139views more  DATAMINE 2006»
13 years 8 months ago
VizRank: Data Visualization Guided by Machine Learning
Data visualization plays a crucial role in identifying interesting patterns in exploratory data analysis. Its use is, however, made difficult by the large number of possible data p...
Gregor Leban, Blaz Zupan, Gaj Vidmar, Ivan Bratko
SIGMOD
2012
ACM
232views Database» more  SIGMOD 2012»
11 years 11 months ago
Large-scale machine learning at twitter
The success of data-driven solutions to difficult problems, along with the dropping costs of storing and processing massive amounts of data, has led to growing interest in largesc...
Jimmy Lin, Alek Kolcz
ATAL
2008
Springer
13 years 10 months ago
A few good agents: multi-agent social learning
In this paper, we investigate multi-agent learning (MAL) in a multi-agent resource selection problem (MARS) in which a large group of agents are competing for common resources. Si...
Jean Oh, Stephen F. Smith
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan