CN107135137A - Network group recognition methods and device - Google Patents
Network group recognition methods and device Download PDFInfo
- Publication number
- CN107135137A CN107135137A CN201610108595.1A CN201610108595A CN107135137A CN 107135137 A CN107135137 A CN 107135137A CN 201610108595 A CN201610108595 A CN 201610108595A CN 107135137 A CN107135137 A CN 107135137A
- Authority
- CN
- China
- Prior art keywords
- node
- passive
- passive node
- group
- active
- 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 45
- 238000012216 screening Methods 0.000 claims description 14
- 108010001267 Protein Subunits Proteins 0.000 claims description 6
- 238000001914 filtration Methods 0.000 claims description 4
- 238000003860 storage Methods 0.000 description 15
- 230000006870 function Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 8
- 230000006872 improvement Effects 0.000 description 7
- 238000012545 processing Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 229920001296 polysiloxane Polymers 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000010979 ruby Substances 0.000 description 1
- 229910001750 ruby Inorganic materials 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
- H04L67/141—Setup of application sessions
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the present application discloses a kind of network group recognition methods and device.The network group recognition methods includes：Receive the set of relationship comprising active node and passive node relation；Calculate the quantity between passive node in the set of relationship with common active node；Filter out the passive node pair that the quantity with common active node is more than predetermined threshold value；The passive node pair and related active node are divided into a suspicious group；Judge whether the density of the suspicious group is more than pre-set density；If so, the suspicious group then is defined as into network group.Utilize the embodiment of the present application, it is possible to achieve automatically recognize the network group in network to improve the efficiency of network group identification.
Description
Technical field
The application is related to Internet technical field, more particularly to a kind of network group recognition methods and device.
Background technology
Various relations are often there are between different nodes in network, usual above-mentioned node can be divided into
Initiator is considered as active node in the node of active node and passive node, i.e., two, and responder is considered as passive section
Point.For example in shopping at network scene, buyer is active node, and seller is passive node.
Relation between part active node and passive node is there are in network and interacts excessively intensive phenomenon, this
The node that planting phenomenon can be referred to as in high density sub-network, the high density sub-network can also be considered as one
Network group.Generally, these network groups, which can contain, special implication, such as joins between buyer and seller
Close the single situation of brush mutually.
Now in the art, recognize that above-mentioned network group is generally relevant reversely to search by known passive node
The active node of system, other passive nodes are reversely being searched by the active node, so repeatedly reverse
Search.Participate in searching with artificial however, this method reversely searched is relied on, it is artificial to search what is often consumed
Time is longer.
In summary, the problem of identification network group is less efficient is there are in the prior art.
The content of the invention
The purpose of the embodiment of the present application is to provide a kind of network group recognition methods and device, existing to solve
The problem of identification network group is less efficient is there are in technology.
In order to solve the above technical problems, network group recognition methods and device that the embodiment of the present application is provided are these
What sample was realized：
A kind of network group recognition methods, including：
Receive the set of relationship comprising active node and passive node relation pair；
Calculate the quantity between passive node in the set of relationship with common active node；
Filter out the passive node pair that the quantity with common active node is more than predetermined threshold value；
Suspicious group will be divided into related active node and passive node relation pair with the passive node
Group；
Judge whether the density of the suspicious group is more than pre-set density；
If so, the suspicious group then is defined as into network group.
A kind of network group identifying device, including：
Receiving unit, for receiving the set of relationship comprising active node and passive node relation pair；
Computing unit, the number between passive node in the set of relationship for calculating with common active node
Amount；
Screening unit, is more than the passive of predetermined threshold value for filtering out the quantity with common active node
Node pair；
Division unit, for will be with the passive node to related active node and passive node relation pair
It is divided into suspicious group；
Judging unit, for judging whether the density of the suspicious group is more than pre-set density；
Determining unit, it is for when the density of the suspicious group is more than pre-set density, the suspicious group is true
It is set to network group.
The technical scheme provided from above the embodiment of the present application, has altogether by calculating between passive node
With the quantity of active node, so as to filter out the higher active node of interactivity and passive node relation pair carrys out structure
Determine whether into suspicious group, and by calculating the density of the suspicious group for network group.In this way,
Without manually participating in, you can realize the network group in automatically identification network to improve network group
Recognition efficiency.
Brief description of the drawings
, below will be to implementing in order to illustrate more clearly of the embodiment of the present application or technical scheme of the prior art
The accompanying drawing used required in example or description of the prior art is briefly described, it should be apparent that, describe below
In accompanying drawing be only some embodiments described in the application, for those of ordinary skill in the art,
Without having to pay creative labor, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is the flow chart of the network group recognition methods provided in the embodiment of the application one；
Fig. 2 is the specific method flow diagrams of S150 in the application Fig. 1；
The graph of a relation for the network group that Fig. 3 provides for the application；
The graph of a relation for another network group that Fig. 4 provides for the application；
Fig. 5 is the flow chart of the method after S130 in the application Fig. 1；
Fig. 6 is the module diagram of the network group identifying device provided in the embodiment of the application one.
Embodiment
In order that those skilled in the art more fully understand the technical scheme in the application, below in conjunction with this
Apply for the accompanying drawing in embodiment, the technical scheme in the embodiment of the present application be clearly and completely described,
Obviously, described embodiment is only some embodiments of the present application, rather than whole embodiments.Base
Embodiment in the application, those of ordinary skill in the art are obtained under the premise of creative work is not paid
The every other embodiment obtained, should all belong to the scope of the application protection.
Fig. 1 is the flow chart of the network group recognition methods provided in the embodiment of the application one.In the present embodiment,
The network group recognition methods comprises the following steps：
S110：Receive the set of relationship comprising active node and passive node relation pair.
Various relations are often there are in network as described above between different nodes, and when two sections
When point is related, one group of active node and passive node relation pair can be formed；It is some to active node and by
Dynamic node relationships are to being properly termed as the set of relationship of active node and passive node relation pair.
It is illustrated by taking the relation of buyer in transaction platform and seller as an example, transaction platform can obtain each and buy
The Transaction Information that occurs and by the buyer being collected into (active node) and corresponding seller (quilt between family and seller
Dynamic node) set of relationship of relation pair provides the network group provided to the application and recognizes server.For example,
One set of relationship (X1, Y1), (X1, Y2), (X2, Y1), (X2, Y2), (X2, Y3), (X2,
Y4), (X3, Y2), (X3, Y3), (X3, Y4), (X4, Y4), (X4, Y5) }；Wherein X tables
Show seller's (passive node), Y represents buyer's (active node), correspondingly (X, Y) then represents passive
Nodes X and active node Y relation pairs.
S120：Calculate the quantity between passive node in the set of relationship with common active node.
It is common if there is having in the set of relationship between any two passive node in the present embodiment
Active node, then the active node is the common active that can be identified as having between described two passive nodes
Node.
Whole combination of two between passive node can be calculated in the set of relationship by this step S120
There is the quantity of common active node afterwards.
The set of relationship illustrated in S110 steps is continued to use, passive node includes X1, X2, X3, X4；
X1 and X2 are there are after combination of two；X1 and X3；X1 and X4；X2 and X3；X2 and X4；X3
And X4.
Between passive node X1, X2, the common active node having is Y1, Y2, then institute after calculating
It is 2 to state the quantity with common active node between passive node X1, X2；
Between passive node X1, X3, the common active node having is Y2, the then quilt after calculating
The quantity between dynamic nodes X 1, X3 with common active node is 1；
Between passive node X1, X4, without common active node, then the passive node after calculating
The quantity with common active node is 0 between X1, X4；
Between passive node X2, X3, the common active node having is Y2, Y3, Y4, then calculates
The quantity between the passive node X2 afterwards, X3 with common active node is 3；
Between passive node X2, X4, the common active node having is Y4, the then quilt after calculating
The quantity between dynamic nodes X 2, X4 with common active node is 1；
Between passive node X3, X4, the common active node having is Y4, the then quilt after calculating
The quantity between dynamic nodes X 3, X4 with common active node is 1.
S130：The screening quantity with common active node is more than the passive node pair of predetermined threshold value.
Predetermined threshold value described in this step can taking human as setting an empirical value.
S130 steps described in the present embodiment, can also specifically include step as follows：
A1：Judge whether the quantity with common active node is more than predetermined threshold value one by one.
A2：If, it is determined that corresponding two passive nodes of the quantity are passive node pair；Return and perform
A1, until having judged the quantity of all common active nodes.
A3：A1 is performed if it is not, then returning, until having judged the quantity of all common active nodes.
Continue to use the example in S120 steps, it is assumed that the predetermined threshold value is 1.Judge passive node X1, X2
Between there is common active node quantity 2 whether be more than 1, be more than 1 due to 2, so by passive node
X1, X2 are defined as passive node pair；Next, it is determined that having common active between passive node X1, X3
Whether the quantity 1 of node is more than 1, due to 1 no more than 1；So next, it is determined that passive node X1, X4
Between have common active node quantity 0 whether be more than 1, due to 0 be not more than 1；So then, quilt
Whether the quantity 3 between dynamic nodes X 2, X3 with common active node is more than 1, because 3 more than 1,
So passive node is defined as into passive node pair to X2, X3；Next, it is determined that passive node X2, X4
Between have common active node quantity 1 whether be more than 1, due to 1 be not more than 1；So then, sentencing
Whether the quantity 1 between disconnected passive node X3, X4 with common active node is more than 1, due to 1 little
In 1；Due to having judged the quantity of all common active nodes, terminate to carry out subsequent step after judging.
S140：Related active node and passive node relation pair will be divided into the passive node can
Doubt group.
Specifically, the S140 steps include：
The active node containing any passive node of passive node centering is searched from the set of relationship
With passive node relation pair, and the active node and passive node relation pair are divided into suspicious group.
Continue to use the example in S130 steps, it is determined that passive node to for X1, X2 and passive node to X2,
X3.From set of relationship (X1, Y1), (X1, Y2), (X2, Y1), (X2, Y2), (X2, Y3),
(X2, Y4), (X3, Y2), (X3, Y3), (X3, Y4), (X4, Y4), (X4, Y5) } in look into
Look for the active node and passive node relation pair that include passive node X1, X2, X3 as follows：
(X1, Y1), (X1, Y2), (X2, Y1), (X2, Y2), (X2, Y3), (X2, Y4),
(X3, Y2), (X3, Y3), (X3, Y4)；And divide the active node and passive node relation pair
For suspicious group.
S150：Judge whether the density of the suspicious group is more than pre-set density.
Density is used as one and weighs in suspicious group that relation is close between active node and passive node
The degree of collection.General, the value of the density is bigger, illustrates active node and passive node in the suspicious group
Between relation it is more intensive；Conversely, the value of the density is smaller, illustrate in the suspicious group active node and passive
Relation is got over not intensive between node.
In the present embodiment, the formula for calculating density is as follows：
Density=(active node and passive node relation pair quantity)/(passive node quantity * active node numbers
Amount)
As shown in Fig. 2 S150 steps described in the present embodiment, specifically may include steps of：
S151：Active node quantity, the quantity of passive node and the group in the suspicious group are obtained respectively
Active node and passive node relation pair quantity in group.
S152：By the active node and passive node relation pair quantity divided by the active node quantity and quilt
The product of dynamic number of nodes, so as to obtain density.
S153：Judge whether the density is more than pre-set density, if so, then performing S160 steps.
In the present embodiment, the pre-set density can be the empirical value artificially set.
Continue to continue to use the example in S140 steps, it is 4 that active node quantity in the suspicious group is obtained respectively
It is individual；Passive node quantity is 3；And the active node and passive node relation pair quantity are 9；
Then calculate and obtain density=9/ (3*4)=0.75；
Judge whether density 0.75 is more than pre-set density；If the predetermined density is less than 0.75, described close
Degree 0.75 is more than pre-set density, then performs S160 steps；If the pre-set density is not more than 0.75,
The density 0.67 is not more than pre-set density, then terminator is run.
S160：The suspicious group is defined as network group.
Because the density of the suspicious group is more than pre-set density, it may be said that actively saved in the bright suspicious group
Relation is more intensive between point and passive node, i.e., the suspicious group meets the feature of network group.
The example in S140 steps is continued to use, if the suspicious group is confirmed as network group, it is determined that
Active node and passive node relation pair are in network group afterwards：(X1, Y1), (X1, Y2), (X2,
Y1), (X2, Y2), (X2, Y3), (X2, Y4), (X3, Y2), (X3, Y3), (X3, Y4)；It is main
Dynamic nodes X 1, X2, X3；Passive node Y1, Y2, Y3, Y4.
By the present embodiment, the quantity with common active node between passive node is calculated, so as to filter out
The higher active node of interactivity and passive node relation pair constitute suspicious group, and by calculate it is described can
The density for doubting group determines that no is network group.So without manually participating in, it is possible to achieve automatically recognize
Network group in network is so as to improve the efficiency of network group identification.
In the specific embodiment of the application, it can also include after S160 steps：
Show the graph of a relation drawn according to active node in the network group and passive node relation pair.
Still by taking the example in S160 steps as an example, according to the network group of determination：Passive node be X1,
X2、X3；Active node is Y1, Y2, Y3, Y4；Active node and passive node relation pair for (X1,
Y1), (X1, Y2), (X2, Y1), (X2, Y2), (X2, Y3), (X2, Y4), (X3, Y2), (X3,
Y3), (X3, Y4), can draw graph of a relation；The graph of a relation is as shown in Figure 3.
By the present embodiment, the network group of determination can be shown in the way of visual graph of a relation
Come, be easy to user intuitively to be checked by the graph of a relation in network group between active node and passive node
The dense degree of relation.
For institute's illustrated example in above-described embodiment, if also there is active node and passive section in set of relationship
Point relation pair (X7, Y7), (X7, Y8), (X8, Y7), (X8, Y8)；It is then passive to save
The quantity with common active node is 2 also greater than predetermined threshold value between point X7, X8, then can by by
Dynamic nodes X 7, X8 is defined as passive node pair.Assuming that in the presence of passive node is to X7, X8, calculating
Density is still more than pre-set density afterwards.The graph of a relation that is so drawn according to the network group of determination as shown in figure 4,
It is and passive, it is apparent that passive node X1, X2, X3, active node Y1, Y2, Y3, Y4
Do not have relation between nodes X 7, X8, active node Y7, Y8, same network group should not be belonged to
Group.
In the problem of in order to solve set forth above, the present embodiment after S130 steps, can also include B1,
B2 steps, it is specific as follows：
B1：Judge to whether there is identical passive node between the passive node pair one by one；
B2：If so, then by corresponding two passive nodes of the identical passive node to merging；Return and perform
B1, until identical passive node is not present between passive node pair.
For above-mentioned passive node to X1, X2；X2, X3；X7, X8.Because passive node is to X1,
X2 and passive node are to X2, and X3 has identical passive node X2, thus merge after passive node to for
X1, X2, X3；Then, because passive node is to X1, X2, X3 and passive node are to X7, and X8 is not
There is identical passive node, so final passive node is to for X1, X2, X3 and passive node to for
X7, X8.
Correspondingly, S140：The passive node is drawn to related active node and passive node relation pair
It is divided into suspicious group, can specifically includes：
Searched from the set of relationship containing any passive node of passive node centering after merging
Active node and passive node relation pair, and the active node and passive node relation pair be divided into suspicious
Group.
The example in S132 steps is continued to use, from set of relationship (X1, Y1), (X1, Y2), (X2, Y1),
(X2, Y2), (X2, Y3), (X2, Y4), (X3, Y2), (X3, Y3), (X3, Y4), (X4,
Y4), (X4, Y5), (X7, Y7), (X7, Y8), (X8, Y7), (X8, Y8) }
It is middle to search containing the passive node after merging to X1, X2, in X3 the active node of any passive node and by
Dynamic node relationships are to as follows：
(X1, Y1), (X1, Y2), (X2, Y1), (X2, Y2), (X2, Y3), (X2, Y4),
(X3, Y2), (X3, Y3), (X3, Y4)；And divide the active node and passive node relation pair
For suspicious group；
In the same manner, searched from set of relationship containing the passive node after merging to any passive in X7, X8
The active node and passive node relation pair of node are as follows：
(X7, Y7), (X7, Y8), (X8, Y7), (X8, Y8)；And by the active
Node and passive node relation pair are divided into suspicious group.
Further, the density of this two groups of suspicious groups is calculated respectively.Assuming that the density of this two groups of suspicious groups
Both greater than pre-set density, then can finally determine two orthogonal network groups.As shown in figure 5, i.e.
For the graph of a relation of this two groups of network groups.Preferably, each network group can also be entered as shown in Figure 5
Line number, such as using Arabic numerals (1,2,3,4 ...), Roman number (I, II, III, IV ...),
English alphabet (a, b, c, d ...) etc., is not limited in the present embodiment to this.
In the present embodiment, by by the passive node with identical passive node to merge, so as to not have
Related passive node is separated, it is to avoid multiple orthogonal network groups are divided in same in network
The problem of in individual network group.
The embodiment of the present application provides and also provides a kind of device, it is possible to achieve above-mentioned method and step, and the device
It can be realized, can also be realized by way of hardware or software and hardware combining by software.It is implemented in software
Exemplified by, as the device on logical meaning, be by the CPU of server (Central Process Unit,
Central processing unit) corresponding computer program instructions are read what operation in internal memory was formed.
Fig. 5 is the module diagram of the network group identifying device provided in the embodiment of the application one.This implementation
In example, the network group identifying device includes：
Receiving unit 210, for receiving the set of relationship comprising active node and passive node relation pair；
Computing unit 220, has common active node for calculating between passive node in the set of relationship
Quantity；
Screening unit 230, is more than predetermined threshold value for filtering out the quantity with common active node
Passive node pair；
Division unit 240, for that will be closed with the passive node to related active node and passive node
System is to being divided into suspicious group；
Judging unit 250, for judging whether the density of the suspicious group is more than pre-set density；
Determining unit 260, for when the density of the suspicious group is more than pre-set density, by the suspicious group
Group is defined as network group.
The device provided by the present embodiment, calculates the quantity with common active node between passive node,
So as to filter out the higher active node of interactivity and passive node relation pair to constitute suspicious group, and pass through
The density of the suspicious group is calculated to determine whether for network group.In this way, without manually participating in, you can
The network group in automatically identification network is realized to improve network group recognition efficiency.
Preferably, the screening unit 230, is specifically included：
First screening subelement, for judging it is pre- whether the quantity with common active node is more than one by one
If threshold value；
Second screening subelement, for the quantity with common active node more than predetermined threshold value when,
It is passive node pair to determine corresponding two passive nodes of the quantity；Return and perform the first screening son list
Member, until having judged all quantity.
Preferably, the division unit 240, is specifically included：
First divides subelement, any containing the passive node centering for being searched from the set of relationship
The active node and passive node relation pair of passive node, and by the active node and passive node relation pair
It is divided into suspicious group.
Preferably, the judging unit 250, is specifically included：
Subelement is obtained, for obtaining active node quantity, passive node quantity in the suspicious group respectively
And active node and passive node relation pair quantity in the group；
Computation subunit, for by the active node and passive node relation pair quantity divided by the active section
The product of point quantity and passive node quantity, so as to obtain density；
First judgment sub-unit, for judging whether the density is more than pre-set density.
Preferably, after the determining unit 250, in addition to：
Display unit, draws for showing according to active node in the network group and passive node relation pair
Graph of a relation.
Preferably, after the screening unit 230, in addition to：
Second judgment sub-unit, for judging to whether there is identical passive section between the passive node pair one by one
Point；
Merge subelement, during for there is identical passive node between the passive node pair, by the phase
With passive node, corresponding two passive nodes are to merging；Return and perform second judgment sub-unit, until
Identical passive node is not present between passive node pair；
Correspondingly, the division unit, including：
Arbitrarily passively saved containing the passive node centering after merging for being searched from the set of relationship
The active node and passive node relation pair of point, and the active node and passive node relation pair are divided into
Suspicious group.
In the 1990s, can clearly to distinguish be changing on hardware for the improvement of a technology
The improvement entered on (for example, improvement to circuit structures such as diode, transistor, switches) or software is (right
In the improvement of method flow).However, with the development of technology, the improvement of many method flows now is
Through directly improving for hardware circuit can be considered as.Designer is nearly all by by improved method flow
It is programmed into hardware circuit to obtain corresponding hardware circuit.Therefore, it cannot be said that method flow
Improvement cannot be realized with hardware entities module.For example, PLD (Programmable
Logic Device, PLD) (for example field programmable gate array (Field Programmable Gate Array,
FPGA)) it is exactly such a integrated circuit, its logic function is determined by user to device programming.By setting
Meter personnel are voluntarily programmed a digital display circuit " integrated " on a piece of PLD, without asking chip system
Manufacturer is made to design and make special IC chip.Moreover, nowadays, substitution manually makes integrated
Circuit chip, this programming also uses " logic compiler (logic compiler) " software instead to realize mostly,
Software compiler used is similar when it writes with program development, and the source code before compiling also is obtained
Write with specific programming language, this is referred to as hardware description language (Hardware Description
Language, HDL), and HDL is also not only a kind of, but have many kinds, such as ABEL (Advanced
Boolean Expression Language)、AHDL(Altera Hardware Description Language)、
Confluence、CUPL(Cornell University Programming Language)、HDCal、JHDL
(Java Hardware Description Language)、Lava、Lola、MyHDL、PALASM、RHDL
(Ruby Hardware Description Language) etc., most generally uses VHDL at present
(Very-High-Speed Integrated Circuit Hardware Description Language) with
Verilog.Those skilled in the art, which also will be apparent to the skilled artisan that, to be only needed to method flow with above-mentioned several hardware descriptions
Language slightly programming in logic and is programmed into integrated circuit, it is possible to is readily available and is realized the logical method stream
The hardware circuit of journey.
Controller can be implemented in any suitable manner, for example, controller can take such as microprocessor
Or processor and storage can by (micro-) computing device computer readable program code (such as software
Or firmware) computer-readable medium, gate, switch, application specific integrated circuit (Application Specific
Integrated Circuit, ASIC), the form of programmable logic controller (PLC) and embedded microcontroller, controller
Example include but is not limited to following microcontroller：ARC 625D、Atmel AT91SAM、Microchip
PIC18F26K20 and Silicone Labs C8051F320, Memory Controller is also implemented as depositing
A part for the control logic of reservoir.It is also known in the art that except with pure computer-readable program
Code means are realized beyond controller, can cause control by the way that method and step is carried out into programming in logic completely
Device is with the shape of gate, switch, application specific integrated circuit, programmable logic controller (PLC) and embedded microcontroller etc.
Formula realizes identical function.Therefore this controller is considered a kind of hardware component, and to being wrapped in it
The device for realizing various functions included can also be considered as the structure in hardware component.Or even, can be with
It not only can will be the software module of implementation method for realizing that the device of various functions is considered as but also can be hardware
Structure in part.
System, device, module or unit that above-described embodiment is illustrated, specifically can be by computer chip or reality
Body is realized, or is realized by the product with certain function.
For convenience of description, it is divided into various units during description apparatus above with function to describe respectively.Certainly,
The function of each unit can be realized in same or multiple softwares and/or hardware when implementing the application.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method, system or meter
Calculation machine program product.Therefore, the present invention can be using complete hardware embodiment, complete software embodiment or knot
The form of embodiment in terms of conjunction software and hardware.Wherein wrapped one or more moreover, the present invention can be used
Containing computer usable program code computer-usable storage medium (include but is not limited to magnetic disk storage,
CD-ROM, optical memory etc.) on the form of computer program product implemented.
The present invention is with reference to the production of method according to embodiments of the present invention, equipment (system) and computer program
The flow chart and/or block diagram of product is described.It should be understood that can by computer program instructions implementation process figure and
/ or each flow and/or square frame in block diagram and the flow in flow chart and/or block diagram and/
Or the combination of square frame.These computer program instructions can be provided to all-purpose computer, special-purpose computer, insertion
Formula processor or the processor of other programmable data processing devices are to produce a machine so that pass through and calculate
The instruction of the computing device of machine or other programmable data processing devices is produced for realizing in flow chart one
The device for the function of being specified in individual flow or multiple flows and/or one square frame of block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or the processing of other programmable datas to set
In the standby computer-readable memory worked in a specific way so that be stored in the computer-readable memory
Instruction produce include the manufacture of command device, the command device realization in one flow or multiple of flow chart
The function of being specified in one square frame of flow and/or block diagram or multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices, made
Obtain and perform series of operation steps on computer or other programmable devices to produce computer implemented place
Reason, so that the instruction performed on computer or other programmable devices is provided for realizing in flow chart one
The step of function of being specified in flow or multiple flows and/or one square frame of block diagram or multiple square frames.
In a typical configuration, computing device includes one or more processors (CPU), input/defeated
Outgoing interface, network interface and internal memory.
Internal memory potentially includes the volatile memory in computer-readable medium, random access memory
And/or the form, such as read-only storage (ROM) or flash memory (flash RAM) such as Nonvolatile memory (RAM).
Internal memory is the example of computer-readable medium.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by appointing
What method or technique realizes that information is stored.Information can be computer-readable instruction, data structure, program
Module or other data.The example of the storage medium of computer includes, but are not limited to phase transition internal memory
(PRAM), static RAM (SRAM), dynamic random access memory (DRAM), its
Random access memory (RAM), read-only storage (ROM), the electrically erasable of his type are read-only
Memory (EEPROM), fast flash memory bank or other memory techniques, read-only optical disc read-only storage
(CD-ROM), digital versatile disc (DVD) or other optical storages, magnetic cassette tape, tape magnetic
Disk storage or other magnetic storage apparatus or any other non-transmission medium, can be calculated available for storage
The information that equipment is accessed.Defined according to herein, computer-readable medium does not include temporary computer-readable matchmaker
The data-signal and carrier wave of body (transitory media), such as modulation.
It should also be noted that, term " comprising ", "comprising" or its any other variant are intended to non-row
His property is included, so that process, method, commodity or equipment including a series of key elements not only include
Those key elements, but also other key elements including being not expressly set out, or also include for this process,
Method, commodity or the intrinsic key element of equipment.In the absence of more restrictions, by sentence " including
One ... " key element that limits, it is not excluded that in the process including the key element, method, commodity or set
Also there is other identical element in standby.
It will be understood by those skilled in the art that embodiments herein can be provided as method, system or computer journey
Sequence product.Therefore, the application can using complete hardware embodiment, complete software embodiment or combine software and
The form of the embodiment of hardware aspect.Moreover, the application can be used wherein includes calculating one or more
Machine usable program code computer-usable storage medium (include but is not limited to magnetic disk storage, CD-ROM,
Optical memory etc.) on the form of computer program product implemented.
The application can be described in the general context of computer executable instructions, example
Such as program module.Usually, program module includes performing particular task or realizes particular abstract data type
Routine, program, object, component, data structure etc..This can also be put into practice in a distributed computing environment
Application, in these DCEs, by the remote processing devices connected by communication network come
Execution task.In a distributed computing environment, program module can be located at local including storage device
In remote computer storage medium.
Each embodiment in this specification is described by the way of progressive, identical phase between each embodiment
As part mutually referring to, what each embodiment was stressed be it is different from other embodiment it
Place.For system embodiment, because it is substantially similar to embodiment of the method, so description
Fairly simple, the relevent part can refer to the partial explaination of embodiments of method.
Embodiments herein is the foregoing is only, the application is not limited to.For this area skill
For art personnel, the application can have various modifications and variations.All institutes within spirit herein and principle
Any modification, equivalent substitution and improvements of work etc., should be included within the scope of claims hereof.
Claims (12)
1. a kind of network group recognition methods, it is characterised in that including：
Receive the set of relationship comprising active node and passive node relation pair；
Calculate the quantity between passive node in the set of relationship with common active node；
Filter out the passive node pair that the quantity with common active node is more than predetermined threshold value；
Suspicious group will be divided into related active node and passive node relation pair with the passive node
Group；
Judge whether the density of the suspicious group is more than pre-set density；
If so, the suspicious group then is defined as into network group.
2. the method as described in claim 1, it is characterised in that filter out described with common actively section
The quantity of point is more than the passive node pair of predetermined threshold value, specifically includes：
A1：Judge whether the quantity with common active node is more than predetermined threshold value one by one；
A2：If, it is determined that corresponding two passive nodes of the quantity are passive node pair；Return and perform
A1, until having judged all quantity.
3. the method as described in claim 1, it is characterised in that will be with the passive node to there is relation
Active node and passive node relation pair be divided into suspicious group, specifically include：
The active node containing any passive node of passive node centering is searched from the set of relationship
With passive node relation pair, and the active node and passive node relation pair are divided into suspicious group.
4. the method as described in claim 1, it is characterised in that judging the density of the suspicious group is
It is no to be more than pre-set density, specifically include：
Active in active node quantity, passive node quantity and the group in the suspicious group is obtained respectively
Node and passive node relation pair quantity；
By the active node and passive node relation pair quantity divided by the active node quantity and passive section
The product of point quantity, so as to obtain density；
Judge whether the density is more than pre-set density.
5. the method as described in claim 1, it is characterised in that the suspicious group is being defined as network
After group, in addition to：
Show the graph of a relation drawn according to active node in the network group and passive node relation pair.
6. the method as described in claim 1, it is characterised in that described with common active filtering out
The quantity of node is more than the passive node of predetermined threshold value to after, in addition to：
B1：Judge to whether there is identical passive node between the passive node pair one by one；
B2：If so, then by corresponding two passive nodes of the identical passive node to merging；Return and perform
B1, until identical passive node is not present between passive node pair；
Correspondingly, the passive node is divided into related active node and passive node relation pair can
Group is doubted, including：
Searched from the set of relationship containing any passive node of passive node centering after merging
Active node and passive node relation pair, and the active node and passive node relation pair be divided into suspicious
Group.
7. a kind of network group identifying device, it is characterised in that including：
Receiving unit, for receiving the set of relationship comprising active node and passive node relation pair；
Computing unit, the number between passive node in the set of relationship for calculating with common active node
Amount；
Screening unit, is more than the passive of predetermined threshold value for filtering out the quantity with common active node
Node pair；
Division unit, for will be with the passive node to related active node and passive node relation pair
It is divided into suspicious group；
Judging unit, for judging whether the density of the suspicious group is more than pre-set density；
Determining unit, it is for when the density of the suspicious group is more than pre-set density, the suspicious group is true
It is set to network group.
8. device as claimed in claim 7, it is characterised in that the screening unit, is specifically included：
First screening subelement, for judging it is pre- whether the quantity with common active node is more than one by one
If threshold value；
Second screening subelement, for the quantity with common active node more than predetermined threshold value when,
It is passive node pair to determine corresponding two passive nodes of the quantity；Return and perform the first screening son list
Member, until having judged all quantity.
9. device as claimed in claim 7, it is characterised in that the division unit, is specifically included：
First divides subelement, any containing the passive node centering for being searched from the set of relationship
The active node and passive node relation pair of passive node, and by the active node and passive node relation pair
It is divided into suspicious group.
10. device as claimed in claim 7, it is characterised in that the judging unit, is specifically included：
Subelement is obtained, for obtaining active node quantity, passive node quantity in the suspicious group respectively
And active node and passive node relation pair quantity in the group；
Computation subunit, for by the active node and passive node relation pair quantity divided by the active section
The product of point quantity and passive node quantity, so as to obtain density；
First judgment sub-unit, for judging whether the density is more than pre-set density.
11. device as claimed in claim 7, it is characterised in that after the determining unit, also wrap
Include：
Display unit, draws for showing according to active node in the network group and passive node relation pair
Graph of a relation.
12. device as claimed in claim 7, it is characterised in that after the screening unit, also wrap
Include：
Second judgment sub-unit, for judging to whether there is identical passive section between the passive node pair one by one
Point；
Merge subelement, during for there is identical passive node between the passive node pair, by the phase
With passive node, corresponding two passive nodes are to merging；Return and perform second judgment sub-unit, until
Identical passive node is not present between passive node pair；
Correspondingly, the division unit, is specifically included：
Second divides subelement, for being searched from the set of relationship containing the passive node after merging
The active node and passive node relation pair of any passive node of centering, and the active node is saved with passive
Point relation pair is divided into suspicious group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610108595.1A CN107135137B (en) | 2016-02-26 | 2016-02-26 | Network group identification method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610108595.1A CN107135137B (en) | 2016-02-26 | 2016-02-26 | Network group identification method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107135137A true CN107135137A (en) | 2017-09-05 |
| CN107135137B CN107135137B (en) | 2020-03-27 |
Family
ID=59720783
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610108595.1A Active CN107135137B (en) | 2016-02-26 | 2016-02-26 | Network group identification method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107135137B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109102151A (en) * | 2018-07-03 | 2018-12-28 | 阿里巴巴集团控股有限公司 | A suspicious group identification method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102750647A (en) * | 2012-06-29 | 2012-10-24 | 南京大学 | Merchant recommendation method based on transaction network |
| CN103164416A (en) * | 2011-12-12 | 2013-06-19 | 阿里巴巴集团控股有限公司 | Identification method and device of user relationship |
| US20140317732A1 (en) * | 2013-04-22 | 2014-10-23 | Facebook, Inc. | Categorizing social networking system users based on user connections to objects |
| CN104272651A (en) * | 2012-04-23 | 2015-01-07 | 阿尔卡特朗讯公司 | Synchronize management groups |
| CN105075178A (en) * | 2013-04-09 | 2015-11-18 | 国际商业机器公司 | Identifying one or more relevant social networks for one or more collaboration artifacts |
-
2016
- 2016-02-26 CN CN201610108595.1A patent/CN107135137B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103164416A (en) * | 2011-12-12 | 2013-06-19 | 阿里巴巴集团控股有限公司 | Identification method and device of user relationship |
| CN104272651A (en) * | 2012-04-23 | 2015-01-07 | 阿尔卡特朗讯公司 | Synchronize management groups |
| CN102750647A (en) * | 2012-06-29 | 2012-10-24 | 南京大学 | Merchant recommendation method based on transaction network |
| CN105075178A (en) * | 2013-04-09 | 2015-11-18 | 国际商业机器公司 | Identifying one or more relevant social networks for one or more collaboration artifacts |
| US20140317732A1 (en) * | 2013-04-22 | 2014-10-23 | Facebook, Inc. | Categorizing social networking system users based on user connections to objects |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109102151A (en) * | 2018-07-03 | 2018-12-28 | 阿里巴巴集团控股有限公司 | A suspicious group identification method and device |
| CN109102151B (en) * | 2018-07-03 | 2021-08-31 | 创新先进技术有限公司 | A method and device for identifying suspicious groups |
| CN113793071A (en) * | 2018-07-03 | 2021-12-14 | 创新先进技术有限公司 | A method and device for identifying suspicious groups |
| CN113793071B (en) * | 2018-07-03 | 2024-09-06 | 创新先进技术有限公司 | A suspicious group identification method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107135137B (en) | 2020-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI715999B (en) | Identification method and device of identity information | |
| CN110262937B (en) | A method and device for identifying the cause of index abnormality | |
| CN107679700A (en) | Business flow processing method, apparatus and server | |
| JP6716149B2 (en) | Blockchain-based data processing method and apparatus | |
| TW201942826A (en) | Payment mode recommendation method and device and equipment | |
| CN110096528A (en) | The method, apparatus and system of formation sequence in a kind of distributed system | |
| CN108460523A (en) | A kind of air control rule generating method and device | |
| CN108305158A (en) | A kind of method, apparatus and equipment of trained air control model and air control | |
| CN109214632A (en) | A kind of risk control method and equipment | |
| CN109003075A (en) | A kind of Risk Identification Method and device | |
| CN109086961A (en) | A kind of Information Risk monitoring method and device | |
| CN109784599A (en) | A kind of method, device and equipment of model training, risk identification | |
| CN108984596A (en) | A kind of keyword excavates and the method, device and equipment of risk feedback | |
| CN110096498A (en) | A kind of data cleaning method and device | |
| CN110147940A (en) | A kind of risk control processing method, equipment, medium and device | |
| CN116340595A (en) | A Fairness Recommendation Algorithm Based on Knowledge Graph | |
| CN116822606A (en) | Training method, device, equipment and storage medium of anomaly detection model | |
| US10719982B2 (en) | Surface extrction method, apparatus, and non-transitory computer readable storage medium thereof | |
| CN110516915A (en) | Service node training, appraisal procedure, device and electronic equipment | |
| CN110059712A (en) | The detection method and device of abnormal data | |
| CN117787443A (en) | A risk control method, device, equipment and readable storage medium | |
| CN110264213A (en) | A kind of processing method of information, device and equipment | |
| CN107544753A (en) | Data processing method, device and server | |
| CN110008237A (en) | A kind of similar inquiry identifying method and device | |
| CN116188023A (en) | Method, device, storage medium and equipment for risk identification model training |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200922 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman, British Islands Patentee after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman, British Islands Patentee before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20200922 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman, British Islands Patentee after: Advanced innovation technology Co.,Ltd. Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands Patentee before: Alibaba Group Holding Ltd. |