Landmark community approximate optimal path query with pure linguistic attributes

doi:10.1007/s11227-019-02895-6

	Landmark community approximate optimal path query with pure linguistic attributes
	Ma, Jingyan ; Zhang, Kehong
	2019-09
发表期刊	JOURNAL OF SUPERCOMPUTING
卷号	75 期号:9 页码:5984-6003
摘要	The optimal path problem of graph data is a classical problem, but with the continuous development of information technology, the linguistic attributes of path descriptions are becoming more and more abundant. The nature of these attributes has uncertainty feature, which makes the choice of optimal path more difficult. Therefore, in order to solve this problem, this paper takes the path of large-scale graph and the uncertainty of linguistic attributes and the inconsistency of evaluation scale described as the research object and uses LWAA and landmark community technology to effectively solve the query problem of approximate optimal path. The efficiency of the algorithm is also verified by experiments.
关键词	Landmark Community Optimal path Pure linguistic Comprehensive evaluation
DOI	10.1007/s11227-019-02895-6
收录类别	SCI ; EI ; SCOPUS ; SCIE
ISSN	0920-8542
语种	英语
WOS研究方向	Computer Science ; Engineering
WOS类目	Computer Science, Hardware & Architecture ; Computer Science, Theory & Methods ; Engineering, Electrical & Electronic
WOS记录号	WOS:000487643900020
出版者	SPRINGER
EI入藏号	20192707129744
原始文献类型	Article
EISSN	1573-0484
引用统计	被引频次[WOS]：0 [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.lzufe.edu.cn/handle/39EH0E1M/10560
专题	信息工程与人工智能学院
作者单位	1.Northwest Minzu Univ, Sch Preparatory Educ, Lanzhou 730030, Gansu, Peoples R China; 2.Lanzhou Univ Finance & Econ, Sch Informat Engn, Lanzhou 730020, Gansu, Peoples R China; 3.Dalian Univ Technol, Sch Comp Sci & Technol, Dalian 116024, Peoples R China
推荐引用方式 GB/T 7714	Ma, Jingyan,Zhang, Kehong. Landmark community approximate optimal path query with pure linguistic attributes[J]. JOURNAL OF SUPERCOMPUTING,2019,75(9):5984-6003.
APA	Ma, Jingyan,&Zhang, Kehong.(2019).Landmark community approximate optimal path query with pure linguistic attributes.JOURNAL OF SUPERCOMPUTING,75(9),5984-6003.
MLA	Ma, Jingyan,et al."Landmark community approximate optimal path query with pure linguistic attributes".JOURNAL OF SUPERCOMPUTING 75.9(2019):5984-6003.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
15472.pdf（1668KB）	期刊论文	出版稿	暂不开放	CC BY-NC-SA	请求全文