首页>
外国专利>
Efficient detection of information of interest using greedy-mode-based graph clustering
Efficient detection of information of interest using greedy-mode-based graph clustering
展开▼
机译:使用基于贪婪模式的图聚类有效检测感兴趣的信息
展开▼
页面导航
摘要
著录项
相似文献
摘要
A computing system which identifies, for graph clustering, first and second sets of vertices in a graph. A respective vertex in the first set of vertices is an exemplar. A respective vertex in the second set of vertices is not an exemplar and not associated with a vertex identifier. The system assigns a vertex identifier of a first vertex in the first set to a second vertex in the second set based on type and strength of relationship between the vertices. The vertices represent elements in a data set. The vertex identifiers of the first and second vertices do not change before convergence. The system allocates the first vertex and the second vertex to a first vertex cluster associated with the vertex identifier, and detects convergence based on modularity associated with vertex clusters representing information of interest in the data set..
展开▼