GRAPH REFORMULATION FOR EFFECTIVE COMMUNITY DETECTION
According to one embodiment of the present invention, a graph reconstruction method performed by a graph reconstruction system may comprise: a step of measuring a structural similarity between a pair of nodes for community exploration from an original graph in which an edge is removed; and a step of...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng ; kor |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | According to one embodiment of the present invention, a graph reconstruction method performed by a graph reconstruction system may comprise: a step of measuring a structural similarity between a pair of nodes for community exploration from an original graph in which an edge is removed; and a step of generating a neighboring graph connecting a plurality of edges for each node based on the measured structural similarity between the pair of nodes.
일 실시예에 따른 그래프 재구성 시스템에 의해 수행되는 그래프 재구성 방법은, 엣지가 제거된 원본 그래프로부터 커뮤니티 탐색을 위한 노드 쌍 간 구조적 유사도를 측정하는 단계; 및 상기 측정된 노드 쌍 간 구조적 유사도에 기초하여 각 노드에 대해 복수 개의 엣지를 연결하는 근접 이웃 그래프를 생성하는 단계를 포함할 수 있다. |
|---|