Skip navigation


Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1002
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBoraste, P. S.-
dc.contributor.authorKanmlapurkar, S. M.-
dc.date.accessioned2018-05-30T10:15:53Z-
dc.date.available2018-05-30T10:15:53Z-
dc.date.issued2017-12-
dc.identifier.issn2321-9653-
dc.identifier.urihttp://192.168.3.232:8080/jspui/handle/123456789/1002-
dc.description.abstractNetwork 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 clusteringen_US
dc.publisherInternational Journal for Research in Applied Science & Engineering Technologyen_US
dc.subjectGraph partitioning, hub, outlier, structural graph clustering, structural similarity.en_US
dc.titleAnalysis of Graph Clustering Methoden_US
dc.typeArticleen_US
Appears in Collections:PG - Students

Files in This Item:
File Description SizeFormat 
document-3.pdfAnalysis of Graph Clustering Method242.14 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.