Sciweavers

4009 search results - page 185 / 802
» Clustering on Complex Graphs
Sort
View
IAT
2009
IEEE
15 years 8 months ago
Efficient Distributed Bayesian Reasoning via Targeted Instantiation of Variables
Abstract--This paper is focusing on exact Bayesian reasoning in systems of agents, which represent weakly coupled processing modules supporting collaborative inference through mess...
Patrick de Oude, Gregor Pavlin
NN
2006
Springer
127views Neural Networks» more  NN 2006»
15 years 4 months ago
Assessing self organizing maps via contiguity analysis
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
Ludovic Lebart
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 7 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
CCS
2009
ACM
16 years 4 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
CVPR
2005
IEEE
16 years 6 months ago
Beyond Pairwise Clustering
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
Sameer Agarwal, Jongwoo Lim, Lihi Zelnik-Manor, Pi...