Sciweavers

292 search results - page 7 / 59
» Predicting labels for dyadic data
Sort
View
ICDM
2008
IEEE
184views Data Mining» more  ICDM 2008»
14 years 4 months ago
Bayesian Co-clustering
In recent years, co-clustering has emerged as a powerful data mining tool that can analyze dyadic data connecting two entities. However, almost all existing co-clustering techniqu...
Hanhuai Shan, Arindam Banerjee
ECIR
2007
Springer
13 years 11 months ago
Active Learning with History-Based Query Selection for Text Categorisation
Automated text categorisation systems learn a generalised hypothesis from large numbers of labelled examples. However, in many domains labelled data is scarce and expensive to obta...
Michael Davy, Saturnino Luz
JMLR
2012
12 years 11 days ago
Transductive Learning of Structural SVMs via Prior Knowledge Constraints
Reducing the number of labeled examples required to learn accurate prediction models is an important problem in structured output prediction. In this paper we propose a new transd...
Chun-Nam Yu
ICML
2004
IEEE
14 years 3 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
12 years 11 days ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich