Sciweavers

2137 search results - page 45 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney
UAI
2004
13 years 9 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan
ICONIP
2008
13 years 9 months ago
Local Feature Selection in Text Clustering
Abstract. Feature selection has improved the performance of text clustering. Global feature selection tries to identify a single subset of features which are relevant to all cluste...
Marcelo N. Ribeiro, Manoel J. R. Neto, Ricardo Bas...
ICML
2007
IEEE
14 years 8 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
ICCS
2004
Springer
14 years 29 days ago
Hierarchical Matrix-Matrix Multiplication Based on Multiprocessor Tasks
We consider the realization of matrix-matrix multiplication and propose a hierarchical algorithm implemented in a task-parallel way using multiprocessor tasks on distributed memory...
Sascha Hunold, Thomas Rauber, Gudula Rünger