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

Support vector machine regression algorithm based on chunking incremental learning

ICCS 2006: 6th International Conference on computational Science

作者： Jingqing, Jiang Chuyi, Song Chunguo, Wu Maurizio, Marchese Yangchun, Liang Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Mathematics and Computer Science Inner Mongolia University for Nationalities Tongliao 028043 China Key Laboratory of Information Science and Engineering Beijing Jiaotong University Railway Ministry Beijing 100044 China Italy

ISBN: (纸本)3540343792

On the basis of least squares support vector machine regression (LSSVR), an adaptive and iterative support vector machine regression algorithm based on chunking incremental learning (CISVR) is presented in this paper. CISVR is an iterative algorithm and the samples are added to the working set in batches. The inverse of the matrix of coefficients from previous iteration is used to calculate the regression parameters. Therefore, the proposed approach permits to avoid the calculation of the inverse of a large-scale matrix and improves the learning speed of the algorithm. Support vectors are selected adaptively in the iteration to maintain the sparseness. Experimental results show that the learning speed of CISVR is improved greatly compared with LSSVR for the similar training accuracy. At the same time the number of the support vectors obtained by the presented algorithm is less than that obtained by LSSVR greatly. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A hybrid discrete particle swarm algorithm for open-shop problems

引用

6th International Conference Simulated Evolution and Learning, SEAL 2006

作者： Qingyun, Yang Jigui, Sun Juyang, Zhang Chunjie, Wang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China Open Laboratory for Intelligence Information Processing Fudan University Shanghai 200433 China Basic Sciences of ChangChun University of Technology ChangChun University of Technology Changchun 130012 China

ISBN: (纸本)3540473319

A hybrid discrete particle swarm algorithm is presented in this paper to solve open-shop problems. The operations are redefined in the discrete particle swarm algorithm. To improve the performance the simulated annealing algorithm is combined with discrete particle swarm. We use SA to enhance the results of local best positions instead of current positions. The experimental results show that our hybrid discrete particle swarm algorithm is effective and efficient to solve open-shop problems. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Visualization model of fuzzy region based on pleat set

引用

Xitong Fangzhen Xuebao / Journal of System Simulation 2006年第SUPPL.期18卷 340-342+346页

作者： Wu, De-Sheng Yu, Qiang-Yuan Institute of Information Spreading Engineering Changchun University of Technology Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Fuzziness modeling for spatial data is currently an important problem in geographic information systems and spatial databases. In many geographical applications, spatial regions do not always have sharply defined boundaries but frequently their interiors and boundaries are fuzzy. A fuzzy spatial region model was proposed based on pleat set and the property of fuzzy regions was analyzed. The calculation method of relative membership of point in fuzzy region was given, and visualization model based on absolute membership value was proposed. The practical case shows that the model based on pleat set is valuable in the fields such as GIS, geography and spatial database.

关键词： Fuzzy region GIS Pleat set Visualization

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of JXTA Based P2P Distributed Computing System

Performance Evaluation of JXTA Based P2P Distributed Computi...

引用

International Conference on Computing (CIC)

作者： Zhiming Dai Zhiyi Fang Xiao Han Fengyuan Xu Hongjun Yang School of Computer Science and Technology Key Laboratory Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China School of Economics and Information Systems Jilin University China

In this paper, we introduce the condition of distributed computing at present firstly. On this foundation, according to the analysis of particular case of distributed computing network, we implement a distributed network environment of P2P whose bottom layer frame is based on JXTA. It improves issuing method of message based on pipeline decomposition mechanism of task based on usage ratio of processor and distributed mechanism of object based on serialization. We build an improved distributed computing network platform on the platform of Linux and Windows and simulate a distributed computing environment. The simulated experiment proves the feasibility and the validity of the distributed network computing platform that is constructed in this paper

关键词： Distributed computing Peer to peer computing Computer networks computational modeling Protocols Power generation economics Environmental economics Linux Large-scale systems Application software

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT COLLISION DETECTION OF COMPLEX DEFORMABLE OBJECTS BASED ON PARTICLE SWARM OPTIMIZATION ALGORITHM

AN EFFICIENT COLLISION DETECTION OF COMPLEX DEFORMABLE OBJEC...

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： YI WANG WEN-HUI LI TIAN-ZHU WANG WU GUO ZHEN-HUA ZHANG Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education College of Computer Science and Technology Jilin University 130012 ChangChun P.R.China

A technique for performing collision detection between complex deformable objects by using PSO optimizer is demonstrated. This approach provides a more comprehensive way to trade-off accuracy for computation time. Although the swarm can handle temporal coherence and efficiently search through the highly large primitive pair solution space, we combine it with hierarchies to achieve higher culling efficiency and significantly reduce the size of solution space. At last, we give the precision and efficiency evaluation about the algorithm and find it might be a reasonable choice for deformable models in collision detection systems.

关键词： Collision Detection Bounding Volumes Hierarchies Particle Swarm Optimization

来源：评论

学校读者我要写书评

暂无评论

A dynamic time delay neural network for ultrasonic motor identification and control

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Liang, Yanchun Zhang, Jie Xu, Xu Yang, Xiaowei Hao, Zhifeng Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Mathematics Jilin University Changchun 130012 China School of Mathematical Science South China University of Technology Guangzhou 510640 China

ISBN: (纸本)3540344373

A novel dynamic time delay neural network is proposed for ultrasonic motors identification and control in this paper. By introducing time delay neurons, the neural network identifier and controller of ultrasonic motors are constructed. Both of them are trained online by using an improved back-propagation algorithm. The usefulness and validity of the presented algorithm is examined by the experiments. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

QUALITATIVE SPATIO-TEMPORAL DATABASE

QUALITATIVE SPATIO-TEMPORAL DATABASE

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： SHENG-SHENG WANG DA-YOU LIU JUAN CHEN HAI-YANG JIA Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University ChangchunChina

The traditional spatio-temporal database stores the quantitative data such as coordinate. But the qualitative information is more close to human thought and requires less storage space and process time. The previous qualitative spatio-temporal systems were all prototype systems which did not support general spatio-temporal relation model and data input. We design the qualitative spatio-temporal database (QSTDB) based on spatio-temporal reasoning. A general spatio-temporal relation framework is put forward and applied to QSTDB. GML data can be converted to QSTDB as input. Thus QSTDB is compatible to most current spatio-temporal relation models and spatio-temporal *** can be applied to qualitative spatio-temporal query,spatio-temporal ontologies, spatio-temporal data mining and way finding systems etc..

关键词： Qualitative Spatio-temporal Database Spatio-temporal Reasoning General Spatio-temporal Relation Model Composition Table

来源：评论

学校读者我要写书评

暂无评论

An Improved Artificial Immune Algorithm with a Dynamic Threshold

引用

Journal of Bionic engineering 2006年第2期3卷 93-97页

作者： Zhang Qiao Xu Xu Liang Yan-chun Key Laboratory of Symbol Computation and Knowledge Engineering （Ministry of Education P. R. China） Qianwei Campus Jilin University Changchun 130012 P. R. China College of Mathematics Qianwei Campus Jilin University Changchun 130012 P. R. China

An improved artificial immune algorithm with a dynamic threshold is presented. The calculation for the affinity function in the real-valued coding artificial immune algorithm is modified through considering the antibody＇s fitness and setting the dynamic threshold value. Numerical experiments show that compared with the genetic algorithm and the originally real-valued coding artificial immune algorithm, the improved algorithm possesses high speed of convergence and good performance for preventing premature convergence.

关键词： dynamic threshold artificial immune algorithm genetic algorithm antibody

来源：评论

学校读者我要写书评

暂无评论

A New Position Updating Algorithm for Moving Objects

A New Position Updating Algorithm for Moving Objects

引用

International Multi-Symposiums on Computer and computational Sciences (IMSCCS)

作者： Xinying Wang Shengsheng Wang Zhengxuan Wang Tianyang Lv Xizhe Zhang College of Computer Science and Technology Key Laboratory of Symbolic Computing and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Continuous queries are important in moving objects databases and spatio-temporal reasoning. The traditional synchronous updating algorithms of moving object pervasively focus on improving queries' execution efficiency, while ignore the fact that the communication cost is also the bottleneck for improving query efficiency. We propose an asynchronous updating algorithm for continuous queries of moving objects. Three types of continuous range queries are discussed in the paper. Theoretical analysis and experiment results show that our algorithm substantially outperforms the traditional synchronous updating algorithms at aspects of monitoring accuracy, communication cost and CPU load balance

关键词： Costs Geographic Information Systems Spatiotemporal phenomena Vehicles Spatial databases Artificial intelligence Memory management Telecommunication computing Hardware educational institutions

来源：评论

学校读者我要写书评

暂无评论

Identification of Transcription Factor Binding Sites Using GA and PSO

Identification of Transcription Factor Binding Sites Using G...

引用

International Conference on Intelligent Systems Design and Applications (ISDA)

作者： Xiao-yu Chang Chun-guang Zhou Yan-wen Li Ping Hu College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University China College of Computer Science Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education department of computer science Northeast Normal University Changchun China

Identification of transcription factor binding sites from the upstream regions of genes is a highly important and unsolved problem. In this paper, we propose a novel framework for using evolutionary algorithm to solve this challenging issue. Under this framework, we use two prevalent evolutionary algorithms: genetic algorithm (GA) and particle swarm optimization (PSO) to find unknown sites in a collection of relatively long intergenic sequences that are suspected of being bound by the same factor. This paper represents binding sites motif to position weight matrix (PWM) and introduces how to code PWM to genome for GA and how to code it to particle for PSO. We apply these two algorithms to 5 different yeast saccharomyces cerevisiae transcription factor binding sites and CRP binding sites. The results on saccharomyces cerevisiae show that it can find the correct binding sites motifs, and the result on CRP shows that these two algorithms can achieve more accuracy than MEME and Gibbs sampler

关键词： Evolutionary computation Pulse width modulation Genomics Bioinformatics Genetic algorithms Particle swarm optimization Biology computing Evolution (biology) educational institutions Computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：