Sciweavers

246 search results - page 28 / 50
» Graph Structure Learning for Task Ordering
Sort
View
NAACL
2004
14 years 11 months ago
Catching the Drift: Probabilistic Content Models, with Applications to Generation and Summarization
We consider the problem of modeling the content structure of texts within a specific domain, in terms of the topics the texts address and the order in which these topics appear. W...
Regina Barzilay, Lillian Lee
GFKL
2005
Springer
125views Data Mining» more  GFKL 2005»
15 years 3 months ago
Towards Structure-sensitive Hypertext Categorization
Abstract. Hypertext categorization is the task of automatically assigning category labels to hypertext units. Comparable to text categorization it stays in the area of function lea...
Alexander Mehler, Rüdiger Gleim, Matthias Deh...
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
15 years 4 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
LEGE
2003
80views Education» more  LEGE 2003»
14 years 11 months ago
Theoretical Foundations for E-Learning Environments Direct to Virtual Scientific Experiments
In this work we want to put in evidence the necessity to integrate theoretical, methodological and didactical aspects with innovative e-learning systems, in order to hypothesize po...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...