126 search results - page 4 / 26 » BAG: a graph theoretic sequence clustering algorithm |
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
CCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
We present a vision based, adaptive, decision theoretic model of human facial displays in interactions. The model is a partially observable Markov decision process, or POMDP. A POM...