Social media data classification method and device based on n-side dfs subgraph lightweight unsupervised graph representation learning
A social media and data classification technology, applied in the field of social media data classification, can solve the problems of not being applicable to large-scale graph data sets, and the inability to comprehensively extract the structural information of graphs, and achieve the effect of improving classification accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0063] like figure 1 As shown, a social media data classification method based on N-edge DFS subgraph lightweight unsupervised graph representation learning, for the convenience of expression, referred to as Substructure2vec, including:
[0064] Step S101: Traverse the N-edge DFS subgraph structure in each graph of the atlas, and extract the N-edge DFS subgraph of each graph; including:
[0065] Step S1011: adopt the depth-first subgraph search algorithm, use the minimum DFSCode to uniquely identify the subgraph, and convert the subgraph into a text representation;
[0066] Step S1012: Perform N-edge DFS sub-graph extraction sequentially for each graph in the atlas, first generate an initial 1-edge sub-atlas, and then sequentially perform N-edge DFS sub-graph mining on the generated initial 1-edge sub-atlas:
[0067] Generate an initial edge set, and gradually expand from each initial edge. When expanding, first determine whether the current subgraph has the smallest DFSCode....
Embodiment 2
[0135] like Figure 8 As shown, a social media data classification device based on N-edge DFS subgraph lightweight unsupervised graph representation learning, including:
[0136] The subgraph extraction module 201 is used to traverse the N-edge DFS subgraph structure in each graph of the atlas, and extract the N-edge DFS subgraphs of each graph;
[0137] The subgraph collection module 202 is used to collect the extracted N-edge DFS subgraphs to form a subgraph set of each graph;
[0138] The graph vector representation module 203 is configured to input the sub-atlas into the neural network model for training, and obtain the vector representation of each graph.
[0139] Specifically, the subgraph extraction module 201 includes:
[0140] The minimum DFSCode identification submodule 2011 is used for adopting the depth-first subgraph search algorithm, using the minimum DFSCode to uniquely identify the subgraph, and converting the subgraph into a textual representation;
[0141]...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


