| 注册
首页|期刊导航|计算机科学与探索|基于加权Voronoi图的top-k局部同位模式挖掘

基于加权Voronoi图的top-k局部同位模式挖掘

金灿 王丽珍 杨金华

计算机科学与探索2026,Vol.20Issue(3):730-746,17.
计算机科学与探索2026,Vol.20Issue(3):730-746,17.DOI:10.3778/j.issn.1673-9418.2505057

基于加权Voronoi图的top-k局部同位模式挖掘

top-k Local Co-location Pattern Mining Based on Weighted Voronoi Diagram

金灿 1王丽珍 2杨金华2

作者信息

  • 1. 云南大学 信息学院,昆明 650500
  • 2. 滇池学院 理工学院,昆明 650228
  • 折叠

摘要

Abstract

Local co-location pattern(LCP)mining is an important branch of the spatial co-location pattern mining,which aims to discover co-location patterns that prevalently occur in local regions.The LCPs can reveal the association relation-ships between spatial features in local regions rather than globally,playing a positive guiding role in various location-based application fields.Existing LCP mining methods cannot effectively identify local regions formed by human activities(human factors),and it is difficult to set an appropriate prevalence threshold to select prevalent patterns in different regions.To address these problems,a novel top-k LCP mining method based on weighted Voronoi diagram(Top-k LCPM-WVD)is proposed.This method first identifies the distribution regions of LCPs formed by human factors through the weighted Voronoi diagram,and then uses a top-k mining framework to efficiently mine the k most prevalent patterns in each region.At the same time,a series of optimization strategies is designed based on this framework to further improve the mining efficiency.In addition,in order to solve the efficiency problem when facing large scale datasets,a parallel mining scheme is proposed to speed up the mining process,achieving a speedup ratio of 1.65 under 4 threads.Extensive experimental results on both real and synthetic datasets demonstrate that the proposed Top-k LCPM-WVDmethod more efficiently discovers interpretable LCPs compared with existing state-of-the-art algorithms,with efficiency improvements up to several dozen times.

关键词

空间模式挖掘/局部同位模式(LCP)/加权Voronoi图/top-k/并行

Key words

spatial pattern mining/local co-location pattern(LCP)/weighted Voronoi diagram/top-k/parallelization

分类

信息技术与安全科学

引用本文复制引用

金灿,王丽珍,杨金华..基于加权Voronoi图的top-k局部同位模式挖掘[J].计算机科学与探索,2026,20(3):730-746,17.

基金项目

国家自然科学基金(62276227,62306266) (62276227,62306266)

云南省基础研究项目(202201AS070015,202401AT070450) (202201AS070015,202401AT070450)

云南大学研究生科研创新基金(KC-23235527,TM-23236919).This work was supported by the National Natural Science Foundation of China(62276227,62306266),the Fundamental Research Pro-jects of Yunnan Province(202201AS070015,202401AT070450),and the Postgraduate Research and Innovation Foundation of Yunnan University(KC-23235527,TM-23236919). (KC-23235527,TM-23236919)

计算机科学与探索

1673-9418

访问量0
|
下载量0
段落导航相关论文