Sciweavers

4591 search results - page 7 / 919
» Learning from Dyadic Data
Sort
View
IS
2008
13 years 6 months ago
Mining relational data from text: From strictly supervised to weakly supervised learning
This paper approaches the relation classification problem in information extraction framework with different machine learning strategies, from strictly supervised to weakly superv...
Zhu Zhang
ICRA
2009
IEEE
179views Robotics» more  ICRA 2009»
14 years 1 months ago
Automatic weight learning for multiple data sources when learning from demonstration
— Traditional approaches to programming robots are generally inaccessible to non-robotics-experts. A promising exception is the Learning from Demonstration paradigm. Here a polic...
Brenna Argall, Brett Browning, Manuela M. Veloso
ICASSP
2009
IEEE
13 years 4 months ago
Probabilistic matrix tri-factorization
Nonnegative matrix tri-factorization (NMTF) is a 3-factor decomposition of a nonnegative data matrix, X USV , where factor matrices, U, S, and V , are restricted to be nonnegativ...
Jiho Yoo, Seungjin Choi
ICML
2007
IEEE
14 years 7 months ago
Self-taught learning: transfer learning from unlabeled data
We present a new machine learning framework called "self-taught learning" for using unlabeled data in supervised classification tasks. We do not assume that the unlabele...
Rajat Raina, Alexis Battle, Honglak Lee, Benjamin ...
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 10 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo