Results 1  10
of
640
Model selection and accounting for model uncertainty in graphical models using Occam's window
, 1993
"... We consider the problem of model selection and accounting for model uncertainty in highdimensional contingency tables, motivated by expert system applications. The approach most used currently is a stepwise strategy guided by tests based on approximate asymptotic Pvalues leading to the selection o ..."
Abstract

Cited by 370 (47 self)
 Add to MetaCart
We consider the problem of model selection and accounting for model uncertainty in highdimensional contingency tables, motivated by expert system applications. The approach most used currently is a stepwise strategy guided by tests based on approximate asymptotic Pvalues leading to the selection
Refining Initial Points for KMeans Clustering
, 1998
"... Practical approaches to clustering use an iterative procedure (e.g. KMeans, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive to initial starting conditions. We present a procedure for computing a refined starting condition fro ..."
Abstract

Cited by 317 (5 self)
 Add to MetaCart
Practical approaches to clustering use an iterative procedure (e.g. KMeans, EM) which converges to one of numerous local minima. It is known that these iterative techniques are especially sensitive to initial starting conditions. We present a procedure for computing a refined starting condition
PAMPAS: RealValued Graphical Models for Computer Vision
, 2003
"... Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, the dependencies between the dimensions lead to an exponential growth in computation when performing inference. Many comm ..."
Abstract

Cited by 121 (3 self)
 Add to MetaCart
common computer vision problems naturally map onto the graphical model framework; the representation is a graph where each node contains a portion of the statespace and there is an edge between two nodes only if they are not independent conditional on the other nodes in the graph. When this graph
Decomposable Graphical Gaussian Model Determination
, 1999
"... We propose a methodology for Bayesian model determination in decomposable graphical gaussian models. To achieve this aim we consider a hyper inverse Wishart prior distribution on the concentration matrix for each given graph. To ensure compatibility across models, such prior distributions are obt ..."
Abstract

Cited by 106 (12 self)
 Add to MetaCart
We propose a methodology for Bayesian model determination in decomposable graphical gaussian models. To achieve this aim we consider a hyper inverse Wishart prior distribution on the concentration matrix for each given graph. To ensure compatibility across models, such prior distributions
Coil sensitivity encoding for fast MRI. In:
 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 fullFOV image from the set of intermediate images. To achieve this one must undo the signal superposition underlying the foldover effect. That is, for each pixel in the reduced FOV the signal
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
the frequency of the behavior that results in reward. In Pavlovian, or classical, conditioning, the outcome follows the conditioned stimulus (CS) irrespective of any behavioral reaction, and repeated pairing of stimuli with outcomes leads to a representation of the outcome that is evoked by the stimulus
Efficient Model Determination for Discrete Graphical Models
, 2000
"... We present a novel methodology for bayesian model determination in discrete decomposable graphical models. We assign, for each given graph, a Hyper Dirichlet distribution on the matrix of cell probabilities. To ensure compatibility across models such prior distributions are obtained by marginalis ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We present a novel methodology for bayesian model determination in discrete decomposable graphical models. We assign, for each given graph, a Hyper Dirichlet distribution on the matrix of cell probabilities. To ensure compatibility across models such prior distributions are obtained
DiscreteTime, DiscreteFrequency TimeFrequency Representations
 in Proc. of the IEEE Int. Conf. on Acoust., Speech, and Signal Processing
, 1995
"... A discretetime, discretefrequency Wigner distribution is derived using a grouptheoretic approach. It is based upon a study of the Heisenberg group generated by the integers mod N , which represents the group of discretetime and discretefrequency shifts. The resulting Wigner distribution satisfi ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
A discretetime, discretefrequency Wigner distribution is derived using a grouptheoretic approach. It is based upon a study of the Heisenberg group generated by the integers mod N , which represents the group of discretetime and discretefrequency shifts. The resulting Wigner distribution
An Explicit Link between Gaussian Fields and Gaussian Markov random fields: the SPDE approach
 PREPRINTS IN MATHEMATICAL SCIENCES
, 2010
"... Continuously indexed Gaussian fields (GFs) is the most important ingredient in spatial statistical modelling and geostatistics. The specification through the covariance function gives an intuitive interpretation of its properties. On the computational side, GFs are hampered with the bign problem, ..."
Abstract

Cited by 115 (17 self)
 Add to MetaCart
. The Markov property makes the involved precision matrix sparse which enables the use of numerical algorithms for sparse matrices, that for fields in R 2 only use the squareroot of the time required by general algorithms. The specification of a GMRF is through its full conditional distributions but its
Results 1  10
of
640