Sciweavers

3105 search results - page 7 / 621
» The Path-Packing Structure of Graphs
Sort
View
CVPR
2012
IEEE
11 years 9 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
JMLR
2010
128views more  JMLR 2010»
13 years 2 months ago
Learning Causal Structure from Overlapping Variable Sets
We present an algorithm name cSAT+ for learning the causal structure in a domain from datasets measuring different variable sets. The algorithm outputs a graph with edges correspo...
Sofia Triantafilou, Ioannis Tsamardinos, Ioannis G...
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 23 days ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
CAS
2008
118views more  CAS 2008»
13 years 7 months ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer
ENDM
2006
75views more  ENDM 2006»
13 years 7 months ago
The structure and unlabelled enumeration of toroidal graphs with no K3, 3's
We characterize the toroidal graphs with no K3,3-subdivisions as canonical compositions in which 2-pole planar networks are substituted for the edges of non-planar cores. This str...
Andrei Gagarin, Gilbert Labelle, Pierre Leroux