ppxscal/embedding_network huggingface dataset:
Online and Incremental Mining of Separately-Grouped Web Access Logs
Authors: Yew Kwong Woon, Wee Keong Ng, Ee-Peng Lim
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

The rising popularity of electronic commerce makes datamining an indispensable technology for business competitiveness.The World Wide Web provides abundant raw datain the form of web access logs, web transaction logs andweb user profiles. Without data mining tools, it is impossibleto make any sense of such massive data. In this paper,we focus on web usage mining because it deals most appropriatelywith understanding user behavioral patterns whichis the key to successful customer relationship management.Previous work deals separately on specific issues of web usagemining and make assumptions without taking a holisticview and thus, have limited practical applicability. We formulatea novel and more holistic version of web usage min-ingtermed TRAnsactionized LOgfile Mining (TRALOM)to effectively and correctly identify transactions as well asto mine useful knowledge from web access logs. We alsointroduce a new data structure, called the Webrie, to efficientlyhold useful preprocessed data so that TRALOM canbe done in an online and incremental fashion. Experimentsconducted on real web server logs verify the usefulness andpracticality of our proposed techniques.
Reducing System Overheads in Home-based Software DSMs
Authors: Weiwu Hu, Weisong Shi, Zhimin Tang
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Software DSM systems suffer from the high communication and coherence-induced overheads that limit performance. This paper introduces our efforts in reducing system overheads of a home-based software DSM called JIAJIA. Three measures, including eliminating false sharing through avoiding unnecessarily in-validating cached pages, reducing virtual memory page faults with a new write detection scheme, and propagating barrier message in a hierarchical way, are taken to reduce the system overhead of JIAJIA. Evaluation with some well-known DSM benchmarks reveals that, though varying with memory reference patterns of different applications, these measures can reduce system overhead of JIAJIA effectively.
A Decision Model Supporting Cooperative Work as an Experience Package
Authors: Maria Teresa Baldassarre, Danilo Caivano, Corrado Aaron Visaggio, Giuseppe Visaggio
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Subcontracting is one of the challenges modern software engineering must face. The need for decision models that guide software engineers in identifying when it is advisable and how to divide a contract, let alone, which risks it involves and which actions should be adopted to control them, is continuously increasing. Many researchers have proposed and experimented these decision models from various viewpoints. We feel the need for a method able to merge and formalize these experiences in order for them to be reused by the entirecommunity.This work presents an approach for formalizing such experience. It also proposes a decision model for dividing a contract according to its characteristics and to the cooperating organizations.This decision model, together with others present in literature, have been integrated and formalized in an experience package.
Visualizing Association Mining Results through Hierarchical Clusters
Authors: Steven Noel, Vijay V. Raghavan, Chee-Hung Henry Chu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We propose a new methodology for visualizing association mining results. Inter-item distances are computed from combinations of item set supports. The new distances retain a simple pairwise structure, and are consistent with important frequently occurring item sets. Thus standard tools of visualization, e.g. hierarchical clustering dendrograms can still be applied, while the distance information upon which they are based is richer. Our approach is applicable to general association mining applications, as well as applications involving information spaces modeled by directed graphs, e.g. the Web. In the context of collections of hypertext documents, the inter-document distances capture the information inherent in a collection's link structure, a for of link mining. We demonstrate our methodology with document sets extracted fro the Science Citation Index, applying a metric that measures consistency between clusters and frequent itemsets.
Bottom-Up Evaluation of Logic Programs Using Binary Decision Diagrams
Authors: Mizuho Iwaihara, Yusaku Inoue
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Binary decision diagram (BDD) is a data structure to manipulate Boolean functions and recognized as a powerful tool in the VLSI CAD area. We consider that compactness and efficient operations of BDDs can be utilized for storing temporary relations in bottom-up evaluation of logic queries. We show two methods of encoding relations into BDDs, called logarithmic encoding and linear encoding, define relational operations on BDDs and discuss optimizations in ordering BDD variables to construct memory and time efficient BDDs. Our experiments show that our BDD-based bottom-up evaluator has remarkable performance against traditional hash table-based methods for transitive closure queries on dense graphs.
Experiment on the Automatic Detection of Function Clones in a Software System Using Metrics
Authors: Jean Mayrand, Claude Leblanc, Ettore Merlo
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

This paper presents a technique to automatically identify duplicate and near duplicate functions in a large software system. The identification technique is based on metrics extracted from the source code using the tool Datrix(. This clone identification technique uses 21 function metrics grouped into four points of comparison. Each point of comparison is used to compare functions and determine their cloning level. An ordinal scale of eight cloning levels is defined. The levels range from an exact copy to distinct functions. The metrics, the thresholds and the process used are fully described. The results of applying the clone detection technique to two telecommunication monitoring systems totaling one million lines of source code are provided as examples. The information provided by this study is useful in monitoring the maintainability of large software systems.
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
Authors: David Wai-Lok Cheung, Jiawei Han, Vincent Ng, C. Y. Wong
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

An incremental updating technique is developed for maintenance of the association rules discovered by database mining. There have been many studies on efficient discovery of association rules in large databases. However, it is nontrivial to maintain such discovered rules in large databases because a database may allow frequent or occasional updates and such updates may not only invalidate some existing strong association rules but also turn some weak rules into strong ones. In this study, an incremental updating technique is proposed for efficient maintenance of discovered association rules when new transaction data are added to a transaction database.
Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases
Authors: Shailesh Agarwal, Arthur M. Keller, Gio Wiederhold, Krishna Saraswat
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

In this work we address the problem of dealing with data inconsistencies while integrating data sets derived from multiple autonomous relational databases. The fundamental assumption in the classical relational model is that data is consistent and hence no support is provided for dealing with inconsistent data. Due to this limitation of the classical relational model, the semantics for detecting, representing, and manipulating inconsistent data have to be explicitly encoded in the applications by the application developer. In this paper, we propose the flexible relational model, which extends the classical relational model by providing support for inconsistent data. We present a flexible relation algebra, which provides semantics for database operations in the presence of potentially inconsistent data. Finally, we discuss issues raised for query optimization when the data may be inconsistent.
A Secure Routing Protocol for Ad Hoc Networks
Authors: Kimaya Sanzgiri, Bridget Dahill, Brian Neil Levine, Clay Shields, Elizabeth M. Belding-Royer
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Most recent ad hoc network research has focused on providing routing services without considering security. In this paper, we detail security threats against ad hoc routing protocols,specifically examining AODV and DSR. In light of these threats, we identify three different environments with distinct security requirements. We propose a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected. Our protocol, ARAN, is based on certificates and successfully defeats all identified attacks.
The clustering Property of Corner Transformation for Spatial Database Applications
Authors: Ju-Won Song, Kyu-Young Whang, Young-Koo Lee, Sang-Wook Kim
Venue: 23rd International Computer Software and Applications Conference (1999)

Spatial access methods(SAMs) are often used as clustering indexes in spatial database systems. Therefore, a SAM should have the clustering property both in the index and in the data file.In this paper, we argue that corner transformation preserves the clustering property such that objects having similar sizes and positions in the original space tend to be placed in the same region in the transform space. We then show that SAMs based on corner transformation are able to maintain clustering both in the index and in the data file for storage systems with fixed object positions and propose the MBR-MLGF as an example to implement such an index.Extensive experiments comparing with the R$^*$-tree show that corner transformation indeed preserves the clustering property. This result reverses the common belief that transformation will adversely affect the clustering.
Quadratic Spline Wavelet Approach to Automatic Extraction of Baselines from Document Images
Authors: Yuan Yan Tang, Jiming Liu, Lihua Yang
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

This paper presents a wavelet-based approach to edge detection in document processing. According to local analysis of the document images using wavelet theory, a novel method is developed to detect the edges in document processing, including extraction of the contours of characters and excerpt of the reference lines in the form document images with gray-levels. In this method, the quadratic spline wavelet is utilized. Experiments have been contacted in this study. The positive results show the effectiveness of the applications of quadratic spline wavelet to edge detection, especially, to extract the reference lines and image boundaries in document processing.
Combining Multiple Representations and Classifiers for Pen-based Handwritten Digit Recognitio
Authors: Fevzi Alimoglu, Ethem Alpaydin
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

We investigate techniques to combine multiple representations of a handwritten digit to increase classification accuracy without significantly increasing system complexity or recognition time. We compare multiexpert and multistage combination techniques and discuss in detail in a comparative manner methods for combining multiple learners: Voting, mixture of experts, stacking, boosting and cascading. In pen-based handwritten character recognition, the input is the dynamic movement of the pentip over the pressure sensitive tablet. There is also the image formed as a result of this movement. On a real-world database, we notice that the two multi-layer perceptron (MLP) neural network-based classifiers using separately these representations make errors on different patterns implying that a suitable combination of the two would lead to higher accuracy. Thus we implement and compare voting, mixture of experts, stacking and cascading. Combined classifiers have an error percentage less than individual ones. The final combined system of two MLPs has less complexity and memory requirement than a single k-nearest neighbor using one of the representations.
Performance Evaluation of Rule Semantics in Active Databases
Authors: Elena Baralis, Andrea Bianco
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Different rule execution semantics may be available in the same active database system. We performe several simulation experiments to evaluate the performance trade-offs yielded by different execution semantics in various operating conditions. In particular, we evaluate the effect of executing transaction and rule statements that affect a varying number of data instances, and applications with different rule triggering breadth and depth. Since references to data changed by the database operation triggering the rules are commonly used in active rule programming, we also analyze the impact of its management on overall performance.
An interactive system to extract structured text from a geometrical representation
Authors: Benoit Poirier, Michel Dagenais
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The proliferation of electronic document formats impedes the dissemination and management of documents. Indeed, a common format with structural information is required to obtain document indexing and navigation. While in some formats it is easy to decode and preserve the document structure information, often the only easily obtainable representation is Postscript, where only the geometrical information remains. Even if an organization is willing to convert all its document producing activities to a structure preserving format such as HTML, the existing documents need to be converted. The paper addresses the difficult problem of extracting the structure of a document from a geometrical representation. An interactive tool to extract the document content and structure from a geometric representation (Postscript) has been developed. It successfully analyzes several documents produced with different tools, and produces structural information using the HyperText Markup Language (HTML). The end user, when presented with the extracted document structure, can interactively modify it, if needed. The tool is easily extended to recognize new constructs and is aimed at organizations needing to convert numerous documents for searching and browsing on intranets or on the Internet.
Using a Formal Technique for Protocol Idealization: A Cautionary Note
Authors: Anish Mathuria
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Analysis of cryptographic protocols by BAN-type logics requires an idealization step to transform a concrete protocol into a logical abstraction. Experience shows that the idealization task is notoriously error-prone. A protocol may be seriously flawed, yet an incorrect idealization can cause a proof of a protocol's correctness using the logical rules to go through. Mao has proposed a formal reasoning technique to guard against protocol idealization errors. A simple example demonstrates that his technique misses certain kinds of idealization errors that appear to be within its scope.
An adaptive synchronization method for unpredictable communication patterns in dataparallel programs
Authors: Sundeep Prakash, Rajive Bagrodia
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Parallel assignments are among the most common constructs in a dataparallel program. The communication patterns implied by a parallel assignment statement may be classified as predictable or unpredictable. Predictable communication patterns can be identified by the compiler and are typically amenable to efficient code generation. Unpredictable communication patterns cannot be detected at compile time and in mast situations are inefficiently implemented using general techniques. The well known inspector-executor method efficiently implements unpredictable communication patterns that repeat themselves, by capturing and saving information the first time, and using it for subsequent repetitions. The primary contribution of this paper is a method that efficiently implements a wide class of unpredictable communication patterns. This class includes patterns that are not necessarily repeated, and so additionally encompasses cases where the inspector-executor method fails. This paper describes the new method and its implementation on the IBM SP1 multicomputer. Experimental results on the performance of this implementation are presented for a variety of synthetic benchmark codes.
A Cliche'-Based Environment to Support Architectural Reverse Engineering
Authors: Roberto Fiutem, Paolo Tonella, Giuliano Antoniol, Ettore Merlo
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

When programmers perform maintenance tasks, program understanding is required. One of the first activities in understanding a software system is identifying its subsystems and their relations, i.e. its software architecture. Since a large part of the effort is spent in creating a mental model of the system under study, tools can help maintainers in managing the evolution of legacy systems, by showing them architectural information. In this paper, an environment for the architectural analysis of software systems is described. The environment is based on a hierarchical architectural model that drives the application of a set of recognizers, each producing a different architectural view of the system or of some of its parts. Recognizers embody knowledge about architectural cliches and use flow analysis techniques to make their output more accurate.
Synthesis for testability of large complexity controllers
Authors: Franco Fummi, Donatella Sciuto, M. Serro
Venue: Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors (1995)

Specification of large complexity controllers in industrial design environments is performed by means of a top-down methodology leading to a description based on a hierarchy of FSMs. This paper presents a set of algorithms which compare such hierarchical descriptions with their structural implementations to produce irredundant circuits for which test patterns are easily derived. These algorithms can be inserted into any commercial design flow, based on VHDL descriptions, thus creating a synthesis for testability environment which provides testable and optimized gate-level descriptions.
Global reduction in wormhole k-ary n-cube networks with multidestination exchange worms
Authors: Dhabaleswar K. Panda
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper presents a new approach to implement global reduction operations in wormhole k-ary n-cubes. The novelty lies in using multidestination message passing mechanism instead of single destination (unicast) messages. Using pairwise exchange worms along each dimension, it is shown that complete global reduction and barrier synchronization operations, as defined by the Message Passing Interface (MPI) standard, can be implemented with n communication start-ups as compared to 2n [log/sub 2/ k] start-ups required with unicast-based message passing. Analytical results for different values of communication startup time, system size, and data size are presented and compared with the unicast-based scheme. The analysis indicates that the proposed framework can be effectively used in wormhole-routed systems to achieve fast global reduction without a separate control network.
A Scalable Algorithm for Clustering Sequential Data
Authors: Valerie Guralnik, George Karypis
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In recent years, we have seen an enormous growth in the amount of available commercial and scientific data. Data from domains such as protein sequences, retail transactions, intrusion detection, and web-logs have an inherent sequential nature. Clustering of such data sets is usefulfor various purposes. For example, clustering of sequences from commercialdata sets may help marketer identify different customer groups based upon their purchasing patterns. Grouping protein sequences that share similar structure helps in identifying sequences with similar functionality. Over the years, many methods have been developed for clustering objects according to their similarity. However these methods tend to have a computational complexity that is at least quadratic on the number of sequences. In this paperwe present an entirely different approach to sequence clustering that does not require an all-against-all analysis and uses a nearlinear complexity K-means based clustering algorithm. Our experiments using data sets derived from sequences of purchasing transactions and protein sequences show that this approach is scalable and leads to reasonably good clusters.
Tree Indexing for Efficient Search of Similar Documents
Authors: Chung-Min Chen, Duen-Ren Liu
Venue: 24th International Computer Software and Applications Conference (2000)

Linear algebra-based techniques have long been used to correlate similar documents. They map the documents to a multi-dimensional vector space, in which a vector represents each document. Searching related documents then translates into searching nearest neighbors in the vector space. In this paper, we propose an indexing structure, called cosine R-tree, which indexes multidimensional vector space and provides efficient nearest neighbor search. Our preliminary results show that it gives better performance than a brute-force linear scan strategy.
Pattern Recognition of the Selection Sort Algorithm
Authors: Ronald Finkbine
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

The field of program understanding attempts to determine the function of a code segmentwithout programmer intervention and for this to occur, it is necessary to have a model (plan)against which to attempt to match the code segment of interest. This paper traces in detailthe pattern recognition of the selection sort algorithm. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
Authors: Xiaotie Deng, Binhai Zhu
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

We present a randomized parallel algorithm for the Voronoi diagram of line segments on coarse grained parallel machines, which, for any input of n line segments on P processors (n= O (P3 +), for any> 0) requires (with high probability) O([n log n/P]) local operations, O(n/P) global-operations (or messages) per processor, O(1) levels of global data dependency (or O(1) communication phases). This generic parallel algorithm can be transformed to the CRCW PRAM model in O(log n) time with O(n) processors and thus provides a different solution from, and conceptually much simpler than, that of [RR].