Vanha Tran

Vanha Tran

Auto-generated profile, based on publicly available information

Vanha Tran


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 April 2020 in Statistical Analysis and Data Mining: An ASA Data Science Journal
Verified
Journal Article
Closed access
PDF file
VTVanha Tran
Vanha Tran
LWLizhen Wang
Lizhen Wang

7 February 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
DWDongsheng Wang
Dongsheng Wang
LWLizhen Wang
Lizhen Wang
XWXiaoxu Wang
Xiaoxu Wang
VTVanha Tran
Vanha Tran

1 June 2019
Verified
Conference Paper
Closed access
VTVanha Tran
Vanha Tran
LWLizhen Wang
Lizhen Wang
LZLihua Zhou
Lihua Zhou
Spatial co-location patterns are groups of spatial features whose instances are frequently located together in spatial proximity. Most existing algorithms of discovering spatial co-location patterns are based on the candidate-test model, which is computationally expensive. When the user adjusts the participation index (PI) threshold, these algorithms have to be re-executed from the size 2 co-location patterns. In this paper, we propose a novel spatial instance partition method for mining co-location patterns which called overlap maximal clique partitioning algorithm (OMCP). The OMCP co-location mining algorithm divides instances of an input spatial dataset into a set of overlap maximal cliques. Table instances of all colocation patterns are collected by the overlap maximal cliques. Prevalent co-location patterns are directly calculated without generating the candidate patterns. The OMCP algorithm only needs to execute once to get the PI of all patterns, without re-executing when the PI threshold is adjusted. Our algorithm is performed on both synthetic and real-world datasets to demonstrate that the OMCP algorithm improvements in efficiency of co-location pattern mining.

13 November 2022 in Expert Systems with Applications
Verified
Journal Article
Closed access
VTVanha Tran
Vanha Tran

24 November 2022
Verified
Book Chapter
Closed access
PDF file
JSJuanjuan Shu
Juanjuan Shu
LWLizhen Wang
Lizhen Wang
PYPeizhong Yang
Peizhong Yang
VTVanha Tran
Vanha Tran

16 October 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
LWLizhen Wang
Lizhen Wang
VTVanha Tran
Vanha Tran
TDThanhcong Do
Thanhcong Do
Groups of spatial features whose instances frequently appear together in nearby areas are regarded as prevalent co-location patterns (PCPs). Traditional PCP mining ignores the significance of instances and features. However, in reality, these instances and features have different significance, the traditional PCPs may not sufficiently expose knowledge from spatial data. This study focuses on discovering high utility co-location patterns (HUCPs) in which each instance is assigned a utility to reflect its significance. To filter HUCPs, an adaptive utility participation index (UPI) is designed. Unfortunately, the UPI does not hold the downward closure property. The performance of mining HUCPs is very inefficient since unnecessary candidates cannot be early pruned. Thus, an efficient clique-querying mining framework is devised without generating candidates. This framework first divides neighboring instances into cliques, then compacts these cliques into a hash table structure. Next, the adaptive UPI of any patterns can be quickly calculated based on their participating instances that are obtained by executing a querying scheme on the hash table. Finally, HUCPs are filtered efficiently. The effectiveness and efficiency of the proposed method are proved in both theory and experiments to make a promise that the patterns mined are more meaningful and the mining performance is significantly improved compared to the previous methods.