28 February 2000 Navigating large hierarchical space using invisible links
Author Affiliations +
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.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ming C. Hao, Ming C. Hao, Meichun Hsu, Meichun Hsu, Umeshwar Dayal, Umeshwar Dayal, Adrian Krug, Adrian Krug, } "Navigating large hierarchical space using invisible links", Proc. SPIE 3960, Visual Data Exploration and Analysis VII, (28 February 2000); doi: 10.1117/12.378920; https://doi.org/10.1117/12.378920
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

WebVis: a hierarchical web homepage visualizer
Proceedings of SPIE (February 27 2000)
Gutenburg's web site: the challenge of web printing
Proceedings of SPIE (April 03 1997)
Visual mining geo-related data using pixel bar charts
Proceedings of SPIE (March 10 2005)
Multiple view and multiform visualization
Proceedings of SPIE (February 27 2000)
Visual mining business service using pixel bar charts
Proceedings of SPIE (June 03 2004)
Multilingual mapping based on XML-SVG
Proceedings of SPIE (November 02 2008)

Back to Top