Multi-objective optimization community discovery system and method based on dynamic social network attributes
A multi-objective optimization, social network technology, applied in instruments, data processing applications, computing, etc., can solve the problems of random convergence direction, slow convergence speed, and high computing cost
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0064] In this example, see figure 1 and Figure 12 , a multi-objective optimization community discovery computing model based on dynamic social network attributes, comprising a receiving unit 2, a data preprocessing unit 3, a computing unit 4, a display unit 5 and a main control unit 1, characterized in that: the receiving unit 2 , data preprocessing unit 3, computing unit 4, and display unit 5 are sequentially connected through the data bus, the main control unit 1 is respectively connected to the receiving unit 2, the data preprocessing unit 3, the computing unit 4, and the display unit 5, and the receiving unit 2, The data preprocessing unit 3, the calculation unit 4, and the display unit 5 are also respectively connected to the main control unit 1 through a signal bus;
[0065] The receiving unit 2 is used to receive and store dynamic social network data;
[0066] The data preprocessing unit (3) is used to number and convert the received dynamic social network data into...
Embodiment 2
[0071] This embodiment is basically the same as Embodiment 1, and the special features are as follows:
[0072] In this embodiment, the graph data structure is expressed as G={G 1 ,G 2 ,...,G t}, where G represents a dynamic network graph, G t =(V t ,E t ) represents the snapshot graph at time step t, V t Represents the collection of nodes in time step t, each node represents a user or a group, E t Represents the set of edges between nodes in time step t, and each edge represents the relationship or interaction between two nodes.
[0073] In this example, the defined probability selection method. During the initialization of the algorithm, a set of proposals of a specified size is generated. Each scheme is a set of community connection key-value pairs contained in each node in the network. This paper proposes a probabilistic selection method to select the community connection key value of each node during initialization. the key y of the i-th node i According to the...
Embodiment 3
[0092] This embodiment is basically the same as the foregoing embodiment, and the special features are as follows:
[0093] In this example, see Figure 12 , a multi-objective optimization community discovery method based on dynamic social network attributes, using the above system to operate, is characterized in that it includes the following steps:
[0094] S1. Obtain dynamic social network data through the receiving unit, and then abstract the social network into a graph data structure through the data preprocessing unit as G={G 1 ,G 2 ,...,G t}, where G represents a dynamic network graph, G t =(V t ,E t ) represents the snapshot graph at time step t, V t Represents the collection of nodes in time step t, each node represents a user or a group, E t Represents the set of edges between nodes in time step t, and each edge represents the relationship or interaction between two nodes;
[0095] S2. In the current time step, encode the N schemes in the scheme set according...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com