CN103327075A - Distributed mass organization realizing method based on label interaction - Google Patents
Distributed mass organization realizing method based on label interaction Download PDFInfo
- Publication number
- CN103327075A CN103327075A CN2013102004661A CN201310200466A CN103327075A CN 103327075 A CN103327075 A CN 103327075A CN 2013102004661 A CN2013102004661 A CN 2013102004661A CN 201310200466 A CN201310200466 A CN 201310200466A CN 103327075 A CN103327075 A CN 103327075A
- Authority
- CN
- China
- Prior art keywords
- label
- neighbours
- node
- tag number
- tag
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a distributed mass organization realizing method based on label interaction. The distributed mass organization realizing method based on the label interaction comprises the steps that information knowable in an application scenario is set, network initialization is carried out, and label updating is carried out. According to the distributed mass organization realizing method based on the label interaction, the method is a general calculation model, relations of mass organizations is dynamically realized and maintained under the information condition that the overall topology is unknown and only local topology with one-hop logical relation is known to nodes, all nodes involve in calculation, the whole mass organization realizing progress in a dynamic network environment is achieved with the method of label interaction of nodes, label information interaction is carried out between each mode and a corresponding neighbor node, each node updates the label according to a strategy, and the topological structure of the whole network is not considered.
Description
Technical field
The invention belongs to communication technical field, be specifically related to the Combo discovering method in the mobile community network.
Background technology
Corporations are groupings that node forms in the network, and the limit in the group is more, and the limit between group is less.Community structure in the complex network is significant, because community structure usually corresponding to a certain functional unit in the network, for example, has the corporations of the website composition of same subject in the World Wide Web (WWW); The corporations that have the cell unit composition of identical function in the bio-networks.The process of finding corporations in the complex network can be regarded as carries out process than coarse to complex network, finds that community structure also can disclose certain concrete node role in complex network.
Along with going deep into of research, it is found that many real networks all have community structure, namely whole network is comprised of several corporations, and the connection that the connection between the corporations is relatively sparse, corporations are inner is relatively dense.Community discovery then is to utilize the information of containing in the graph topological structure to parse its modular community structure from complex network, the further investigation of this problem helps to study in a kind of mode of dividing and rule module, function and the evolution thereof of whole network, understand more accurately organizational principle, topological structure and the dynamics of complication system, tool is of great significance.
Combo discovering method in the current research, great majority are centralized community discovery algorithms, and namely a server that has the whole network logical topology by various algorithms and strategy, is found the community structure in the whole network.Current common distributed computing method is divided into two kinds.
A kind of is by different servers identical network data to be calculated respectively, each server adopts different algorithm parameters, then the result is carried out statistical disposition, draw optimum community discovery result, this mode will need repeatedly to calculate originally, and the algorithm that the result is compared divides streamline to process.
Another kind of then be to utilize existing distributed computing platform to realize the parallel processing of community discovery algorithm.CLPA (Clique Label Propagation Algorithm) algorithm has just adopted such mode to realize parallel computation, a kind of programming model MapReduce that the method adopts *** company to propose, this model is mainly used in the processing of mass data, CLPA proposes to utilize this model to carry out the data input, thereby can realize parallel computation, with originally finishing to server farm a dispensed that server carries out, then obtain the algorithm final result.
The essence of this dual mode all is by calculation content being utilized existing model carry out Distributed Calculation, prerequisite and content that algorithm calculates do not change, all need a concentrated server to provide whole topology of networks information for the calculation procedure that distributes, in network static state, that full mesh topology is known, carry out community discovery, i.e. server that has the whole network logical topology, by various algorithms and strategy, find the community structure in the whole network.
Summary of the invention
The objective of the invention is to have proposed a kind of based on the mutual distributed Combo discovering method of label in order to solve the problems referred to above of prior art existence.
Technical scheme of the present invention is: a kind of based on the mutual distributed Combo discovering method of label, specifically comprise the steps:
Step 1. arranges in the application scenarios information as can be known, specifically comprises: the initialization tag number of each node, and described tag number has uniqueness; The logic neighbours of each node;
Step 2. netinit process: all node is according to the tag number of local unique information initialization self in the network; The weight of this tag number is set to 1, and the propagation factor of tag number is initialized as 1; Local iterations is set is designated as 1, to the tag number of all neighbor node broadcasting oneself; The local neighbours' tag number tabulation of preserving of initialization, each the neighbours' label that arranges in neighbours' tag number tabulation of preservation is update mode not;
Step 3. tag update process: node receives the tag number broadcasting from neighbours, iterations in neighbours' tag number tabulation that contrast receives and the iterations of local respective neighbours list of labels of preserving, if the neighbor list iterations that the iterations in the neighbours' list of labels that receives is preserved greater than this locality, new neighbor list of labels more then, the corresponding lists state is set for upgrading, if be less than or equal to the local neighbor list iterations of preserving, then ignore this broadcasting packet; When the updating mark of all neighbours' tag numbers of nodes records when upgrading, upgrade local label number tabulation, update strategy is: with neighbours' tag number tabulation addition, the propagation factor of label is got propagation factor maximum in neighbours' same label and is deducted predefined propagation coefficient p, if the label propagation factor less than 0, is then deleted label; The label weight addition of same label number, all label weights of normalization, the deletion weight is less than the tag number of preliminary setting parameter 1/v, if all less than 1/v then keep the tag number of weight maximum, if a plurality of such tag numbers are arranged, then select at random the label of a weight limit, delete all the other labels, the tag number that keeps of normalization then, iterations adds 1, broadcast number tabulation of new local label to neighbours, all neighbours' of record list of labels updating mark is set to not upgrade; If after once upgrading, the tag number tabulation of node does not change, and shows that then the community structure that belongs under the node current state is stable.
Further, said method also comprises the Dynamic Maintenance process, when occurring triggering the Dynamic Maintenance process when logic neighborhood between new node or two nodes changes, this moment, node was to the own list of labels of all neighbor nodes issues, initiation tag update process.
Further, the described local unique information of step 2 is specially mac address or user name or node ID.
Beneficial effect of the present invention: the present invention propose based on the mutual distributed Combo discovering method of label, it is a kind of general computation model, unknown at Global Topological, node only knows that one jumps under the information of local topology of logical relation, Dynamic Discovery, safeguards corporations' relation; All nodes all participate in calculating, by the mutual mode of label between node, finish the community discovery process in the dynamic network environment, each node passes through respectively and neighbor node interactive tag information, according to the tag number of policy update oneself, and be indifferent to whole topology of networks.Each node participates in the computational process of community discovery algorithm in the inventive method, does not therefore rely on a centralized server of knowing full mesh topology, and node does not need to know full mesh topology, and time complexity no longer becomes the bottleneck of community discovery algorithm; In this external tag update process, can adopt different update strategies, thereby reach better community discovery result, therefore method of the present invention can be used as a frame module, all are slightly changed based on the community discovery algorithm of label, be applied in the different models, thereby be applicable to distributed community discovery algorithm.
Description of drawings
Fig. 1 is the main flow chart of the specific embodiment of the invention.
Fig. 2 is the particular flow sheet of specific embodiment of the invention step 2.
Fig. 3 is the particular flow sheet of specific embodiment of the invention step 3.
Fig. 4 is the particular flow sheet of specific embodiment of the invention step 4.
Embodiment
The invention will be further described below in conjunction with the drawings and specific embodiments.As shown in Figure 1, based on the mutual distributed Combo discovering method of label, specifically comprise step:
Step 1. arranges in the application scenarios information as can be known:
Distributed community discovery algorithm needs certain scene ability and network environment.Before the method initialization, at first so that in the application scenarios as can be known information comprise:
Make each node know the initialization tag number of oneself, and this tag number have uniqueness; Make each node know which the logic neighbours of oneself have.
Here, each node passes through and the neighbor node real time interaction information, perceives the appearing and subsiding of its neighbor node.
Step 2. netinit process:
All node is according to the tag number of local unique information initialization self in the network; Local unique information can adopt such as in the signs such as mac address, user name, node ID any.The weight of this tag number is set to 1, and the propagation factor that this tag number is set is 1; Local iterations is set is designated as 1, to the tag number of all neighbor node broadcasting oneself.This step detailed process is as shown in Figure 2:
The tag number of all node initializing of step 21. self: all node is according to the tag number of local unique information initialization self in the network, and local unique information can adopt such as signs such as mac address, user name, node ID.
The weight of this tag number of step 22. is set to 1, and propagation factor is initialized as 1.
Step 23. arranges local iterations and is designated as 1.
Step 24. is to the tag number of all neighbor node broadcasting oneself.
The local neighbours' tag number tabulation of preserving of step 25. initialization, each the neighbours' tag number that arranges in neighbours' tag number tabulation of preservation is update mode not.
Step 3. tag update process:
Node receives the tag number broadcasting from neighbours, the iterations of the iterations in neighbours' list of labels that contrast receives and local respective neighbours list of labels of preserving, if tag number is greater than the neighbor list iterations of this preservation, new neighbor list of labels more then, the corresponding lists state is set for upgrading, if be less than or equal to the local neighbor list iterations of preserving, then ignore this broadcasting packet; When the updating mark of all neighbours' tag numbers of nodes records when upgrading, upgrade local label number tabulation, update strategy is: with neighbours' list of labels addition, the propagation factor of label is got propagation factor maximum in neighbours' same label and is deducted fixing propagation coefficient p, if the label propagation factor less than 0, is then deleted label.The weight addition of identical label label, all tag number weights of normalization, the deletion weight is less than the tag number of predefined parameter 1/v, if all less than 1/v then keep the tag number of weight maximum, if a plurality of such tag numbers are arranged, then select at random the label of a weight limit, delete all the other labels, the weighted value of the tag number that keeps of normalization then, iterations adds 1, broadcast new tag number tabulation to neighbours, all neighbours' of record list of labels updating mark is set to not upgrade.V is predefined parameter, corporations' number (state machine) that representation node belongs at most.
In the tag update process, tag number in the list of labels that each node keeps is just representing the community structure id that present node belongs to, if after once upgrading, the tag number tabulation of node does not change, and proves that then the community structure that belongs under the node current state is stable.No longer change, until its corporations relation changes or change because of corporations' relation of neighbours corporations' ownership that occurs that changes.
Need to prove, tag number information of carrying comprises here: said tag, the weight of tag number, the information such as propagation factor; Each node has number tabulation of a local label, formed (during initialization by a plurality of tag numbers, the corresponding tag number of each node, be in the tag update process in follow-up process, node can be preserved a plurality of tag numbers), the own tag number that has of representative, the information of local label number tabulation comprises: local iterations, and a plurality of tag number; During the tabulation of the tag number of node broadcasts oneself, broadcasting be local label number tabulation, comprise local iterations and a plurality of tag number; Each node is also safeguarded an own neighbours' tag number tabulation, this tabulation has comprised many tables, the corresponding tag number tabulation of each neighbour, each neighbour's tag number tabulation inclusion information: neighbours' iterations, the tag number that neighbours have, and these neighbours' tag number update mode.
Concrete steps are as shown in Figure 3:
Step 31. node receives and record is broadcasted from neighbours' tag number: the iterations of the iterations in neighbours' list of labels that contrast receives and local respective neighbours list of labels of preserving, if tag number is greater than the neighbor list iterations of this preservation, new neighbor list of labels more then, the corresponding lists state is set for upgrading, if be less than or equal to the local neighbor list iterations of preserving, then ignore this broadcasting packet; When the updating mark of all neighbours' tag numbers of nodes records when upgrading, upgrade local label number tabulation.
Step 32. is selected to upgrade tag number: with neighbours' list of labels addition, the weight addition of same numeral, all label weights of normalization, the deletion weight is less than the tag number of predefined parameter 1/v, if all less than 1/v then keep the tag number of weight maximum, if a plurality of such tag numbers are arranged, then select at random the label of a weight limit, delete all the other labels, then the tag number of normalization reservation.The maximum that the propagation factor of tag number is set to the propagation factor of same label in neighbours' list of labels number deducts the result of propagation coefficient p, and the deletion propagation factor is less than 0 tag number.Wherein, v is predefined parameter, corporations' number that representation node belongs at most; P is preliminary setting parameter, represents the speed of propagation factor decay, is the real number between interval [0,1].
Step 33. iterations adds up and broadcasts new tag number tabulation to neighbours: iterations adds 1, broadcasts new tag number tabulation to neighbours, and all neighbours' of record list of labels updating mark is set to not upgrade.
Step 34. checks whether the tag number tabulation of node changes: in the tag update process, tag number in the list of labels that each node keeps, just representing the community structure id that present node belongs to, if after once upgrading, the tag number tabulation of node does not change, and proves that then the community structure that belongs under the node current state is stable.No longer change, until its corporations relation changes or change because of corporations' relation of neighbours corporations' ownership that occurs that changes.
By the renewal iteration of certain number of times, the corporations of all nodes of the whole network ownership has reached local stability.
Here, as a kind of preferred version, also comprise step 4. Dynamic Maintenance process.
The Dynamic Maintenance of community structure mainly occurs in both cases, the one, after new node occurring, two is that variation has occured two logic neighborhoods between the node, does not namely originally have two nodes of neighborhood to become dynamically neighborhood or originally is that two nodes of neighbours are not linking to each other.Dual mode all is to have found new neighborhood concerning existing node; When logical relation changed, relevant node can be found to have occurred new neighbours or have neighbours to disappear, and this moment, node was issued own current list of labels to all neighbours, initiated the tag update process.
Concrete steps are as shown in Figure 4:
Each node of step 41. checks whether the logic neighborhood changes;
New node appears in step 42.: when logical relation changed, relevant node can be found to have occurred new neighbours or have neighbours to disappear, and this moment, node was issued own current list of labels to all neighbours, initiated the tag update process, i.e. step 3.
Variation has occured in the logic neighborhood between two nodes of step 43.: namely originally do not have two nodes of neighborhood to become dynamically neighborhood or originally be that two nodes of neighbours are no longer continuous; When logical relation changed, relevant node can be found to have occurred new neighbours or have neighbours to disappear, and this moment, node was issued own current list of labels to all neighbours, initiated the tag update process, i.e. step 3.
The contribution of the inventive method is mainly reflected in following several aspect:
Neighbor information and label are mutual: each node only will be responsible for calculating the tag number of oneself, the topology information of whole network does not need by known to each node, each node only need to know which neighbor node is, and available its tag number tabulation gets final product, therefore node should have the mutual ability of label, the label of oneself can be distributed to the neighbours of oneself, thereby so that each node is known the tag number that own all neighbours have.Neighbours in the distributed Combo discovering method, corresponding to the node that links to each other in traditional community discovery algorithm, the represents physical link does not link to each other, and two nodes that refer to have certain social relationships, and can intercom mutually.Therefore do not do special indicating, neighbours described here refer to all is in logic neighbours.
Tag update is synchronous: in the community discovery algorithm of centralized based on label, being divided into the synchronous and asynchronous dual mode calculates, but no matter any mode, the node of current calculating can be seen own all neighbours' tag number information simultaneously, because the centralized server has the topology information of whole network.And in distributed community discovery process, because node is broadcasted the tag number of oneself to all neighbours, node just can be received each neighbour's tag number.But because in the distributed system, node can not receive the label broadcasting that neighbours issue by synchronization, can not judge current label broadcasting of receiving is when neighbours issue.Consider that node is when renewal self label, the label information that only need to collect neighbor node current iteration number of times gets final product, therefore when node interactive tag information, increase this parameter of iterations, so that whether node is told neighbours' label information of receiving available, node thinks that the up-to-date tag number of iterations is effective label, and behind the label of each node updates oneself, the iterations that carries in the label information of broadcasting adds 1.
Dynamic Maintenance: owing to not having the topology information of whole network in the distributed system, therefore working as network topology changes, add if any new node, when perhaps having new logical relation to occur, the node of the new node that adds or increase new logic relation is initiatively to the new tag number information of all neighbor node issues, whether near the node the change in topology upgrades the tag number information of oneself according to strategy decision, thereby safeguards dynamically corporations' information.The coverage of corporations' change mainly has in the corporations of overlapping nodes in corporations inside and with corporations, therefore can not be diffused into whole network range.
Label is propagated control: if adopt the mode of the unconfined propagation of all labels, after mutual through label repeatedly, can mark off a plurality of large-scale corporations, repeat corporations, thereby reduce the effect of community discovery, here the scope of coming abstract factory number to propagate by the mode that increases propagation factor has effectively been improved through corporations after the iteration repeatedly and has been divided the as a result problem of hydraulic performance decline.
The workflow of whole method model as mentioned above, in the tag update process, can adopt different update strategies, thereby reach better community discovery effect, therefore method of the present invention can be used as a frame module, all are slightly changed based on the community discovery algorithm of label, be applied in the different models, thereby be applicable to distributed community discovery algorithm.
Those of ordinary skill in the art will appreciate that, embodiment described here is in order to help reader understanding's principle of the present invention, should to be understood to that protection scope of the present invention is not limited to such special statement and embodiment.Those of ordinary skill in the art can make various other various concrete distortion and combinations that do not break away from essence of the present invention according to these technology enlightenments disclosed by the invention, and these distortion and combination are still in protection scope of the present invention.
Claims (3)
1. one kind based on the mutual distributed Combo discovering method of label, specifically comprises the steps:
Step 1. arranges in the application scenarios information as can be known, specifically comprises: the initialization tag number of each node, and described tag number has uniqueness; The logic neighbours of each node;
Step 2. netinit process: all node is according to the tag number of local unique information initialization self in the network; The weight of this tag number is set to 1, and the propagation factor of tag number is initialized as 1; Local iterations is set is designated as 1, to the tag number of all neighbor node broadcasting oneself; The local neighbours' tag number tabulation of preserving of initialization, each the neighbours' label that arranges in neighbours' tag number tabulation of preservation is update mode not;
Step 3. tag update process: node receives the tag number broadcasting from neighbours, iterations in neighbours' tag number tabulation that contrast receives and the iterations of local respective neighbours list of labels of preserving, if the neighbor list iterations that the iterations in the neighbours' list of labels that receives is preserved greater than this locality, new neighbor list of labels more then, the corresponding lists state is set for upgrading, if be less than or equal to the local neighbor list iterations of preserving, then ignore this broadcasting packet; When the updating mark of all neighbours' tag numbers of nodes records when upgrading, upgrade local label number tabulation, update strategy is: with neighbours' tag number tabulation addition, the propagation factor of label is got propagation factor maximum in neighbours' same label and is deducted predefined propagation coefficient p, if the label propagation factor less than 0, is then deleted label; The label weight addition of same label number, all label weights of normalization, the deletion weight is less than the tag number of preliminary setting parameter 1/v, if all less than 1/v then keep the tag number of weight maximum, if a plurality of such tag numbers are arranged, then select at random the label of a weight limit, delete all the other labels, the tag number that keeps of normalization then, iterations adds 1, broadcast number tabulation of new local label to neighbours, all neighbours' of record list of labels updating mark is set to not upgrade; If after once upgrading, the tag number tabulation of node does not change, and shows that then the community structure that belongs under the node current state is stable.
2. according to claim 1 a kind of based on the mutual distributed Combo discovering method of label, it is characterized in that, also comprise the Dynamic Maintenance process, when occurring triggering the Dynamic Maintenance process when logic neighborhood between new node or two nodes changes, this moment, node was issued the list of labels of oneself to all neighbor nodes, initiated the tag update process.
3. according to claim 1 and 2 a kind ofly it is characterized in that based on the mutual distributed Combo discovering method of label, the described local unique information of step 2 is specially mac address or user name or node ID.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310200466.1A CN103327075B (en) | 2013-05-27 | 2013-05-27 | Based on the distributed Combo discovering method that label is mutual |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310200466.1A CN103327075B (en) | 2013-05-27 | 2013-05-27 | Based on the distributed Combo discovering method that label is mutual |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103327075A true CN103327075A (en) | 2013-09-25 |
| CN103327075B CN103327075B (en) | 2015-11-18 |
Family
ID=49195597
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310200466.1A Expired - Fee Related CN103327075B (en) | 2013-05-27 | 2013-05-27 | Based on the distributed Combo discovering method that label is mutual |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103327075B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103793460A (en) * | 2013-11-22 | 2014-05-14 | 清华大学 | Method and system for sensing specific community on line on basis of social network |
| CN105677648A (en) * | 2014-11-18 | 2016-06-15 | 四三九九网络股份有限公司 | Community detection method and system based on label propagation algorithm |
| CN106874931A (en) * | 2016-12-30 | 2017-06-20 | 东软集团股份有限公司 | User portrait grouping method and device |
| CN107203946A (en) * | 2016-03-15 | 2017-09-26 | 阿里巴巴集团控股有限公司 | The localization method of group of corporations, the localization method of risk group and device |
| CN107395440A (en) * | 2017-08-28 | 2017-11-24 | 电子科技大学 | Internet topology probe node optimization dispositions method based on complex network |
| CN108763359A (en) * | 2018-05-16 | 2018-11-06 | 武汉斗鱼网络科技有限公司 | A kind of usage mining method, apparatus and electronic equipment with incidence relation |
| CN109949046A (en) * | 2018-11-02 | 2019-06-28 | 阿里巴巴集团控股有限公司 | The recognition methods of risk clique and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070118539A1 (en) * | 2005-11-18 | 2007-05-24 | International Business Machines Corporation | Focused community discovery |
| CN102880644A (en) * | 2012-08-24 | 2013-01-16 | 电子科技大学 | Community discovering method |
-
2013
- 2013-05-27 CN CN201310200466.1A patent/CN103327075B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070118539A1 (en) * | 2005-11-18 | 2007-05-24 | International Business Machines Corporation | Focused community discovery |
| CN102880644A (en) * | 2012-08-24 | 2013-01-16 | 电子科技大学 | Community discovering method |
Non-Patent Citations (5)
| Title |
|---|
| HOU QIANG 等: "《A Method of Personalized Recommendation Based on Multi-Label Propagation for Overlapping Community Detection》", 《2012 3RD INTERNATIONAL CONFERENCE ON SYSTEM SCIENCE,ENGINEERING DESIGN AND MANUFACTURING INFORMATIZATION》, vol. 1, 21 October 2012 (2012-10-21), pages 360 - 364, XP032467955, DOI: doi:10.1109/ICSSEM.2012.6340748 * |
| JIE RUI XIE 等: "《Community Detection Using A Neighborhood Strength Driven Label Propagation Algorithm》", 《NETWORK SCIENCE WORKSHOP 2011,IEEE》, 24 June 2011 (2011-06-24), pages 188 - 195 * |
| YUXIN ZHAO 等: "《Community Detection Using Label Propagation in Entropic Order》", 《2012 IEEE 12TH INTERNATIONALCONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY》, 29 October 2012 (2012-10-29), pages 18 - 24 * |
| 段倩: "《动态网络社团挖掘算法研究》", 《中国优秀硕士学位论文全文数据库(电子期刊)基础科学辑》, 31 October 2012 (2012-10-31), pages 002 - 73 * |
| 王立敏 等: "《基于相对密度的社团结构探测算法》", 《计算机工程》, vol. 35, no. 1, 31 January 2009 (2009-01-31), pages 117 - 119 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103793460A (en) * | 2013-11-22 | 2014-05-14 | 清华大学 | Method and system for sensing specific community on line on basis of social network |
| CN105677648A (en) * | 2014-11-18 | 2016-06-15 | 四三九九网络股份有限公司 | Community detection method and system based on label propagation algorithm |
| CN105677648B (en) * | 2014-11-18 | 2018-08-28 | 四三九九网络股份有限公司 | A kind of Combo discovering method and system based on label propagation algorithm |
| CN107203946A (en) * | 2016-03-15 | 2017-09-26 | 阿里巴巴集团控股有限公司 | The localization method of group of corporations, the localization method of risk group and device |
| CN107203946B (en) * | 2016-03-15 | 2020-08-07 | 阿里巴巴集团控股有限公司 | Positioning method of community group, positioning method of risk group and positioning device of risk group |
| CN106874931A (en) * | 2016-12-30 | 2017-06-20 | 东软集团股份有限公司 | User portrait grouping method and device |
| CN106874931B (en) * | 2016-12-30 | 2021-01-22 | 东软集团股份有限公司 | User portrait clustering method and device |
| CN107395440A (en) * | 2017-08-28 | 2017-11-24 | 电子科技大学 | Internet topology probe node optimization dispositions method based on complex network |
| CN108763359A (en) * | 2018-05-16 | 2018-11-06 | 武汉斗鱼网络科技有限公司 | A kind of usage mining method, apparatus and electronic equipment with incidence relation |
| CN109949046A (en) * | 2018-11-02 | 2019-06-28 | 阿里巴巴集团控股有限公司 | The recognition methods of risk clique and device |
| CN109949046B (en) * | 2018-11-02 | 2023-06-09 | 创新先进技术有限公司 | Identification method and device for risk group partner |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103327075B (en) | 2015-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103327075B (en) | Based on the distributed Combo discovering method that label is mutual | |
| CN109598563A (en) | Brush single detection method, device, storage medium and electronic equipment | |
| CN107783815A (en) | A kind of method and apparatus for determining virtual machine (vm) migration | |
| JP2017108438A (en) | Method and device for anchor master selection | |
| CN106888245A (en) | A kind of data processing method, apparatus and system | |
| CN107104824A (en) | A kind of network topology determines method and apparatus | |
| CN104734962B (en) | A kind of resource search method of non-structural P 2 P network | |
| CN110276602B (en) | Block chain hierarchical consensus method and system for Internet of things and electronic equipment | |
| CN104618980B (en) | The route implementation method of wireless multi-hop chain network | |
| CN105515997B (en) | The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM | |
| CN103796273A (en) | Energy-balanced clustering routing strategy for wireless sensor networks | |
| CN105335438A (en) | Local shortest loop based social network group division method | |
| CN106506368A (en) | A kind of data communication implementation method based on internet | |
| CN102075974A (en) | Method for searching high contiguity resources in wireless sensor network | |
| CN103179045A (en) | Resource node selection method supportive of P2P (peer to peer) traffic optimization | |
| CN108512765B (en) | Network content diffusion method based on network node distributed Pagerank | |
| CN103347101B (en) | Based on bunch 6LoWPAN wireless transducer network address configuration method | |
| CN104794158A (en) | Domain name data repeated detection and fast index method in boundscript window | |
| Zhu et al. | Energy-efficient graph reinforced vNFC deployment in elastic optical inter-DC networks | |
| US10505820B2 (en) | User interface with an expandable navigation tree | |
| Zhang et al. | A survivability clustering algorithm for ad hoc network based on a small-world model | |
| CN102076053A (en) | Method for quickly repairing Zigbee wireless sensor network | |
| CN103546522B (en) | Determine the method and distributed memory system of storage server | |
| Macarthur et al. | Efficient, superstabilizing decentralised optimisation for dynamic task allocation environments | |
| CN104838624A (en) | Method, apparatus and system for controlling forwarding of service data in virtual network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20151118 Termination date: 20190527 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |