Zhe Yuan*, Zhewei Wei, Ji-rong Wen
CMC-Computers, Materials & Continua, Vol.75, No.3, pp. 5009-5026, 2023, DOI:10.32604/cmc.2023.038531
- 29 April 2023
Abstract Motif-based graph local clustering (MGLC) algorithms are generally designed with the two-phase framework, which gets the motif weight for each edge beforehand and then conducts the local clustering algorithm on the weighted graph to output the result. Despite correctness, this framework brings limitations on both practical and theoretical aspects and is less applicable in real interactive situations. This research develops a purely local and index-adaptive method, Index-adaptive Triangle-based Graph Local Clustering (TGLC+), to solve the MGLC problem w.r.t. triangle. TGLC+ combines the approximated Monte-Carlo method Triangle-based Random Walk (TRW) and deterministic Brute-Force method Triangle-based Forward Push More >
Login
Register
