74 search results - page 9 / 15 » Algorithms for Generating Convex Sets in Acyclic Digraphs |
116
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
111
Voted
UAI
2008
15 years 1 months ago
2008
We generalize Shimizu et al's (2006) ICA-based approach for discovering linear non-Gaussian acyclic (LiNGAM) Structural Equation Models (SEMs) from causally sufficient, conti...
115
Voted
ICDM
2007
IEEE
15 years 6 months ago
2007
IEEE
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...
EUSFLAT
2009
14 years 10 months ago
2009
Fuzzy Logic Systems are widely recognized to be successful at modelling uncertainty in a large variety of applications. While recently interval type-2 fuzzy logic has been credited...
117
Voted
JMLR
2010
14 years 7 months ago
2010
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...