Focus Dependant Multi-Level Graph CLustering - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2004

Focus Dependant Multi-Level Graph CLustering

Abstract

In this paper we propose a structure-based clustering technique that transforms a given graph into a specific double tree structure called multi-level outline tree. Each meta-node of the tree - that represents a subset of nodes - is itself hierarchically clustered. So, a meta-node is considered as a tree root of included clusters.The main originality of our approach is to account for the user focus in the clustering process to provide views from different perspectives. Multi-level outline trees are computed in linear time and easy to explore. We think that our technique is well suited to investigate various graphs like Web graphs or citation graphs.
No file

Dates and versions

lirmm-00108946 , version 1 (23-10-2006)

Identifiers

Cite

François Boutin, Mountaz Hascoët. Focus Dependant Multi-Level Graph CLustering. AVI: Advanced Visual Interface, May 2004, Gallipoli, Italy. pp.167-170, ⟨10.1145/989863.989888⟩. ⟨lirmm-00108946⟩
50 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More