Sciweavers

4009 search results - page 36 / 802
» Clustering on Complex Graphs
Sort
View
IM
2008
14 years 11 months ago
Finding Strongly Knit Clusters in Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
SIGIR
2008
ACM
14 years 11 months ago
Pagerank based clustering of hypertext document collections
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
Konstantin Avrachenkov, Vladimir Dobrynin, Danil N...
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 3 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
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
GFKL
2005
Springer
95views Data Mining» more  GFKL 2005»
15 years 5 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...