Sciweavers

2383 search results - page 10 / 477
» Finding Representative Set from Massive Data
Sort
View
BMCBI
2006
147views more  BMCBI 2006»
13 years 6 months ago
Grouping Gene Ontology terms to improve the assessment of gene set enrichment in microarray data
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...
Alex Lewin, Ian C. Grieve
IJCV
2006
194views more  IJCV 2006»
13 years 6 months ago
Reconstructing Open Surfaces from Image Data
In this paper a method for fitting open surfaces to data obtained from images is presented using a level set representation of the surface. This is done by tracking a curve, repres...
Jan Erik Solem, Anders Heyden
APIN
1999
107views more  APIN 1999»
13 years 6 months ago
Massively Parallel Probabilistic Reasoning with Boltzmann Machines
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
Petri Myllymäki
UAI
1992
13 years 7 months ago
Interval Structure: A Framework for Representing Uncertain Information
In this paper, a unified framework for representing uncertain information based on the notion of an interval structure is proposed. It is shown that the lower and upper approximat...
S. K. Michael Wong, Lusheng Wang, Yiyu Yao
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 9 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda