Sciweavers

7 search results - page 1 / 2
» The offset tree for learning with partial labels
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 5 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
SDM
2012
SIAM
305views Data Mining» more  SDM 2012»
11 years 7 months ago
Learning Hierarchical Relationships among Partially Ordered Objects with Heterogeneous Attributes and Links
Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleanin...
Chi Wang, Jiawei Han, Qi Li, Xiang Li, Wen-Pin Lin...
DIS
2009
Springer
13 years 11 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
ECML
2006
Springer
13 years 8 months ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
WWW
2005
ACM
14 years 5 months ago
Web data extraction based on partial tree alignment
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
Yanhong Zhai, Bing Liu