Sciweavers

Share
164 search results - page 1 / 33
» Symmetrizations for clustering directed graphs
Sort
View
EDBT
2011
ACM
197views Database» more  EDBT 2011»
7 years 10 months 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
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
8 years 8 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
PAMI
2010
260views more  PAMI 2010»
8 years 5 months ago
Unsupervised Object Segmentation with a Hybrid Graph Model (HGM)
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
Guangcan Liu, Zhouchen Lin, Yong Yu, Xiaoou Tang
SPIRE
2001
Springer
8 years 11 months ago
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohar...
ALT
2007
Springer
8 years 11 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
books