Sciweavers

3068 search results - page 29 / 614
» Clustering with Multiple Graphs
Sort
View
EDBT
2011
ACM
197views Database» more  EDBT 2011»
13 years 1 hour ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
14 years 2 months ago
An Indicator for the Number of Clusters: Using a Linear Map to Simplex Structure
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 9 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
CSDA
2007
264views more  CSDA 2007»
13 years 8 months ago
Model-based methods to identify multiple cluster structures in a data set
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...
Giuliano Galimberti, Gabriele Soffritti
CLUSTER
2006
IEEE
14 years 2 months ago
Matrix Multiplication on Two Interconnected Processors
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...
Brett A. Becker, Alexey L. Lastovetsky