10188810
Estimation Distribution of Algorithm for Fuzzy Clustering Gene Expression Data
With the rapid development of genome projects, clustering of gene expression data is a crucial step in analyzing gene function and relationship of conditions. In this paper, we put forward an estimation of distribution algorithm for fuzzy clustering gene expression data, which combines estimation of distribution algorithms and fuzzy logic. Comparing with sGA, our method can avoid many parameters and can converge quickly. Tests on real data show that EDA converges ten times as fast as sGA does in clustering gene expression data. For clustering accuracy, EDA can get a more reasonable result than sGA does in the worst situations although both methods can get the best results in the best situations.
11689877
A Projection and Search Algorithm for the Bicluster Problem
The advent of microarray technologies has made the experimental study of gene expression faster and more efficient. It is an important task to analyze the gene expression data acquired from the microarray experiments. Biclustering is a popular method to search a subset of genes which exhibit similar expression patterns along a subset of conditions in the gene expression matrix. In this paper, we propose a projection and search algorithm (PSA) for finding biclusters in the gene expression matrix. The algorithm adopts projection method to find a raw submatrix, then refines and extends the raw submatrix into a bicluster using greedy algorithms. We test the algorithm on simulation data and real data. The test results show that the algorithm has good performance on both simulation data and real data. Additionally, compared with other methods, PSA isnpsilat sensitive to noise level.
195347610
Environment Lighting for Point Sampled Geometry
1077673
Low Complexity MMSE Vector Precoding Using Lattice Reduction for MIMO Systems
In this paper, a lattice-reduction-aided (LRA) minimum mean square error (MMSE) vector precoding (VP) is proposed for multiple input multiple output (MIMO) systems. Three schemes are provided for the perturbation vector design by Babai's approximation procedures based on lattice reduction method to reduce the complexity. Performance and complexity analysis are provided. Simulation results show that the proposed schemes significantly outperform the conventional MMSE Tomlinson-Harashima precoding (THP) and the zero forcing (ZF) VP. Compared with the MMSE VP via closest-point search, our LRA approach provides a simple alternative with little performance loss.
15273775
Learning Microarray Gene Expression Data by Hybrid Discriminant Analysis
Microarray technology offers a high-throughput means to study expression networks and gene regulatory networks in cells. The intrinsic nature of high dimensionality and small sample size in microarray data calls for effective computational methods. In this article, we propose a novel hybrid dimension reduction technique for classification that combines principal component analysis (PCA) and linear discriminant analysis (LDA)-hybrid PCA and LDA analysis. This technique effectively solves the singular scatter matrix problem caused by small training samples and increases the effective dimension of the projected subspace. It offers more flexibility and a richer set of alternatives to LDA and PCA in the parametric space. In addition, we propose a boosted hybrid discriminant analysis (HDA), using the AdaBoost algorithm which provides a unified and stable solution to find close to the optimal PCA-LDA prediction result and also reduces computational complexity. Extensive experiments on the yeast cell cycle regulation data set show the superior performance of the hybrid analysis, as we explain.
35354920
Color text image binarization based on binary texture analysis
In this paper, a novel binarization algorithm for color text images is presented. This algorithm effectively integrates color clustering and binary texture analysis, and is capable of handling situations with complex backgrounds. In this algorithm, dimensionality reduction and graph theoretical clustering are first employed. As the result, binary images related to clusters can be obtained. Binary texture analysis is then performed on each candidate binary image. Two kinds of effective texture features, run-length histogram and spatial-size distribution related respectively, are extracted and explored. Cooperating with an LDA classifier, the optimal candidate of the best binarization effect is obtained. Experiments with images collected from Internet has been carried out and compared with existing techniques, both show the effectiveness of the algorithm.
15977207
Exploiting hierarchical CP-nets to increase the reliability of Web services workflow
Individual Web services can be composed together to form value-added composite Web services represented as business process workflow. However, the value of such composite Web services is directly influenced by the reliability of the composite services. Composing Web services is not an easy task and is error-prone, so there is a growing interest for the verification techniques which enable designers to find and repair design errors even before actual running of the service, or allow designers to detect erroneous properties such as deadlocks or livelocks and formally verify whether the service process design does have certain desired properties (such as consistency with the conversation protocols of partner service). In this paper, we present to analyze and verify Web services composition by using some kind of colored Petri nets (CP-nets) called hierarchical CP-nets, which combine the strengths of Petri nets with the expressive power of high-level programming and have sound mathematical semantics. Services composition proposals can be transformed by transformation rules into CP-nets, which can be simulated to analyze the performance and verified to investigate behavioral properties by exploiting existing CP-nets specialized tools