A social network data processing method and device, storage medium and electronic device
By constructing a social relationship network model and utilizing information entropy and network representation learning, combined with clustering algorithms, the influence of nodes in social networks is calculated. This solves the problem that existing technologies fail to fully consider the individual's location and influence, thus improving the scientific rigor and accuracy of the assessment.
Patent Information
- Application Number
- CN202210347852.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-04-01
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2042-04-01
AI Technical Summary
Existing social network node influence assessment schemes fail to fully consider an individual's position and influence within the network, resulting in reduced scientific rigor and accuracy of the assessment results.
By acquiring user data from social networks, a social relationship network model is constructed, the degree and relative importance of nodes are calculated, and nodes are represented as low-dimensional vectors using information entropy and network representation learning. Then, clustering algorithms are used to divide communities and calculate the influence of nodes in social networks.
It improves the scientific rigor and accuracy of node influence calculation in social networks, focusing on the assessment of the scope of node influence.
Smart Images

Figure CN114841821B_ABST
Abstract
Description
Background Art
[0002] Current social networks attract and retain numerous users with the services they provide. While users interact with each other at a high frequency, the influence of different nodes varies, and therefore they have different effects on information dissemination, marketing, public opinion control, and mass incidents.
[0003] Most of the information dissemination evaluation schemes in related technologies are based on the evaluation of individual basic attributes, and rarely consider the individual's position and influence in the entire network. This will reduce the scientificity and accuracy of the node influence evaluation results in social networks.
[0004] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention
[0005] The purpose of the present disclosure is to provide a social network data processing method and apparatus, medium and device, which at least to a certain extent overcome the problem of reduced accuracy of node influence evaluation results due to limitations of related technologies.
[0006] Other features and advantages of the present disclosure will become apparent from the following detailed description, or may be learned in part by the practice of the present disclosure.
[0007] According to one aspect of the present disclosure, a method for processing social network data is provided, the method comprising:
[0008] Obtaining social network user data;
[0009] Building a social relationship network model based on the social network user data;
[0010] Calculating the degree of the nodes according to the network adjacency matrix of the social relationship network model, and calculating the relative importance of each node;
[0011] Calculate the information entropy of each node according to the relative importance;
[0012] Compressing the network adjacency matrix into a low-dimensional space through network representation learning, wherein one node corresponds to one vector;
[0013] Divide all nodes into multiple communities through a clustering algorithm, and calculate the ratio of the number of nodes in the community to the total number of nodes;
[0014] The influence of the node in its social network is calculated according to the information entropy and the ratio.
[0015] In one embodiment of the present disclosure, the obtaining of social network user data includes: obtaining social network user data on a social platform through a crawler tool, wherein the social network user data includes historical data of browsing, communication, and comments of individuals in the social network.
[0016] In one embodiment of the present disclosure, constructing a social relationship network model based on the social network user data includes: constructing the social relationship network model with social network users as nodes and user interaction relationships as edges based on the social network user data.
[0017] In one embodiment of the present disclosure, the social relationship network model is an undirected weighted complex network, and the undirected weighted complex network is represented by G(V, E), where V is a node set and E is an edge set.
[0018] In one embodiment of the present disclosure, the calculation formula of the relative importance is as follows:
[0019] in,
[0020] 0<I i <1, k i is the degree of node i, and N is the total number of network nodes.
[0021] In one embodiment of the present disclosure, the information entropy is calculated as follows:
[0022] e i =-∑ j∈Γ(i) I j .lnI j ,in,
[0023] e i > 0, Γ(i) represents the set of 2 times neighboring nodes of node i, I j is the relative importance of node j.
[0024] In one embodiment of the present disclosure, the calculation formula of the node influence is as follows:
[0025] in,
[0026] is the ratio of the number of nodes in the community to the total number of nodes, CN k (i) is the number of nodes in the community where node i is located, K is the total number of communities, -∑ j∈Γ(i) I j .lnI j is the information entropy of node i.
[0027] According to another aspect of the present disclosure, a social network data processing device is provided, comprising:
[0028] A data acquisition module, used to acquire social network user data;
[0029] A model building module, used to build a social relationship network model based on the social network user data;
[0030] A model solving module, used to calculate the degree of nodes according to the network adjacency matrix of the social relationship network model, and calculate the relative importance of each node;
[0031] An information entropy calculation module, used to calculate the information entropy of each node according to the relative importance;
[0032] A matrix transformation module, used to compress the network adjacency matrix into a low-dimensional space through network representation learning, wherein one node corresponds to one vector;
[0033] A community analysis module is used to divide the vectors corresponding to all nodes into multiple communities through a clustering algorithm, and calculate the ratio of the number of nodes in the community to the total number of nodes;
[0034] A result calculation module is used to calculate the influence of the node in its social network according to the information entropy and the ratio.
[0035] According to another aspect of the present disclosure, there is provided an electronic device, including:
[0036] Processor; and
[0037] A memory, configured to store executable instructions of the processor;
[0038] The processor is configured to execute any one of the above-mentioned social network data processing methods by executing the executable instructions.
[0039] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the social network data processing method described in any one of the above is implemented.
[0040] The embodiments of the present disclosure provide a social network data processing method and device, storage medium and electronic device, which first obtain social network user data, build a social relationship network model, and then calculate the information entropy size in the node neighborhood according to the network adjacency matrix of the social relationship network model, and then obtain the low-dimensional vector representation of the node propagation characteristics through network representation learning, and use a clustering algorithm to obtain the proportion of the number of nodes in the community to the total number of nodes, and finally build a formula for calculating the node influence. In this way, the influence range of nodes in social networks can be more focused, and the scientificity and accuracy of node influence calculation in social networks can be improved.
[0041] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS
[0042] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.
[0043] Figure 1 A flow chart of a method for processing social network data in an embodiment of the present disclosure is shown.
[0044] Figure 2 A schematic diagram showing a social relationship network in an embodiment of the present disclosure.
[0045] Figure 3 A schematic diagram showing a social network data processing device in an embodiment of the present disclosure.
[0046] Figure 4 A block diagram of an electronic device used for a social network data processing method in an embodiment of the present disclosure is shown.
[0047] Figure 5 A schematic diagram of a computer-readable storage medium for a social network data processing method in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION
[0048] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that the disclosure will be more comprehensive and complete and to fully convey the concepts of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0049] In addition, the accompanying drawings are only schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.
[0050] The exemplary embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.
[0051] Figure 1 A flow chart of a method for processing social network data in an embodiment of the present disclosure is shown.
[0052] refer to Figure 1 , a social network data processing method may include:
[0053] Step S102: obtaining social network user data;
[0054] Step S104: constructing a social relationship network model based on social network user data;
[0055] Step S106: Calculate the degree of the node according to the network adjacency matrix of the social relationship network model, and calculate the relative importance of each node;
[0056] Step S108: Calculate the information entropy of each node according to the relative importance;
[0057] Step S110: compressing the network adjacency matrix into a low-dimensional space through network representation learning, wherein one node corresponds to one vector;
[0058] Step S112: Divide the vectors corresponding to all nodes into multiple communities by using a clustering algorithm, and calculate the ratio of the number of nodes in the community to the total number of nodes;
[0059] Step S114: Calculate the influence of the node in its social network according to the information entropy and the ratio.
[0060] Specifically, we first obtain social network user data, build a social relationship network model, and then calculate the information entropy in the node neighborhood based on the network adjacency matrix of the social relationship network model. Then, we use network representation learning to obtain a low-dimensional vector representation of the node propagation characteristics, and use a clustering algorithm to obtain the proportion of the number of nodes in the community to the total number of nodes, and finally build a formula for calculating node influence. This can better focus on the influence range of nodes in social networks and improve the scientificity and accuracy of node influence calculation in social networks.
[0061] The following are Figure 1 Each step in is described in detail.
[0062] In step S101, social network user data is obtained.
[0063] In this example implementation, user social information disclosed by social network users may be obtained through a crawler tool. The user social information may include historical data such as browsing, communication, and comments of individuals in the social network.
[0064] In step S104, a social relationship network model is constructed based on the social network user data.
[0065] The main components of a social network include basic concepts such as nodes, edges, and communities. The following is a brief introduction to the basic elements of the constructed social network.
[0066] Node: A node refers to a research individual in a network. In a social network, a node usually refers to an actual participant, which can be an individual, thing, or group with mutual connections in the network. Based on the principle of node diversity, in the embodiment of the present disclosure, a network is constructed with social network users as nodes, which facilitates a more comprehensive study of the mutual connections between users in the network.
[0067] Edge: Edge generally refers to the connection between nodes, that is, users form a network through certain connections. This kind of connection relationship is diverse. Friendship relationships, common attribute relationships, interactive relationships, etc. between people are all relationship edges connecting two nodes. The closeness of the relationship between user nodes in a social network is also different. Some people have close relationships, while some people have sparse relationships. Therefore, different weight values should be introduced to distinguish different relationships. However, for simple calculations, binary relationships are usually used for analysis, that is, two users are either related or not, and the relationship between users is treated equally.
[0068] Community: A community is a collection of some nodes in a network. A community is a natural existence in a network, reflecting the inherent state and properties of the network. Users in the same community in a social network can have different attributes and different purposes, but the relationship between users in the community is relatively close, the density of edges in the internal structure of the community is relatively large, and the connection between communities is relatively sparse. In the embodiment of the present disclosure, a clustering algorithm with a relatively fine division effect is used to divide users into communities to find a set of users with relatively close relationships in the network structure.
[0069] In this example implementation, a social network model may be constructed based on social network user data, with social network users as nodes and user interaction relationships as edges, wherein the social network model is an undirected weighted complex network.
[0070] refer to Figure 1 , an undirected weighted complex network can be represented by G(V, E), where V is a set of nodes and E is an edge. For example, Figure 1 The circles numbered 1, 2, 3, ..., 12 in the figure represent each user in the network. There is a connection edge between circle 6 and circle 9, indicating that there has been communication between user 6 and user 9. Node V = {v1, v2, ..., v N} is a set of user nodes, E represents the set of edges connecting user nodes, and the edge E can represent the interactive relationship between users of the social network, which can include mutual browsing, forwarding, commenting, replying, etc. E = {ξij}, ξij = (vi, vj), ξij is the edge connecting vi and vj, vi and vj are user nodes in the network, if this edge exists, the value of ξij is 1, otherwise it is 0, that is, when there is communication between node vi and node vj, the value of ξij is 1, otherwise it is 0, where i = {1,2,…,N}, j = {1,2,…,N}, N is a natural number greater than 0, and N is the total number of user nodes in the network.
[0071] In step S106, the degree of the node is calculated according to the network adjacency matrix of the social relationship network model, and the relative importance of each node is calculated.
[0072] In this example implementation, since the social relationship network model is an undirected weighted complex network, the network adjacency matrix is a symmetric matrix. The network adjacency matrix A can be recorded as A N×N =(a ij ). For each data in the network adjacency matrix, if there is communication between node vi and node vj, then a ij =1, otherwise a ij = 0. And calculate the node degree and the relative importance of each node according to the network adjacency matrix.
[0073] Specifically, the degree of a node refers to the sum of the weights of the number of links or edges connected to the node. The node degree can be expressed as ki, and the calculation formula for the node degree is k i =∑ j a ij , a ij Represents the element in row i and column j in the adjacency matrix A. The relative importance of each node is calculated based on the node degree. The calculation formula for its relative importance is: Where 0<I i <1, k i is the degree of node i, and N is the total number of network nodes.
[0074] In step S108, the information entropy of each node is calculated according to the relative importance.
[0075] In this example implementation, the information entropy of a node represents the influence that neighboring nodes provide to the node. Information entropy can be expressed as e i , the calculation formula is e i =-∑ j∈Γ(i) I j .lnI j , i=(1,2,3,…,N), 1≤i≤N, N is a natural number, ei > 0, Γ(i) represents the set of 2 times neighboring nodes of a node, I j is the relative importance of node j.
[0076] In step S110, the network adjacency matrix is compressed into a low-dimensional space through network representation learning, wherein one node corresponds to one vector.
[0077] Among them, network representation learning aims to represent the nodes in the network as low-dimensional, real-valued, dense vector forms, so that the obtained vector forms can have the ability to represent and reason in the vector space, so that they can be more flexibly applied to different data mining tasks. For example, the representation of the node can be used as a feature and sent to a classifier like a support vector machine. At the same time, the node representation can also be converted into spatial coordinates for visualization tasks.
[0078] In this example implementation, the network adjacency matrix A(N×N) can be compressed to a representation of N×r low-dimensional space through DeepWalk network representation learning, where one node corresponds to one vector. The vector representation of any node vi is xi=(xi1,xi2,xi3,…,xir), i=(1,2,3,…,N), and r is an adjustable parameter.
[0079] In step S112, the vectors corresponding to all nodes are divided into multiple communities by using a clustering algorithm, and the ratio of the number of nodes in the community to the total number of nodes is calculated.
[0080] The clustering algorithm may be a K-means clustering algorithm (K-means clustering algorithm), which is a partitioning algorithm with a known number of cluster categories. It is a typical distance-based clustering algorithm that uses distance as an evaluation index of similarity, that is, it is believed that the closer the distance between two objects, the greater their similarity. The algorithm believes that clusters are composed of objects that are close in distance, so obtaining compact and independent clusters is the ultimate goal. It uses the Euclidean distance metric (simply understood as the straight-line distance between two points, and the Euclidean distance is just a more standardized definition of this distance, extended to n dimensions). It can handle large data sets and is efficient. Its input is the data set and the number of categories. The clustering result is K data sets divided into K categories.
[0081] In this example implementation, the K-means clustering algorithm is used to divide the vector xir corresponding to N nodes into K communities, and sort them according to the number of nodes in the community, denoted as C = (C1, C2, C3, ..., CK), where K is an adjustable parameter. The number of community nodes can be sorted as CN1>CN2>...>CNK. In the social relationship network model, any node i is selected, and the number of nodes CN in the community where node i is located can be obtained. K (i) Among them, is the ratio of the number of nodes in the community to the total number of nodes.
[0082] In step S114, the influence of the node in its social network is calculated according to the information entropy and the ratio.
[0083] In this example implementation, the calculation formula for the node influence is as follows: in, is the ratio of the number of nodes in the community to the total number of nodes, CN k (i) is the number of nodes in the community where node i belongs, N is the total number of nodes, K is the total number of communities, and the calculation result of ET(i) is the influence of node i in the social network.
[0084] It should be clearly understood that the present invention describes how to form and use specific examples, but the principles of the present invention are not limited to any details of these examples. On the contrary, based on the teachings of the content disclosed in the present invention, these principles can be applied to many other embodiments.
[0085] Figure 3 A schematic diagram showing a social network data processing device in an embodiment of the present disclosure.
[0086] refer to Figure 3 A social network data processing device 3 includes a data acquisition module 302, a model construction module 304, a model solution module 306, an information entropy calculation module 308, a matrix transformation module 310, a community analysis module 312 and a result calculation module 314.
[0087] A data acquisition module 302 is used to acquire social network user data;
[0088] A model building module 304 is used to build a social relationship network model based on the social network user data;
[0089] A model solving module 306, configured to calculate the degree of nodes according to the network adjacency matrix of the social relationship network model, and calculate the relative importance of each node;
[0090] An information entropy calculation module 308 is used to calculate the information entropy of each node according to the relative importance;
[0091] A matrix transformation module 310, for compressing the network adjacency matrix into a low-dimensional space through network representation learning, wherein one node corresponds to one vector;
[0092] The community analysis module 312 is used to divide the vectors corresponding to all nodes into multiple communities by using a clustering algorithm, and calculate the ratio of the number of nodes in the community to the total number of nodes;
[0093] The result calculation module 314 calculates the influence of the node in its social network according to the information entropy and the ratio.
[0094] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".
[0095] Refer to the following Figure 4 An electronic device 400 according to this embodiment of the present invention will be described. Figure 4 The electronic device 400 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.
[0096] like Figure 4 As shown, the electronic device 400 is in the form of a general computing device. The components of the electronic device 400 may include but are not limited to: at least one processing unit 410, at least one storage unit 420, and a bus 430 connecting different system components (including the storage unit 420 and the processing unit 410).
[0097] The storage unit stores program codes, which can be executed by the processing unit 410, so that the processing unit 410 performs the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification. For example, the processing unit 410 can perform the following steps: Figure 1 Step S102 shown in: obtaining social network user data; step S104: building a social relationship network model based on the social network user data; step S106: calculating the degree of the node according to the network adjacency matrix of the social relationship network model, and calculating the relative importance of each node; step S108: calculating the information entropy of each node according to the relative importance; step S110: compressing the network adjacency matrix to a low-dimensional space through network representation learning, wherein one node corresponds to one vector; step S112: dividing the vectors corresponding to all nodes into multiple communities through a clustering algorithm, and calculating the proportion of the number of nodes in the community to the total number of nodes; step S114: calculating the influence of the node in its social network according to the information entropy and the proportion.
[0098] The storage unit 420 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 4201 and / or a cache storage unit 4202 , and may further include a read-only storage unit (ROM) 4203 .
[0099] The storage unit 420 may also include a program / utility 4204 having a set (at least one) of program modules 4205, such program modules 4205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.
[0100] Bus 430 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
[0101] The electronic device 400 may also communicate with one or more external devices 600 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 400, and / or communicate with any device that enables the electronic device 400 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 450. Furthermore, the electronic device 400 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 460. As shown, the network adapter 460 communicates with other modules of the electronic device 400 via a bus 430. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 400, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.
[0102] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0103] Refer to the following Figure 5In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product 500 capable of implementing the above method of this specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product 500, which includes a program code. When the program product 500 is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of this specification.
[0104] A program product 500 for implementing the above method according to an embodiment of the present invention is described, which can be a portable compact disk read-only memory (CD-ROM) and includes program code, and can be run on a terminal device, such as a personal computer. However, the program product 500 of the present invention is not limited thereto, and in this document, a readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.
[0105] The program product 500 may be any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination thereof. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.
[0106] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0107] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
[0108] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).
[0109] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.
[0110] In addition, although the steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.
[0111] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0112] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the present disclosure, which follows the general principles of the present disclosure and includes common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.
Claims
1. A social network data processing method, characterized in that: The method comprises: Acquiring social network user data; the acquiring social network user data includes: acquiring social network user data on a social platform through a crawler tool, wherein the social network user data includes historical data of browsing, communication, and comments of individuals in the social network; Based on the social network user data, a social relationship network model is constructed with social network users as nodes and user interaction relationships as edges; The degree of the node is calculated according to the network adjacency matrix of the social relationship network model, and the relative importance of each node is calculated; the calculation formula of the relative importance is as follows: in, 0 i <1, k i is the degree of node i, N is the total number of network nodes; The information entropy of each node is calculated according to the relative importance; the calculation formula of the information entropy is as follows: e i = - ∑ j∈Γ(i) I j .lnI j , Among them, e i > 0, Γ(i) represents the set of 2 times neighboring nodes of node i, I j is the relative importance of node j; Compressing the network adjacency matrix into a low-dimensional space through network representation learning, wherein one node corresponds to one vector; The vectors corresponding to all nodes are divided into multiple communities by a clustering algorithm, and the ratio of the number of nodes in the community to the total number of nodes is calculated; The influence of the node in its social network is calculated according to the information entropy and the ratio; the calculation formula of the node influence is as follows: in, is the ratio of the number of nodes in the community to the total number of nodes, CN k (i) is the number of nodes in the community where node i is located, K is the total number of communities, -∑ j∈Γ(i) I j .lnI j is the information entropy of node i.
2. The social network data processing method according to claim 1, characterized in that: The social relationship network model is an undirected weighted complex network, and the undirected weighted complex network is represented by G(V, E), wherein V is a node set and E is an edge set.
3. A social network data processing device, characterized in that: include: A data acquisition module, used to acquire social network user data; The obtaining of social network user data includes: obtaining social network user data on a social platform through a crawler tool, wherein the social network user data includes historical data of browsing, communication, and comments of individuals in the social network; A model building module, used to build a social relationship network model with social network users as nodes and user interaction relationships as edges based on the social network user data; The model solving module is used to calculate the degree of the node according to the network adjacency matrix of the social relationship network model, and calculate the relative importance of each node; the calculation formula of the relative importance is as follows: in, 0 i <1, k i is the degree of node i, N is the total number of network nodes; The information entropy calculation module is used to calculate the information entropy of each node according to the relative importance; the calculation formula of the information entropy is as follows: e i = - ∑ j∈Γ(i) I j .lnI j , Among them, e i > 0, Γ(i) represents the set of 2 times neighboring nodes of node i, I j is the relative importance of node j; A matrix transformation module, used to compress the network adjacency matrix into a low-dimensional space through network representation learning, wherein one node corresponds to one vector; A community analysis module is used to divide the vectors corresponding to all nodes into multiple communities through a clustering algorithm, and calculate the ratio of the number of nodes in the community to the total number of nodes; The result calculation module is used to calculate the influence of the node in its social network according to the information entropy and the ratio; the calculation formula of the node influence is as follows: in, is the ratio of the number of nodes in the community to the total number of nodes, CN k (i) is the number of nodes in the community where node i is located, K is the total number of communities, -∑ j∈Γ(i) I j .lnI j is the information entropy of node i.
4. An electronic device, characterized in that: include: processor; as well as A memory, configured to store executable instructions of the processor; The processor is configured to execute the social network data processing method according to any one of claims 1 to 2 by executing the executable instructions.
5. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the social network data processing method according to any one of claims 1 to 2 is implemented.
