Sciweavers

4926 search results - page 194 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
PKDD
2009
Springer
134views Data Mining» more  PKDD 2009»
16 years 24 days ago
Mining Graph Evolution Rules
In this paper we introduce graph-evolution rules, a novel type of frequency-based pattern that describe the evolution of large networks over time, at a local level. Given a sequenc...
Michele Berlingerio, Francesco Bonchi, Björn ...
PAMI
2010
324views more  PAMI 2010»
15 years 4 months ago
A Compositional and Dynamic Model for Face Aging
—In this paper we present a compositional and dynamic model for face aging. The compositional model represents faces in each age group by a hierarchical And-Or graph, in which An...
Jin-Li Suo, Song Chun Zhu, Shiguang Shan, Xilin Ch...
ACST
2006
15 years 7 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
AAAI
2008
15 years 8 months ago
Dormant Independence
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
Ilya Shpitser, Judea Pearl
IJAR
2006
89views more  IJAR 2006»
15 years 6 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander