Sciweavers

2137 search results - page 112 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
WALCOM
2010
IEEE
255views Algorithms» more  WALCOM 2010»
14 years 5 months ago
A Global k-Level Crossing Reduction Algorithm
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
ICITA
2005
IEEE
14 years 4 months ago
Partition-Based Parallel PageRank Algorithm
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
Arnon Rungsawang, Bundit Manaskasemsak
CVPR
2012
IEEE
12 years 1 months ago
Non-negative low rank and sparse graph for semi-supervised learning
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
GLVLSI
2003
IEEE
147views VLSI» more  GLVLSI 2003»
14 years 4 months ago
Clustering based acyclic multi-way partitioning
In this paper, we present a clustering based algorithm for acyclic multi-way partitioning. Many existing partitioning algorithms have shown that clustering can effectively improv...
Eric S. H. Wong, Evangeline F. Y. Young, Wai-Kei M...
APVIS
2009
13 years 12 months ago
A hybrid space-filling and force-directed layout method for visualizing multiple-category graphs
Many graphs used in real-world applications consist of nodes belonging to more than one category. We call such graph "multiplecategory graphs". Social networks are typic...
Takayuki Itoh, Chris Muelder, Kwan-Liu Ma, Jun Ses...