Sciweavers

2137 search results - page 196 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ASUNAM
2010
IEEE
13 years 8 months ago
A Multiobjective and Evolutionary Clustering Method for Dynamic Networks
—The discovery of evolving communities in dynamic networks is an important research topic that poses challenging tasks. Previous evolutionary based clustering methods try to maxi...
Francesco Folino, Clara Pizzuti
TKDE
2012
245views Formal Methods» more  TKDE 2012»
12 years 1 days ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
CIKM
2010
Springer
13 years 4 months ago
Mining networks with shared items
Recent advances in data processing have enabled the generation of large and complex graphs. Many researchers have developed techniques to investigate informative structures within...
Jun Sese, Mio Seki, Mutsumi Fukuzaki
CVPR
2007
IEEE
14 years 11 months ago
Segmenting Motions of Different Types by Unsupervised Manifold Clustering
We propose a novel algorithm for segmenting multiple motions of different types from point correspondences in multiple affine or perspective views. Since point trajectories associ...
Alvina Goh, René Vidal
CVPR
2005
IEEE
14 years 11 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
Kai Zhang, Ming Tang, James T. Kwok