With the development of high-throughput microarray technology, a large number of microarray data has been obtained by tens of thousands of simulation experiments on gene expression. However, due to the high cost, gene...
详细信息
Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In thi...
详细信息
Most researches on co-authorship network analyze the author's information globally according to the overall network topology structure, instead of analyzing the author's local network. Therefore, this paper pr...
详细信息
Most researches on co-authorship network analyze the author's information globally according to the overall network topology structure, instead of analyzing the author's local network. Therefore, this paper presents a community mining algorithm and divides big co-authorship network into small communities, in which entities' relationship is closer. Then we mine central authors in community by three different centrality standards including closeness centrality, eigenvector centrality and a new proposed measure termed extensity degree centrality. We choose the SIGMOD data as datasets and measure the centrality from different views. And experiments in co-authorship network achieve many interesting results, which indicate our technique is efficient and feasible, and also have reference value for scientific evaluation.
A text mining algorithm named HMM-TFM (Hidden Markov Model based transcription factor name mining) is presented. The proposed algorithm does not need a dictionary of transcription factor names. A small verb set is def...
详细信息
A huge amount of microarray datasets are produced with big number of genes and small samples. Feature selection methods have become a very sharp tool to select the gene signatures from the whole gene set. In recent ye...
详细信息
A huge amount of microarray datasets are produced with big number of genes and small samples. Feature selection methods have become a very sharp tool to select the gene signatures from the whole gene set. In recent years, researchers are concerned much about the datasets containing samples of cancer as well as corresponding control tissues. However, few feature selection methods consider the effect of paired samples. In this article, we propose a new feature selection method for paired microarray datasets based on the original paired t-test approach. We apply on the paired datasets across six common cancer types. Through comparison with some widely used methods on the performance of prediction power, stability of gene lists and functional stability, our method shows excellent performance. The proposed method has good effectiveness, stability and consistency, which enables the method to be applicative to feature selection for paired microarray expression data analysis.
Solving reinforcement learning problems in continuous space with function approximation is currently a research hotspot of machine learning. When dealing with the continuous space problems, the classic Q-iteration alg...
详细信息
The increase of microarray experiments brings a fresh challenge to analyze microarray data across datasets. Several methods have been developed and implemented. But the current tools were either complicated software w...
详细信息
In this paper we use an improved Particle Swarm Optimization algorithm to solve Multiple Sequence Alignment (MSA). MSA is a key problem in bioinformatics. The thesis starts with the theory of Particle swarm optimizati...
详细信息
In this paper, on the basis of principal component analysis, we use least squares support vector machine (LS-SVM) to predict tRNA. Appearance frequencies of single nucleotide, 2-nucleotides, (G-C)% and (A-T)% were cho...
详细信息
A mathematical model using the spline functional as smooth constraints was presented. The second-and fourth-order partial differential equations constraints were two special cases in the model. The necessary condition...
详细信息
A mathematical model using the spline functional as smooth constraints was presented. The second-and fourth-order partial differential equations constraints were two special cases in the model. The necessary condition for optical flow minimization problem solution was also presented. This model provided a basis for formal representation and numerical computation of optical flow from a methodological point of view. The significance of this mathematical model lay in the simplification of the equations for optical flow computation into linear algebraic equations. The simplification can contribute to discrete representation of the optical flow equation, and also verify that the use of smoothness constraints can ensure the existence and uniqueness of the solution from the view of the algebraic equations.
暂无评论