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

An adaptive fuzzy ant colony optimization for feature selection

Journal of computational Information Systems 2011年第4期7卷 1206-1213页

作者： Liu, Yuanning Wang, Gang Chen, Huiling Zhao, Zhengdong Zhu, Xiaodong Liu, Zhen College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Network Center Changchun University of Science and Technology Changchun 130022 China Graduate School of Engineering Nagasaki Institute of Applied Science Japan

Standard pattern classifiers perform on all data features. Whereas, some of the features are redundant or irrelevant, which reduce prediction accuracy, and increase running time of classifier. The purpose of this study is to search optimal feature subset, in order to increase the classification performance. The feature selection problem differs from traditional optimization problem on the problem size, namely the searching space or the problem dimension. Thus it is easy to converge at a local optimum by means of the ant colony optimization (ACO) based method with static parameter settings, but the adaptive parameter control strategy can balance between exploration and exploitation in the search space to intelligently improve solutions and avoid premature convergence. Only little research has been reported to adjust parameters of ACO adaptively. This paper proposes a novel adaptive fuzzy ant colony optimization (AFACO) based method for feature selection. We design two fuzzy controllers to adjust parameters of ACO, namely pheromone evaporation rate and the number of ants. The performance of the proposed method is compared with that of the Standard ACO based, Standard particle swarm optimization (PSO) based and genetic algorithm (GA) based methods on 10 benchmark data sets, taken from UCI machine learning and StatLog databases. The experimental results show that the proposed method outperforms the other methods in prediction accuracy, and is efficient and effective for feature selection problem. Copyright © 2011 Binary Information Press.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A kind of improving HMM model and using in the visual speech recognition

A kind of improving HMM model and using in the visual speech...

引用

International Conference on Computer Science and Service System (CSSS)

作者： Zeliang Zhang Xiongfei Li Chengjia Yang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Beihang University Jilin China

Visual speech-lip reading, making the computer understands what do speakers want to express through observing the lip direction of them. The most simply method of lip reading in early stage is to compare between characters from the frozen pictures and templates being stored. It neglects the character is changing with time. This method is very simply, but it only can classify the simple elements not the words, so it couldn't render great serves to speech recognition. Afterwards the adoption of behavioral characteristics is becoming more widespread. Because of the superior of Hidden Markov model (HMM), it can be applied in speech recognition widely. In recent years, it is also used in the research of lip-reading recognition. The classical HMM model makes two hypotheses: hidden expropriation hypothesis: the state at t+1 is only conditioned by the state at t, not the state before; the expropriation hypothesis from hidden state to visible state: the visible state at t only conditioned by the hidden state at t, not the state before. Such kind of hypothesis is not very reasonable in some practical application (such as lip-reading). In some kind condition, the state at t is not only conditioned by t-1, but also t-2. Therefore this thesis revises the assumed condition classical HMM to derive a new HMM model and algorithm, and applying it into lip-reading recognition to increase the discrimination.

关键词： Hidden Markov models Viterbi algorithm Speech recognition knowledge engineering Laboratories Electronic mail Medical services

来源：评论

学校读者我要写书评

暂无评论

An Approach for Calculating Semantic Similarity between Words Using WordNet

An Approach for Calculating Semantic Similarity between Word...

引用

International Conference on Digital Manufacturing and Automation (ICDMA)

作者： Dou Hao Wanli Zuo Tao Peng Fengling He College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

This paper presents a new edge-counting based method using Word Net to compute the similarity. The method achieves a similarity that perfectly fits with human rating and effectively simulate the human tHought process that is people prefer to consider more differences when the semantic distance between two word is closer, and vice versa. At last, we weigh up our model against a benchmark set by human similarity judgment, and obtain a much improved result compared with other methods.

关键词： Semantics Humans computational modeling Correlation Educational institutions Benchmark testing Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

A kind of improving HMM model and using in the visual speech recognition

A kind of improving HMM model and using in the visual speech...

引用

2011 International Conference on Computer Science and Service System, CSSS 2011

作者： Zhang, Zeliang Li, Xiongfei Yang, Chengjia Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Beihua University Jilin China

ISBN: (纸本)9781424497638

Visual speech-lip reading, making the computer understands what do speakers want to express through observing the lip direction of them. The most simply method of lip reading in early stage is to compare between characters from the frozen pictures and templates being stored. It neglects the character is changing with time. This method is very simply, but it only can classify the simple elements not the words, so it couldn't render great serves to speech recognition. Afterwards the adoption of behavioral characteristics is becoming more widespread. Because of the superior of Hidden Markov model (HMM), it can be applied in speech recognition widely. In recent years, it is also used in the research of lip-reading recognition. The classical HMM model makes two hypotheses: hidden expropriation hypothesis: the state at t+1 is only conditioned by the state at t, not the state before;the expropriation hypothesis from hidden state to visible state: the visible state at t only conditioned by the hidden state at t, not the state before. Such kind of hypothesis is not very reasonable in some practical application (such as lip-reading). In some kind condition, the state at t is not only conditioned by t-1, but also t-2. Therefore this thesis revises the assumed condition classical HMM to derive a new HMM model and algorithm, and applying it into lip-reading recognition to increase the discrimination. © 2011 IEEE.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

A study on improved hidden Markov models and applications to speech recognition

A study on improved hidden Markov models and applications to...

引用

International Conference on Computer Science and Service System (CSSS)

作者： Zeliang Zhang Xiongfei Li Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Beihang University Jilin China

Visual voice lip-reading, so the computer can understand what the speakers want to express direction by looking at their lips. Lip reading is the easiest way to compare the early characters and templates from the frozen image is stored. It ignores the very nature and time changes. This method is very simple, but it's just simple elements can be classified, then it may not show significant speech recognition services. Behavior was characterized by more and more common. Because of the hidden Markov model is superior (HMM), which can be widely used in speech recognition. In recent years, is also used to lip reading identification. Classical HMM model, so that the two assumptions: hidden assumptions collected: in t+1 the state can only be in this country is not in the state before t; from the hidden visible state hypothesis: only by regulating the t hide the visible state, rather than the previous state. This hypothesis is not very useful in some applications (such as lip reading) is reasonable. Under certain conditions, in the t state not only limits the t-1, but also t-2. Therefore, this study modified the assumptions of the classical HMM to derive a new HMM model and algorithms, and applied to the lip-reading recognition is increasing discrimination.

关键词： Hidden Markov models Mouth Speech recognition Cost accounting Training Viterbi algorithm Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Communities Detection with Applications to Real-World Networks Analysis

Communities Detection with Applications to Real-World Networ...

引用

International Conference on computational Intelligence and Security

作者： Bo Yang School of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

Community structure is one of non-trivial topological properties ubiquitously demonstrated in real-world complex networks. Related theories and approaches are of fundamental importance for understanding the functions of networks. Previously, we have proposed a probabilistic algorithm called the NCMA to efficiently as well as effectively mine communities from real-world networks. Here, we show that the NCMA can be readily extended and applied to address a wide range of network oriented applications beyond community detection including ranking, characterizing and searching real world networks.

关键词： Communities Probability distribution Dolphins Social network services Probabilistic logic Prediction algorithms Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Robust and efficient annotation based on ontology evolution for deep web data

引用

Journal of Computers 2011年第10期6卷 2029-2036页

作者： Chen, Kerui Zuo, Wanli Zhang, Fan He, Fengling Chen, Yongheng Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China College of Information Engineering Zhongzhou University Zhengzhou 450044 China

Among those researches in Deep Web, compared to research of data extraction which is more mature, the research of data annotation is still at its preliminary stage. Currently, although the approach of applying ontology in data annotating has been approved by most researchers, there are many weaknesses existed, such as the complexity of the ontology, as well as the limitation on static ontology's ability to annotate new pages. Respond to those problems, this paper proposes a robust, highly efficient data annotation method based on ontology evolution. It needs to be noticed that this paper defines a simpler ontology which can improve annotating efficiency significantly. Experiments indicate that this method could improve the accuracy and efficiency of data annotation. © 2011 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Verilog combinational equivalence checking based on smt constraint solver

引用

ICIC Express Letters, Part B: Applications 2011年第5期2卷 1087-1092页

作者： Zeng, Hailin Ouyang, Dantong Zhang, Yuehua Zhang, Liming Zhang, Guiling School of Computer Science and Technology Jilin University No. 2699 Qanjin Street Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University No. 2699 Qanjin Street Changchun 130012 China Software College Jilin University No. 2699 Qanjin Street Changchun 130012 China

Most previous works on combinational equivalence checking use BDDs and other Boolean level representations to formulate and solve the problem, and therefore, not utilizing the word-level information inherently presents in the design. To overcome this limitation, word level proof techniques like Satis ability Module Theory (SMT) were proposed. The SMT can efficiently handle the designs containing word-level arithmetic operators and bit-level Boolean logic. In this paper, we present a technique checking the equivalence of two combinational circuits based on SMT constraint solver. The experimental results indicate that our method can utilize word-level information to speed up the process of verification and result in a decrease in memory usage. © 2011 ISSN 2185-2766.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

Optimization strategy of top-down join enumeration on modern multi-core CPUs

引用

Journal of Computers 2011年第10期6卷 2004-2012页

作者： Zuo, Wanli Chen, Yongheng He, Fenglin Chen, Kerui Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China

Most contemporary database systems query optimizers exploit System-R's bottom-up dynamic programming method (DP) to find the optimal query execution plan (QEP) without evaluating redundant subplans. The distinguished exceptions are Volcano/Cascades using transforms to generate new plans according to a topdown approach. As recent research has revealed, bottom-up dynamic programming can improve performance with respect to the shape of the join graph and parallelism. However top-down join enumeration dynamic programming method can derive upper bounds for the costs of the plans it generates which is not available to typical bottom-up DP method. In this paper, we propose a comprehensive and practical framework for parallelizing top-down dynamic programming query optimization with complex non-inner join in the multi-core processor architecture, referred as PTDhyp. We have implemented such a search strategy and experimental results show that can improve optimization time effective compared to known existing algorithms. © 2011 ACADEMY PUBLISHER.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Image annotation refinement using dynamic weighted voting based on mutual information

Journal of Software

引用

Journal of Software 2011年第11 SPEC. ISSUE期6卷 2239-2246页

作者： Song, Haiyu Li, Xiongfei Wang, Pengjie Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Institute of Computer Graphics and Image Processing Dalian Nationalities University Dalian China State Key Laboratory of CAD and CG Zhejiang University Hangzhou China

Automatic image annotation is a promising solution to narrow the semantic gap between low-level content and high-level semantic concept, which has been an active research area in the fields of image retrieval, pattern recognition, and machine learning. However, even the most dedicated annotation algorithms are often unsatisfactory. Image annotation refinement has attracted much more attention recently. In this paper, a novel refinement algorithm using dynamic voting based on mutual information is proposed. Unlike the traditional refinement algorithm, the proposed algorithm adopts dynamic weighted voting to measure the dependence between the candidate annotations, which not only permits that the annotations with higher probabilities deny the annotations with lower probabilities, but also permits that the annotations with lower probabilities deny the annotations with higher probabilities. The proposed refinement algorithm adopts progressive method instead of iterative, which can significantly decrease the time cost of refining annotations. In order to further improve efficiency without sacrificing precision, we propose the block-based normalized cut algorithm to segment image. Experiments conducted on standard Washington Ground Truth Image Database demonstrate the effectiveness and efficiency of our proposed approach for refining image annotations. © 2011 ACADEMY PUBLISHER.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：