A Fast Algorithm for Balanced Graph Clustering

UTSePress Research/Manakin Repository

Search UTSePress Research


Advanced Search

Browse

My Account

Show simple item record

dc.contributor.author Huang, Mao Lin en_US
dc.contributor.author Nguyen, Quang Vinh en_US
dc.contributor.editor Banissi, E., Burkhard, R.A., Grinstein, G., et al en_US
dc.date.accessioned 2009-11-09T05:35:39Z
dc.date.available 2009-11-09T05:35:39Z
dc.date.issued 2007 en_US
dc.identifier 2006009882 en_US
dc.identifier.citation Huang Mao and Nguyen Quang Vinh 2007, 'A Fast Algorithm for Balanced Graph Clustering', IEEE Computer Society Publisher, Los Alamitos, USA, pp. 46-52. en_US
dc.identifier.issn 0-7695-2900-3 en_US
dc.identifier.other E1 en_US
dc.identifier.uri http://hdl.handle.net/10453/2425
dc.description.abstract Scalability problem is a long-lasting challenge for both information visualization and graph drawing communities. Available graph visualization techniques could perform well for small or medium size graphs but they are rarely able to handle very large and complex graphs. One of effective approach to solve this problem is to employ graph abstraction; that is to hierarchically partitioning the complete graph into a clustered graph. A graph visualization technique is then applied to display the abstract view of this clustered graph with partially displayed detail of one or a few sub-graphs where the user is currently focusing on. This reduces the complexity of display and makes it easier for users to interpret, perceive and navigate the large scale information. In this paper, we propose a graph clustering method which can quickly discover the community structure embedded in large graphs and partition the graph into densely connected sub-graphs. The proposed algorithm can not only run fast, but also achieve a consistent partitioning result in which a graph is divided into a set of clusters of the similar size in terms of their visual complexity and the number of nodes and edges. In addition, we also provide a mechanism to partition very dense graphs in which the number of edges is much larger than the number of nodes. en_US
dc.publisher IEEE Computer Society Publisher en_US
dc.relation.isbasedon http://dx.doi.org/10.1109/IV.2007.10 en_US
dc.title A Fast Algorithm for Balanced Graph Clustering en_US
dc.parent Information Visualization en_US
dc.journal.volume en_US
dc.journal.number en_US
dc.publocation Los Alamitos, USA en_US
dc.identifier.startpage 46 en_US
dc.identifier.endpage 52 en_US
dc.cauo.name FEIT.School of Computing and Communications en_US
dc.conference Verified OK en_US
dc.conference.location Zurich, Switzerland en_US
dc.for 080100 en_US
dc.personcode 990771 en_US
dc.personcode 024665 en_US
dc.percentage 100 en_US
dc.classification.name Artificial Intelligence and Image Processing en_US
dc.classification.type FOR-08 en_US
dc.custom International Conference on Information Visualisation en_US
dc.date.activity 20070704 en_US
dc.location.activity Zurich, Switzerland en_US
dc.staffid 024665 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record