id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_ja5wcuvf65hxrpyv62j6qsu2gy	Nico Schlitter	DenGraph-HO: a density-based hierarchical graph clustering algorithm	2013	16	.pdf	application/pdf	8430	759	71	DenGraph-HO: A Density-based Hierarchical Graph Clustering DenGraph-HO is an extension of the density-based graph clustering algorithm DenGraph. It is able to detect dense groups of nodes in a given graph and produces a hierarchy Our approach differs from traditional hierarchical clustering methods in that DenGraph-HO as the used data structures, their memory requirements and the algorithm's run time complexity. Since density-based clustering approaches provide significant advantages they have also been Since DenGraph is a non-partitioning clustering algorithm there can be noise nodes VN = node v is marked as core and a new cluster is than one community, the original DenGraph algorithm does not allow for clusters to overlap. DenGraph-O, allows border nodes that are members of multiple clusters. In case a former noise node becomes core, a new cluster is In this article we proposed the hierarchical density-based graph clustering algorithm structural clustering algorithm for networks., in	./cache/work_ja5wcuvf65hxrpyv62j6qsu2gy.pdf	./txt/work_ja5wcuvf65hxrpyv62j6qsu2gy.txt