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

Reasoning and predicting POMDP planning complexity via covering numbers

Frontiers of Computer Science 2016年第4期10卷 726-740页

作者： Zongzhang ZHANG Qiming FU Xiaofang ZHANG Quan LIU School of Computer Science and Technology Soochow University Suzhou 215000 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210000 China School of Electronic and Information Engineering Suzhou University of Science and Technology Suzhou 215000 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Partially observable Markov decision processes （POMDPs） provide a rich mathematical framework for planning tasks in partially observable stochastic environments. The notion of the covering number, a metric of capturing the search space size of a POMDP planning problem, has been proposed as a complexity measure of approximate POMDP planning. Existing theoretical results are based on POMDPs with finite and discrete state spaces and measured in the l1- metric space. When considering heuristics, they are assumed to be always admissible. This paper extends the theoretical results on the covering numbers of different search spaces, including the newly defined space reachable under inadmissible heuristics, to the ln-metric spaces. We provide a simple but scalable algorithm for estimating covering numbers. Experimentally, we provide estimated covering numbers of the search spaces reachable by following different policies on several benchmark problems, and analyze their abilities to predict the runtime of POMDP planning algorithms.

关键词： POMDP planning complexity theory covering number search space

来源：评论

学校读者我要写书评

暂无评论

Integrity constraint validation in dl-liter based ontology using rewriting 2nd

Integrity constraint validation in dl-liter based ontology u...

引用

2nd International Conference on Young Computer Scientists, Engineers and Educators, ICYCSEE 2016

作者： Cui, Xianji Ouyang, Dantong He, Jialiang College of Information and Communication Engineering Dalian Minzu University Dalian116600 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9789811020971

With the rapid development of information technology, semantic web data present features of massiveness and complexity. As the data-centric science, social computing have great influence in collecting and analyzing semantic data. In our contribution, we propose an integrity constraint validation for DL-LiteR based ontology in view of data correctness issue in the progress of social computing applications. Firstly, at the basis of translations from integrity constraint axioms into a set of conjunctive queries, integrity constraint validation is converted into the conjunctive query answering over knowledge bases. Moreover, rewriting rules are used for reformulating the integrity constraint axioms using standard axioms. On this account, the integrity constraint validation can be reduced to the query evaluation over the ABox, and use query mechanisms in database management systems to optimize integrity constraint validation. Finally, the experimental result shows that the rewritingbased method greatly improves the efficiency of integrity constraint validation and is more appropriate to scalable data in the semantic web. © Springer Science+Business Media Singapore 2016.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Group sparse Bayesian learning for active surveillance on epidemic dynamics

arXiv

引用

arXiv 2017年

作者： Pei, Hongbin Yang, Bo Liu, Jiming Dong, Lei College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China Department of Computer Science Hong Kong Baptist University Hong Kong Institute of Remote Sensing and Geographical Information Systems Peking University Beijing China

Predicting epidemic dynamics is of great value in understanding and controlling diffusion processes, such as infectious disease spread and information propagation. This task is intractable, especially when surveillance resources are very limited. To address the challenge, we study the problem of active surveillance, i.e., how to identify a small portion of system components as sentinels to effect monitoring, such that the epidemic dynamics of an entire system can be readily predicted from the partial data collected by such sentinels. We propose a novel measure, the γ value, to identify the sentinels by modeling a sentinel network with row sparsity structure. We design a flexible group sparse Bayesian learning algorithm to mine the sentinel network suitable for handling both linear and non-linear dynamical systems by using the expectation maximization method and variational approximation. The efficacy of the proposed algorithm is theoretically analyzed and empirically validated using both synthetic and real-world data. Copyright © 2017, The Authors. All rights reserved.

关键词： Monitoring

来源：评论

学校读者我要写书评

暂无评论

Integrating topic modeling with word embeddings by mixtures of vMFs 26

Integrating topic modeling with word embeddings by mixtures ...

引用

26th International Conference on computational Linguistics, COLING 2016

作者： Li, Ximing Chi, Jinjin Li, Changchun Ouyang, Jihong Fu, Bo College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China College of Computer and Information Technology Liaoning Normal University China

ISBN: (纸本)9784879747020

Gaussian LDA integrates topic modeling with word embeddings by replacing discrete topic distribution over word types with multivariate Gaussian distribution on the embedding space. This can take semantic information of words into account. However, the Euclidean similarity used in Gaussian topics is not an optimal semantic measure for word embeddings. Acknowledgedly, the cosine similarity better describes the semantic relatedness between word embeddings. To employ the cosine measure and capture complex topic structure, we use von Mises-Fisher (vMF) mixture models to represent topics, and then develop a novel mix-vMF topic model (MvTM). Using public pre-trained word embeddings, we evaluate MvTM on three real-world data sets. Experimental results show that our model can discover more coherent topics than the state-of-the-art baseline models, and achieve competitive classification performance. © 1963-2018 ACL.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Multi-label Deep Learning for Gene Function Annotation in Cancer Pathways

引用

Scientific reports 2018年第1期8卷 8995页

作者： Renchu Guan Xu Wang Mary Qu Yang Yu Zhang Fengfeng Zhou Chen Yang Yanchun Liang Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun 130012 China. MidSouth Bioinformatics Center and Joint Bioinformatics Ph.D. Program of University of Arkansas at Little Rock and Univ. of Arkansas Medical Sciences Little Rock AR 72204 USA. Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Beijing 100093 China. College of Earth Sciences Jilin University Changchun 130061 China. yangc616@***. Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun 130012 China. ycliang@***. Zhuhai Laboratory of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai 519041 China. ycliang@***.

A correction to this article has been published and is linked from the HTML and PDF versions of this paper. The error has not been fixed in the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pancreatic cancer biomarker detection using recursive feature elimination based on Support Vector Machine and large margin distribution machine

Pancreatic cancer biomarker detection using recursive featur...

引用

International Conference on Systems and Informatics (ICSAI)

作者： Yidan Lv Yan Wang Yongfei Tan Wei Du Keke Liu Hao Wang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Basic Medicine School Jilin University Changchun China Department of Hepatopancreatobiliary Surgery and Second Affiliated Hospital Harbin Medical University Harbin China

Pancreatic cancer acts as one of the leading causes of cancer-connective deaths. Its five-year overall survival rate being reported is about 7.7% from 2006 to 2012 by the National Cancer Institute. One of the main causes for its poor prognosis is because its non-typical symptoms make early diagnosis very challenging. Therefore, a predominant strategy for early accurate detection and prognostication on pancreatic cancer is vital to the whole course of comprehensive therapy. In this research, we proposed a method which combined Recursive Feature Elimination (RFE) method based on Support Vector Machine (SVM) and Large Margin Distribution Machine (LDM) to identify potential biomarkers for pancreatic cancer. In our experiments, we have strengthened the process of RFE to achieve better performance. The dataset GSE15471 we adopted are from GEO database with 39 pairs of pancreatic ductal carcinoma and adjacent control pancreatic tissues. Through experiments, a panel of twelve genes was identified as biomarkers in pancreatic cancer with 91.28% classification accuracy. The universality of the candidate genes was examined on another dataset GSE28735 and the classification accuracy was higher than 80%. In addition, by using the SVM, LDM and BP classifiers, we compared the ordered feature sets generated by our proposed method with T-test, SVM-RFE and LDM-RFE, and the results indicated our proposed method obtained higher average classification accuracy.

关键词： Cancer Support vector machines Feature extraction Tumors Training data Testing

来源：评论

学校读者我要写书评

暂无评论

Biogeography-based optimization for cluster analysis

Biogeography-based optimization for cluster analysis

引用

International Conference on Computer, Communication and computational Sciences, ICCCCS 2016

作者： Wu, Xueyan Wang, Hainan Chen, Zhimin Lu, Zhihai Phillips, Preetha Wang, Shuihua Zhang, Yudong School of Computer Science and Technology Nanjing Normal University NanjingJiangsu210023 China Key Laboratory of Statistical Information Technology & Data Mining State Statistics Bureau ChengduSichuan610225 China School of Computer and Information Engineering Henan Normal University XinxiangHenan453000 China School of Electronic Information Shanghai Dianji University Shanghai200240 China Key Laboratory of Symbolic Computation & Knowledge Engineering of Ministry of Education Jilin University ChangchunJilin130012 China Guangxi Key Laboratory of Manufacturing System & Advanced Manufacturing Technology GuilinGuangxi541004 China School of Natural Sciences and Mathematics Shepherd University ShepherdstownWV25443 United States West Virginia School of Osteopathic Medicine 400 N Lee St LewisburgWV24901 United States Department of Electrical Engineering The City College of New York CUNY New YorkNY10031 United States State Key Lab of CAD & CG Zhejiang University HangzhouZhejiang310027 China Manchester Metropolitan University ManchesterM156BH United Kingdom

ISBN: (纸本)9789811037696

With the aim of resolving the issue of cluster analysis more precisely and validly, a new approach was proposed based on biogeography-based optimization (abbreviated as BBO) algorithm. (Method) First, we reformulated the problem with an optimization model based on the variance ratio criterion (VARAC). Then, BBO was presented to search the optimal solution of the VARAC. There are 400 data of four groups in the experimental dataset, which have the degrees of overlapping of three distinct scales. The first one is nonoverlapping, the second one is partial overlapping, and the last is severely overlapping. BBO algorithm was compared with three different state-of-the-art approaches. We ran every algorithm 20 times. In this experiment, our results demonstrate the maximum VARAC values that can be found by BBO. The conclusion is that BBO is predominant which is extremely quick for the issue of clustering analysis. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

The BBC news hunter: A novel crawler for BBC news 2nd

The BBC news hunter: A novel crawler for BBC news

引用

2nd International Conference on Young Computer Scientists, Engineers and Educators, ICYCSEE 2016

作者： Wang, Mingxin Wang, Ning Wang, Boran Tian, Can Liang, Yanchun Zhao, Guozhong Han, Xiaosong College of Software Jilin University Changchun130012 China Key Laboratory for Symbol Computation and Knowledge Engineering of National Education Ministry College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory for Symbol Computation Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai519041 China Daqing Oilfield Personnel Development Institute CNPC Daqing163000 China

ISBN: (纸本)9789811020971

In order to distinguish and extract the topic information from other interferential information on the BBC news website for the study in social computing, the BBC News Hunter was proposed in this paper. The whole system consists of 6 subsystems, respectively named: UI, Control, Download, Analysis, Storage and Log. Numerical experiments show that satisfactory results can be obtained from the BBC news website, whose average accuracy as well as efficiency are acceptable. © Springer Science+Business Media Singapore 2016.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A Group key Management Scheme Based on Random Transmission for VANET

A Group Key Management Scheme Based on Random Transmission f...

引用

2016 6th International Conference on Machinery,Materials,Environment,Biotechnology and Computer(MMEBC 2016)

作者： Liang PANG Da WEI Qi ZHAO Jianqi ZHU College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin University

ISBN: (纸本)9781510828087

Group key management plays an important role in ensuring the safety and reliability of the VANET(vehicular ad-hoc network) over the channelThrough considering the characteristics of VANET communication and topology, a VANET group key management scheme is proposed based on random transmission which is combined with the construction of polynomial and key updating by Hash chainThe scheme achieves the random transmission function of group key and the node revocation capabilityMoreover, it can ensure the forward and backward and other security attributes of the group keyThe results show that the proposed scheme has less communication complexity and better communication performance, also it can suitable for large scale VANET group.

关键词： VANET Group Random Transmission Polynomial Hash Chain

来源：评论

学校读者我要写书评

暂无评论

A local gradient based peak search algorithm for three-dimensional rotation electron diffraction image processing

A local gradient based peak search algorithm for three-dimen...

引用

International Conference on Systems and Informatics (ICSAI)

作者： Xinzheng Dong Yixuan Wang He Yin Zhuhai College of Jilin University Zhuhai Laboratory of Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Zhuhai China

ISBN: (纸本)9781509055227

Peak search for three-dimensional rotation electron diffraction image is almost the most important step in crystal structure determination. The difference of Gaussian method is the traditional approach for this task with the disadvantage that values of three tunable parameters need to be determined by users. To address this drawback, this paper presents a local gradient based peak search algorithm that needs only one tunable parameter. Experiments show that our proposed method is as effective as the difference of Gaussian method in peak detection task, but has obvious advantages in speed and convenience.

关键词： Diffraction Dogs Kernel Standards Software algorithms Shape

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：