Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/144629
Title: Cluster analysis on dynamic graphs
Authors: Nguyen, Ngoc Khanh
Keywords: Engineering::Computer science and engineering::Computing methodologies::Pattern recognition
Issue Date: 2020
Publisher: Nanyang Technological University
Project: SCSE19-0810
Abstract: 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.
URI: https://hdl.handle.net/10356/144629
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
final-report.pdf
  Restricted Access
601.89 kBAdobe PDFView/Open
final-report.zip
  Restricted Access
385.24 kBUnknownView/Open

Page view(s)

279
Updated on May 28, 2022

Download(s) 50

55
Updated on May 28, 2022

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.