The study of TOP-K path query for fuzzy multiattribute graph
Zhang, Kehong1,3; Ma, Jingyan2
2018
发表期刊Paper Asia
卷号2018期号:Compendium3页码:33-38
摘要

With the unceasing change of information world, the path query is no longer confined to the optimal path. People pay close attention to the Top-k candidate path in a certain order. In addition, more and more people concern about the research on multiattribute path optimization. So the article studies the complex attribute of road, and comes up with FMPGA algorithm for multiple fuzzy attribute. Firstly, fuzzy decision technique is used to get the comprehensive score of each path; Secondly, the optimum path of Top-k is calculated by the genetic algorithm and deviating node algorithm. Finally, the effectiveness of FMPGA algorithm is verified by the experimental analysis.

关键词Decision making Genetic algorithms Experimental analysis Fuzzy attributes Fuzzy decision Multi attributes Optimal paths Optimum paths Path Path optimizations
收录类别EI
ISSN02184540
语种英语
出版者SHPMedia Sdn Bhd
EI入藏号20183405724984
文献类型期刊论文
条目标识符http://ir.lzufe.edu.cn/handle/39EH0E1M/9653
专题信息工程与人工智能学院
作者单位1.School of Information Engineering, Lanzhou University of Finance and Economics, Lanzhou, China;
2.School of Preparatory Education, Northwest University for Nationalities, Lanzhou, China;
3.School of Computer Science and Technology, Dalian University of Technology, Dalian, China
第一作者单位兰州财经大学
推荐引用方式
GB/T 7714
Zhang, Kehong,Ma, Jingyan. The study of TOP-K path query for fuzzy multiattribute graph[J]. Paper Asia,2018,2018(Compendium3):33-38.
APA Zhang, Kehong,&Ma, Jingyan.(2018).The study of TOP-K path query for fuzzy multiattribute graph.Paper Asia,2018(Compendium3),33-38.
MLA Zhang, Kehong,et al."The study of TOP-K path query for fuzzy multiattribute graph".Paper Asia 2018.Compendium3(2018):33-38.
条目包含的文件
条目无相关文件。
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Zhang, Kehong]的文章
[Ma, Jingyan]的文章
百度学术
百度学术中相似的文章
[Zhang, Kehong]的文章
[Ma, Jingyan]的文章
必应学术
必应学术中相似的文章
[Zhang, Kehong]的文章
[Ma, Jingyan]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。