16928019
Map Displays for Information Retrieval
The focus of this article is to develop a map display for to stack in the dark, without knowing what stacks that information retrieval. Through an examination of relawe have walked through. We can get a few books each tionships among visual displays, information retrieval, time and walk out of the library to see if the book we and browsing, advantages of visual displays for informaare searching for is among them. If not, we have to walk tion retrieval are characterized as (1) the ability to conin again, based on our knowledge and our previous experivey a large amount of information in a limited space, (2) the potential to reveal semantic relationships of terms ence, to a location where we hope the book would be. In and documents, and (3) the facilitation of browsing and this situation, success in finding a book greatly depends perceptual inferences on retrieval interfaces. These adon whether we can walk to the right place in the dark (to vantages are further demonstrated through a map disgenerate a good query), and whether we know how to play generated by a neural network’s self-organizing aladjust our locations until we get to the right place (to gorithm. The map display detects complex relationships among given documents, and reveals the relationships modify queries interactively) . through a spatial arrangement of terms abstracted from Can we turn on the light for such a library? Can we the documents. The map display also provides interdevelop some visible cues in our retrieval systems so that active tools to allow the user to interact with the underlywe can use our perception for information seeking in ing information. Examples of the map displays show that the digital environment? Answers to these questions may such map displays can be used both as an overview tool and an access or exploration tool, and the map displays reside in the recent advance of information technology. will likely increase the amount of information that the ‘‘Information processing has been evolving from numeriuser is willing to browse. cal computation to character handling, and now to visual information processing’’ (Kunii, 1989). As a result, visualization will become ‘‘the second computer revolution’’ Introduction (Friedhoff & Benzon, 1989). Computers are expected to be used to reveal associations and properties of electronic The world in which we live is a visual world. We look, information to allow people to use their visual capabilities we see, and we find things. Even for written information, for information seeking (Veith, 1988). we expect to see it on tangible media stored in visible locations. We have developed a whole set of perception This article discusses using some mapping techniques and association techniques to get what we need from the to create visual displays for textual information stored in environment. However, when we search information by the computer. The focus of the article is on the developcomputer, all the things, information, media, locations, ment of a map display for information retrieval. The map as well as their relationships, become invisible; all the display attempts to show both contents and semantic clues for visual perceptions and associations disappear. structures of a document space by mapping major conWe heavily rely on our competence to generate queries cepts and documents of a document space to a two-dimenand the computer’s ability to match the queries with inforsional map. It preserves, as faithfully as possible, documation stored in the computer. At best, when interaction ment semantic relationships and reveals these relationis involved, we can modify queries based on the retrieved ships through various visual components of the display. results of a previous query. This is like searching books By communicating a spatial metaphor to the user and in a library without light. We can walk around from stack making information in a document space graphically visible, the map display provides a visual guide to help the user perceive contents and structures of the document Received May 26, 1995; revised December 18, 1995; accepted Decemspace. ber 18, 1995. In the following, relationships among information retrieval, browsing, and visual displays are discussed first, q 1997 John Wiley & Sons, Inc.
2535403
Visualization for the document space
An information retrieval frame work that promotes graphical displays, and that will make documents in the computer visualizable to the searcher, is described. As examples of such graphical displays, two simulation results of using a Kohonen feature map to generate map displays for information retrieval are presented and discussed. The map displays are a mapping from a high-dimensional document space to a two-dimensional space. They show document relationships by various visual cues, such as dots, links, clusters, and areas, as well as their measurement and spatial arrangement. Using the map displays as an interface for document retrieval systems, the user is provided with richer visual information to support browsing and searching.<<ETX>>
207195547
Graphical table of contents
This paper proposes a graphical table of contents (GTOC) that is functionally analogous to the table of contents. The proposed GTOC can be generated automatically from the text of documents. It visualizes document contents and relationships to allow easy access of underlying documents. It also provides various interactive tools to let the user explore the documents. Issues of how to generate such GTOC include how documents are indexed and organized, how the organized documents are visualized, and what interactive means are needed to provide necessary functionality of GTOC. These issues are discussed in this paper with a GTOC prototype based on Kohonen’s selforganizing featore map algorithm.
21113165
Graphical representations of electronic search patterns
Increasing numbers of researchers and developers are collecting data that trace the processes of humancomputer interactions. Although a variety of methods are used to collect such data, all researchers share common problems in representing and analyzing continuous streams of data. A set of methods and tools for graphically representing the search patterns of users interacting with a variety of databases and hypertexts is under development as part of ongoing research in electronic information seeking. The methodology described in this article involves defining state spaces of user options within a system, capturing keystrokes or mouse moves as raw data, coding these data into the state spaces, and analyzing user moves through the state space as evidence of goal-directed informationseeking strategies and patterns. A tool for displaying user moves through a state space has been developed and is described. The tool graphically represents data in a variety of formats, allowing human pattern recognition capabilities to be applied for data analysis. Graphs can be represented for individual searches or for multiple searches done by either a single searcher or by several searchers working on the same search task.
32681772
Visual MeSH
Visual MeSH is a graphical interface developed to interact with real world databases such as the National Library of Medicine’s MetaThesaurus and MEDLINE. Visual MeSH makes it easy for the user to browse complex relationships through visual representation of thesaurus structures. It helps the user to select controlled vocabulary terms for online searching in the click-andchoose environment.
18690541
Real-time author co-citation mapping for online searching
Author searching is traditionally based on the matching of name strings. Special characteristics of authors as personal names and subject indicators are not considered. This makes it difficult to identify a set of related authors or to group authors by subjects in retrieval systems. In this paper, we describe the design and implementation of a prototype visualization system to enhance author searching. The system, called AuthorLink, is based on author co-citation analysis and visualization mapping algorithms such as Kohonen's feature maps and Pathfinder networks. AuthorLink produces interactive author maps in real time from a database of 1.26 million records supplied by the Institute for Scientific Information. The maps show subject groupings and more fine-grained intellectual connections among authors. Through the interactive interface the user can take advantage of such information to refine queries and retrieve documents through point-and-click manipulation of the authors' names.
6238577
Labeling Scheme and Structural Joins for Graph-Structured XML Data
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graph-structured XML data brings new challenges because traditional structural join methods cannot be directly applied. In this paper, we propose a labeling scheme for graph-structured XML data. With this labeling scheme, the reachability relationship of two nodes can be judged efficiently without accessing other nodes. Based on this labeling scheme, we design efficient structural join algorithms to evaluate reachability queries. Experiments show that our algorithms have high efficiency and good scalability.
16437816
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic analyzing, Web navigation, semantic web, chemical informatics and bio-informatics systems, and computer vision. A graph reachability query, as one of the primary tasks, is to find whether two given data objects, u and v, are related in any ways in a large and complex dataset. Formally, the query is about to find if v is reachable from u in a directed graph which is large in size. In this paper, we focus ourselves on building a reachability labeling for a large directed graph, in order to process reachability queries efficiently. Such a labeling needs to be minimized in size for the efficiency of answering the queries, and needs to be computed fast for the efficiency of constructing such a labeling. As such a labeling, 2-hop cover was proposed for arbitrary graphs with theoretical bounds on both the construction cost and the size of the resulting labeling. However, in practice, as reported, the construction cost of 2-hop cover is very high even with super power machines. In this paper, we propose a novel geometry-based algorithm which computes high-quality 2-hop cover fast. Our experimental results verify the effectiveness of our techniques over large real and synthetic graph datasets.
18279251
Detection and analysis of table of contents based on content association
AbstractAs a special type of table understanding, the detection and analysis of tables of contents (TOCs) play an important role in the digitization of multi-page documents. Most previous TOC analysis methods only concentrate on the TOC itself without taking into account the other pages in the same document. Besides, they often require manual coding or at least machine learning of document-specific models. This paper introduces a new method to detect and analyze TOCs based on content association. It fully leverages the text information throughout the whole multi-page document and can be directly applied to a wide range of documents without the need to build or learn the models for individual documents. In addition, the associations of general text and page numbers are combined to make the TOC analysis more accurate. Natural language processing and layout analysis are integrated to improve the TOC functional tagging. The applications of the proposed method in a large-scale digital library project are also 
discussed.
19354462
Towards area requirements for drawing hierarchically planar graphs
Hierarchical graphs are an important class of graphs for modeling many real applications in software and information visualization. In this paper, we investigate area requirements for drawing hierarchically planar graphs regarding two different drawing standards. Firstly, we show an exponential lower bound for the area needed for straight-line drawing of hierarchically planar graphs. The lower bound holds even for s-t hierarchical graphs without transitive arcs, in contrast to the results for upward planar drawing. This motivates our investigation of another drawing standard grid visibility representation, as a relaxation of straight-line drawing. An application of the existing results from upward drawing can guarantee a quadric drawing area for grid visibility representation but does not necessarily guarantee the minimum drawing area. Motivated by this, we will present a new grid visibility drawing algorithm which is efficient and guarantees the minimum drawing area with respect to a given topological embedding. This implies that the area minimization problem is polynomial time solvable restricted to the class of graphs whose planar embeddings are unique. However, we can show that the problem of area minimization of grid visibility for hierarchically planar graphs is generally NP-hard, even restricted to s-t graphs.
19601209
Pricing-Based Control of Large Networks
In this work we study pricing as a mechanism to control large networks. Our model is based on revenue maximization in a general loss network with Poisson arrivals and arbitrary holding time distributions. In dynamic pricing schemes, the network provider can charge different prices to the user according to the current utilization level of the network. We show that, when the system becomes large, the performance of an appropriately chosen static pricing scheme, whose price is independent of the current network utilization, will approach that of the optimal dynamic pricing scheme. Further, we show that under certain conditions, this static price is independent of the route that the connections take. This result has the important implication that distance-independent pricing that is prevalent in current domestic telephone networks in the U.S. may in fact be appropriate not only from a simplicity, but also a performance point of view. We also show that in large systems prior knowledge of the connection holding time is not important from a network revenue point of view.