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

The 9th International Conference on Computer and Computing Technologies in Agriculture (CCTA 2015)

作者： Xu Wang Jihong Ouyang Guifen Chen College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University College of Information Technology Jilin Agricultural University

ISBN: (纸本)9783319483535

A method to simplify the calculation in the process of measuring graph similarity is proposed, where lots of redundant operations are avoided in order to quickly obtain the initial tickets matrixIn this proposal, the element value of the initial tickets matrix is assigned to 1 when it is positive in corresponding position of the paths matrix at the first timeThe proposed method calculates the initial tickets matrix value based on the positive value in the paths matrix in a forward and backward wayAn example is provided to illustrate that the method is feasible and effective.

关键词： Graph similarity measure Paths and tickets Adjacency matrix Forward and backward Simplifying calculation

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Multi-path Routing for VANET

A Dynamic Multi-path Routing for VANET

引用

2015 International Conference on Automation,Mechanical and Electrical engineering(AMEE 2015)

作者： Z.Y.Yuan D.Wei J.Q.Zhu Y.J.Hou M.Li T.Sun College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Regional Road Transportation Administrative Bureau

Compared with traditional VANET(Vehicular Ad-Hoc Networks) routing techniques, geographic routing has been proven to be more fittable for highly mobile scenes. Traditional routings use greedy modes or fixed forwarding paths to sent packets. But, the dynamic features of VANET such as fast changed topology, vehicles density and radio obstacles, could cause local maximum and sparse connectivity. Due to the characteristics of wireless channel, while there are too many packets transmit through a path, the delay and the number of packets loss will both increase clearly. We propose DMPR, a Dynamic Multipath Routing, combined with node location and digital map. The proposed DMPR detects transmission delay of different paths every once in a period of time, and dynamically determine the transmission ratio of each path. We execute NS2 simulation to exhibit that DMPR routing protocol significantly outperform three well known VANET ones in terms of the average packet delivery ratio and end-to-end delay.

关键词： VANET dynamic multi-path routing digital map transmission delay detection

来源：评论

学校读者我要写书评

暂无评论

TDRec: Enhancing Social Recommendation Using Both Trust and Distrust Information

TDRec: Enhancing Social Recommendation Using Both Trust and ...

引用

European Network Intelligence Conference (ENIC)

作者： Tiansheng Bai Bo Yang Fei Li School of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Computer Science Department George Mason University Fairfax VA USA

ISBN: (纸本)9781467375931

Traditional Collaborative Filtering has been one of the most widely used recommender systems, unfortunately it suffers from cold-start and data sparsity problems. With the development of social networks, more recommendation systems are trying to generate more eligible recommendation through excavating users' potential preferences using their social relationships. Almost all social recommender systems employ only positive inter-user relations such as friendship or trust information. However, incorporating negative relations in recommendation has not been investigated thoroughly in literature. In this paper, we propose a novel model-based method which takes advantage of both positive and negative inter-user relations. We apply matrix factorization techniques and utilize both rating and trust information to learn users' reasonable latent preference. We also incorporate two regularization terms to take distrust information into consideration. Our experiments on real-world and open datasets demonstrate the superiority of our model over the other state-of-the-art methods.

关键词： Europe

来源：评论

学校读者我要写书评

暂无评论

Dynamic lip identification algorithm based on automatic calibration of feature points

引用

Journal of Information and computational Science 2015年第15期12卷 5659-5665页

作者： Shen, Xuanjing Wang, Ziyu Wang, Yu Chen, Haipeng 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 Applied Technology College Jilin University Changchun China

In order to avoid the defect of lip identification about one single picture and enhance the accuracy of the recognition, this paper applies the dynamic lip identification and puts forward the method to calibrate the feature points inner and outer of lips at the same time. Meanwhile, this paper introduces the algorithm of calibration of feature points and improves it on the basis of the algorithms. The improved algorithm not only reduces the computational complexity of the calibration, but also increase the accuracy of the calibration. In matching and recognition stage, the classifier of this paper is HMM. Experiments show that the algorithm reduces the computational complexity. Meanwhile, it enhances the accuracy of the recognition. © 2015 by Binary Information Press

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

An ensemble feature selection method based on mRMR for paired microarray data

引用

Journal of computational Information Systems 2014年第11期10卷 4875-4882页

作者： He, Lihua Cao, Zhongbo Wang, Yan Du, Wei Liang, Yanchun Key Laboratory for Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China

With the development of high-throughput microarray chip technology, there are a large number of microarray expression data, which have few samples compared to the genes of high dimensions. And in recent years, more and more expression datasets contain samples of cancer tissues with their corresponding control tissues as paired. In the last decade, a variety of filter feature selection methods have been proposed. However, most of these methods rarely consider the effect of outlier and paired samples. In this article, we propose an ensemble feature selection method based on minimum redundancy maximum relevance (mRMR) method for paired microarray data. In order to increase the stability of the method, the improved method uses an ensemble strategy to generate diverse subsets from the original dataset. Then, the mRMR method is used to obtain multiple feature lists on the subsets. Finally, a rank aggregation strategy is adopted to decide the final list of selected features. We apply the method on six paired microarray datasets across different cancer types. Through comparison on the performance with other widely used filter methods, the proposed method obtains an excellent performance on the results. It indicates that the improved method is effective and has good applicability of feature selection for paired microarray expression data analysis. © 2014 Binary Information Press.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Bayesian inference for epistasis association mapping in case-control studies

引用

ICIC Express Letters 2015年第1期9卷 261-268页

作者： Zhou, Zhihui Liu, Guixia Su, Lingtao Tian, Yuan College of Computer Science and Technology Jilin University No. 2699 Qianjin Avenue Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University No. 2699 Qianjin Avenue Changchun China

A genome-wide association study (GWAS) typically involves detecting epistatic interactions of multiple genetic variants on the susceptibility of complex human diseases. As the most abundant source of genetic variation in human genome, the number of single nucleotide polymorphisms (SNPs) reaches millions in public datasets and SNP data collected from thousands of individuals in case-control studies may shed light on our understanding of epistatic interactions. Various methods have been proposed in previous literature for identifying genetic interactions, but they are infeasible for GWAS as biology data is too large, we here propose a method ‘epistasis group based on Bayesian inference’ (EGBI). EGBI applies a Bayesian marker partition model to investigate observed case-control data and computes the posterior distribution of each epistasis group that is associated with the disease via Markov chain Monte Carlo (MCMC). When applied to both simulated data and WTCCC type 1 diabetes data, EGBI successfully identified many known susceptible genes including CTLA4 and MHC and performed more powerfully than its competitors.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

Comparative Study on Metaheuristic-Based Feature Selection for Cotton Foreign Fibers Recognition

Comparative Study on Metaheuristic-Based Feature Selection f...

引用

The 9th International Conference on Computer and Computing Technologies in Agriculture (CCTA 2015)

作者： Xuehua Zhao Xueyan Liu Daoliang Li Huiling Chen Shuangyin Liu Xinbin Yang Shaobin Zhan Wenyong Zhao School of Digital Media Shenzhen Institute of Information Technology Key Laboratory of Symbolic Computation and Knowledge Engineer (Jilin University) Ministry of Education College of Information and Electrical Engineering China Agricultural University College of Physics and Electronic Information Wenzhou University College of Information Guangdong Ocean University

ISBN: (纸本)9783319483566

The excellent feature set or feature combination of cotton foreign fibers is great significant to improve the performance of machine-vision-based recognition system of cotton foreign fibers. To find the excellent feature sets offoreign fibers, in this paper presents three metaheuristic-based feature selection approaches for cotton foreign fibers recognition, which are particle swarm optimization, ant colony optimization and genetic algorithm, respectively. The k-nearest neighbor classifier and support vector machine classifier with k-fold cross validation are used to evaluate the quality offeature subset and identify the cotton foreign fibers. The results show that the metaheuristic-based feature selection methods can efficiently find the optimal feature sets consisting of a few features. It is highly significant to improve the performance of recognition system for cotton foreign fibers.

关键词： Metaheuristic Feature selection Foreign fibers Recognition system Feature extraction recognition system Fiber Fibrous materials Cotton Support Vector Network

来源：评论

学校读者我要写书评

暂无评论

Ant colony algorithm based on local mutation

引用

Journal of Chemical and Pharmaceutical Research 2014年第8期6卷 508-516页

作者： Shen, Xuan-Jing Shen, Xuan-Jing 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

Ant colony algorithm is a more effective way of solving traveling salesman problem (TSP). Ant colony algorithm adopts the distributed parallel computing mechanism;and it is easy to combine with other methods. Furthermore, it has the advantages of strong robustness. But the search time is long, and it often falls into local optimal solution. In order to speed up convergence rate and ensure the global search ability, use adaptive adjustment mechanism to adjust pheromone evaporation factor, and mutate solutions according to the characteristics of ant colony searching for path in each iteration. An improved ant colony algorithm is proposed in this paper. Experiments show that algorithm has a more remarkable quality of precision and convergent velocity than T. A. S. Masutti and G. F. Dong’s, the improved Percentage deviations of average to the BKS is less than 1% equally, percentage deviations of best to the BKS is less than 0.05% equally. © 2014, Journal of Chemical and Pharmaceutical Research. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Efficiently and fast learning a fine-grained stochastic blockmodel from large networks

Efficiently and fast learning a fine-grained stochastic bloc...

引用

18th Pacific-Asia Conference on Advances in knowledge Discovery and Data Mining, PAKDD 2014

作者： Zhao, Xuehua Yang, Bo Chen, Hechang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineer Ministry of Education Jilin University Changchun China

ISBN: (纸本)9783319066073

Stochastic blockmodel (SBM) has recently come into the spotlight in the domains of social network analysis and statistical machine learning, as it enables us to decompose and then analyze an exploratory network without knowing any priori information about its intrinsic structure. However, the prohibitive computational cost limits SBM learning algorithm with the capability of model selection to small network with hundreds of nodes. This paper presents a fine-gained SBM and its fast learning algorithm, named FSL, which ingeniously combines the component-wise EM (CEM) algorithm and minimum message length (MML) together to achieve the parallel learning of parameter estimation and model evaluation. The FSL significantly reduces the time complexity of the learning algorithm, and scales to network with thousands of nodes. The experimental results indicate that the FSL can achieve the best tradeoff between effectiveness and efficiency through greatly reducing learning time while preserving competitive learning accuracy. Moreover, it is noteworthy that our proposed method shows its excellent generalization ability through the application of link prediction. © 2014 Springer International Publishing.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A DE algorithm combined with lévy flight for reliability redundancy allocation problems

引用

International Journal of Hybrid Information Technology 2015年第5期8卷 113-118页

作者： Liu, Yubao Qin, Guihe College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Changchun University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

In this paper, a differential evolution (DE) algorithm combined with Lévy flight is proposed to solve the reliability redundancy allocation problems. The Lévy flight is incorporated to enhance the ability of global search of differential evolution algorithm. DE is used for local search mainly. The method considers the trade-off of the diversification and the intensification simultaneously. Experimental results for three benchmark problems demonstrate that the proposed algorithm is more effective for solving the reliability redundancy allocation problems. © 2015 SERSC.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：