Sciweavers

1986 search results - page 141 / 398
» Path Separability of Graphs
Sort
View
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 7 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
BIRTHDAY
2009
Springer
14 years 4 months ago
On Lazy Commutation
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
Nachum Dershowitz
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 10 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
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 11 months ago
Reconstruction from Randomized Graph via Low Rank Approximation
The privacy concerns associated with data analysis over social networks have spurred recent research on privacypreserving social network analysis, particularly on privacypreservin...
Leting Wu, Xiaowei Ying, Xintao Wu
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry