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...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2020
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/144629 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| id |
sg-ntu-dr.10356-144629 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.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 |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
Engineering::Computer science and engineering::Computing methodologies::Pattern recognition |
| spellingShingle |
Engineering::Computer science and engineering::Computing methodologies::Pattern recognition Nguyen, Ngoc Khanh Cluster analysis on dynamic graphs |
| 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. |
| author2 |
Ke Yiping, Kelly |
| author_facet |
Ke Yiping, Kelly Nguyen, Ngoc Khanh |
| format |
Final Year Project |
| author |
Nguyen, Ngoc Khanh |
| author_sort |
Nguyen, Ngoc Khanh |
| title |
Cluster analysis on dynamic graphs |
| title_short |
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_sort |
cluster analysis on dynamic graphs |
| publisher |
Nanyang Technological University |
| publishDate |
2020 |
| url |
https://hdl.handle.net/10356/144629 |
| _version_ |
1688665678614102016 |