A Privacy Graph-Based Community Discovery Method
A technology of community discovery and privacy graph, applied in the field of community discovery based on privacy graph
Active Publication Date: 2022-08-05
SHANDONG UNIV
View PDF9 Cites 0 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
The subgraph structures used by the current community discovery include k-core, k-cluster, etc. However, these community structures can only be used in general public graphs. For private graphs, due to the existence of private edges, through k-core or k-group cannot accurately perform community discovery
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0033] The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
[0034] The present invention provides a community discovery method based on privacy graph, such as figure 1 shown, including the following steps:
[0035] Step 1: Collect the relationship between users from the actual social network, use nodes to represent users, edges to represent the relationship between users, and use all user-visible relationships as public edges, and only a user-visible relationship as a relationship. The user's private edge to build the privacy graph.
[0036] Step 2, define a new concept for each node in the privacy graph, pp-kernel value, this indicator is used to measure the importance of the node, and further used to determine the community to which the node belongs;
[0037] The pp-kernel value of a node is defined as, when a node has k n...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention discloses a community discovery method based on a privacy graph, comprising the following steps: collecting the relationship between users from an actual social network, and constructing a privacy graph based on the relationship between users and users; Each node defines a new concept, pp-kernel value; calculates the public kernel value of all nodes in the public graph of the private graph, and mines the k-kernel subgraph in the public graph as a community; for each node, according to The public kernel value of all its neighbors in the public graph calculates the pp-kernel value of the node in the private graph, and then constructs a new community in the private graph with each node and the neighborhood where the pp-kernel value satisfies the condition. community; when a public or private edge is inserted or deleted, update the pp‑core value of all nodes and the community to which the node belongs. The method disclosed by the invention is convenient and concise, has low computational complexity, and can be applied to large-scale graph data.
Description
technical field [0001] The invention relates to the technical field of data mining, in particular to a community discovery method based on a privacy graph. Background technique [0002] In social networks, privacy issues are an important factor to consider when designing algorithms. A simple example is that a user can mark some of her friends as private, which will make the relationship between this user and his private friends only visible to the user and his friends. To describe this kind of social network, a privacy graph model is proposed. As mentioned in the Efficient Algorithms for Public-Private Social Networks document, Public-Private Graphs (public-private graphs) are defined as private graphs in this application. In the privacy graph, nodes represent users, and edges represent the relationships between users. The privacy graph includes a public graph and multiple private graphs. The public graph refers to the public graph that all the relationships between nodes ...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/2458G06F16/9536G06F21/62
CPCG06F16/2465G06F16/9536G06F21/6245
Inventor 于东晓张喜连郑艳伟罗琦
Owner SHANDONG UNIV