Results 1 - 10 of 1,895

Clustering by passing messages between data points

by Brendan J. Frey, Delbert Dueck - Science , 2007
"... Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initi ..."
Abstract - Cited by 696 (8 self) - Add to MetaCart
so in less than one-hundredth the amount of time. Clustering data based on a measure of similarity is a critical step in scientific data analysis and in engineering systems. A common approach is to use data to learn a set of centers such that the sum of

Modeling multi-step relevance propagation for expert finding

by Pavel Serdyukov, Henning Rode, Djoerd Hiemstra - In CIKM ’08 , 2008
"... An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. This paper proposes a novel approach to expert finding in large enterprises or intranets by modeling candidate experts (pers ..."
Abstract - Cited by 32 (3 self) - Add to MetaCart
relevance propagation improve over the baseline one-step propagation based method in almost all cases.

One-Step Change from Baseline Calculations

by unknown authors
"... Change from baseline is a common measure of safety and/or efficacy in clinical trials. The traditional way of calculating changes from baseline in a vertically structured data set requires multiple DATA steps and thus several passes through the data. This paper demonstrates how change from baseline ..."
Abstract - Add to MetaCart
Change from baseline is a common measure of safety and/or efficacy in clinical trials. The traditional way of calculating changes from baseline in a vertically structured data set requires multiple DATA steps and thus several passes through the data. This paper demonstrates how change from baseline

Statistics-based summarization – Step one: Sentence compression

by Kevin Knight, Daniel Marcu - In Proceedings of AAAI , 2000
"... When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one another, and that capture the most salient pieces of information in the original document. pairs are available online, i ..."
Abstract - Cited by 122 (2 self) - Add to MetaCart
When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one another, and that capture the most salient pieces of information in the original document. pairs are available online

Propagation Algorithms for Variational Bayesian Learning

by Zoubin Ghahramani, Matthew J. Beal - In Advances in Neural Information Processing Systems 13 , 2001
"... Variational approximations are becoming a widespread tool for Bayesian learning of graphical models. We provide some theoretical results for the variational updates in a very general family of conjugate-exponential graphical models. We show how the belief propagation and the junction tree algorithms ..."
Abstract - Cited by 139 (20 self) - Add to MetaCart
algorithms can be used in the inference step of variational Bayesian learning. Applying these results to the Bayesian analysis of linear-Gaussian state-space models we obtain a learning procedure that exploits the Kalman smoothing propagation, while integrating over all model parameters. We demonstrate how

Tracking Loose-limbed People

by Leonid Sigal, Sidharth Bhatia, Stefan Roth, Michael J. Black, Michael Isard , 2004
"... We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loosely-connected limbs. Conditional probabilities relating the 3D pose of connected limbs are learned from motioncaptured tr ..."
Abstract - Cited by 191 (7 self) - Add to MetaCart
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loosely-connected limbs. Conditional probabilities relating the 3D pose of connected limbs are learned from motioncaptured

Coil sensitivity encoding for fast MRI. In:

by Klaas P Pruessmann , Markus Weiger , Markus B Scheidegger , Peter Boesiger - Proceedings of the ISMRM 6th Annual Meeting, , 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract - Cited by 193 (3 self) - Add to MetaCart
image for each array element using discrete Fourier transform (DFT). The second step then is to create a full-FOV image from the set of intermediate images. To achieve this one must undo the signal superposition underlying the fold-over effect. That is, for each pixel in the reduced FOV the signal

Spatial gossip and resource location protocols

by David Kempe, Jon Kleinberg, Alan Demers , 2001
"... The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying d ..."
Abstract - Cited by 174 (8 self) - Add to MetaCart
deterministic or randomized algorithm, exchanging information in each communication step. In a variety of contexts, the use of randomization to propagate information has been found to provide better reliability and scalability than more regimented deterministic approaches. In many settings, such as a cluster

the relationship between capacity and distance in an underwater acoustic communication channel

by Milica Stojanovic - ACM SIGMOBILE Mobile Computing and Communications Review (MC2R), vol.11, Issue , 2007
"... Path loss of an underwater acoustic communication channel depends not only on the transmission distance, but also on the signal frequency. As a result, the useful bandwidth depends on the transmission distance, a feature that distinguishes an underwater acoustic system from a terrestrial radio one. ..."
Abstract - Cited by 169 (34 self) - Add to MetaCart
physical models of acoustic propagation loss and ambient noise. A simple, single-path time-invariant model is considered as a first step. To assess the fundamental bandwidth limitation, we take an information-theoretic approach and define the bandwidth corresponding to optimal signal energy allocation

Nonlinear Dynamic Structures

by A. Ronald Gallant, Peter E. Rossi, George Tauchen, A. Ronald Gallant, Peter E. Rossi, George Tauchen - Econometrica , 1993
"... We describe three methods for analyzing the dynamics of a nonlinear time series that is represented by a nonparametric estimate of its one-step ahead conditional density. These strategies are based on examination of conditional moment profiles corresponding to certain shocks; a conditional moment pr ..."
Abstract - Cited by 130 (10 self) - Add to MetaCart
We describe three methods for analyzing the dynamics of a nonlinear time series that is represented by a nonparametric estimate of its one-step ahead conditional density. These strategies are based on examination of conditional moment profiles corresponding to certain shocks; a conditional moment
Results 1 - 10 of 1,895