Sciweavers

358 search results - page 18 / 72
» Learning from labeled and unlabeled data on a directed graph
Sort
View
ACL
2009
14 years 9 months ago
Distant supervision for relation extraction without labeled data
Modern models of relation extraction for tasks like ACE are based on supervised learning of relations from small hand-labeled corpora. We investigate an alternative paradigm that ...
Mike Mintz, Steven Bills, Rion Snow, Daniel Jurafs...
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
16 years 5 days ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
ICCV
2009
IEEE
16 years 4 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...
DIS
2009
Springer
15 years 6 months ago
An Iterative Learning Algorithm for Within-Network Regression in the Transductive Setting
Within-network regression addresses the task of regression in partially labeled networked data where labels are sparse and continuous. Data for inference consist of entities associ...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
ICDM
2010
IEEE
197views Data Mining» more  ICDM 2010»
14 years 9 months ago
D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-defined Classification
: D-LDA: A Topic Modeling Approach without Constraint Generation for Semi-Defined Classification Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yuhong Xiong, Zhongzhi Shi HP Labo...
Fuzhen Zhuang, Ping Luo, Zhiyong Shen, Qing He, Yu...