1339 search results - page 57 / 268 » Robust learning from bites for data mining |
SC
2005
ACM
14 years 2 months ago
2005
ACM
Parallel applications running on high-end computer systems manifest a complexity of performance phenomena. Tools to observe parallel performance attempt to capture these phenomena...
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
The biclustering, co-clustering, or subspace clustering problem involves simultaneously grouping the rows and columns of a data matrix to uncover biclusters or sub-matrices of the...
ICDM
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we study the problem of classifier learning where the input data contains unjustified dependencies between some data attributes and the class label. Such cases arise...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...