Sciweavers

602 search results - page 107 / 121
» A New Approximation Method of the Quadratic Discriminant Fun...
Sort
View
UAI
2000
14 years 10 months ago
Gaussian Process Networks
In this paper we address the problem of learning the structure of a Bayesian network in domains with continuous variables. This task requires a procedure for comparing different c...
Nir Friedman, Iftach Nachman
TMI
2008
136views more  TMI 2008»
14 years 9 months ago
Classification of fMRI Time Series in a Low-Dimensional Subspace With a Spatial Prior
We propose a new method for detecting activation in functional magnetic resonance imaging (fMRI) data. We project the fMRI time series on a low-dimensional subspace spanned by wave...
François G. Meyer, Xilin Shen
WSDM
2010
ACM
245views Data Mining» more  WSDM 2010»
15 years 6 months ago
Improving Quality of Training Data for Learning to Rank Using Click-Through Data
In information retrieval, relevance of documents with respect to queries is usually judged by humans, and used in evaluation and/or learning of ranking functions. Previous work ha...
Jingfang Xu, Chuanliang Chen, Gu Xu, Hang Li, Elbi...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 6 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 9 months ago
Cleansing uncertain databases leveraging aggregate constraints
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
Haiquan Chen, Wei-Shinn Ku, Haixun Wang