PATENT CLAIM ANALYSIS

Application Number: 15892279
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-11
Patent Classification: ["707", "737000"]

Abstract:
The present disclosure discloses a method and system for detecting overlapping communities based on similarity between nodes in a social network. The method comprises steps of: receiving a social network to be detected; calculating a level of similarity between nodes in the social network to be detected; detecting overlapping communities in the social network based on the level of similarity between nodes; and, outputting a structure of the detected overlapping communities. In the method for detecting overlapping communities based on similarity between nodes in a social network of the present disclosure, a method for calculating similarity between network structure information and node attribute information is fused in the social network environment, and a method for discovering overlapping communities by fusing the similarity between nodes is proposed on this basis to obtain a high-quality community cohered in terms of both network structure and node preference.

Claim (Index 5):
The method according to  claim 1 , wherein performing rough K-Medoids clustering on nodes in the social network according to the initial clustering center for rough clustering to obtain an initial overlapping community structure of the social network specifically comprises:\n step S31: setting an upper approximation weight w up  and a lower approximation weight w low  for rough clustering of a social network G(V,E); step S32: if \u2200v i  \u2208V,u i  \u2208U, calculating p(v i ,u i ), wherein p(v i ,u i ) is a similar potential generated by a central node u i  at the node v i ; step S3: classifying the node v i  to a strongest cluster C l , and\n p ( v i , C l )=max{ p ( v 1 ,u i ),  p ( v 2 ,u i ), \u22c5 \u22c5 \u22c5 ,  p ( v i ,u i )} \n \n step S34: if \u2200v i  \u2208V, C j  \u2208C, calculating a potential difference \u03b4=p(v i , C l )\u2212p)v i , C j ); if \u03b4\u2264\u03b1, classifying v i  to an intersection set of upper approximation sets of C l  and C j , that is, v i  \u2208 C l \u2229 C j ; or otherwise, classifying v i  to a lower approximation set of C l , that is, v i  \u2208 C l ; step s35: if \u2200C m , C n  \u2208C and if \u2203v i  \u2208( C m \u2212 C m )\u2229( C n \u2212 C n ), that is, if the node v i  is located within a boundary region of two clusters, recalculating a potential of a node in a cluster, and setting p(v i , C l )=max{p(v i , C m ), p(v i , C n )} and p(v i , C j )=min{p(v i , C m ), p(v i , C n )}; step S36: recalculating a clustering center; step S37: when all clustering centers tend to be stable, executing step S38; or otherwise, returning to step S34; and step S38: outputting the obtained clusters to obtain the initial overlapping community structure of the social network.

Metadata:
- Claim Count in Document: 13.0
- Percentile: 88.0
- Lexical Diversity: 2.75
- Patent Class: 707.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['14786188', '14391676', '14207205', '13098870', '14363161']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2361700996356491
- 35 USC 102 Novelty (BERT): 0.5077149520761078
- Combined Prediction Score: 0.263324584879695
- Mean Citation Score: 234.905806
- Max Citation Score: 244.0496
- Similarity Product: 146.57505615787505

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 0
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test