Sciweavers

1805 search results - page 171 / 361
» Functional programming with structured graphs
Sort
View
DAGM
2004
Springer
15 years 6 months ago
Predictive Discretization During Model Selection
We present an approach to discretizing multivariate continuous data while learning the structure of a graphical model. We derive the joint scoring function from the principle of p...
Harald Steck, Tommi Jaakkola
BMCBI
2006
199views more  BMCBI 2006»
15 years 1 months ago
PageMan: An interactive ontology tool to generate, display, and annotate overview graphs for profiling experiments
Background: Microarray technology has become a widely accepted and standardized tool in biology. The first microarray data analysis programs were developed to support pair-wise co...
Björn Usadel, Axel Nagel, Dirk Steinhauser, Y...

Lecture Notes
443views
16 years 11 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
AAAI
2008
15 years 3 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
SIAMDM
2008
119views more  SIAMDM 2008»
15 years 1 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...