دانلود مقاله ISI انگلیسی شماره 79060
ترجمه فارسی عنوان مقاله

GO: یک الگوریتم خوشه ای برای تجسم نمودار ☆

عنوان انگلیسی
GO: A cluster algorithm for graph visualization ☆
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
79060 2015 12 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Journal of Visual Languages & Computing, Volume 28, June 2015, Pages 71–82

ترجمه کلمات کلیدی
تجسم اطلاعات؛ خوشه بندی نمودار
کلمات کلیدی انگلیسی
Information visualization; Graph clustering
پیش نمایش مقاله
پیش نمایش مقاله  GO: یک الگوریتم خوشه ای برای تجسم نمودار ☆

چکیده انگلیسی

As we are in the big data age, graph data such as user networks in Facebook and Flickr becomes large. How to reduce the visual complexity of a graph layout is a challenging problem. Clustering graphs is regarded as one of effective ways to address this problem. Most of current graph visualization systems, however, directly use existing clustering algorithms that are not originally developed for the visualization purpose. For graph visualization, a clustering algorithm should meet specific requirements such as the sufficient size of clusters, and automatic determination of the number of clusters. After identifying the requirements of clustering graphs for visualization, in this paper we present a new clustering algorithm that is particularly designed for visualization so as to reduce the visual complexity of a layout, together with a strategy for improving the scalability of our algorithm. Experiments have demonstrated that our proposed algorithm is capable of detecting clusters in a way that is required in graph visualization.