Sciweavers

2878 search results - page 93 / 576
» Learning the Common Structure of Data
Sort
View
126
Voted
IJCAI
2003
15 years 4 months ago
Inductive Learning in Less Than One Sequential Data Scan
Most recent research of scalable inductive learning on very large dataset, decision tree construction in particular, focuses on eliminating memory constraints and reducing the num...
Wei Fan, Haixun Wang, Philip S. Yu, Shaw-hwa Lo
163
Voted
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 3 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
133
Voted
PGLDB
2003
166views Database» more  PGLDB 2003»
15 years 4 months ago
ROSA: A Data Model and Query Language for e-Learning Objects
Learning Content Management Systems (LCMS) supports e-learning applications with storage and efficient access for e-learning objects (LO)s. ROSA is a LCMS built as a semantic laye...
Fabio Porto, Ana Maria de Carvalho Moura, Adriana ...
ICML
2005
IEEE
16 years 4 months ago
Learning from labeled and unlabeled data on a directed graph
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
Bernhard Schölkopf, Dengyong Zhou, Jiayuan Hu...
NIPS
1998
15 years 4 months ago
Learning from Dyadic Data
Dyadic data refers to a domain with two nite sets of objects in which observations are made for dyads, i.e., pairs with one element from either set. This type of data arises natur...
Thomas Hofmann, Jan Puzicha, Michael I. Jordan