检索结果-内蒙古大学图书馆

A hidden markov model and immune particle swarm optimization-based algorithm for multiple sequence alignment

18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence

作者： Ge, Hong-Wei Liang, Yan-Chun Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun 130012 China

ISBN: (纸本)3540304622

Multiple sequence alignment (MSA) is a fundamental and challenging problem in the analysis of biologic sequences. In this paper, an immune particle swarm optimization (IPSO) is proposed, which is based on the models of the vaccination and the receptor editing in immune systems. The proposed algorithm is used to train hidden Markov models (HMMs), further, an integration algorithm based on the HMM and IPSO for the MSA is constructed. The approach is tested on a set of standard instances taken from the Benchmark Alignment database, BAliBASE. Numerical simulated results are compared with those obtained by using the Baum-Welch training algorithm. The results show that the proposed algorithm not only improves the alignment abilities, but also reduces the time cost. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Mining maximal sequential patterns

Mining maximal sequential patterns

引用

2005 International Conference on Neural Networks and Brain Proceedings, ICNNB'05

作者： Guan, En-Zheng Chang, Xiao-Yu Wang, Zhe Zhou, Chun-Guang Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0780394224

To solve the problem that when patterns are long, frequent sequential patterns mining may generate an exponential number of results, which often makes decision-makers perplexed for there is too much useless repeated information, a novel algorithm MFSPAN (Maximal Frequent Sequential Pattern mining algorithm) to mine the complete set of maximal frequent sequential patterns in sequence databases is proposed. MFSPAN takes full advantage of the property that two different sequences may share a common prefix to reduce itemset comparing times. Experiments on standard test data show that MFSPAN is very effective. © 2005 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A novel method for mining sequential patterns in datasets

A novel method for mining sequential patterns in datasets

引用

ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications

作者： Xiaoyu, Chang Chunguang, Zhou Zhe, Wang Ping, Hu Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun 130012 China

ISBN: (纸本)0769525288

Sequential pattern mining is one of the most important fields in data mining. In this paper, we propose a novel algorithm FSPAN (Fast Sequential Pattern mining algorithm) to do the sequence mining. FSPAN can mine all the frequent sequential patterns in large datasets and it integrates a depth-first traversal approach with an effective pruning mechanism. This pruning mechanism solves the problem of searching frequent sequences in a sequence database by searching frequent items or frequent itemsets, which makes this method very efficient. Moreover, the databases scanned via FSPAN keep shrinking quickly, which makes the algorithm more efficient when the sequential patterns are longer. Experiments on standard test data show that FSPAN is very effective. © 2006 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Robust estimation of the fundamental matrix based on an error model

Robust estimation of the fundamental matrix based on an erro...

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Zhong, Hui-Xiang Feng, Yue-Ping Pang, Yun-Jie Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)078039092X

A new method is presented for robustly estimating fundamental matrix from matched points. The method comprises two parts. The first uses a robust technique-the random sample consensus (RANSAC) to discard outliers in an initial set of matched points. It adopts the sampling strategy to generate inliers from the initial set. The second part of the method is an algorithm for computing fundamental matrix, using the output of the RANSAC. This algorithm is based on the consistent fundamental matrix estimation in a quadratic measurement error model. An extended system for determining the estimator is proposed, and an efficient implementation for solving the system-a continuation method is developed. The proposed algorithm avoids solving total eigenvalue problems. Results for both synthetic and real images show the effectiveness of the proposed method. © 2005 IEEE.

关键词： Robustness (control systems)

来源：评论

学校读者我要写书评

暂无评论

Combining greedy method and genetic algorithm to identify transcription factor binding sites

Combining greedy method and genetic algorithm to identify tr...

引用

6th International Conference on Hybrid Intelligent Systems and 4th Conference on Neuro-Computing and Evolving Intelligence, HIS-NCEI 2006

作者： Wanyu, Wang Xiaoyu, Chang Chunguang, Zhou Key Laboratory of Symbol Computation and Knowledge Engineering Juin University Ministry of Education Changchun 130012 China

ISBN: (纸本)0769526624

Identification of Transcription Factor Binding Sites (TFBS) from the upstream region of genes remains a highly important and unsolved problem particularly in higher eukaryotic genomes. In this paper, we propose a novel approach to identify transcription factor binding sites. This approach combines greedy method and genetic algorithm (CGGA) to search conserved segment in the given sequence set. A new greedy method which can efficiently search a local optimal result is proposed. In order to solve the high complexity of this algorithm, we also give an effective improvement for this method. Then, we describe how to combine genetic algorithm with this greedy method to find the more optimal results. Greedy method is combined to the fitness function of the genetic algorithm. We apply this approach on two different TFBS sets and the results show that it can find correct result both effective and efficient, and for CRP binding sites, it get a more accurate result than Gibbs Sampler, AlignACE and MDGA. © 2006 IEEE.

关键词： Transcription factors

来源：评论

学校读者我要写书评

暂无评论

An adaptive stochastic collision detection between deformable objects using particle swarm optimization

An adaptive stochastic collision detection between deformabl...

引用

EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC

作者： Tianzhu, Wang Wenhui, Li Yi, Wang Zihou, Ge Dongfeng, Han Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)3540332375

In this paper, we present an efficient method for detecting collisions between highly deformable objects, which is a combination of newly developed stochastic method and Particle Swarm Optimization (PSO) algorithm. Firstly, our algorithm samples primitive pairs within the models to construct a discrete binary search space for PSO, and in this way user can balance performance and detection quality. Besides a particle update process is added in every time step to handle the dynamic environments caused by deformations. Our algorithm is also very general that makes no assumptions about the input models and doesn't need to store additional data structures either. In the end, we give the precision and efficiency evaluation about the algorithm and find it might be a reasonable choice for complex deformable models in collision detection systems. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

An extended system method for consistent fundamental matrix estimation

An extended system method for consistent fundamental matrix ...

引用

International Conference on Intelligent Computing, ICIC 2005

作者： Zhong, Huixiang Feng, Yueping Pang, Yunjie Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China

ISBN: (纸本)9783540282266

This paper is concerned with solution of the consistent fundamental matrix estimation in a quadratic measurement error model. First an extended system for determining the estimator is proposed, and an efficient implementation for solving the system-a continuation method is developed to fix on an interval in which a local minimum belongs. Then an optimization method using a quadratic interpolation is used to exactly locate the minimum. The proposed method avoids solving total eigenvalue problems. Thus the computational cost is significantly reduced. Synthetic and real images are used to verify and illustrate the effectiveness of the proposed approach. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

An AutoEncoder-Based Matrix Factorization Approach to Estimating Cell Proportion from Bulk Tumor RNA-seq Data

An AutoEncoder-Based Matrix Factorization Approach to Estima...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Xu, Yingze Wang, Yan Xie, Xuping Wang, Feilong Chen, Qiong Sun, Huiyan Jilin University College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun China Jilin University School of Artificial Intelligence Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun China

ISBN: (纸本)9781665401265

The deconvolution of infiltrating immune cells and stromal cells from complex tumor tissues is significant for studying the impact of these cells on tumor development, as well as assisting cancer therapies. Integrating cell-specific marker genes from several references, we put forward an AutoEncoder-based matrix factorization method to estimate the cell proportion in heterogeneous samples. The proportion predicted by our method achieved over 0.95 Pearson correlation coefficient (PCC) with the ground truth. Moreover, through analyzing association between cell proportion of tumor tissues and clinical information of the tumor patients, we found that the proportion of cancer-associated fibroblast (CAF) gradually increased with the progress of tumor, and the proportion of B cell in tissues was significantly related to the five-year survival rate of tumor patients. © 2021 IEEE.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

An integration of cotraining and KNN for LPU problem

An integration of cotraining and KNN for LPU problem

引用

2nd Indian International Conference on Artificial Intelligence, IICAI 2005

作者： Xin, RuiMing Zuo, WanLi Yang, Ping Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology JiLin University Changchun 130012 China

ISBN: (纸本)0972741216

Under the framework of LPU (learning from positive data and unlabeled data), this paper originally proposes a three-step algorithm. First, Co-Training is employed for filtering out the "suspect positive" data from the unlabeled dataset U. If CoTraining filter out the most of positive data mixed in U, the remainder of U can be viewed as a negative set with a little noise. Second, a constrained KNN approach attempts to pick out the positive data from "suspect positive" dataset which is produced in first step. Those data picked out can be supplied to positive dataset P. Finally, a linear SVM will learn from both the purified U as negative and the expanded P as positive. Because of the algorithm's characteristic of automatic expanding positive dataset, the proposed algorithm especially performs well in situations where given positive dataset P is insufficient. A comprehensive experiment proves that our algorithm is preferable to the existing ones. Copyright © IICAI 2005.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Canonical Huffman code based full-text index

引用

Progress in Natural Science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b, Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a College of Computer Science and Technology, Jilin University, key laboratory of symbol computation and knowledge Engineering of the Ministry of Education, Changchun 130012, China b Department of Computer Science, Jilin Technology and Business College, Changchun 130062, China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer Science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：