Sciweavers

292 search results - page 38 / 59
» Predicting labels for dyadic data
Sort
View
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
14 years 4 months ago
Active Learning with Generalized Queries
—Active learning can actively select or construct examples to label to reduce the number of labeled examples needed for building accurate classifiers. However, previous works of...
Jun Du, Charles X. Ling
ICCV
2009
IEEE
15 years 2 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
NIPS
2004
13 years 11 months ago
Co-Training and Expansion: Towards Bridging Theory and Practice
Co-training is a method for combining labeled and unlabeled data when examples can be thought of as containing two distinct sets of features. It has had a number of practical succ...
Maria-Florina Balcan, Avrim Blum, Ke Yang
JCST
2010
109views more  JCST 2010»
13 years 4 months ago
The Inverse Classification Problem
In this paper, we examine an emerging variation of the classification problem, which is known as the inverse classification problem. In this problem, we determine the features to b...
Charu C. Aggarwal, Chen Chen, Jiawei Han
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
13 years 7 months ago
Graph Regularized Transductive Classification on Heterogeneous Information Networks
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
Ming Ji, Yizhou Sun, Marina Danilevsky, Jiawei Han...