Discover gene specific local co-regulations from time-course gene expression data
Discovering gene co-regulatory relationships is one of most important research in DNA microarray data analysis. The problem of gene specific co-regulation discovery is to, for a particular gene of interest called target gene, identify the condition subsets where strong gene co-regulations of the target gene are observed and its co-regulated genes in these condition subsets. The co-regulations are local in the sense that they occur in some subsets of full experimental conditions. The study on this problem can contribute to better understanding and characterizing the target gene during the biological activity involved. In this paper, we propose an innovative method for finding gene specific co-regulations using genetic algorithm GA. A sliding window is used to delimit the allowed length of conditions in which gene co-regulations occur and an ad hoc GA, called the progressive GA, is performed in each window position to find those condition subsets having high fitness. It is called progressive because the initial population for the GA in a window position inherits the top-ranked individuals obtained in its preceding window position, enabling the GA to achieve a better accuracy than the non-progressive algorithm. kNN Lookup Table is utilized to substantially speed up fitness evaluation in the GA. Experimental results with a real-life gene expression data demonstrate the efficiency and effectiveness of our technique in discovering gene specific co-regulations.

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: Anomaly detection in high-dimensional network data streams: A case study
abstract: In this paper, we study the problem of anomaly detection in high-dimensional network streams. We have developed a new technique, called Stream Projected Outlier deTector (SPOT), to deal with the problem of anomaly detection from high-dimensional data streams. We conduct a case study of SPOT in this paper by deploying it on 1999 KDD Intrusion Detection application. Innovative approaches for training data generation, anomaly classification and false positive reduction are proposed in this paper as well. Experimental results demonstrate that SPOT is effective in detecting anomalies from network data streams and outperforms existing anomaly detection methods.

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: 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: Multi-Index Cooperative Mixed Strategy for Service Selection Problem in Service-Oriented Architecture
abstract: Under the environment of Service-Oriented Architecture (SOA), service users have to decide how to choose the proper provider from the candidates to obtain optimal service level. The existing approaches based on the optimization theories usually ignore the decision conflicts among users, which result in periodic QoS fluctuation and poor system performance. This paper treated the service selection problem as an inconstant-sum non-cooperative n-person dynamic game with incomplete information. The mechanism that generated the decision conflicts is discussed at first, and then Multi-index Cooperative Mixed Strategy (MCMS) with corresponding algorithm for finding its optimal solution is developed. Simulation shows that MCMS offers service users an optimal strategy that reduces the fluctuation of QoS and improves performance of SOA. Moreover, the stability and equilibrium of MCMS make it acceptable to most of the users, thus MCMS is able to improve predictability and controllability of SOA significantly.

title: Name Disambiguation Using Atomic Clusters
abstract: Name ambiguity is a critical problem in many applications, in particular in the online bibliography systems, such as DBLP and CiteSeer. Previously, several clustering based methods have been proposed although, the problem still presents to be a big challenge for both research and industry communities. In this paper, we present a complementary study to the problem from another point of view. We propose an approach of finding atomic clusters to improve the performance of existing clustering-based methods. We conducted experiments on a dataset from a real-world system: Arnetminer.org. Experiments results show that significant improvements can be obtained by using the proposed atomic clusters finding approach (about +8% and +27% improvements depending on different clustering methods).

title: The Predictive Control of Sintering Temperature in Rotary Kiln Based on Image Feedback and Soft Computing
abstract: The sintering temperature in rotary kiln is measured through image processing algorithm as feedback of its predictive control. The predictive model based on radial basis function (RBF) network is designed by the image and other process data optimized by genetic algorithm. The final results of application at an alumina sintering kiln show that this intelligent predictive control strategy can achieve higher stability in normal condition.

title: Expert Finding in a Social Network
abstract: This paper addresses the issue of expert finding in a social network. The task of expert finding, as one of the most important research issues in social networks, is aimed at identifying persons with relevant expertise or experience for a given topic. In this paper, we propose a propagation-based approach that takes into consideration of both person local information and network information (e.g. relationships between persons). Experimental results show that our approach can outperform the baseline approach.

title: Automatic detection and recognition of signs from natural scenes
abstract: In this paper, we present an approach to automatic detection and recognition of signs from natural scenes, and its application to a sign translation task. The proposed approach embeds multiresolution and multiscale edge detection, adaptive searching, color analysis, and affine rectification in a hierarchical framework for sign detection, with different emphases at each phase to handle the text in different sizes, orientations, color distributions and backgrounds. We use affine rectification to recover deformation of the text regions caused by an inappropriate camera view angle. The procedure can significantly improve text detection rate and optical character recognition (OCR) accuracy. Instead of using binary information for OCR, we extract features from an intensity image directly. We propose a local intensity normalization method to effectively handle lighting variations, followed by a Gabor transform to obtain local features, and finally a linear discriminant analysis (LDA) method for feature selection. We have applied the approach in developing a Chinese sign translation system, which can automatically detect and recognize Chinese signs as input from a camera, and translate the recognized text into English.