Share Email Print
cover

Proceedings Paper

Navigating large hierarchical space using invisible links
Author(s): Ming C. Hao; Meichun Hsu; Umeshwar Dayal; Adrian Krug
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

To date, many web visualization applications have shown the usefulness of a hyperbolic tree. However, we have discovered that strict hierarchical tree structures are too limited. For many practical applications, we need to generalize a hyperbolic tree to a hyperbolic space. This approach results in massive cross-links in a highly connected graph that clutter the display. To resolve this problem, an invisible link technique is introduced. In this paper. we describe the navigation in a large hyperbolic space using invisible links in some detail. We have applied this invisible link method to three data mining visualization applications: e-business web navigation for URL visits, customer call center for question-answer service, and web site index creation.

Paper Details

Date Published: 28 February 2000
PDF: 11 pages
Proc. SPIE 3960, Visual Data Exploration and Analysis VII, (28 February 2000); doi: 10.1117/12.378920
Show Author Affiliations
Ming C. Hao, Hewlett-Packard Labs. (United States)
Meichun Hsu, Hewlett-Packard Labs. (United States)
Umeshwar Dayal, Hewlett-Packard Labs. (United States)
Adrian Krug, Hewlett-Packard Labs. (United States)


Published in SPIE Proceedings Vol. 3960:
Visual Data Exploration and Analysis VII
Robert F. Erbacher; Philip C. Chen; Jonathan C. Roberts; Craig M. Wittenbrink, Editor(s)

© SPIE. Terms of Use
Back to Top