Sciweavers

702 search results - page 58 / 141
» Learning Probabilistic Models of Relational Structure
Sort
View
120
Voted
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
16 years 3 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
126
Voted
AAAI
2007
15 years 5 months ago
Mapping and Revising Markov Logic Networks for Transfer Learning
Transfer learning addresses the problem of how to leverage knowledge acquired in a source domain to improve the accuracy and speed of learning in a related target domain. This pap...
Lilyana Mihalkova, Tuyen N. Huynh, Raymond J. Moon...
139
Voted
WWW
2004
ACM
16 years 3 months ago
Mining models of human activities from the web
The ability to determine what day-to-day activity (such as cooking pasta, taking a pill, or watching a video) a person is performing is of interest in many application domains. A ...
Mike Perkowitz, Matthai Philipose, Kenneth P. Fish...
151
Voted
ICML
2006
IEEE
16 years 3 months ago
Cost-sensitive learning with conditional Markov networks
There has been a recent, growing interest in classification and link prediction in structured domains. Methods such as conditional random fields and relational Markov networks sup...
Prithviraj Sen, Lise Getoor
118
Voted
ICML
2007
IEEE
16 years 3 months ago
Statistical predicate invention
We propose statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in struct...
Stanley Kok, Pedro Domingos