Cluster analysis on dynamic graphs

• المؤلف الرئيسي: Nguyen, Ngoc Khanh
• مؤلفون آخرون: Ke Yiping, Kelly
• التنسيق: Final Year Project
• اللغة: English
• منشور في: Nanyang Technological University 2020
• الموضوعات: Engineering::Computer science and engineering::Computing methodologies::Pattern recognition
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/144629
• المؤسسة: Nanyang Technological University

This project describes: a novel graph clustering algorithm that is an efficient extension of the Gibbs sampling under distance-dependent Chinese Restaurant Process, ddCRP for graph, a general cluster ensemble, and a cluster matching algorithm based on the concept of Meta-Graph [32], an algorithm pipeline to tackle the dynamic graph clustering problem, intensive experiments to measure performance of the new algorithms.