Social network initial key node selection method considering delay constraint
A social network, key node technology, applied in the computer field, can solve the problem that the characteristics of the delay constraint propagation delay are rarely mined and applied to the initial key node and so on
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0058] In this embodiment, the data set from the real photo sharing website Flickr is used, divided into 4 parts according to the source of the photos, and one of them is selected as the experimental object, including 2602 nodes, 222292 edges and 24648 photos. Because the credit distribution obeys the time-delay constraint and the network structure, the two original data sets are processed to obtain two files respectively, in which the graph file records the relationship between authors, and the user behavior record file contains user behavior recorded in time order , and the user behavior records are divided into two parts, which are respectively used as the test set and the training set as the records.
[0059] Depend on figure 2 and image 3 It can be seen that, through a social network initial key node selection method (CDTC) considering delay constraints, the running time required for the same number of initial key node selection is lower than the time consumed by other...
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