Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/1002| Title: | Analysis of Graph Clustering Method |
| Authors: | Boraste, P. S. Kanmlapurkar, S. M. |
| Keywords: | Graph partitioning, hub, outlier, structural graph clustering, structural similarity. |
| Issue Date: | Dec-2017 |
| Publisher: | International Journal for Research in Applied Science & Engineering Technology |
| Abstract: | Network data clustering has vital importance in various domains such as social network analysis, epidemiology, World Wide Web analysis, etc. The clustering technique derives underlying structures present in the graph. Along with the cluster creation, vertices classification is also an important task. To detect hubs and outlier is very important task in graph mining. There are various graph clustering algorithm such as graph partitioning, density based, modularity based, etc. This work aims to study various techniques of graph data clustering |
| URI: | http://192.168.3.232:8080/jspui/handle/123456789/1002 |
| ISSN: | 2321-9653 |
| Appears in Collections: | PG - Students |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| document-3.pdf | Analysis of Graph Clustering Method | 242.14 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.