CN110247805A - A kind of method and device for propagating key node based on the identification that K shell decomposes - Google Patents
A kind of method and device for propagating key node based on the identification that K shell decomposes Download PDFInfo
- Publication number
- CN110247805A CN110247805A CN201910550676.0A CN201910550676A CN110247805A CN 110247805 A CN110247805 A CN 110247805A CN 201910550676 A CN201910550676 A CN 201910550676A CN 110247805 A CN110247805 A CN 110247805A
- Authority
- CN
- China
- Prior art keywords
- node
- shell
- communication network
- degree
- index
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000001902 propagating effect Effects 0.000 title claims description 15
- 238000004891 communication Methods 0.000 claims abstract description 66
- 238000004364 calculation method Methods 0.000 claims abstract description 12
- 239000011159 matrix material Substances 0.000 claims description 39
- 238000003860 storage Methods 0.000 claims description 19
- 238000004422 calculation algorithm Methods 0.000 claims description 11
- 238000003780 insertion Methods 0.000 claims description 6
- 230000037431 insertion Effects 0.000 claims description 6
- 230000000644 propagated effect Effects 0.000 abstract description 7
- 238000004590 computer program Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 9
- 238000012545 processing Methods 0.000 description 6
- 238000000354 decomposition reaction Methods 0.000 description 5
- 238000012986 modification Methods 0.000 description 5
- 230000004048 modification Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000012163 sequencing technique Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000009792 diffusion process Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005065 mining Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
Classifications
-
- 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—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/52—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Health & Medical Sciences (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- Human Resources & Organizations (AREA)
- General Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Primary Health Care (AREA)
- Algebra (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Pure & Applied Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention discloses a kind of method and device that key node is propagated based on the identification that K shell decomposes, this method comprises: communication network is established in the message forwarding by acquisition social platform, the individual of message will be forwarded to be determined as node in the communication network；The corresponding even number of edges amount of each node is obtained according to buddy list data；Degree according to the node calculates the K shell index of each node；The shortest distance in the communication network between each pair of node is calculated, the shortest distance between the node is used to characterize propagation position of the individual in social networks；Score value is corresponded to according to the ranking of each node of minimum distance calculation between K shell index and the node, and then obtains the crucial disseminator in the communication network.The present invention can the positioning of more accurate positioning node in a network, accurately excavate the crucial disseminator in social networks, reduce false determination ratio.
Description
Technical field
The present invention relates to Web information mining fields, and in particular to a kind of identification propagation key node decomposed based on K shell
Method and device.
Background technique
In today of a networked society, message propagation is very fast, and the key node in propagation is exactly that those can be bigger
The structure of network and some special entities of function are influenced in degree, and refer to can for the key node in gossip propagation network
Utmostly accelerate the node of rumour diffusion.For example, the big V of microblogging can accelerate the diffusion of rumour.Therefore we need from magnanimity
The crucial disseminator in gossip propagation network is accurately excavated out in user, us can be helped preferably to control the biography of rumour in this way
It broadcasts.
Currently, most of gossip propagation that is directed to, by the way of manually deleting, also some people, which use, is directed to gossip propagation net
The node sequencing method of network, but position or the disturbance degree of node are only determined using single method, but in network
The node of heart position may also appear in network edge, and the high node location of disturbance degree may also identify gossip propagation net very partially
The accuracy rate of the crucial disseminator of network is lower.
Summary of the invention
Goal of the invention: for overcome the deficiencies in the prior art, the present invention provides a kind of identification propagation pass decomposed based on K shell
It the problem of method of key node, this method can solve the false assessment of K shell node high for network edge, more accurately excavates
To the crucial disseminator of communication network, on the other hand, the present invention also provides a kind of identifications decomposed based on K shell to propagate key node
Device.
Technical solution: the method for the present invention that key node is propagated based on the identification that K shell decomposes, this method comprises:
Communication network is established in message forwarding by acquiring social platform, according to for forwarding message in the communication network
Body determines node set, acquires the corresponding buddy list data of each node in the node set；
Obtain that each node is corresponding directly to connect number of edges amount according to the buddy list data；Wherein, if being between individual
Friend relation then exists between corresponding two node and directly connects side；
According to the degree for directly connecting number of edges amount and determining each node in the communication network of each node, according to the node
Degree calculate the K shell index of each node, the K shell index is used to characterize influence power individual in the communication network；
The shortest distance in the communication network between each pair of node is calculated using Floyd algorithm, according to the K shell index and
The ranking of each node of minimum distance calculation corresponds to score value, and then obtains the propagation key node in the communication network.
Further, comprising:
The degree for directly connecting number of edges amount and determining each node in the communication network according to each node, specifically:
The degree of the communication network interior joint is equal to the direct of the node and connects number of edges amount.
Further, comprising:
The degree according to the node calculates the K shell index of each node, and specific steps include:
Obtain the degree of each node in the communication network interior joint set S, the node set S={ s1,s2,...,
sn, n is the sum of node；
Traverse node set S, searching degree are 1 all nodes, and delete corresponding node and connect with the direct of the node
Side, by the corresponding node storage to set S1, the set S1In each node K shell indexp∈S1；
Traverse node set S, all nodes that searching degree is 2, and the side deleting corresponding node and being connected with the node,
By the corresponding node storage to set S2, the set S2In each node K shell indexq∈S2；
Traverse node set S is repeated, and the degree found adds 1 every time, it is corresponding all until finding maximum degree n in set
Node, and the side deleting corresponding node and being connected with the node, by the corresponding node storage to set Sn, the set
SnIn each node K shell indexm∈Sn。
Further, comprising:
The shortest distance calculated using Floyd algorithm in the communication network between each pair of node, comprising:
Obtain the corresponding network adjacent matrix G of the communication network；
Distance matrix D is initialized according to adjacency matrix G, if having Lu Keda, Distance matrix D from node i to node j
[i] [j]=d, d indicate the length on the road；Otherwise D [i] [j]=infinity, wherein 1≤i < j≤n；
The information that matrix L is used to record be inserted into node is defined, L [i] [j] expression needs to pass through from node i to node j
Node initializes L [i] [j]=j；Remaining each node is inserted into the path of i to j, compare insertion node after i to j away from
From with it is former with a distance from, indicate are as follows: D [i] [j]=min (D [i] [j], D [i] [k]+D [k] [j]), if the value of D [i] [j] becomes smaller,
Then L [i] [j]=k；Aforesaid operations are repeated, until D no longer updates, export Distance matrix D.
Further, comprising:
The ranking for calculating each node corresponds to the formula of score value are as follows:
Wherein, KSIt (t) is the corresponding K shell index of t-th of node, dl,tIndicate the shortest distance between node l and t.
A kind of device for propagating key node based on the identification that K shell decomposes, comprising:
Acquisition module, communication network is established in the message forwarding by acquiring social platform, according to the communication network transfer
The individual for sending out message determines node set, acquires the corresponding buddy list data of each node in the node set；
Directly connect side computing module, obtains that each node is corresponding directly to connect number of edges amount according to the buddy list data；
Wherein, if between individual being friend relation, exist between corresponding two node and directly connect side；
K shell index computing module, for according to each node directly connect number of edges amount determine it is each in the communication network
The degree of node, the degree according to the node calculate the K shell index of each node, and the K shell index is used to characterize the transmitting network
Individual influence power in network；
Score value computing module, for calculating the shortest distance in the communication network between each pair of node using Floyd algorithm,
It is indexed according to the K shell and corresponds to score value with the ranking of each node of the minimum distance calculation, and then obtain the communication network
In propagation key node.
Further, comprising:
In the K shell index computing module, the degree of communication network interior joint is equal to the direct of the node and connects number of edges amount.
Further, comprising:
The K shell indexes computing module, further includes:
Obtain the degree of each node in the communication network interior joint set S, the node set S={ s1,s2,...,
sn, n is the sum of node；
Traverse node set S, searching degree are 1 all nodes, and delete corresponding node and connect with the direct of the node
Side, by the corresponding node storage to set S1, the set S1In each node K shell indexp∈S1；
Traverse node set S, all nodes that searching degree is 2, and the side deleting corresponding node and being connected with the node,
By the corresponding node storage to set S2, the set S2In each node K shell indexq∈S2；
Traverse node set S is repeated, and the degree found adds 1 every time, it is corresponding all until finding maximum degree n in set
Node, and the side deleting corresponding node and being connected with the node, by the corresponding node storage to set Sn, the set
SnIn each node K shell indexm∈Sn。
Further, comprising:
The minimum distance calculation module, further includes:
Obtain the corresponding network adjacent matrix G of the communication network；
Distance matrix D is initialized according to adjacency matrix G, if having Lu Keda, Distance matrix D from node i to node j
[i] [j]=d, d indicate the length on the road；Otherwise D [i] [j]=infinity, wherein 1≤i < j≤n；
The information that matrix L is used to record be inserted into node is defined, L [i] [j] expression needs to pass through from node i to node j
Node initializes L [i] [j]=j；Remaining each node is inserted into the path of i to j, compare insertion node after i to j away from
From with it is former with a distance from, indicate are as follows: D [i] [j]=min (D [i] [j], D [i] [k]+D [k] [j]), if the value of D [i] [j] becomes smaller,
Then L [i] [j]=k；Aforesaid operations are repeated, until D no longer updates, export Distance matrix D.
Further, comprising:
In the score value computing module, the ranking for calculating each node corresponds to the formula of score value are as follows:
Wherein, KSIt (t) is the corresponding K shell index of t-th of node, dl,tIndicate the shortest distance between node l and t.
The utility model has the advantages that the present invention improves the common counter of network node, propagation can be reflected comprehensively by obtaining one kind
The crucial Rank scores for propagating node role in network, can the positioning of more accurate positioning node in a network, accurately
The crucial disseminator excavated in social networks, reduce false determination ratio；And the present invention uses between Floyd algorithm calculate node
Distance, low compared to time complexity with other distance algorithms, when suitable for complicated social networks, time cost is lower, improves
Recognition efficiency.
Detailed description of the invention
Fig. 1 is recognition methods flow chart figure in the embodiment of the present invention；
Fig. 2 is network node connection figure in the embodiment of the present invention；
It is identification device structure chart that Fig. 3, which is in the embodiment of the present invention,；
Fig. 4 is electronic devices structure schematic diagram in the embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, is not whole embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Identify social networks crucial disseminator, other than the individual amount that can be directly affected, locating for propagation
The whether enough centers in position also determine its influence power propagated, therefore it is necessary to consider these two aspects simultaneously for node sequencing method
Effect, i.e., the influence power (quantity of individual individual in close relations therewith in social networks) of node itself and node are in network
The location of middle (propagation position of the individual in social networks).Classical node sequencing method is not examined simultaneously at present
Consider the effect of these two aspects, this makes can not the role of thoroughly evaluating node in a network using above-mentioned existing method.
K- shell decomposition method is used widely because its computation complexity is low and recognition effect is excellent.Often k shell is bigger
Node be located at the center of network, but be also possible to appear in network edge, at this moment k shell decomposition method still will be considered that this
Node is critically important, but true really not so.
To solve the above-mentioned problems, the present invention is a kind of new by designing node path information involvement k shell decomposition method
Node sequencing method come promoted its identification accuracy rate, correction k shell decomposition method k shell node high for network edge mistake comment
Estimate, more accurately excavates to the crucial disseminator for wanting communication network, there is very big application value.
As shown in fig.1, the invention proposes a kind of methods for propagating key node based on the identification that K shell decomposes, specifically
Include:
S110 establishes communication network by the message forwarding of acquisition social platform, forwards message according in the communication network
Individual determine node set, acquire the corresponding buddy list data of each node in the node set, wherein node set
S={ s1,s2,...,sn, n is the sum of node.
In the embodiment of the present invention, specific network is not limited, certain in microblogging or other social platforms can be acquired
The entire chain of the forwarding of message establishes communication network according to entire chat, and further, the present invention can be according to forwarding message
The key node of situation identification gossip propagation.
S120 obtains the corresponding even number of edges amount of each node according to the buddy list data；If between individual being good friend pass
System then exists between corresponding two node and directly connects side；
Specifically, the present invention does not limit specific social software, if being direct friend in the buddy list of individual
Relationship then acquires the buddy list relationship in social software in corresponding database, if being friends between two individuals, deposits
Directly connect side at one, if between two individuals not being friend relation, there is no side is directly connected, leads to not between the individual of good friend
It crosses while influencing each other for the individual of good friend.
S130 directly connects the degree that number of edges amount determines each node in the communication network according to each node, according to described in
The degree of node calculates the K shell index of each node, and the K shell index is used to characterize individual in the communication network directly affect
Power.
The corresponding number of edges amount that directly connects of each node is that the corresponding degree of the node is expressed as K (i), wherein i is network section
Point number, 1≤i≤n, n are the sum of the communication network interior joint, while having the node to have the node for directly connecting side is the section
The corresponding neighbor node of point.
The degree according to the node calculates the K shell index of each node, specifically includes:
Input: the degree of each node in the communication network interior joint set S；
Step: S1 traverse node set S, searching degree be 1 all nodes, and delete corresponding node and with the node phase
Side even, by the corresponding node storage to set S1, the set S1In each node K shell index p∈S1；
S2 traverse node set S, searching degree are 2 all nodes, and delete corresponding node and be connected with the node
Side, by the corresponding node storage to set S2, the set S2In each node K shell indexq∈S2；
S3 repeats traverse node set S, and the degree found adds 1 every time, until the corresponding institute of degree n maximum in searching set
The side for having node, and deleting corresponding node and being connected with the node, by the corresponding node storage to set Sn, the collection
Close SnIn each node K shell indexm∈Sn；
Output: node set S1,S2,...,SnAnd the K shell index of corresponding node
S140 calculates the shortest distance in the communication network between each pair of node using Floyd algorithm, between the node
The shortest distance is used to correct the K shell index of each node.
For example the high k shell node of network edge locations is appeared in, and since the distance that it arrives other nodes of network is far, shadow
It ringing power to be overestimated, therefore lower weight should be endowed, we can describe this weight by the inverse of euclidean distance between node pair,
Because distance is remoter, the inverse of distance is smaller, and weight is smaller, and node is more inessential.
The shortest distance calculated using Floyd algorithm in the communication network between each pair of node, comprising:
Input: the corresponding network adjacent matrix G of the communication network；
Step: (1) initializing Distance matrix D according to adjacency matrix G, if having Lu Keda from node i to node j, away from
From matrix D [i] [j]=d, d indicates the length on the road；Otherwise D [i] [j]=infinity, wherein 1≤i < j≤n；
(2) define matrix L and be used to record the information of be inserted into node, L [i] [j] indicate to need from node i to node j through
The node crossed initializes L [i] [j]=j；Remaining each node is inserted into the path of i → j, i → j after insertion node is compared
Distance with it is original at a distance from, i.e. D [i] [j]=min (D [i] [j], D [i] [k]+D [k] [j]), if the value of D [i] [j] becomes
It is small, then L [i] [j]=k；Aforesaid operations are repeated, until D no longer updates；
Output: the Distance matrix D between nodes.
Further, comprising:
The Rank scores formula of each node are as follows:
Wherein, KSIt (t) is the corresponding K shell index of t-th of node, dl,tIndicate the shortest distance between node l and t
The ranking that S150 indexes each node of minimum distance calculation between the node according to the K shell corresponds to score value,
And then obtain the crucial disseminator in the communication network.
It is worth noting that the method flow diagram in the embodiment of the present invention is to clearly illustrate implementation of the present invention
Technical solution in example, does not constitute the limitation to technical solution provided in an embodiment of the present invention, also, in the embodiment of the present invention
It is also not limited to the application of social networks, for other system structures and service application, technology provided in an embodiment of the present invention
Scheme is equally applicable for similar problem.
Specific implementation of the invention is described in detail below in conjunction with the example network in Fig. 2.
Step 1: calculating the K shell index of each node.The node (7,8,10) and its connect side that network moderate is 1 are removed, at this time
The immoderate node for being 1 in network, thus node 7,8,10 k shell index be 1, at this time network only include seven nodes (1,2,3,
4,5,6,9).Remove again network moderate be 2 node (5,6,9) and its even side, at this time in network still degree of having be 2 node (3,
4) node 3,4 and its even side, are removed, rest network still degree of having is less than or equal to 2 node (1,2), therefore removes node 1,2, this
When network in again without node, therefore the k shell index of node 1,2,3,4,5,6,9 is 2.The K shell index of all nodes is shown in Table 1:
The k shell of each node of table 1 indexes
Step 2: calculating the shortest distance d in network between each pair of nodeij。
Input is corresponding network adjacent matrix, is exported as distance matrix, and corresponding adjacency matrix indicates in the present embodiment
Are as follows:
By taking node 1 as an example, exists with node 2,3,4 and directly connect side, therefore corresponding position is between 1, with remaining six node
There is no directly connecting side, therefore corresponding position is 0.
Be shown in Table 2: the row and column in the table is the reference numeral of node, the shortest distance square between output valve corresponding node
Battle array, with node to (1,6) for, due to node 1 and node 6 not direct neighbor (a1,6=0), therefore initial distance is set as infinite
Greatly；Then node 2 is inserted between node 1,6, node 1 and node 6 cannot reach each other；It is inserted into node 3, node 1 and node 6
It cannot still reach each other；It is inserted into node 4, node 1 and node 6 can achieve each other, therefore the shortest distance between them is more
New is 2；Sequentially add node 5,6,7,8,9,10, the shortest distance of node 1 and node 6 is to be updated, therefore d1,6=2.
The shortest distance between each node pair of table 2
Step 3: calculating the Rank scores of each node, Rank scores more high node is more important.
By taking node 1 as an example:
The score of all nodes is shown in Table 3:
The score of each node of table 3
According to the score of table 3, available final node importance ranking is shown in Table 4:
The importance ranking of each node of table 4
By table 4, it can be seen that, node 4 is mostly important.It is not difficult to find out that node 4 is connected to left and right Liang Ge little society from Fig. 1
Group, the really mostly important node of the node 4 in " network core position ".Reflect in true communication network, node 4
Position, and the medium as two Group Communications are propagated with best message, it is irreplaceable.Compared to other nodes, such as
Node 5 needs to get to the group on right side by longer message propagation path.And if node 4 be used as message dissemination person, more
Specifically, rumour can Liang Ge group spreads apart in its left and right rapidly, accelerate the propagation of rumour.
Based on the above embodiment, as shown in fig.3, in the embodiment of the present invention, crucial section is propagated based on the identification that K shell decomposes
The device of point, comprising:
Acquisition module 21, communication network is established in the message forwarding by acquiring social platform, by the communication network transfer
The individual of message is sent out as node, each node is numbered to obtain node set S={ s1,s2,...,sn, and acquire institute
State the corresponding buddy list data of each node in node set, wherein n is the sum of node；
Directly connect side computing module 22, for obtaining the corresponding even number of edges of each node according to the buddy list data
Amount；If between individual being friend relation, exists between corresponding two node and directly connect side；
K shell indexes computing module 23, for being determined in the communication network respectively according to the number of edges amount that directly connects of each node
The degree of a node, the degree according to the node calculate the K shell index of each node, and the K shell index is used to characterize the propagation
Individual direct influence in network；
Minimum distance calculation module 24, for being calculated in the communication network between each pair of node most using Floyd algorithm
Short distance, the shortest distance between the node are used to characterize propagation position of the individual in social networks；
Score value computing module 25, for according to each node of minimum distance calculation between K shell index and the node
Ranking correspond to score value, and then obtain the crucial disseminator in the communication network.
Further, comprising:
In the K shell index computing module 23, the degree of communication network interior joint is equal to the direct of the node and connects number of edges amount.
Further, comprising:
The K shell indexes computing module 23, further includes:
Input unit, for inputting the degree of each node in the communication network interior joint set S；
Traversal Unit, preferred traverse node set S, searching degree be 1 all nodes, and delete corresponding node and with it is described
The connected side of node, by the corresponding node storage to set S1, the set S1In each node K shell indexp∈S1；
Secondly, traverse node set S, searching degree are 2 all nodes, and delete corresponding node and be connected with the node
Side, by the corresponding node storage to set S2, the set S2In each node K shell indexq∈S2；
Finally, traverse node set S is repeated, and the degree found adds 1 every time, it is corresponding until finding maximum degree n in set
All nodes, and the side deleting corresponding node and being connected with the node, by the corresponding node storage to set Sn, institute
State set SnIn each node K shell indexm∈Sn；
Output unit, output node set S1,S2,...,SnAnd the K shell index of corresponding node
Further, comprising:
The minimum distance calculation module 24, further includes:
Input unit inputs the corresponding network adjacent matrix G of the communication network；
Computing unit, it is preferred, Distance matrix D is initialized according to adjacency matrix G, if having road can from node i to node j
It reaches, then Distance matrix D [i] [j]=d, d indicate the length on the road；Otherwise D [i] [j]=infinity, wherein 1≤i < j≤
n；
Secondly, defining the information that matrix L is used to record be inserted into node, L [i] [j] indicates to need from node i to node j
The node of process initializes L [i] [j]=j；Remaining each node is inserted into the path of i → j, i after insertion node is compared
The distance of → j with it is original at a distance from, i.e. D [i] [j]=min (D [i] [j], D [i] [k]+D [k] [j]), if the value of D [i] [j]
Become smaller, then L [i] [j]=k；Aforesaid operations are repeated, until D no longer updates；
Output unit exports the Distance matrix D between nodes.
Further, comprising:
In the score value computing module 25, the Rank scores formula of each node are as follows:
Wherein, KSIt (t) is the corresponding K shell index of t-th of node, dl,tIndicate the shortest distance between node l and t.
As shown in fig.4, in the embodiment of the present invention, a kind of electronic equipment structural schematic diagram.
The embodiment of the invention provides a kind of electronic equipment, which may include 310 (Center of processor
Processing Unit, CPU), memory 320, input equipment 330 and output equipment 340 etc., input equipment 330 may include
Keyboard, mouse, touch screen etc., output equipment 340 may include display equipment, such as liquid crystal display (Liquid Crystal
Display, LCD), cathode-ray tube (Cathode Ray Tube, CRT) etc..
Memory 320 may include read-only memory (ROM) and random access memory (RAM), and mention to processor 310
For the program instruction and data stored in memory 320.In embodiments of the present invention, memory 320 can be used for storing above-mentioned
The program of the method for key node is propagated based on the identification that K shell decomposes.
Processor 310 is by the program instruction for calling memory 320 to store, and processor 310 is for the program according to acquisition
The step of method of key node is propagated in any of the above-described kind of identification based on the decomposition of K shell of instruction execution.
Based on the above embodiment, in the embodiment of the present invention, a kind of computer readable storage medium is provided, is stored thereon with
Computer program, the computer program realize decomposing in above-mentioned any means embodiment based on K shell when being executed by processor
Identification propagate key node method.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the present invention
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the present invention, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The present invention be referring to according to the method for the embodiment of the present invention, the process of equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic
Property concept, then additional changes and modifications may be made to these embodiments.So it includes excellent that the following claims are intended to be interpreted as
It selects embodiment and falls into all change and modification of the scope of the invention.
Obviously, those skilled in the art can carry out various modification and variations without departing from this hair to the embodiment of the present invention
The spirit and scope of bright embodiment.In this way, if these modifications and variations of the embodiment of the present invention belong to the claims in the present invention
And its within the scope of equivalent technologies, then the present invention is also intended to include these modifications and variations.
Claims (10)
1. a kind of method for propagating key node based on the identification that K shell decomposes, which is characterized in that this method comprises:
Communication network is established in message forwarding by acquiring social platform, really according to the individual of forwarding message in the communication network
Determine node set, acquires the corresponding buddy list data of each node in the node set；
Obtain that each node is corresponding directly to connect number of edges amount according to the buddy list data；Wherein, if between individual being good friend
Relationship then exists between corresponding two node and directly connects side；
Degree according to the degree for directly connecting number of edges amount and determining each node in the communication network of each node, according to the node
The K shell index of each node is calculated, the K shell index is used to characterize influence power individual in the communication network；
The shortest distance in the communication network between each pair of node is calculated using Floyd algorithm, is indexed according to the K shell and described
The ranking of each node of minimum distance calculation corresponds to score value, and then obtains the propagation key node in the communication network.
2. the method according to claim 1 for propagating key node based on the identification that K shell decomposes, which is characterized in that described
Directly connect the degree that number of edges amount determines each node in the communication network according to each node, specifically: the communication network
The degree of interior joint is equal to the direct of the node and connects number of edges amount.
3. the method according to claim 2 for propagating key node based on the identification that K shell decomposes, which is characterized in that described
Degree according to the node calculates the K shell index of each node, and specific steps include:
Obtain the degree of each node in the communication network interior joint set S, the node set S={ s1,s2,...,sn, n
For the sum of node；
Traverse node set S, searching degree are 1 all nodes, and delete corresponding node and connect side with the direct of the node, will
The corresponding node is stored to set S1, the set S1In each node K shell indexp∈S1；
Traverse node set S, all nodes that searching degree is 2, and the side deleting corresponding node and being connected with the node, by institute
Corresponding node storage is stated to set S2, the set S2In each node K shell indexq∈S2；
Traverse node set S is repeated, and the degree found adds 1 every time, until the corresponding all sections of degree n maximum in searching set
Point, and the side deleting corresponding node and being connected with the node, by the corresponding node storage to set Sn, the set Sn
In each node K shell indexm∈Sn。
4. the method according to claim 1 for propagating key node based on the identification that K shell decomposes, which is characterized in that described
The shortest distance in the communication network between each pair of node is calculated using Floyd algorithm, comprising:
Obtain the corresponding network adjacent matrix G of the communication network；
Distance matrix D, if there is Lu Keda from node i to node j, Distance matrix D [i] [j] are initialized according to adjacency matrix G
=d, d indicate the length on the road；Otherwise D [i] [j]=infinity, wherein 1≤i < j≤n；
The information that matrix L is used to record be inserted into node is defined, L [i] [j] indicates the section for needing to pass through from node i to node j
Point initializes L [i] [j]=j；Remaining each node is inserted into the path of i to j, the distance of i to j after insertion node is compared
With former distance, indicate are as follows: D [i] [j]=min (D [i] [j], D [i] [k]+D [k] [j]), if the value of D [i] [j] becomes smaller, L
[i] [j]=k；Aforesaid operations are repeated, until D no longer updates, export Distance matrix D.
5. the method according to claim 1 for propagating key node based on the identification that K shell decomposes, which is characterized in that calculate
The ranking of each node corresponds to the formula of score value are as follows:
Wherein, KSIt (t) is the corresponding K shell index of t-th of node, dl,tIndicate the shortest distance between node l and t.
6. a kind of device for propagating key node based on the identification that K shell decomposes characterized by comprising
Acquisition module, the message forwarding by acquiring social platform establish communication network, are disappeared according to forwarding in the communication network
The individual of breath determines node set, acquires the corresponding buddy list data of each node in the node set；
Directly connect side computing module, obtains that each node is corresponding directly to connect number of edges amount according to the buddy list data；Wherein,
If between individual being friend relation, exists between corresponding two node and directly connect side；
K shell indexes computing module, for directly connecting number of edges amount and determine each node in the communication network according to each node
Degree, the degree according to the node calculates the K shell index of each node, and the K shell index is used to characterize in the communication network
The influence power of individual；
Score value computing module, for calculating the shortest distance in the communication network between each pair of node using Floyd algorithm, according to
The K shell index corresponds to score value with the ranking of each node of the minimum distance calculation, and then obtains in the communication network
Propagate key node.
7. the device according to claim 6 for propagating key node based on the identification that K shell decomposes, which is characterized in that the K
Shell indexes in computing module, and the degree of communication network interior joint is equal to the direct of the node and connects number of edges amount.
8. the device according to claim 7 for propagating key node based on the identification that K shell decomposes, which is characterized in that the K
Shell indexes computing module, further includes:
Obtain the degree of each node in the communication network interior joint set S, the node set S={ s1,s2,...,sn, n
For the sum of node；
Traverse node set S, searching degree are 1 all nodes, and delete corresponding node and connect side with the direct of the node, will
The corresponding node is stored to set S1, the set S1In each node K shell indexp∈S1；
Traverse node set S, all nodes that searching degree is 2, and the side deleting corresponding node and being connected with the node, by institute
Corresponding node storage is stated to set S2, the set S2In each node K shell indexq∈S2；
Traverse node set S is repeated, and the degree found adds 1 every time, until the corresponding all sections of degree n maximum in searching set
Point, and the side deleting corresponding node and being connected with the node, by the corresponding node storage to set Sn, the set Sn
In each node K shell indexm∈Sn。
9. the device according to claim 6 for propagating key node based on the identification that K shell decomposes, which is characterized in that described
Minimum distance calculation module, further includes:
Obtain the corresponding network adjacent matrix G of the communication network；
Distance matrix D, if there is Lu Keda from node i to node j, Distance matrix D [i] [j] are initialized according to adjacency matrix G
=d, d indicate the length on the road；Otherwise D [i] [j]=infinity, wherein 1≤i < j≤n；
The information that matrix L is used to record be inserted into node is defined, L [i] [j] indicates the section for needing to pass through from node i to node j
Point initializes L [i] [j]=j；Remaining each node is inserted into the path of i to j, the distance of i to j after insertion node is compared
With former distance, indicate are as follows: D [i] [j]=min (D [i] [j], D [i] [k]+D [k] [j]), if the value of D [i] [j] becomes smaller, L
[i] [j]=k；Aforesaid operations are repeated, until D no longer updates, export Distance matrix D.
10. the device according to claim 6 for propagating key node based on the identification that K shell decomposes, which is characterized in that described
In score value computing module, the ranking for calculating each node corresponds to the formula of score value are as follows:
Wherein, KSIt (t) is the corresponding K shell index of t-th of node, dl,tIndicate the shortest distance between node l and t.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910550676.0A CN110247805B (en) | 2019-06-24 | 2019-06-24 | Method and device for identifying propagation key nodes based on K-shell decomposition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910550676.0A CN110247805B (en) | 2019-06-24 | 2019-06-24 | Method and device for identifying propagation key nodes based on K-shell decomposition |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110247805A true CN110247805A (en) | 2019-09-17 |
| CN110247805B CN110247805B (en) | 2021-11-30 |
Family
ID=67889156
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910550676.0A Active CN110247805B (en) | 2019-06-24 | 2019-06-24 | Method and device for identifying propagation key nodes based on K-shell decomposition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110247805B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110837608A (en) * | 2019-11-07 | 2020-02-25 | 中科天玑数据科技股份有限公司 | Public opinion topic propagation path analysis system and method based on multi-source data |
| CN112231591A (en) * | 2020-11-06 | 2021-01-15 | 烟台大学 | Information recommendation method and system considering social network user group closeness |
| CN113259170A (en) * | 2021-06-01 | 2021-08-13 | 宁波大学 | Method for identifying sub-network and key target thereof in computer network and application thereof |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140188994A1 (en) * | 2012-12-28 | 2014-07-03 | Wal-Mart Stores, Inc. | Social Neighborhood Determination |
| CN104992266A (en) * | 2015-06-15 | 2015-10-21 | 广东电网有限责任公司电力调度控制中心 | Method of determining power grid node importance degree and system thereof |
| CN106681334A (en) * | 2017-03-13 | 2017-05-17 | 东莞市迪文数字技术有限公司 | Automatic-guided-vehicle dispatching control method based on genetic algorithm |
-
2019
- 2019-06-24 CN CN201910550676.0A patent/CN110247805B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140188994A1 (en) * | 2012-12-28 | 2014-07-03 | Wal-Mart Stores, Inc. | Social Neighborhood Determination |
| CN104992266A (en) * | 2015-06-15 | 2015-10-21 | 广东电网有限责任公司电力调度控制中心 | Method of determining power grid node importance degree and system thereof |
| CN106681334A (en) * | 2017-03-13 | 2017-05-17 | 东莞市迪文数字技术有限公司 | Automatic-guided-vehicle dispatching control method based on genetic algorithm |
Non-Patent Citations (3)
| Title |
|---|
| 朱晓霞: "基于改进k-shell 算法的节点影响力的识别", 《计算机工程与应用》 * |
| 李鹏飞: "动态Adhoc网络关键节点识别", 《动态ADHOC网络关键节点识别》 * |
| 顾亦然: "一种基于K－Shell 的复杂网络重要节点发现算法", 《计算机技术与发展》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110837608A (en) * | 2019-11-07 | 2020-02-25 | 中科天玑数据科技股份有限公司 | Public opinion topic propagation path analysis system and method based on multi-source data |
| CN110837608B (en) * | 2019-11-07 | 2024-04-12 | 中科天玑数据科技股份有限公司 | Public opinion topic propagation path analysis system and method based on multi-source data |
| CN112231591A (en) * | 2020-11-06 | 2021-01-15 | 烟台大学 | Information recommendation method and system considering social network user group closeness |
| CN112231591B (en) * | 2020-11-06 | 2024-02-09 | 烟台大学 | Information recommendation method and system considering social network user group compactness |
| CN113259170A (en) * | 2021-06-01 | 2021-08-13 | 宁波大学 | Method for identifying sub-network and key target thereof in computer network and application thereof |
| CN113259170B (en) * | 2021-06-01 | 2021-09-24 | 宁波大学 | Method for identifying sub-network and key target thereof in computer network and application thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110247805B (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110213164B (en) | Method and device for identifying network key propagator based on topology information fusion | |
| CN108985309B (en) | Data processing method and device | |
| CN111222029B (en) | Method for selecting key nodes in network public opinion information dissemination | |
| CN110247805A (en) | A kind of method and device for propagating key node based on the identification that K shell decomposes | |
| CN105653689B (en) | A kind of determination method and apparatus of user's propagation effect power | |
| CN106972952B (en) | Information propagation leader node extraction method based on network degree correlation | |
| Fu et al. | Determining source–destination connectivity in uncertain networks: Modeling and solutions | |
| CN112464107B (en) | Social network overlapping community discovery method and device based on multi-label propagation | |
| CN109120431B (en) | Method and device for selecting propagation source in complex network and terminal equipment | |
| CN116016199B (en) | Information control method, system, electronic equipment and readable storage medium | |
| CN107590189B (en) | Intelligent contract execution method, device, equipment and storage medium | |
| CN107358308B (en) | Method and device for maximizing social network influence | |
| CN108133426B (en) | Social network link recommendation method | |
| CN105843809A (en) | Data processing method and device | |
| CN115081122B (en) | Method, equipment and medium for automatically extracting geometric middle plane of plate-shell structure | |
| CN106899433B (en) | Network link prediction method and device | |
| CN112396151B (en) | Rumor event analysis method, rumor event analysis device, rumor event analysis equipment and computer readable storage medium | |
| CN115048529A (en) | Path processing method and device, storage medium and electronic equipment | |
| CN112333085B (en) | Social method and electronic device | |
| CN115130044A (en) | Influence node identification method and system based on second-order H index | |
| CN114470746A (en) | Server system, data transmission method, device, equipment and storage medium | |
| CN111680376B (en) | Method, device and system for constructing polygon by line elements | |
| CN111245657A (en) | Two network topology type directed link prediction indexes based on neighbor | |
| CN103064872A (en) | Processing search queries in a network of interconnected nodes | |
| CN109993313A (en) | Sample label processing method and processing device, community partitioning method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |