18241581
An Associative Information Visualizer
The following item is made available as a courtesy to scholars by the author(s) and Drexel University Library and may contain materials and content, including computer code and tags, artwork, text, graphics, images, and illustrations (Material) which may be protected by copyright law. Unless otherwise noted, the Material is made available for non profit and educational purposes, such as research, teaching and private study. For these limited purposes, you may reproduce (print, download or make copies) the Material without prior permission. All copies must include any copyright notice originally included with the Material. You must seek permission from the authors or copyright owners for all uses that are not allowed by fair use and other provisions of the U.S. Copyright Law. The responsibility for making an independent legal assessment and securing any necessary permission rests with persons desiring to reproduce or use the Material.
7373402
Co-cited author maps as interfaces to digital libraries: designing Pathfinder Networks in the humanities
Using data from the Arts and Humanities Citation Index for 1988-1997, we are attempting to generate co-cited author maps in real time that can serve as interfaces for document retrieval. Our novel approach is to start the maps by entering the name of a single author. Our system obtains a rank-ordered list of the other authors who are most often co-cited with the input name (e.g., the top 50) and then systematically pairs these other authors in turn to obtain their co-citation counts. The resulting matrix can be passed to a mapping program which groups the authors meaningfully to show the structure of the field implied by the input author's name. At present we are experimenting with Pathfinder Networks (PFNETs) as the mapping program, and show a PFNET for 25 authors in hermeneutics, a major field of the humanities. The documents co-citing the mapped authors are candidates for retrieval. We discuss desirable features and design considerations in retrieval interfaces based on PFNETs.
33192410
Visual interactions with Web database content
In this paper, we describe an experimental web application, Visual MeSH that supports dynamic user interaction with medical vocabulary databases and literature databases. Visual MeSH is a client-server application based on Java RMI technology. It provides multiple views of MeSH term relationships and allows the user to explore term relationships visually. Visual MeSH helps the user improve both search precision and recall by making it easy to convert user’s natural language queries to controlled vocabulary-based queries.
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.
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.
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.
4444141
Similarity Search with Implicit Object Features
Driven by many real applications, in this paper we study the problem of similarity search with implicit object features; that is, the features of each object are not pre-computed/evaluated. As the existing similarity search techniques are not applicable, a novel and efficient algorithm is developed in this paper to approach the problem. The R-tree based algorithm consists of two steps: feature evaluation and similarity search. Our performance evaluation demonstrates that the algorithm is very efficient for large spatial datasets.
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.
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.
46289674
Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules
Abstract Counting costs have a great impact on efficiency of mining association rules in a large database of sales transactions. In this paper, we first formally analyze the facts that determine counting costs. Secondly, we present an on-line bitmap indexing technique to speed-up the counting process. Besides theoretical analysis, our implementation reports suggest that this indexing technique may reduce counting costs up to 50%, and almost at no costs.
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.