Sciweavers

1622 search results - page 150 / 325
» Learning a Hidden Matching
Sort
View
159
Voted
TSP
2008
167views more  TSP 2008»
15 years 1 months ago
Multi-Task Learning for Analyzing and Sorting Large Databases of Sequential Data
A new hierarchical nonparametric Bayesian framework is proposed for the problem of multi-task learning (MTL) with sequential data. The models for multiple tasks, each characterize...
Kai Ni, John William Paisley, Lawrence Carin, Davi...
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
16 years 4 months ago
Relational learning via latent social dimensions
Social media such as blogs, Facebook, Flickr, etc., presents data in a network format rather than classical IID distribution. To address the interdependency among data instances, ...
Lei Tang, Huan Liu
264
Voted
KDD
2008
ACM
159views Data Mining» more  KDD 2008»
16 years 3 months ago
Semi-supervised learning with data calibration for long-term time series forecasting
Many time series prediction methods have focused on single step or short term prediction problems due to the inherent difficulty in controlling the propagation of errors from one ...
Haibin Cheng, Pang-Ning Tan
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 3 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
ECCV
2010
Springer
15 years 3 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof