This paper presents a system for graph clustering where users can visualize the clustering and give 'hints' that help a computing method to find better solutions. Hints include a variety of constraints, as well as direct manipulation of the previously computed clustering. The framework is flexible: it can accommodate several kinds of hints, clustering algorithms, and visualization techniques.
|Cite as: do Nascimento, H.A.D. and Eades, P. (2001). A System for Graph Clustering Based on User Hints. In Proc. Selected papers from Pan-Sydney Area Workshop on Visual Information Processing (VIP2000), Sydney, Australia. CRPIT, 2. Eades, P. and Jin, J., Eds. ACS. 73-74. |
(local if available)