首页>
外国专利>
Hierarchical cluster determination based on subgraph density
Hierarchical cluster determination based on subgraph density
展开▼
机译:基于子图密度的层次聚类确定
展开▼
页面导航
摘要
著录项
相似文献
摘要
Densest subgraphs of a graph are determined. The graph includes vertices and edges interconnecting the vertices. Each edge connects two of the vertices and has a weight. The vertices and the edges form subgraphs from which the densest subgraphs are determined as those subgraphs having densities greater than a threshold. Clusters at levels of a hierarchy are determined based on the densest subgraphs. Each cluster includes a set of the vertices and a set of the edges of the graph. Each level corresponds to a different density of the clusters. The hierarchy is ordered from a most-dense level of the clusters to a least-dense level of the clusters.
展开▼