Sciweavers

292 search results - page 5 / 59
» Predicting labels for dyadic data
Sort
View
KDD
2009
ACM
198views Data Mining» more  KDD 2009»
14 years 10 months ago
Pervasive parallelism in data mining: dataflow solution to co-clustering large and sparse Netflix data
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
Srivatsava Daruru, Nena M. Marin, Matt Walker, Joy...
ICDM
2008
IEEE
182views Data Mining» more  ICDM 2008»
14 years 4 months ago
Multiple-Instance Regression with Structured Data
We present a multiple-instance regression algorithm that models internal bag structure to identify the items most relevant to the bag labels. Multiple-instance regression (MIR) op...
Kiri L. Wagstaff, Terran Lane, Alex Roper
ICPR
2010
IEEE
14 years 1 months ago
Underwater Mine Classification with Imperfect Labels
A new algorithm for performing classification with imperfectly labeled data is presented. The proposed approach is motivated by the insight that the average prediction of a group ...
David Williams
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 10 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
ICML
2006
IEEE
14 years 10 months ago
Connectionist temporal classification: labelling unsegmented sequence data with recurrent neural networks
Many real-world sequence learning tasks require the prediction of sequences of labels from noisy, unsegmented input data. In speech recognition, for example, an acoustic signal is...
Alex Graves, Faustino J. Gomez, Jürgen Schmid...