Sciweavers

735 search results - page 65 / 147
» Supervised Graph Inference
Sort
View
NIPS
2001
13 years 9 months ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
ICML
2007
IEEE
14 years 8 months ago
Spectral clustering and transductive learning with multiple views
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
Dengyong Zhou, Christopher J. C. Burges
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 1 months ago
Learning Sensor Network Topology through Monte Carlo Expectation Maximization
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
Dimitri Marinakis, Gregory Dudek, David J. Fleet
ESWS
2010
Springer
14 years 15 days ago
OWL Reasoning with WebPIE: Calculating the Closure of 100 Billion Triples
Abstract. In previous work we have shown that the MapReduce framework for distributed computation can be deployed for highly scalable inference over RDF graphs under the RDF Schema...
Jacopo Urbani, Spyros Kotoulas, Jason Maassen, Fra...
WSDM
2012
ACM
325views Data Mining» more  WSDM 2012»
12 years 3 months ago
Coupled temporal scoping of relational facts
Recent research has made significant advances in automatically constructing knowledge bases by extracting relational facts (e.g., Bill Clinton-presidentOf-US) from large text cor...
Partha Pratim Talukdar, Derry Tanti Wijaya, Tom Mi...