An Effective and Efficient Data Cleaning Technique in Large Databases

title: PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
abstract: In this paper, we will propose PC-Filter (PC stands for Partitio n Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter distinguishes itself from all of existing methods by using the notion of partition in duplicate detection. It first sorts the whole database and splits the sorted database into a number of record partitions. The Partition Comparison Graph (PCG) is then constructed by performing fast partition pruning. Finally, duplicate records are effectively detected by using internal and external partition comparison based on PCG. Four properties, used as heuristics, have been devised to achieve a remarkable efficiency of the filter based on triangle inequity of record similarity. PC-Filter is insensitive to the key used to sort the database, and can achieve a very good recall level that is comparable to that of the pair-wise record comparison method but only with a complexity of O(N 4/3). Equipping existing detection methods with PC-Filter, we are able to well solve the ”Key Selection” problem, the ”Scope Specification” problem and the ”Low Recall” problem that the existing methods suffer from.

title: A Color Indexing Scheme Using Two-level Clustering Processing for Effective and Efficient Image Retrieval
abstract: In this paper, we present a clustering-based color indexing scheme for effective amd efficient image retrieval, which is essentially an exploration on the application of clustering technique to image retrieval. In our approach, the color features are clustered automatically using a color clustering algorithm twice (called two-level clustering processing) and two color feature summarizations are obtained, e.g. Local Color Centriods (LCCs) and Global Color Centroids (GCCs). Based upon LCCs and GCCs, a three-level R-tree is bulit for indexing database images and performing effecitve and efficient image retrieval. The experiments show that this indexing scheme is effective and efficient in performing image retrieval.

title: Generalized Semi-Infinite Optimization and its Application in Robotics' Path Planning Problem

title: XAR-miner: efficient association rules mining for XML data
abstract: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently. In XAR-Miner, raw data in the XML document are first preprocessed to transform to either an Indexed Content Tree (IX-tree) or Multi-relational databases (Multi-DB), depending on the size of XML document and memory constraint of the system, for efficient data selection and AR mining. Task-relevant concepts are generalized to produce generalized meta-patterns, based on which the large ARs that meet the support and confidence levels are generated.

title: Gene Specific Co-regulation Discovery: An Improved Approach
abstract: Discovering gene co-regulatory relationships is a new but important research problem in DNA microarray data analysis. The problem of gene specific co-regulation discovery is to, for a particular gene of interest, called the target gene , identify its strongly co-regulated genes and the condition subsets where such strong gene co-regulations are observed. The study on this problem can contribute to a better understanding and characterization of the target gene. The existing method, using the genetic algorithm (GA), is slow due to its expensive fitness evaluation and long individual representation. In this paper, we propose an improved method for finding gene specific co-regulations. Compared with the current method, our method features a notably improved efficiency. We employ k NN Search Table to substantially speed up fitness evaluation in the GA. We also propose a more compact representation scheme for encoding individuals in the GA, which contributes to faster crossover and mutation operations. Experimental results with a real-life gene microarray data set demonstrate the improved efficiency of our technique compared with the current method.

title: DNA Sequences Classification Based on Immune Evolution Network
abstract: Classification is a major task in the gene sequence analysis. Based on the general principle of artificial immune system, this paper first constructed a classifier which inducted antibody-antigen identification, immune colonel reproduction, hypermutation, affinity mature and the network suppression, by simulating how the antigens stimulate the immune network and how the immune network responds. Then, a "leave-one-out" method was adopted to test the classifier's performance, applying 1-20th DNA sequences of Art-model-data with class attribute. Its accuracy was up to 90%. At last, a well-pleasing result was got on the prediction of 21-40th DNA sequences of Art-model-data.

title: Itanium processor clock design
abstract: The Itanium processor is Intel's first 64-bit microprocessor  and features a highly parallel architecture fabricated using the 0.18um process. This higher integration of features requires a significant silicon real estate and high clock loading. These factors, coupled with more prominent on-die variations because of reduced device geometries, call for special techniques to manage the clock design. The Itanium processor employs very well balanced clock routing along with distributed deskew buffers (DSK) to achieve low skew. The ItaniumTM processor also includes additional features to aid performance tuning and timing debug. This paper highlights the salient features of the Itanium processor clock design and presents clock characterization data from initial silicon.

title: A New Scheme For Wireless Network Authentication System
abstract: In this paper we use the independent component analysis (ICA) and Factorial Face Code as an additional user identity checking method to strengthen the solidity of the wireless application system authentication security. The basic theory of ICA and factorial face code are presented firstly and then the main works of this method are detailed. After that an experiment based on this method is given. According to this experiment, we know that this method can confirm user’s identity and can be an additional method to check wireless application system user identity. In order to improve the affectivity of this method, we should increase the mount of image data in the face database, getting more ICs and enlarging the size of the basic images set. All this will increase the length of the factorial face code, and subsequently will differentiate one person from another more easily.

title: Index Support for Visualizing Large, Distributed, High-Dimension Data Sets

title: A model-driven approach to enforce crosscutting assertion checking
abstract: Design by Contract provides an effective principle to enable the construction of robust software by describing properties of a module using logical assertions. This paper presents a model-driven approach for weaving assertion checking aspects into a large software system. The approach is based on a technique called two-level aspect weaving. At the top level, crosscutting assertions are weaved into a model by use of a model weaver. The second step of the weaving process occurs when the Model-Driven Program Transformation technique is applied to perform large-scale adaptation of the underlying source code from the contracts specified in the high-level models. The paper briefly presents a case study to illustrate the concept.