Sciweavers

2137 search results - page 35 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
AAAI
2008
13 years 10 months ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang
DAM
2006
172views more  DAM 2006»
13 years 7 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala
ICCS
2005
Springer
14 years 1 months ago
A Multi-level Approach for Document Clustering
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
Suely Oliveira, Sang-Cheol Seok
COMAD
2009
13 years 8 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan
KAIS
2011
129views more  KAIS 2011»
13 years 2 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis