A system for graph clustering based on user hints

Authors:
Hugo A. D. do Nascimento;Peter Eades
Affiliations:
University of Newcastle, Australia;University of Sydney, Australia
Venue:
VIP '00 Selected papers from the Pan-Sydney workshop on Visualisation - Volume 2
Year:
2000

Citing 6
Cited 2

Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal
Human-Guided Simple Search

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering

IWPC '00 Proceedings of the 8th International Workshop on Program Comprehension
On the Stability of Software Clustering Algorithms

IWPC '00 Proceedings of the 8th International Workshop on Program Comprehension
A Framework for Experimental Evaluation of Clustering Techniques

IWPC '00 Proceedings of the 8th International Workshop on Program Comprehension

User Hints for map labeling

Journal of Visual Languages and Computing
Perspectives of self-adapted self-organizing clustering in organic computing

BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

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