Sciweavers

316 search results - page 12 / 64
» Expressiveness of graph conditions with variables
Sort
View
ICML
2004
IEEE
15 years 3 months ago
Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs
We introduce a new perceptron-based discriminative learning algorithm for labeling structured data such as sequences, trees, and graphs. Since it is fully kernelized and uses poin...
Hisashi Kashima, Yuta Tsuboi
IBERAMIA
2010
Springer
14 years 8 months ago
Interaction Graphs for Multivariate Binary Data
We define a class of graphs that summarize in a compact visual way the interaction structure between binary multivariate characteristics. This allows studying the conditional depe...
Johan Van Horentonioeek, Jesús Emeterio Nav...
114
Voted
SMR
2010
149views more  SMR 2010»
14 years 8 months ago
Capturing variability in business process models: the Provop approach
Usually, for a particular business process different variants exist. Each of them constitutes an adjustment of a reference process model to specific requirements building the proc...
Alena Hallerbach, Thomas Bauer, Manfred Reichert
ICDT
2005
ACM
139views Database» more  ICDT 2005»
15 years 3 months ago
First Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
Maarten Marx
BMCBI
2007
138views more  BMCBI 2007»
14 years 9 months ago
A full Bayesian hierarchical mixture model for the variance of gene differential expression
Background: In many laboratory-based high throughput microarray experiments, there are very few replicates of gene expression levels. Thus, estimates of gene variances are inaccur...
Samuel O. M. Manda, Rebecca E. Walls, Mark S. Gilt...