Community discovery method in social network based on maximum group enumeration
The invention discloses a community discovery method in a social network based on maximum group enumeration, which comprises the following steps: S1, abstracting a social network relationship as a social network graph, and initializing a maximum group result set as a null set; S2, dividing the socia...
Saved in:
Main Authors | , , , |
---|---|
Format | Patent |
Language | Chinese English |
Published |
05.07.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The invention discloses a community discovery method in a social network based on maximum group enumeration, which comprises the following steps: S1, abstracting a social network relationship as a social network graph, and initializing a maximum group result set as a null set; S2, dividing the social network diagram by adopting core division to obtain adjacent sub-diagrams of all vertexes; S3, taking out the next unprocessed adjacent subgraph, judging whether the adjacent subgraph is dense or not, if yes, entering the step S4, and if not, entering the step S5; S4, iteratively deleting the vertex with the minimum degree in the adjacent subgraphs until the current subgraph becomes a cluster, recalling to search for a maximum cluster containing previous deletion points, and merging the obtained maximum cluster into a maximum cluster result set; S5, calling a traditional maximum group enumeration method for calculation, and merging the obtained maximum groups into a maximum group result set; and S6, repeating the |
---|---|
Bibliography: | Application Number: CN201910142643 |