Cluster analysis on dynamic graphs
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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project (FYP) |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/144629 |
| _version_ | 1824455632307093504 |
|---|---|
| author | Nguyen, Ngoc Khanh |
| author2 | Ke Yiping, Kelly |
| author_facet | Ke Yiping, Kelly Nguyen, Ngoc Khanh |
| author_sort | Nguyen, Ngoc Khanh |
| collection | NTU |
| description | 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. |
| first_indexed | 2025-02-19T03:41:17Z |
| format | Final Year Project (FYP) |
| id | ntu-10356/144629 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2025-02-19T03:41:17Z |
| publishDate | 2020 |
| publisher | Nanyang Technological University |
| record_format | dspace |
| spelling | ntu-10356/1446292020-11-16T06:26:26Z Cluster analysis on dynamic graphs Nguyen, Ngoc Khanh Ke Yiping, Kelly School of Computer Science and Engineering ypke@ntu.edu.sg Engineering::Computer science and engineering::Computing methodologies::Pattern recognition 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. Bachelor of Engineering (Computer Science) 2020-11-16T06:23:05Z 2020-11-16T06:23:05Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/144629 en SCSE19-0810 application/pdf application/octet-stream Nanyang Technological University |
| spellingShingle | Engineering::Computer science and engineering::Computing methodologies::Pattern recognition Nguyen, Ngoc Khanh Cluster analysis on dynamic graphs |
| title | Cluster analysis on dynamic graphs |
| title_full | Cluster analysis on dynamic graphs |
| title_fullStr | Cluster analysis on dynamic graphs |
| title_full_unstemmed | Cluster analysis on dynamic graphs |
| title_short | Cluster analysis on dynamic graphs |
| title_sort | cluster analysis on dynamic graphs |
| topic | Engineering::Computer science and engineering::Computing methodologies::Pattern recognition |
| url | https://hdl.handle.net/10356/144629 |
| work_keys_str_mv | AT nguyenngockhanh clusteranalysisondynamicgraphs |