CN116578787A - Online social media topic propagation collaborative loop detection method and equipment - Google Patents

Online social media topic propagation collaborative loop detection method and equipment Download PDF

Info

Publication number
CN116578787A
CN116578787A CN202310436008.1A CN202310436008A CN116578787A CN 116578787 A CN116578787 A CN 116578787A CN 202310436008 A CN202310436008 A CN 202310436008A CN 116578787 A CN116578787 A CN 116578787A
Authority
CN
China
Prior art keywords
path
loop
node
propagation
topic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310436008.1A
Other languages
Chinese (zh)
Inventor
曾园园
江昊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhan University WHU
Original Assignee
Wuhan University WHU
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Wuhan University WHU filed Critical Wuhan University WHU
Priority to CN202310436008.1A priority Critical patent/CN116578787A/en
Publication of CN116578787A publication Critical patent/CN116578787A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9536—Search customisation based on social or collaborative filtering
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention provides a method and equipment for detecting a propagation collaboration loop of an online social media topic. The method comprises the following steps: step 1 to step 6. According to the method, a cascade diagram is constructed aiming at the online social media topic transmission message forwarding process, and a Top-K diffusion path in the deep direction of topic transmission and a Top-K diffusion path in the wide direction of topic transmission are searched by taking the node hop number and the forwarding number as weights respectively; and extracting loops of the Top-N before the number of the loop path forwarding on the Top-K diffusion path before the number of the loop path forwarding and loops of the Top-N before the number of the loop path forwarding on the Top-K diffusion path before the number of the topic propagation by taking the weight of the forwarding number, and obtaining a collaborative loop topological structure in the topic propagation process by taking a union. The method and the system can effectively detect the key topological structure of the path-dependent node cooperative loop feedback in the online social media topic transmission process, thereby further assisting in identifying the public opinion topic manipulation.

Description

Online social media topic propagation collaborative loop detection method and equipment
Technical Field
The embodiment of the invention relates to the technical field of online social media data mining, in particular to a method and equipment for detecting online social media topic transmission collaboration loops.
Background
With the advent of the internet era, the high efficiency and convenience of online social media became the dominant medium for information dissemination in the internet era. The online social media topic transmission loop detection is effectively carried out, and the online social media topic transmission loop detection method has important significance for online social media public opinion manipulation discovery and network public opinion environment management. The related technology provides detection based on a social robot node account, and detection based on similar forwarding behaviors, common mention/forwarding/praise, similar text sending and other behaviors of the nodes, wherein the detection mainly aims at node account characteristics and propagation behavior characteristics, and loop topological structures generated by node cooperation in the process of propagating the topics cannot be detected effectively. Therefore, developing a method and a device for detecting a propagation collaboration loop of an online social media topic can effectively overcome the defects in the related art, and is a technical problem to be solved in the industry.
Disclosure of Invention
Aiming at the problems existing in the prior art, the embodiment of the invention provides a method and equipment for detecting a propagation collaboration loop of an online social media topic.
In a first aspect, an embodiment of the present invention provides a method for detecting a collaborative loop of online social media topic propagation, including: step 1, constructing a topic transmission forwarding network cascade diagram according to an information forwarding relation among node accounts by using an online social media network under a target topic, and calculating hop numbers and forwarding amounts forwarded by all nodes; step 2: starting from each source account, searching a deep diffusion path of topic propagation on a cascade graph by taking the hop count of a node as a weight, and extracting a deep diffusion path of Top-K before the depth of the propagation path; step 3, starting from each source account, searching a broad-direction diffusion path of topic transmission by taking the node forwarding number as a weight, and extracting a broad-direction diffusion path of Top-K before the transmission path forwarding number; step 4, detecting loops on the paths, namely paths connected by end-to-end nodes, by taking the node forwarding number as a weight according to the obtained topic transmission Top-K deep direction diffusion paths, and extracting loops of Top-N before the topic transmission deep direction loop path forwarding number; step 5, detecting loops on the paths, namely paths connected end to end, by taking the node forwarding number as a weight according to the obtained topic propagation Top-K broad-direction diffusion paths, and extracting loops of Top-N before the topic propagation broad-direction loop path forwarding number; step 6, according to the extracted loop of Top-N before the deep-direction loop path and the loop of Top-N before the wide-direction loop path, taking the union of the two as the cooperative loop topology structure of the topic propagation; the propagation depth direction is a propagation direction with a first preset number of node forwarding hops away from the source node in the propagation process; the propagation wide direction is the propagation direction with the forwarding number of the second preset number of nodes in the propagation process; k is a first constant given by an upper layer application; n is a second constant given to the upper layer application.
Based on the content of the method embodiment, the method for detecting the online social media topic propagation collaboration loop provided by the embodiment of the invention comprises the following steps: the method comprises the steps that 1.1, a node set V of a cascade graph is formed according to an online social media network forwarding relation data set of a target topic and account nodes, a directed edge set E of the cascade graph is formed according to forwarding relations among the nodes, and a topic propagation cascade graph G (V, E) is constructed according to the directed edge set E; step 1.2, extracting user nodes which release original blog in a cascade diagram, and determining that the user nodes are message source accounts of target topic transmission; starting from the originating account, a hop count from the originating account by the node includes: obtaining the hop count forwarded by the node; and according to the degree of egress of the node in the cascade graph, calculating to obtain the forwarding number of the node.
Based on the content of the method embodiment, the method for detecting the online social media topic propagation collaborative loop provided by the embodiment of the invention calculates the forwarding number of the node according to the degree of departure of the node in the cascade graph, and comprises the following steps:
fw(v)＝OD(v),v∈V
wherein, node V is any node in node set V, fw (V) is the forwarding number of node V, and OD (V) is node output.
Based on the content of the method embodiment, the method for detecting the online social media topic propagation collaboration loop provided by the embodiment of the invention comprises the following steps: 2.1, starting from any source account, accessing the node, starting from neighbor nodes which are not accessed by the source account in sequence, performing depth-first search according to the number of hops of the neighbor nodes as a weight from large to small until the search of K paths is completed or all nodes which are in path communication with the source account in a cascade diagram are accessed; the depth of the path is calculated and saved in the searching process, namely: the current search path is distant from the hop count of the originating account; step 2.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 2.3: if the number of the search paths in the process of the step 2.1 reaches K, the new search path depth in the process of the step 2.2 is larger than the search path depth of the step 2.1, replacement is carried out, and the paths with the front Top-K depth in the current step 2.1 and the step 2.2 are reserved; the specific calculation mode is as follows:
min(p∈P d )＝p new ,if|P d |＝＝K
Where K is a first constant given by the upper layer application, P d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |P d The I obtains the potential of a deep direction path set, namely the number of paths; min (P E P) d ) Calculating the path with the minimum weight, namely the minimum path depth, of the current deep direction path set; step 2.4: if the number of the search paths in the process of step 2.1 does not reach K, adding the new search paths in the process of step 2.2 into the search path set, wherein the specific calculation mode is as follows:
P d ＝P d ∪{p new },if|P d |<K
where K is a first constant given by the upper layer application, P d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |pd| is the potential to get the set of deep-direction paths, i.e. the number of paths.
Based on the content of the method embodiment, the method for detecting the online social media topic propagation collaboration loop provided by the embodiment of the invention comprises the following steps: starting from an originating account to access nodes, starting from neighbor nodes which are not accessed by the originating account in sequence, performing depth-first search according to the forwarding number of the neighbor nodes as a weight from large to small until N paths are searched or all nodes which are in path communication with the originating account in a cascade diagram are accessed; and in the searching process, calculating and storing the forwarding number of the path, namely: the sum of the forwarding numbers of all nodes on the current search path; step 3.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 3.3: if the number of the searching paths in the process of the step 3.1 reaches K, the new searching path depth in the process of the step 3.2 is larger than the searching path depth of the step 3.1, replacement is carried out, and a diffusion path of the front Top-K forwarding number in the current step 3.1 and the step 3.2 is reserved; the specific calculation mode is as follows:
min(p∈P b )＝p new1 ,if|P b |＝＝K
Where K is a first constant given by the upper layer application, P b P for the set of broad-direction paths currently searched by step 3.1 new1 For the new path searched in step 3.2, |P b The I obtains the potential of a broad-direction path set, namely the number of paths; min (P E P) b ) Calculating the path of the minimum weight of the current broad-direction path set, namely the minimum path forwarding number; step 3.4: if the number of the search paths in the process of the step 3.1 does not reach K, adding a new search path in the process of the step 3.2 into the search path set, wherein the specific calculation mode is as follows: p (P) b ＝P b ∪{p new1 },if|P b |<K。
Based on the content of the method embodiment, the method for detecting the online social media topic propagation collaboration loop provided by the embodiment of the invention comprises the following steps: step 4.1, extracting a deep direction diffusion path set formed by the diffusion paths of the Top-K before the deep direction according to the step 2; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 4.2, if the paths in the deep direction diffusion path set are not accessed, selecting a path which is not accessed at the moment to search, and repeating the searching process; step 4.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, including: the node sequence of the loop path and the forwarding number of the loop path.
Based on the content of the method embodiment, the method for detecting the online social media topic propagation collaboration loop provided by the embodiment of the invention comprises the following steps: step 5.1, extracting a wide-direction diffusion path set formed by diffusion paths of the Top-K in the wide direction according to the step 3; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 5.2, if no path is accessed in the wide-direction diffusion path set, selecting a path which is not accessed for searching, and repeating the searching process; step 5.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, comprising the following steps: the nodes of the loop path and the total number of forwarding of the loop path.
In a second aspect, an embodiment of the present invention provides an online social media topic propagation collaboration loop detection apparatus, including: the first main module is used for realizing online social media networks under target topics, constructing a topic transmission forwarding network cascade diagram according to the information forwarding relation among node accounts, and calculating hop counts and forwarding quantities forwarded by all nodes; the second main module is used for searching a deep diffusion path of topic transmission on the cascade graph from each source account, and extracting a deep diffusion path of Top-K before the depth of the transmission path; the third main module is used for realizing the wide-direction diffusion path of the topic transmission from each source account, extracting the wide-direction diffusion path of Top-K before the transmission path forwarding number; a fourth main module, configured to detect a loop on the path according to the obtained topic propagation deep direction diffusion path, that is, a path connected by end-to-end nodes, and extract a loop of Top-N before forwarding the topic propagation deep direction loop path; a fifth main module, configured to detect a loop on the path according to the obtained broad-direction path of the topic transmission, that is, a path connected by end-to-end nodes, and extract a loop of Top-N before forwarding the broad-direction loop path of the topic transmission; a sixth main module, configured to implement a cooperative loop topology structure that propagates a loop of Top-N before a deep-direction loop path and a loop of Top-N before a wide-direction loop path according to the extracted topics, and takes a union of the two as a topic propagation; the propagation depth direction is a propagation direction with a first preset number of node forwarding hops away from the source node in the propagation process; the propagation wide direction is the propagation direction with the forwarding number of the second preset number of nodes in the propagation process; k is a first constant given by an upper layer application; n is a second constant given to the upper layer application.
In a third aspect, an embodiment of the present invention provides an electronic device, including:
at least one processor; and
at least one memory communicatively coupled to the processor, wherein:
the memory stores program instructions executable by the processor, the processor invoking the program instructions capable of executing the online social media topic propagation collaborative loop detection method provided by any of the various implementations of the first aspect.
In a fourth aspect, embodiments of the present invention provide a non-transitory computer-readable storage medium storing computer instructions that cause a computer to perform the online social media topic propagation collaborative loop detection method provided by any of the various implementations of the first aspect.
According to the method and the device for detecting the online social media topic transmission collaboration loop, which are provided by the embodiment of the invention, the loop feedback key topological structure which is formed by mutual collaboration of nodes and has the dependence of the transmission path is extracted in the online social media topic transmission process, so that the nodes with organized collaboration interaction association and the forwarding number information thereof in the topic transmission are found, and a basis is provided for online social media public opinion manipulation discovery.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, a brief description will be given below of the drawings required for the embodiments or the prior art descriptions, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings may be obtained according to these drawings without any inventive effort for a person skilled in the art.
FIG. 1 is a schematic flow diagram of a method for detecting online social media topic propagation collaboration loops provided by an embodiment of the invention;
fig. 2 is a schematic structural diagram of an online social media topic propagation collaboration loop detection device provided by an embodiment of the present invention;
fig. 3 is a schematic entity structure diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of 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, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention. In addition, the technical features of each embodiment or the single embodiment provided by the invention can be combined with each other at will to form a feasible technical scheme, and the combination is not limited by the sequence of steps and/or the structural composition mode, but is necessarily based on the fact that a person of ordinary skill in the art can realize the combination, and when the technical scheme is contradictory or can not realize, the combination of the technical scheme is not considered to exist and is not within the protection scope of the invention claimed.
The embodiment of the invention provides a method for detecting a propagation collaboration loop of an online social media topic, which comprises the following steps: step 1, constructing a topic transmission forwarding network cascade diagram according to an information forwarding relation among node accounts by using an online social media network under a target topic, and calculating hop numbers and forwarding amounts forwarded by all nodes; step 2: starting from each source account, searching a deep diffusion path of topic propagation on a cascade graph by taking the hop count of a node as a weight, and extracting a deep diffusion path of Top-K before the depth of the propagation path; step 3, starting from each source account, searching a broad-direction diffusion path of topic transmission by taking the node forwarding number as a weight, and extracting a broad-direction diffusion path of Top-K before the transmission path forwarding number; step 4, detecting loops on the paths, namely paths connected by end-to-end nodes, by taking the node forwarding number as a weight according to the obtained topic propagation depth direction Top-K diffusion paths, and extracting loops of Top-N before the topic propagation depth direction loop path forwarding number; step 5, detecting loops on the paths, namely paths connected by end-to-end nodes, by taking the node forwarding number as a weight according to the obtained topic propagation broad-direction Top-K diffusion paths, and extracting loops of Top-N before the topic propagation broad-direction loop path forwarding number; step 6, according to the extracted loop of Top-N before the deep-direction loop path and the loop of Top-N before the wide-direction loop path, taking the union of the two as the cooperative loop topology structure of the topic propagation; the propagation depth direction is a propagation direction with a first preset number of node forwarding hops away from the source node in the propagation process; the propagation wide direction is the propagation direction with the forwarding number of the second preset number of nodes in the propagation process; k is a first constant given by an upper layer application; n is a second constant given to the upper layer application.
Based on the content of the above method embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection method provided in the embodiment of the present invention, step 1 specifically includes: the method comprises the steps that 1.1, a node set V of a cascade graph is formed according to an online social media network forwarding relation data set of a target topic and account nodes, a directed edge set E of the cascade graph is formed according to forwarding relations among the nodes, and a topic propagation cascade graph G (V, E) is constructed according to the directed edge set E; step 1.2, extracting user nodes which release original blog in a cascade diagram, and determining that the user nodes are message source accounts of target topic transmission; starting from the originating account, a hop count from the originating account by the node includes: obtaining the hop count forwarded by the node; and according to the degree of egress of the node in the cascade graph, calculating to obtain the forwarding number of the node.
Based on the content of the method embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection method provided in the embodiment of the present invention calculates, according to the degree of departure of a node in a cascade graph, the forwarding number of the node, including:
fw(v)＝OD(v),v∈V
wherein fw (v) is the forwarding number of node v, and OD (v) is the node output.
Specifically, all node sets participating in topic propagation form a cascade graph vertex set V, and a directed edge set E is constructed among all nodes according to the forwarding relation from a source node to a target node of message forwarding, so that a topic propagation forwarding cascade graph G (V, E) is obtained. And determining the originating account according to whether the node account node has an incoming edge. Accordingly, each node calculates the hop count from the originating account, and calculates the forwarding count according to the degree of each node.
Based on the content of the above method embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection method provided in the embodiment of the present invention, step 2 specifically includes: 2.1, starting from any source account, accessing the node, starting from neighbor nodes which are not accessed by the source account in sequence, performing depth-first search according to the number of hops of the neighbor nodes as a weight from large to small until the search of K paths is completed or all nodes which are in path communication with the source account in a cascade diagram are accessed; the depth of the path is calculated and saved in the searching process, namely: the current search path is distant from the hop count of the originating account; step 2.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 2.3: if the number of the search paths in the process of the step 2.1 reaches K, the new search path depth in the process of the step 2.2 is larger than the search path depth of the step 2.1, replacement is carried out, and the paths with the front Top-K depth in the current step 2.1 and the step 2.2 are reserved; the specific calculation mode is as follows:
min(p∈P d )＝p new ,if|P d |＝＝K
wherein P is d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |P d The I obtains the potential of a deep direction path set, namely the number of paths; min (P E P) d ) Calculating the path with the minimum weight, namely the minimum path depth, of the current deep direction path set; step 2.4: if the number of the search paths in the process of step 2.1 does not reach K, adding the new search paths in the process of step 2.2 into the search path set, wherein the specific calculation mode is as follows:
P d ＝P d ∪{p new },if|P d |<K
wherein P is d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |pd| is the potential to get the set of deep-direction paths, i.e. the number of paths.
Specifically, the path of the depth of the front Top-K in the current step 2.1 and step 2.2 is reserved until the total path number searched in the step 2.1 and step 2.2 processes reaches K, or all nodes in the cascade diagram, which are in path communication with the originating account, are accessed. Thereby, a deep diffusion path of Top-K before the propagation path depth is obtained.
Based on the content of the above method embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection method provided in the embodiment of the present invention, step 3 specifically includes: starting from an originating account to access nodes, starting from neighbor nodes which are not accessed by the originating account in sequence, performing depth-first search according to the forwarding number of the neighbor nodes as a weight from large to small until N paths are searched or all nodes which are in path communication with the originating account in a cascade diagram are accessed; and in the searching process, calculating and storing the forwarding number of the path, namely: the sum of the forwarding numbers of all nodes on the current search path; step 3.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 3.3: if the number of the searching paths in the process of the step 3.1 reaches K, the new searching path depth in the process of the step 3.2 is larger than the searching path depth of the step 3.1, replacement is carried out, and a diffusion path of the front Top-K forwarding number in the current step 3.1 and the step 3.2 is reserved; the specific calculation mode is as follows:
min(p∈P b )＝p new1 ,if|P b |＝＝K
Wherein P is b P for the set of broad-direction paths currently searched by step 3.1 new1 For the new path searched in step 3.2, |P b The I obtains the potential of a broad-direction path set, namely the number of paths; min (P E P) b ) Calculating the path of the minimum weight of the current broad-direction path set, namely the minimum path forwarding number; step 3.4: if the number of the search paths in the process of the step 3.1 does not reach K, adding a new search path in the process of the step 3.2 into the search path set, wherein the specific calculation mode is as follows: p (P) b ＝P b ∪{p new1 },if|P b |<K。
Specifically, the path of the front Top-K forwarding number in the current step 3.1 and step 3.2 is reserved until the total path number searched in the step 3.1 and step 3.2 processes reaches K, or all nodes in the cascade diagram, which are in path communication with the originating account, are accessed. Thus, a wide-direction diffusion path of Top-K before the propagation path forwarding amount is obtained.
Based on the content of the above method embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection method provided in the embodiment of the present invention, step 4 specifically includes: step 4.1, extracting a deep diffusion path set according to the step 2; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 4.2, if the path is not accessed in the deep direction diffusion path set formed by the diffusion paths of the Top-K before the deep direction at this time, selecting a path which is not accessed for searching, and repeating the searching process; step 4.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, including: the node sequence of the loop path and the forwarding number of the loop path.
Based on the content of the above method embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection method provided in the embodiment of the present invention, step 5 specifically includes: step 5.1, extracting a wide-direction diffusion path set formed by diffusion paths of the Top-K in the wide direction according to the step 3; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 5.2, if no path is accessed in the wide-direction diffusion path set, selecting a path which is not accessed for searching, and repeating the searching process; step 5.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, comprising the following steps: the nodes of the loop path and the total number of forwarding of the loop path.
In another embodiment, step 6 takes the union of the extracted loops of Top-N before the deep-direction loop path and the extracted loops of Top-N before the wide-direction loop path as the loop topology result of the topic propagation. In the implementation process, the loop topology structure is a loop and broad-direction loop path node sequence and loop path forwarding number of Top-N before the deep-direction loop path of the topic propagation, and a loop and broad-direction loop path node sequence and loop path forwarding number of Top-N before the deep-direction loop path of the topic propagation.
According to the online social media topic transmission collaborative loop detection method provided by the embodiment of the invention, the loop feedback key topological structure which is formed by mutual collaboration of nodes and has propagation path dependence is extracted in the online social media topic transmission process, so that nodes with organized collaborative interaction association and forwarding number information thereof in topic transmission are found, and a basis is provided for online social media public opinion manipulation discovery.
The implementation basis of the embodiments of the present invention is realized by a device with a processor function to perform programmed processing. Therefore, in engineering practice, the technical solutions and the functions of the embodiments of the present invention can be packaged into various modules. Based on the actual situation, on the basis of the above embodiments, the embodiment of the present invention provides an online social media topic propagation collaboration loop detection device, which is used for executing the online social media topic propagation collaboration loop detection method in the above method embodiment. Referring to fig. 2, the apparatus includes: the first main module is used for realizing online social media networks under target topics, constructing a topic transmission forwarding network cascade diagram according to the information forwarding relation among node accounts, and calculating hop counts and forwarding quantities forwarded by all nodes; the second main module is used for searching a deep diffusion path of topic transmission on the cascade graph from each source account, and extracting a deep diffusion path of Top-K before the depth of the transmission path; the third main module is used for realizing the wide-direction diffusion path of the topic transmission from each source account, extracting the wide-direction diffusion path of Top-K before the transmission path forwarding number; a fourth main module, configured to detect a loop on the path according to the obtained topic propagation deep direction diffusion path, that is, a path connected by end-to-end nodes, and extract a loop of Top-N before forwarding the topic propagation deep direction loop path; a fifth main module, configured to detect a loop on the path according to the obtained broad-direction path of the topic transmission, that is, a path connected by end-to-end nodes, and extract a loop of Top-N before forwarding the broad-direction loop path of the topic transmission; a sixth main module, configured to implement a cooperative loop topology structure that propagates a loop of Top-N before a deep-direction loop path and a loop of Top-N before a wide-direction loop path according to the extracted topics, and takes a union of the two as a topic propagation; the propagation depth direction is a propagation direction with a first preset number of node forwarding hops away from the source node in the propagation process; the propagation wide direction is the propagation direction with the forwarding number of the second preset number of nodes in the propagation process; k is a first constant given by an upper layer application; n is a second constant given to the upper layer application.
The online social media topic propagation collaborative loop detection device provided by the embodiment of the invention adopts a plurality of modules shown in fig. 2, and finds out nodes with organized collaborative interaction association and forwarding number information thereof in topic propagation by extracting a loop feedback key topological structure which is formed by mutual collaboration of nodes and is dependent on propagation paths in the online social media topic propagation process, thereby providing basis for online social media public opinion manipulation finding.
It should be noted that, the device in the device embodiment provided by the present invention may be used to implement the method in the above method embodiment, and may also be used to implement the method in other method embodiments provided by the present invention, where the difference is merely that the corresponding functional module is provided, and the principle is basically the same as that of the above device embodiment provided by the present invention, so long as a person skilled in the art refers to a specific technical solution in the above device embodiment based on the above device embodiment, and obtains a corresponding technical means by combining technical features, and a technical solution formed by these technical means, and on the premise that the technical solution is ensured to have practicability, the device in the above device embodiment may be modified, so as to obtain a corresponding device embodiment, and be used to implement the method in other method embodiment. For example:
Based on the content of the above device embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection device provided in the embodiment of the present invention further includes: the first sub-module is configured to implement step 1 specifically including: the method comprises the steps that 1.1, a node set V of a cascade graph is formed according to an online social media network forwarding relation data set of a target topic and account nodes, a directed edge set E of the cascade graph is formed according to forwarding relations among the nodes, and a topic propagation cascade graph G (V, E) is constructed according to the directed edge set E; step 1.2, extracting user nodes which release original blog in a cascade diagram, and determining that the user nodes are message source accounts of target topic transmission; starting from the originating account, a hop count from the originating account by the node includes: obtaining the hop count forwarded by the node; and according to the degree of egress of the node in the cascade graph, calculating to obtain the forwarding number of the node.
Based on the content of the above device embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection device provided in the embodiment of the present invention further includes: the second sub-module is configured to implement the calculating to obtain a forwarding number of the node according to the degree of egress of the node in the cascade graph, and includes:
fw(v)＝OD(v),v∈V
Wherein fw (v) is the forwarding number of node v, and OD (v) is the node output.
Based on the content of the above device embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection device provided in the embodiment of the present invention further includes: the third sub-module is configured to implement step 2 specifically including: 2.1, starting from any source account, accessing the node, starting from neighbor nodes which are not accessed by the source account in sequence, performing depth-first search according to the number of hops of the neighbor nodes as a weight from large to small until the search of K paths is completed or all nodes which are in path communication with the source account in a cascade diagram are accessed; the depth of the path is calculated and saved in the searching process, namely: the current search path is distant from the hop count of the originating account; step 2.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 2.3: if the number of the search paths in the process of the step 2.1 reaches K, the new search path depth in the process of the step 2.2 is larger than the search path depth of the step 2.1, replacement is carried out, and the paths with the front Top-K depth in the current step 2.1 and the step 2.2 are reserved; the specific calculation mode is as follows:
min(p∈P d )＝p new ,if|P d |＝＝K
Wherein P is d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |P d The I obtains the potential of a deep direction path set, namely the number of paths; min (P E P) d ) Calculating the path with the minimum weight, namely the minimum path depth, of the current deep direction path set; step 2.4: if the number of search paths in the process of step 2.1 is not reachedK, adding a new search path into the search path set in the process of step 2.2, wherein the specific calculation mode is as follows:
P d ＝P d ∪{p new },if|P d |<K
wherein P is d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |pd| is the potential to get the set of deep-direction paths, i.e. the number of paths.
Based on the content of the above device embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection device provided in the embodiment of the present invention further includes: the fourth sub-module is configured to implement step 3 specifically including: starting from an originating account to access nodes, starting from neighbor nodes which are not accessed by the originating account in sequence, performing depth-first search according to the forwarding number of the neighbor nodes as a weight from large to small until N paths are searched or all nodes which are in path communication with the originating account in a cascade diagram are accessed; and in the searching process, calculating and storing the forwarding number of the path, namely: the sum of the forwarding numbers of all nodes on the current search path; step 3.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 3.3: if the number of the searching paths in the process of the step 3.1 reaches K, the new searching path depth in the process of the step 3.2 is larger than the searching path depth of the step 3.1, replacement is carried out, and a diffusion path of the front Top-K forwarding number in the current step 3.1 and the step 3.2 is reserved; the specific calculation mode is as follows:
min(p∈P b )＝p new1 ,if|P b |＝＝K
Wherein P is b P for the set of broad-direction paths currently searched by step 3.1 new1 For the new path searched in step 3.2, |P b The I obtains the potential of a broad-direction path set, namely the number of paths; min (P E P) b ) Calculating the path of the minimum weight of the current broad-direction path set, namely the minimum path forwarding number; step 3.4: if the number of search paths in the process of step 3.1 does not reach K, the process of step 3.2The new search path in the list is added into the search path set, and the specific calculation mode is as follows: p (P) b ＝P b ∪{p new1 },if|P b |<K。
Based on the content of the above device embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection device provided in the embodiment of the present invention further includes: the fifth sub-module is configured to implement step 4 specifically including: step 4.1, extracting a deep diffusion path set according to the step 2; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 4.2, if the path is not accessed in the deep direction diffusion path set formed by the diffusion paths of the Top-K before the deep direction at this time, selecting a path which is not accessed for searching, and repeating the searching process; step 4.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, including: the node sequence of the loop path and the forwarding number of the loop path.
Based on the content of the above device embodiment, as an optional embodiment, the online social media topic propagation collaboration loop detection device provided in the embodiment of the present invention further includes: the sixth sub-module is configured to implement step 5 specifically including: step 5.1, extracting a wide-direction diffusion path set according to the step 3; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 5.2, if the paths in the wide-direction diffusion path set formed by the diffusion paths of the front Top-K in the wide direction are not accessed, selecting one path which is not accessed for searching, and repeating the searching process; step 5.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, comprising the following steps: the nodes of the loop path and the total number of forwarding of the loop path.
The method of the embodiment of the invention is realized by the electronic equipment, so that the related electronic equipment is necessary to be introduced. To this end, an embodiment of the present invention provides an electronic device, as shown in fig. 3, including: at least one processor (processor), a communication interface (Communications Interface), at least one memory (memory) and a communication bus, wherein the at least one processor, the communication interface, and the at least one memory communicate with each other via the communication bus. The at least one processor may invoke logic instructions in the at least one memory to perform all or part of the steps of the methods provided by the various method embodiments described above.
Further, the logic instructions in at least one of the memories described above may be implemented in the form of a software functional unit and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or may be implemented by hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. Based on this knowledge, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It should be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims (10)

1. The online social media topic transmission collaborative loop detection method is characterized by comprising the following steps of: step 1, constructing a topic transmission forwarding network cascade diagram according to an information forwarding relation among node accounts by using an online social media network under a target topic, and calculating hop numbers and forwarding amounts forwarded by all nodes; step 2: starting from each source account, searching a deep diffusion path of topic propagation on a cascade graph by taking the hop count of a node as a weight, and extracting a deep diffusion path of Top-K before the depth of the propagation path; step 3, starting from each source account, searching a broad-direction diffusion path of topic transmission by taking the node forwarding number as a weight, and extracting a broad-direction diffusion path of Top-K before the transmission path forwarding number; step 4, detecting loops on the paths, namely paths connected end to end, by taking the node forwarding number as a weight according to the obtained forward Top-K diffusion paths of the topic propagation deep direction, and extracting loops of the forward Top-N of the topic propagation deep direction loop paths; step 5, according to the obtained forward Top-K diffusion path of the topic transmission wide direction, using the node forwarding number as a weight, detecting a loop on the path, namely a path connected by end-to-end nodes, and extracting a loop of the forward Top-N of the topic transmission wide direction loop path forwarding number; step 6, according to the extracted loop of Top-N before the deep-direction loop path and the loop of Top-N before the wide-direction loop path, taking the union of the two as the cooperative loop topology structure of the topic propagation; the propagation depth direction is a propagation direction with a first preset number of node forwarding hops away from the source node in the propagation process; the propagation wide direction is the propagation direction with the forwarding number of the second preset number of nodes in the propagation process; k is a first constant given by an upper layer application; n is a second constant given to the upper layer application.
2. The method for detecting a propagation collaboration loop of an online social media topic as claimed in claim 1, wherein the step 1 specifically includes: the method comprises the steps that 1.1, a node set V of a cascade graph is formed according to an online social media network forwarding relation data set of a target topic and account nodes, a directed edge set E of the cascade graph is formed according to forwarding relations among the nodes, and a topic propagation cascade graph G (V, E) is constructed according to the directed edge set E; step 1.2, extracting user nodes which release original blog in a cascade diagram, and determining that the user nodes are message source accounts propagated by target topics; starting from the source account, obtaining the hop count forwarded by the node by the hop count of the node from the source account; and according to the degree of egress of the node in the cascade graph, calculating to obtain the forwarding number of the node.
3. The method for detecting the online social media topic propagation collaboration loop according to claim 2, wherein the calculating the forwarding number of the node according to the degree of departure of the node in the cascade graph comprises:
fw(v)＝OD(v),v∈V
wherein, node V is any node in node set V, fw (V) is the forwarding number of node V, and OD (V) is node output.
4. The method for detecting a propagation collaboration loop on an online social media topic as claimed in claim 3, wherein step 2 specifically comprises: step 2.1, starting from any source account, accessing the node, starting from neighbor nodes which are not accessed by the source account in sequence, performing depth-first search according to the number of hops of the neighbor nodes as a weight from large to small until the search of the appointed K paths is completed or all nodes which are in path communication with the source account in the cascade diagram are accessed; the depth of the path is calculated and saved in the searching process, namely: the current search path is distant from the hop count of the originating account; step 2.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 2.3: if the number of the search paths in the process of the step 2.1 reaches K, the new search path depth in the process of the step 2.2 is larger than the search path depth of the step 2.1, replacement is carried out, and the paths with the front Top-K depth in the current step 2.1 and the step 2.2 are reserved; the specific calculation mode is as follows:
min(p∈P d )＝p new ,if|P d |＝＝K
Wherein P is d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |P d The I obtains the potential of a deep direction path set, namely the number of paths; min (P E P) d ) Calculating the minimum weight of the current deep direction path set, namely the path with the minimum path depth; step 2.4: if the number of the search paths in the process of step 2.1 does not reach K, adding the new search paths in the process of step 2.2 into the search path set, wherein the specific calculation mode is as follows:
P d ＝P d ∪{p new },if|P d |<K
wherein P is d For the deep direction path set currently searched by step 2.1, p new For the new path searched in step 2.2, |pd| is the potential to get the set of deep-direction paths, i.e. the number of paths.
5. The method for detecting a propagation collaboration loop on an online social media topic as claimed in claim 4, wherein the step 3 specifically includes: starting from an originating account to access nodes, starting from neighbor nodes which are not accessed by the originating account in sequence, performing depth-first search according to the forwarding number of the neighbor nodes as a weight from large to small until N paths are searched or all nodes which are in path communication with the originating account in a cascade diagram are accessed; and in the searching process, calculating and storing the forwarding number of the path, namely: the sum of the forwarding numbers of all nodes on the current search path; step 3.2, if the fashionable active account is not accessed, selecting an unaccessed active account as a starting point, and repeating the searching process; step 3.3: if the number of the searching paths in the process of the step 3.1 reaches K, the new searching path depth in the process of the step 3.2 is larger than the searching path depth of the step 3.1, replacement is carried out, and a diffusion path of the front Top-K forwarding number in the current step 3.1 and the step 3.2 is reserved; the specific calculation mode is as follows:
min(p∈P b )＝p new1 ,if|P b |＝＝K
Wherein P is b P for the set of broad-direction paths currently searched by step 3.1 new1 For the new path searched in step 3.2, |P b The I obtains the potential of a broad-direction path set, namely the number of paths; min (P E P) b ) Calculating the minimum weight of the current broad-direction path set, namely the path of the minimum path forwarding number; step 3.4: if the number of the search paths in the process of the step 3.1 does not reach K, adding a new search path in the process of the step 3.2 into the search path set, wherein the specific calculation mode is as follows:
P b ＝P b ∪{p new1 },if|P b |<K。
6. the method for detecting a propagation collaboration loop on an online social media topic as claimed in claim 5, wherein step 4 specifically comprises: step 4.1, extracting a deep direction diffusion path set formed by the diffusion paths of the Top-K before the deep direction according to the step 2; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 4.2, if the paths in the deep direction diffusion path set are not accessed, selecting a path which is not accessed at the moment to search, and repeating the searching process; step 4.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, including: the node sequence of the loop path and the forwarding number of the loop path.
7. The method for detecting a propagation collaboration loop on an online social media topic as claimed in claim 6, wherein the step 5 specifically includes: step 5.1, extracting a wide-direction diffusion path set formed by diffusion paths of the Top-K in the wide direction according to the step 3; setting all path nodes in an unvisited state, starting from any unvisited node on any path, performing depth-first search according to the forwarding number of neighbor nodes as a weight from large to small until the current search node and the visited node have connected edges, extracting the loop structure, namely the searched end-to-end path structure, and recording the node sequence of the loop path and the forwarding number of the loop path; or until all nodes on the current path are accessed; step 5.2, if no path is accessed in the wide-direction diffusion path set, selecting a path which is not accessed for searching, and repeating the searching process; step 5.3, extracting the loop structure information of Top-N before the total forwarding number of the loop path, comprising the following steps: the nodes of the loop path and the total number of forwarding of the loop path.
8. An online social media topic propagation collaboration loop detection device, comprising: the first main module is used for realizing online social media networks under target topics, constructing a topic transmission forwarding network cascade diagram according to the information forwarding relation among node accounts, and calculating hop counts and forwarding quantities forwarded by all nodes; the second main module is used for realizing starting from each source account, searching a deep diffusion path of topic transmission on the cascade graph by taking the hop count of the node as a weight, and extracting a deep diffusion path of Top-K before the depth of the transmission path; the third main module is used for realizing starting from each source account, searching a broad-direction diffusion path of topic transmission by taking the node forwarding number as a weight, and extracting a broad-direction diffusion path of Top-K before the transmission path forwarding number; a fourth main module, configured to implement detecting a loop on a path, that is, a path connected by end-to-end nodes, by using a node forwarding number as a weight according to the obtained topic propagation depth direction Top-K diffusion path, and extracting a loop of Top-N before the topic propagation depth direction loop path forwarding number; a fifth main module, configured to implement detecting a loop on a path, that is, a path connected by end-to-end nodes, by using a node forwarding number as a weight according to the obtained topic propagation broad-direction Top-K diffusion path, and extracting a loop of Top-N before the topic propagation broad-direction loop path forwarding number; a sixth main module, configured to implement a cooperative loop topology structure that propagates a loop of Top-N before a deep-direction loop path and a loop of Top-N before a wide-direction loop path according to the extracted topics, and takes a union of the two as a topic propagation; the propagation depth direction is a propagation direction with a first preset number of node forwarding hops away from the source node in the propagation process; the propagation wide direction is the propagation direction with the forwarding number of the second preset number of nodes in the propagation process; k is a first constant given by an upper layer application; n is a second constant given to the upper layer application.
9. An electronic device, comprising:
at least one processor, at least one memory, and a communication interface; wherein, the liquid crystal display device comprises a liquid crystal display device,
the processor, the memory and the communication interface are communicated with each other;
the memory stores program instructions executable by the processor, the processor invoking the program instructions to perform the method of any of claims 1-7.
10. A non-transitory computer readable storage medium storing computer instructions that cause the computer to perform the method of any one of claims 1 to 7.
CN202310436008.1A 2023-04-21 2023-04-21 Online social media topic propagation collaborative loop detection method and equipment Pending CN116578787A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310436008.1A CN116578787A (en) 2023-04-21 2023-04-21 Online social media topic propagation collaborative loop detection method and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310436008.1A CN116578787A (en) 2023-04-21 2023-04-21 Online social media topic propagation collaborative loop detection method and equipment

Publications (1)

Publication Number Publication Date
CN116578787A true CN116578787A (en) 2023-08-11

Family

ID=87540469

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310436008.1A Pending CN116578787A (en) 2023-04-21 2023-04-21 Online social media topic propagation collaborative loop detection method and equipment

Country Status (1)

Country Link
CN (1) CN116578787A (en)

Similar Documents

Publication Publication Date Title
Roos et al. Settling payments fast and private: Efficient decentralized routing for path-based transactions
Wen et al. To shut them up or to clarify: Restraining the spread of rumors in online social networks
Song et al. Spam filtering in twitter using sender-receiver relationship
RU2611247C1 (en) Method and device for forming label library, method and device for user search
US9253077B2 (en) Parallel top-K simple shortest paths discovery
Augustine et al. Storage and search in dynamic peer-to-peer networks
CN102656922A (en) System and method of utilizing a framework for information routing in large-scale distributed systems using swarm intelligence
Fang et al. BTDS: Bayesian‐based trust decision scheme for intelligent connected vehicles in VANETs
CN108289034A (en) A kind of fault discovery method and apparatus
CN104866586A (en) Method and system for calculating node importance of information transmission in social media
Saurabh et al. ICMP based IP traceback with negligible overhead for highly distributed reflector attack using bloom filters
Hao et al. BlockP2P: Enabling fast blockchain broadcast with scalable peer-to-peer network topology
CN110233833A (en) Support the message method and system of social network user secret protection
Yuan et al. A multi-source feedback based trust calculation mechanism for edge computing
CN111191080A (en) Data processing method and device
Krishnamurthy et al. An analytical study of a structured overlay in the presence of dynamic membership
CN116578787A (en) Online social media topic propagation collaborative loop detection method and equipment
Lu et al. Skeleton construction in mobile social networks: Algorithms and applications
Lu et al. Reinforcement learning relieves the vaccination dilemma
Bonsma et al. Extremal graphs having no matching cuts
US8374353B2 (en) Method and apparatus for updating a group key
US9621401B1 (en) Performing dynamic data analysis within a dynamic network
Margariti et al. A study on the redundancy of flooding in unstructured p2p networks
Shang Fast distributed consensus seeking in large-scale sensor networks via shortcuts
Bin et al. A novel ε-sensitive correlation indistinguishable scheme for publishing location data

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination