16036261
Building a repository for workflow systems
Workflow technology is becoming the key technology for business process modeling, reengineering and automating. During the workflow specification, enactment and administration, there may appear various types of metadata about workflow specifications and instances. A repository manager is, therefore, necessary to store and manage these metadata. In this paper, a workflow metamodel is proposed first. Then the requirements of repository support for workflows are explored and analysed. Based on the requirements, an object oriented design for the repository manager is presented.
17501980
Term Graph Model for Text Classification
Most existing text classification methods (and text mining methods at large) are based on representing the documents using the traditional vector space model. We argue that important information, such as the relationship among words, is lost. We propose a term graph model to represent not only the content of a document but also the relationship among the keywords. We demonstrate that the new model enables us to define new similarity functions, such as considering rank correlation based on PageRank-style algorithms, for the classification purpose. Our preliminary results show promising results of our new model.
6221918
Efficiently Matching Proximity Relationships in Spatial Databases
Spatial data mining recently emerges from a number of real applications, such as real-estate marketing, urban planning, weather forecasting, medical image analysis, road traffic accident analysis, etc. It demands for efficient solutions for many new, expensive, and complicated problems. In this paper, we investigate a proximity matching problem among clusters and features. The investigation involves proximity relationship measurement between clusters and features. We measure proximity in an average fashion to address possible nonuniform data distribution in a cluster. An efficient algorithm, for solving the problem, is proposed and evaluated. The algorithm applies a standard multistep paradigm in combining with novel lower and upper proximity bounds. The algorithm is implemented in several different modes. Our experiment results do not only give a comparison among them but also illustrate the efficiency of the algorithm.
14038708
Efficiently computing frequent tree-like topology patterns in a Web environment
Data mining has recently emerged in a number of real life applications, such as banking, supermarketing, and interneting. The authors investigate a novel data mining problem derived from the applications of WWW. They present an efficient algorithm for solving the problem. The initial implementation suggests that the algorithm is very efficient and scalable in practice.
4018890
Clustering Moving Objects for Spatio-temporal Selectivity Estimation
Many spatio-temporal applications involve managing and querying moving objects. In such an environment, predictive spatio-temporal queries become an important query class to be processed to capture the nature of moving objects. In this paper, we investigated the problem of selectivity estimation for predictive spatio-temporal queries. We propose a novel histogram technique based on a clustering paradigm. To avoid expensive computation costs, we developed linear time heuristics to construct such a histogram. Our performance study indicated that the new techniques improve the accuracy of the existing techniques by one order of magnitude.
1993887
Locating Motifs in Time-Series Data
Finding motifs in time-series is proposed to make clustering of time-series subsequences meaningful, because most existing algorithms of clustering time-series subsequences are reported meaningless in recent studies. The existing motif finding algorithms emphasize the efficiency at the expense of quality, in terms of the number of time-series subsequences in a motif and the total number of motifs found. In this paper, we formalize the problem as a continuous top-k motif balls problem in an m-dimensional space, and propose heuristic approaches that can significantly improve the quality of motifs with reasonable overhead, as shown in our experimental studies.
1977537
Active layout engine: Algorithms and applications in variable data printing
Variable Data Printing (VDP) refers to the process of generating and printing dynamic or personalized contents. A core technology required by highly customized VDP applications is the automatic document layout design engine, whose task is to adjust the original design or generate a new layout to present variable contents. This paper presents a novel document layout design engine, called Active Layout Engine (ALE). 'Active' reflects several unique features of the engine: first, through linear text block modeling and two-pass constraint solving algorithm, it supports a rich set of layout operations, such as simultaneous optimization of text block width and height, integrated image cropping, and non-rectangular text wrapping. Second, it does not rely on a particular layout description language and thus can actively pursue emerging formats and standards. This paper describes the various technical aspects of ALE: linearization of the text block modeling, two-pass constraint solving algorithm, format-neutral Active Layout Template (ALT), system optimization, and typical VDP applications around the core engine.
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.
12662254
Creating digital libraries: content generation and re-mastering
This article has two main goals: to describe the automatic creation of a digital library and to provide an overview of the metaalgorithmic patterns that can be applied to increase the accuracy of its creation. Automating the creation of useful digital libraries - that is, digital libraries affording searchable text and reusable ("repurposable") output - is a complicated process, whether the original library is paper-based or already available in electronic form. We outline the steps involved in the creation of a deployable digital library (>1.2 /spl times/ 10/sup 6/ pages) for MIT Press, as well as its implications to other aspects of digital library creation, management, use and repurposing. Input, transformation, information extraction, and output processes are considered in light of their utility in creating layers of content. Interestingly, in some aspects, scanning directly from paper offers extra opportunities for error-checking through feedback-feedforward combination. Strategies for quality assurance (QA) at the document, chapter and book level are also discussed. We emphasize the use of metaalgorithmic design patterns for application towards improving the content generation, extraction and remastering. This approach also increases the ease with which modules and algorithms are added to and deprecated from the system.
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.
15723189
Impact of imperfect OCR on part-of-speech tagging
Part-of-speech (POS) tagging is the foundation of natural language processing (NLP) systems, and thus has been an active area of research for many years. However, one question remains unanswered: How will a POS tagger behave when the input text is not error-free? This issue can be of great importance when the text comes from imperfect sources like optical character recognition (OCR). This paper analyzes the performance of both individual POS taggers and combination systems on imperfect text. Experimental results show that a POS tagger's accuracy decreases linearly with the character error rate and the slope indicates a tagger's sensitivity to input text errors.