Sciweavers

2100 search results - page 142 / 420
» Learning to rank on graphs
Sort
View
ICML
2007
IEEE
16 years 7 months ago
Parameter learning for relational Bayesian networks
We present a method for parameter learning in relational Bayesian networks (RBNs). Our approach consists of compiling the RBN model into a computation graph for the likelihood fun...
Manfred Jaeger
FUZZIEEE
2007
IEEE
16 years 24 days ago
Learning Undirected Possibilistic Networks with Conditional Independence Tests
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
Christian Borgelt
ICALP
2004
Springer
15 years 12 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
16 years 6 months ago
Ordering patterns by combining opinions from multiple sources
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...
Pang-Ning Tan, Rong Jin
CLEF
2006
Springer
15 years 10 months ago
The University of New South Wales at GeoCLEF 2006
This paper describes our participation in the GeoCLEF monolingual English task of the Cross Language Evaluation Forum 2006. The main objective of this study is to evaluate the retr...
You-Heng Hu, Linlin Ge