Sciweavers

1731 search results - page 92 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 4 months ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 4 months ago
Estimation of the Rate-Distortion Function
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...
Matthew T. Harrison, Ioannis Kontoyiannis
NN
2002
Springer
136views Neural Networks» more  NN 2002»
15 years 3 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
ISCI
2007
170views more  ISCI 2007»
15 years 4 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
PKDD
2005
Springer
122views Data Mining» more  PKDD 2005»
15 years 9 months ago
A Probabilistic Clustering-Projection Model for Discrete Data
For discrete co-occurrence data like documents and words, calculating optimal projections and clustering are two different but related tasks. The goal of projection is to find a ...
Shipeng Yu, Kai Yu, Volker Tresp, Hans-Peter Krieg...