CN109345158A - Business risk recognition methods, device and computer readable storage medium - Google Patents
Business risk recognition methods, device and computer readable storage medium Download PDFInfo
- Publication number
- CN109345158A CN109345158A CN201811566532.6A CN201811566532A CN109345158A CN 109345158 A CN109345158 A CN 109345158A CN 201811566532 A CN201811566532 A CN 201811566532A CN 109345158 A CN109345158 A CN 109345158A
- Authority
- CN
- China
- Prior art keywords
- associated nodes
- weight
- enterprise
- current
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0635—Risk analysis of enterprise or organisation activities
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
This application provides a kind of business risk recognition methods, which comprises pre-establishes enterprise network figure, includes the side collection between associated nodes and the associated nodes in the enterprise network figure；Risk assessment request is responded, determines the first associated nodes corresponding with risk assessment request in enterprise's network chart；Enterprise's network chart is begun stepping through from first associated nodes, determines that the associated nodes and side concentrate risks and assumptions and the Risk of Communication path for meeting preset condition.In this manner, the weight of associated nodes and the weight of propagation path codetermine suitable path and go to traverse, and obtain the biggish associated nodes of weight and propagation path, so that the risk analysis result to enterprise is more accurate and efficient.
Description
Technical field
The application belongs to technical field of data processing, and in particular to a kind of business risk recognition methods, device and computer
Readable storage medium storing program for executing.
Background technique
Association map is the relational network figure established based on chart database, is a kind of visual intellectual analysis product, is led to
Data pick-up and conversion are crossed, figure computing engines are inquired and are analyzed to data, realize second grade data operation and data visualization,
And the analysis tool of user is showed in the form of map.Association map be made of node and side, node characterize event entity and
Business entity, side characterize the relationship between entity, and node and side can have multiple attributes.
It is associated with map and is applied to company information and business risk discovery field, core value is the enterprise each classification
Industry information is organically together in series, to facilitate co-related risks, group's risk etc. that risk model goes identification wherein to hide.?
Business risk is associated in map, and node is made of company, personnel and risk case, between Bian You company, personnel and risk case
Relationship constitute.In real enterprise association map, the shareholder of company is relatively more, other companies of a corporate investment also compare
It is more, and then form huge map, the problems such as this usually will appear super node, side explosion.
Current Risk Identification Method can obtain a large amount of data information when carrying out figure traversal.And in fact, having one
A little data informations are not apparent to the venture influence of enterprise.This results in wasting a large amount of time when scheming traversal, and
And since data volume is big, data are caused to calculate pressure larger.
Summary of the invention
In order to solve the above problems existing in the present technology, the application is designed to provide a kind of business risk identification side
Method, device and computer storage medium, it is intended to solve the presence of a large amount of invalid traversals and traversal model in carrying out figure retrieving
Enclose larger problem.
In order to solve the above technical problems, this application provides a kind of business risk recognition methods, which comprises in advance
Enterprise network figure is established, includes the side collection between associated nodes and the associated nodes in the enterprise network figure；Respond risk
Assessment request, determines the first associated nodes corresponding with risk assessment request in enterprise's network chart；From described first
Associated nodes begin stepping through enterprise's network chart, determine that the associated nodes and side concentrate the risks and assumptions for meeting preset condition
With Risk of Communication path.
Optionally, described to begin stepping through enterprise's network chart from first associated nodes, determine the associated nodes
The step of meeting risks and assumptions and the Risk of Communication path of preset condition is concentrated with side, comprising: determines the power of current associated nodes
When meeting default weight threshold again, traversed along at least propagation path being connected with the current associated nodes and described current
The adjacent at least next stage associated nodes of associated nodes；It determines that the next stage associated nodes are current associated nodes, repeats
It executes above-mentioned steps and stops ergodic condition until meeting.
Optionally, the weight of the current associated nodes of the determination meets the step of default weight threshold, comprising: described in acquisition
The initial weight value of current associated nodes；Obtain at least one upper level associated nodes of the current associated nodes, wherein institute
Upper level associated nodes are stated to be located on the propagation path；According to the weighted value of at least one upper level associated nodes and institute
State the weight that initial weight value determines the current associated nodes；By the weight of the current associated nodes and default weight threshold
It is compared, default weight threshold is met with the weight of the current associated nodes of determination.
Optionally, the weighted value of at least one upper level associated nodes according to and the initial weight value determine
The step of weight of the current associated nodes, comprising: obtain at least one described upper level associated nodes and the current pass
At least one described propagation path between interlink point；According to the weighted value of at least one upper level associated nodes and
The corresponding propagation path determines the transmitting weight of the current associated nodes；According at least one described transmitting weight and institute
State the weight that initial weight value determines the current associated nodes.
Optionally, the weighted value according at least one upper level associated nodes and the corresponding propagation
Path determines the step of transmitting weight of the current associated nodes are as follows: calculates the current associated nodes according to the following formula
Weight
Wherein, the αnFor the weighted value of the upper level associated nodes, βnFor the weight of the corresponding propagation path
Value, f (αn,βn) it is transmission function, N is the number of the upper level associated nodes.
Optionally, the propagation path be meet while weight threshold while.
Optionally, the associated nodes include N number of nodal community, preset the corresponding nodal community of the nodal community
Value, the initial weight value of the current associated nodes are the sum of the corresponding node attribute values of nodal community described in N.
Optionally, the propagation path between two associated nodes is the Zi Bianji being made of M sub- sides, is preset
The corresponding side right weight values in the sub- side, the weighted value of the propagation path are the sum of the corresponding side right weight values in the M sub- sides.
Present invention also provides a kind of business risk identification devices, and described device includes: to establish module, for pre-establishing
Enterprise network figure includes the side collection between associated nodes and the associated nodes in the enterprise network figure；Respond module is used for
Risk assessment request is responded, determines the first associated nodes corresponding with risk assessment request in enterprise's network chart；Time
Module is gone through, for beginning stepping through enterprise's network chart from first associated nodes, determines that the associated nodes and side are concentrated
Meet risks and assumptions and the Risk of Communication path of preset condition.
Present invention also provides a kind of computer readable storage medium, the computer-readable recording medium storage has one
Or multiple computer executable instructions, when one or more of computer executable instructions are executed by one or more processors
When, so that one or more of processors execute above-mentioned business risk recognition methods.
Business risk recognition methods provided by the present application obtains the association section currently traversed when traversing enterprise network figure
The weight of point when being greater than default weight threshold by the weight of the current associated nodes of determination, just determines further traversal downwards；
Before traverse downwards, when the weight of the propagation path between two associated nodes is greater than side weight threshold, just pass through
The propagation path traverses the next stage associated nodes being connected with current associated nodes.In this manner, the weight of associated nodes
Suitable path is codetermined with the weight of propagation path to go to traverse, and is obtained the biggish associated nodes of weight and propagation path, is made
It is more accurate and efficient to the risk analysis result of enterprise to obtain.
Detailed description of the invention
Fig. 1 is the application flow chart.
Specific embodiment
In order to make the above objects, features, and advantages of the present application more apparent, with reference to the accompanying drawing and it is specific real
Applying mode, the present application will be further described in detail.
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not intended to limit the present invention.
In subsequent description, it is only using the suffix for indicating such as " module ", " component " or " unit " of element
Be conducive to explanation of the invention, itself there is no a specific meaning.Therefore, " module ", " component " or " unit " can mix
Ground uses.
Fig. 1 is the flow chart of business risk recognition methods provided by the present application.The method of the embodiment is once by user
Triggering, then the process in the embodiment passes through terminal automatic running, wherein each step can be when operation according to such as
Sequence in flow chart successively carries out, and is also possible to multiple steps according to the actual situation while carrying out, herein and without limitation.This
The business risk recognition methods that application provides includes the following steps:
Step S110, pre-establishes enterprise network figure, includes that associated nodes with described are associated with section in the enterprise network figure
Side collection between point；
Step S120, response risk assessment request, determines corresponding with risk assessment request in enterprise's network chart
The first associated nodes；
Step S130 begins stepping through enterprise's network chart from first associated nodes, determine the associated nodes and
Concentrate risks and assumptions and the Risk of Communication path for meeting preset condition in side.
By above embodiment, the biggish associated nodes of available weight and propagation path, so as to the wind of enterprise
Analysis result in danger is more accurate and efficient.
Detailed narration is carried out to above steps below in conjunction with specific embodiment.
In step s 110, enterprise network figure is pre-established, includes associated nodes and the pass in the enterprise network figure
Side collection between interlink point.Side collection refers to the set of the incidence relation between associated nodes.
Specifically, step S110 can be completed as follows:
Step S1101 obtains the association needed for establishing enterprise network figure between associated nodes and the associated nodes and closes
System.Wherein, using incidence relation as the side between associated nodes.In the present embodiment, associated nodes refer to and business risk
Relevant different types of data, for example, the type of associated nodes may include three kinds, such as: enterprise, personnel and risk
Event.In other embodiments, the type of associated nodes also may include that other are relevant to business risk, with specific reference to building
It stands the designer of network and determines.It should be noted that the node of network is by largely belonging to enterprise, personnel and risk thing
The specifying information of part is constituted, for example, the enterprise in network may include A enterprise, B enterprise, C enterprise etc., personnel may include
CEO, CFO, president, manager, risk case can be investment, leaving office, bankruptcy, financing etc..
In step S1102, initial enterprise map is established according to the associated nodes and the incidence relation.Specifically,
Initial enterprise map interior joint and side do not assign specific weight, moreover, having between two adjacent nodes a plurality of with association
The side that relationship determines.In the present embodiment, the initial enterprise map includes at least two associated nodes, two passes
It include at least one incidence relation between interlink point, the associated nodes include at least one nodal community, the association
Relationship includes at least one side attribute, each different side attribute represents a different dimension of incidence relation.Wherein, it saves
Point attribute refers to that the content of node relevant to business risk, the associated nodes of different types have the section for representing multiple dimensions
Point attribute.For example, when the node classification is company, then the nodal community includes but is not limited to: registered capital, rule
Mould, industry, type and area；When the node classification is risk case, then the nodal community includes but is not limited to: occurring
Time, place, severity and the property value being related to；When the node classification is people, then the nodal community includes but not
It is limited to: position, tenure duration and passing record of bad behavior.
In step S1103, according to preset algorithm to the associated nodes and the incidence relation handled with
Obtain the node weights and side right weight of initial enterprise map.
Specifically, in the present embodiment, node weights and side right weight can be obtained as follows:
Step S11031 obtains at least one corresponding ancestor node attribute value of each associated nodes；
Step S11032 is obtained corresponding at least one incidence relation corresponding between described two associated nodes
At least one described original side attribute value；
Step S11033 corresponds to the associated nodes by merging to obtain at least one described ancestor node attribute value
The node weights；
Step S11034 corresponds to described two associated nodes by merging to obtain at least one described original side attribute value
Between the side right weight.
By above embodiment, can by initial enterprise map nodal community and incidence relation merge simplification,
To obtain relatively single business connection, and obtained by assigning the node after merging and side by comprehensively considering each attribute
Weighted value, establish the simple enterprise network figure of structure.
Specifically, in step S11031, at least one corresponding nodal community of each associated nodes is obtained, according to
First mapping relations determine the corresponding ancestor node attribute value of the nodal community.Wherein it is possible to be assigned by artificial mode
Same alike result is also possible to by way of computer assign same alike result automatically according to preset algorithm with identical attribute value
With identical attribute value, in the present embodiment, assignment range is between 0-100.
In step S11032, at least one incidence relation institute corresponding between described two associated nodes is obtained
At least one corresponding described side attribute, determines the corresponding original side attribute value of the side attribute according to the second mapping relations.Its
In, incidence relation between two associated nodes may more than one, and each incidence relation equally has multiple attributes, can be with
Same alike result is assigned with identical attribute value by artificial mode, is also possible to by way of computer automatically according to default
Algorithm assign same alike result with identical attribute value, in the present embodiment, assignment range is between 0-100.
In step S11033, by multiple ancestor node attribute values of the same associated nodes be mapped to corresponding numerical value with
As node weights.In the present embodiment, corresponding to all nodal communities that node weights possess for the associated nodes
The sum of ancestor node attribute value, for example, for associated nodes, it is assumed that the primitive attribute of node V is { pi, it can be by such as
The node weights a of associated nodes is calculated in lower formula:
Wherein, i is dimension, piFor the attribute of i-th dimension, fiFor the mapping function of the corresponding numerical value of attribute of i-th dimension, n is should
The quantity of nodal community possessed by associated nodes.It should be noted that fiSpecific formula can be according to big data determine
Content, be also possible to the relationship made by oneself according to the intention of setting person, specifically without limitation.
In step S11034, multiple original side attribute values on same side are mapped to corresponding numerical value as two
The attribute value of a line between associated nodes, due to there are multiple summits, therefore, by two nodes between two associated nodes
Between the corresponding multiple attribute values of multiple summits be mapped to a numerical value using as the side between described two associated nodes
Weight.In the present embodiment, while attribute value be this while the sum of all original side attribute values that possesses.For example, right
Yu Bian, it is assumed that the primitive attribute of side E is { qj, the attribute value β on side can be calculated by following formula:
Wherein, j is dimension, qjFor the attribute of jth dimension, gjFor the mapping function of the corresponding numerical value of attribute of jth dimension, m is should
The quantity of side attribute possessed by side.
Further, in the present embodiment, side right weighs the sum of the attribute value on side all between two associated nodes.It lifts
For example, it is assumed that the side collection between two associated nodes is { Ei, simplified one can be calculated by following formula
While while weight beta `:
Wherein, EiIt is β for the i-th sideiThe attribute value on side, fiFor the mapping letter of the corresponding numerical value of attribute value on i-th side
Number, n are the quantity that element is concentrated on side.
By above embodiment, can by multiple attributes of associated nodes in initial enterprise map and two nodes it
Between multiple incidence relations carry out it is comprehensive simplify to obtain the node weights and side right weight of corresponding enterprise network figure, it is effectively simple
The complexity of the enterprise network figure of subsequent foundation is changed.
In step S1104, enterprise network is established according to the associated nodes, the incidence relation and the reduced parameter
Figure.Corresponding node and side are assigned as weight using by the reduced parameter obtained in abovementioned steps by algorithm, to be looked forward to
Industry network.
Pass through above embodiment, it is possible to reduce for establishing the data magnitude of model, while improving the foundation speed of model
Degree, and it is higher to the community network graph traversal, feature extraction and analysis efficiency by making.
In the step s 120, response risk assessment request, determines in enterprise's network chart and requests with the risk assessment
Corresponding first associated nodes.Risk assessment request can be sent from terminal to serverless backup end.Risk assessment is requested for controlling
System triggering traversal enterprise network figure, when being occurred with assessing particular event, to enterprise's bring risk.
In the present embodiment, specific risk case is carried in risk assessment request.Risk case be refer to for
One or more event affected in each associated nodes in enterprise network figure.After receiving risk case, look into
Looking for associated nodes relevant to the risk case in enterprise network figure is the first associated nodes.
It in other embodiments, can also be only control monitoring and information relevant with enterprise, and from the information of monitoring
In be matched to corresponding first associated nodes in enterprise network figure, for example, server be in advance in enterprise network figure extremely
Few associated nodes configure keyword, and the keyword for associated nodes configuration can be one, are also possible to multiple keywords
Set.The keyword of associated nodes is substantially the set of the high word of the searched frequency relevant to associated nodes.
Step S130 begins stepping through enterprise's network chart from first associated nodes, determine the associated nodes and
Concentrate risks and assumptions and the Risk of Communication path for meeting preset condition in side.Wherein, risks and assumptions refer to the pass for meeting preset condition
Interlink point；Risk of Communication path refers to the side for being used to traverse enterprise's network chart for meeting preset condition.In the present embodiment, full
Sufficient preset condition, which refers to, meets weight threshold.In other embodiments, meeting preset condition may also mean that other controls time
Go through the Parameter Conditions of range.
Specifically, in the present embodiment, step S130 can be achieved by the steps of:
Step S1301, when determining that the weight of current associated nodes meets default weight threshold, along with the current association
The connected at least propagation path of node traverses an at least next stage associated nodes adjacent with the current associated nodes；
Step S1302 determines that the next stage associated nodes are current associated nodes, repeats above-mentioned steps until full
Foot stops ergodic condition.
It should be noted that the current associated nodes in step S1301 refer to the pass accessed in ergodic process
Interlink point.For example, then current associated nodes refer to the first associated nodes when being begun stepping through with the first associated nodes, when passing through
It is when continuing traversal downwards by next stage associated nodes, then next when first associated nodes are traversed to next stage associated nodes
Grade associated nodes are current associated nodes.Propagation path is the side being connected between two associated nodes, wherein is associated with one
Node may exist multiple for the propagation path of endpoint.In the present embodiment, it is pre- to determine that the weight of current associated nodes meets
If the step of weight threshold, can be as follows:
Step S13011 obtains the initial weight value of the current associated nodes；
Step S13012 obtains at least one upper level associated nodes of the current associated nodes, wherein described upper one
Grade associated nodes are located on the propagation path；
Step S13013 is determined according to the weighted value of at least one upper level associated nodes and the initial weight value
The weight of the current associated nodes.
Wherein, the initial weight value of associated nodes is the node weights according to determined by the attribute of associated nodes.In this reality
It applies in mode, the associated nodes include N number of nodal community, preset the corresponding node attribute values of the nodal community, institute
The initial weight value for stating current associated nodes is the sum of the corresponding node attribute values of nodal community described in N, particularly relevant content
It has been recorded in foregoing teachings.Upper level associated nodes refer to the node that current associated nodes are traversed by propagation path.It lifts
For example, when being traversed by propagation path to node w by node v, node w is current associated nodes, and node v is upper level
Associated nodes.In the present embodiment, propagation path refer to meet while weight threshold while.In the present embodiment, upper level
Associated nodes refer to by meet while weight threshold while traverse the nodes of current associated nodes.For example, it is assumed that node
V1And V2It is all accessed, node W is current associated nodes, node V1Side E is connected between node W1, node V2With node W
Between be connected with side E2If side E1Weight be less than side weight threshold, side E2Weight be greater than side weight threshold, then, at this time
Side E2For propagation path, node V2For upper level associated nodes.
In the present embodiment, step S13013 can be achieved by the steps of:
Step A, obtain between at least one described upper level associated nodes and the current associated nodes it is described at least
One propagation path；
Step B, according to the weighted value of at least one upper level associated nodes and the corresponding propagation path
Determine the transmitting weight of the current associated nodes；
Step C determines the current associated nodes according at least one described transmitting weight and the initial weight value
Weight；
The weight of the current associated nodes is compared step D with default weight threshold, to determine current association section
The weight of point meets default weight threshold.
In the present embodiment, the weight of the current associated nodes can be calculated according to the following formula
Wherein, the αnFor the weighted value of the upper level associated nodes, βnFor the weight of the corresponding propagation path
Value, f (αn,βn) it is transmission function, N is the number of the upper level associated nodes.
Wherein, about in step S1301 --- along at least propagation path time being connected with the current associated nodes
Go through an at least next stage associated nodes adjacent with the current associated nodes --- content, specifically, when determining current close
When the weight of interlink point is greater than or equal to default weight threshold, it is obtained from least one side that current associated nodes are starting point,
Obtain the corresponding side right weight values in the side.When the weight of the current associated nodes of determination is less than default weight threshold, does not then retain and work as
Preceding associated nodes and stop continue to traverse.In the present embodiment, the Zi Bianji constituted while to be sub- by M, sets in advance
The corresponding side right weight values in the fixed sub- side, the weighted value of the propagation path are the sum of the corresponding side right weight values in the M sub- sides.
When determine this while side right weight values be greater than or equal to while weight threshold when, then under the current associated nodes of son traverse downwards along the side
Level-one associated nodes.When determine this while side right weight values be less than while weight threshold when, then be no longer along the side and traverse downwards.
By codetermining suitable road using the weight of associated nodes and the weight of propagation path in above embodiment
Diameter goes to traverse, and obtains the biggish associated nodes of weight and propagation path, so that the risk analysis result to enterprise is more accurate
With it is efficient.
One embodiment of the application, also provides a kind of business risk identification device, and described device includes:
Module is established, includes associated nodes and the pass in the enterprise network figure for pre-establishing enterprise network figure
Side collection between interlink point；
Respond module is determined in enterprise's network chart and is requested with the risk assessment for responding risk assessment request
Corresponding first associated nodes；
Spider module determines the association section for beginning stepping through enterprise's network chart from first associated nodes
Risks and assumptions and the Risk of Communication path for meeting preset condition are concentrated in point and side.
It should be noted that the content in the method for building up embodiment of aforementioned enterprise network figure is equally applicable to this implementation
Example, therefore, this will not be repeated here.
One embodiment of the application additionally provides a kind of computer readable storage medium, the computer readable storage medium
One or more computer executable instructions are stored with, when one or more of computer executable instructions are one or more
When processor executes, so that one or more of processors execute following steps:
Enterprise network figure is pre-established, includes the side between associated nodes and the associated nodes in the enterprise network figure
Collection；Risk assessment request is responded, determines the first associated nodes corresponding with risk assessment request in enterprise's network chart；
Enterprise's network chart is begun stepping through from first associated nodes, determines that the associated nodes and side are concentrated and meets preset condition
Risks and assumptions and Risk of Communication path.
Optionally, described to begin stepping through enterprise's network chart from first associated nodes, determine the associated nodes
The step of meeting risks and assumptions and the Risk of Communication path of preset condition is concentrated with side, comprising: determines the power of current associated nodes
When meeting default weight threshold again, traversed along at least propagation path being connected with the current associated nodes and described current
The adjacent at least next stage associated nodes of associated nodes；It determines that the next stage associated nodes are current associated nodes, repeats
It executes above-mentioned steps and stops ergodic condition until meeting.
Optionally, the weight of the current associated nodes of the determination meets the step of default weight threshold, comprising: described in acquisition
The initial weight value of current associated nodes；Obtain at least one upper level associated nodes of the current associated nodes, wherein institute
Upper level associated nodes are stated to be located on the propagation path；According to the weighted value of at least one upper level associated nodes and institute
State the weight that initial weight value determines the current associated nodes；By the weight of the current associated nodes and default weight threshold
It is compared, default weight threshold is met with the weight of the current associated nodes of determination.
Optionally, the weighted value of at least one upper level associated nodes according to and the initial weight value determine
The step of weight of the current associated nodes, comprising: obtain at least one described upper level associated nodes and the current pass
At least one described propagation path between interlink point；According to the weighted value of at least one upper level associated nodes and
The corresponding propagation path determines the transmitting weight of the current associated nodes；According at least one described transmitting weight and institute
State the weight that initial weight value determines the current associated nodes.
Optionally, the weighted value according at least one upper level associated nodes and the corresponding propagation
Path determines the step of transmitting weight of the current associated nodes are as follows: calculates the current associated nodes according to the following formula
Weight
Wherein, the αnFor the weighted value of the upper level associated nodes, βnFor the weight of the corresponding propagation path
Value, f (αn,βn) it is transmission function, N is the number of the upper level associated nodes.
Optionally, the propagation path be meet while weight threshold while.
Optionally, the associated nodes include N number of nodal community, preset the corresponding nodal community of the nodal community
Value, the initial weight value of the current associated nodes are the sum of the corresponding node attribute values of nodal community described in N.
Optionally, the propagation path between two associated nodes is the Zi Bianji being made of M sub- sides, is preset
The corresponding side right weight values in the sub- side, the weighted value of the propagation path are the sum of the corresponding side right weight values in the M sub- sides.
The application is not limited to above-mentioned optional embodiment, anyone can show that other are various under the enlightenment of the application
The product of form, however, make any variation in its shape or structure, it is all to fall into the claim of this application confining spectrum
Technical solution, all fall within the protection scope of the application.
Claims (10)
1. a kind of business risk recognition methods, which is characterized in that the described method includes:
Enterprise network figure is pre-established, includes the side collection between associated nodes and the associated nodes in the enterprise network figure；
Risk assessment request is responded, determines the first association section corresponding with risk assessment request in enterprise's network chart
Point；
Enterprise's network chart is begun stepping through from first associated nodes, determines that the associated nodes and side are concentrated to meet and presets
The risks and assumptions of condition and Risk of Communication path.
2. business risk recognition methods as described in claim 1, which is characterized in that described since first associated nodes
Enterprise's network chart is traversed, determines that the associated nodes and side concentrate risks and assumptions and the Risk of Communication road for meeting preset condition
The step of diameter, comprising:
When determining that the weight of current associated nodes meets default weight threshold, it is connected at least along with the current associated nodes
One propagation path traverses an at least next stage associated nodes adjacent with the current associated nodes；
It determines that the next stage associated nodes are current associated nodes, repeats above-mentioned steps until meeting and stop traversal item
Part.
3. business risk recognition methods as claimed in claim 2, which is characterized in that the weight of the current associated nodes of determination
The step of meeting default weight threshold, comprising:
Obtain the initial weight value of the current associated nodes；
Obtain at least one upper level associated nodes of the current associated nodes, wherein the upper level associated nodes are located at
On the propagation path；
Determine that the current association saves according to the weighted value of at least one upper level associated nodes and the initial weight value
The weight of point；
The weight of the current associated nodes is compared with default weight threshold, it is full with the weight of the current associated nodes of determination
The default weight threshold of foot.
4. business risk recognition methods as claimed in claim 3, which is characterized in that described at least one upper level according to
The step of weighted value of associated nodes and the initial weight value determine the weight of the current associated nodes, comprising:
Obtain at least one described propagation road between at least one described upper level associated nodes and the current associated nodes
Diameter；
Work as according to the weighted value of at least one upper level associated nodes and the corresponding propagation path determination
The transmitting weight of preceding associated nodes；
The weight of the current associated nodes is determined according at least one described transmitting weight and the initial weight value.
5. business risk recognition methods as claimed in claim 4, which is characterized in that described according to described at least one
The step of weighted value of level-one associated nodes and the corresponding propagation path determine the transmitting weight of the current associated nodes
Are as follows: the weight of the current associated nodes is calculated according to the following formula
Wherein, the αnFor the weighted value of the upper level associated nodes, βnFor the weighted value of the corresponding propagation path, f
(αn,βn) it is transmission function, N is the number of the upper level associated nodes.
6. claim 2-5 arbitrarily as described in business risk recognition methods, which is characterized in that the propagation path be meet side right
The side of weight threshold value.
7. business risk recognition methods as claimed in claim 3, which is characterized in that the associated nodes include N number of node category
Property, the corresponding node attribute values of the nodal community are preset, the initial weight value of the current associated nodes is described in N
The sum of the corresponding node attribute values of nodal community.
8. business risk recognition methods as claimed in claim 5, which is characterized in that the propagation between two associated nodes
Path is the Zi Bianji being made of M sub- sides, presets the corresponding side right weight values in the sub- side, the weight of the propagation path
Value is the sum of the corresponding side right weight values in the sub- side the M.
9. a kind of business risk identification device, which is characterized in that described device includes:
Module is established, includes that associated nodes with described are associated with section for pre-establishing enterprise network figure, in the enterprise network figure
Side collection between point；
Respond module determines corresponding with risk assessment request in enterprise's network chart for responding risk assessment request
The first associated nodes；
Spider module, for beginning stepping through enterprise's network chart from first associated nodes, determine the associated nodes and
Concentrate risks and assumptions and the Risk of Communication path for meeting preset condition in side.
10. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has one or more
A computer executable instructions, when one or more of computer executable instructions are executed by one or more processors,
So that one or more of processor perform claims require business risk recognition methods described in 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811566532.6A CN109345158A (en) | 2018-12-19 | 2018-12-19 | Business risk recognition methods, device and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811566532.6A CN109345158A (en) | 2018-12-19 | 2018-12-19 | Business risk recognition methods, device and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109345158A true CN109345158A (en) | 2019-02-15 |
Family
ID=65304739
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811566532.6A Pending CN109345158A (en) | 2018-12-19 | 2018-12-19 | Business risk recognition methods, device and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109345158A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110557393A (en) * | 2019-09-05 | 2019-12-10 | 腾讯科技（深圳）有限公司 | network risk assessment method and device, electronic equipment and storage medium |
| CN111861119A (en) * | 2020-06-17 | 2020-10-30 | 国家计算机网络与信息安全管理中心 | Enterprise risk data processing method and device based on enterprise risk associated graph |
| WO2021027317A1 (en) * | 2019-08-14 | 2021-02-18 | 深圳壹账通智能科技有限公司 | Relationship network-based attribute information processing method and device, computer apparatus, and storage medium |
| CN112989374A (en) * | 2021-03-09 | 2021-06-18 | 闪捷信息科技有限公司 | Data security risk identification method and device based on complex network analysis |
| CN113642926A (en) * | 2021-08-31 | 2021-11-12 | 上海明略人工智能(集团)有限公司 | Method and device for risk early warning, electronic equipment and storage medium |
| CN113674081A (en) * | 2021-07-30 | 2021-11-19 | 浙江创邻科技有限公司 | Graph database-based wind control management system and method for small and medium-sized enterprises |
| WO2023020113A1 (en) * | 2021-08-18 | 2023-02-23 | 深圳前海微众银行股份有限公司 | Method and apparatus for detecting user feature, and device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105677648A (en) * | 2014-11-18 | 2016-06-15 | 四三九九网络股份有限公司 | Community detection 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 |
| CN107239882A (en) * | 2017-05-10 | 2017-10-10 | 平安科技（深圳）有限公司 | Methods of risk assessment, device, computer equipment and storage medium |
| CN108492201A (en) * | 2018-03-29 | 2018-09-04 | 山东科技大学 | A kind of social network influence power maximization approach based on community structure |
-
2018
- 2018-12-19 CN CN201811566532.6A patent/CN109345158A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105677648A (en) * | 2014-11-18 | 2016-06-15 | 四三九九网络股份有限公司 | Community detection 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 |
| CN107239882A (en) * | 2017-05-10 | 2017-10-10 | 平安科技（深圳）有限公司 | Methods of risk assessment, device, computer equipment and storage medium |
| CN108492201A (en) * | 2018-03-29 | 2018-09-04 | 山东科技大学 | A kind of social network influence power maximization approach based on community structure |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2021027317A1 (en) * | 2019-08-14 | 2021-02-18 | 深圳壹账通智能科技有限公司 | Relationship network-based attribute information processing method and device, computer apparatus, and storage medium |
| CN110557393A (en) * | 2019-09-05 | 2019-12-10 | 腾讯科技（深圳）有限公司 | network risk assessment method and device, electronic equipment and storage medium |
| CN111861119A (en) * | 2020-06-17 | 2020-10-30 | 国家计算机网络与信息安全管理中心 | Enterprise risk data processing method and device based on enterprise risk associated graph |
| CN112989374A (en) * | 2021-03-09 | 2021-06-18 | 闪捷信息科技有限公司 | Data security risk identification method and device based on complex network analysis |
| CN113674081A (en) * | 2021-07-30 | 2021-11-19 | 浙江创邻科技有限公司 | Graph database-based wind control management system and method for small and medium-sized enterprises |
| CN113674081B (en) * | 2021-07-30 | 2023-12-19 | 浙江创邻科技有限公司 | System and method for wind control management of middle and small enterprises based on graph database |
| WO2023020113A1 (en) * | 2021-08-18 | 2023-02-23 | 深圳前海微众银行股份有限公司 | Method and apparatus for detecting user feature, and device and storage medium |
| CN113642926A (en) * | 2021-08-31 | 2021-11-12 | 上海明略人工智能(集团)有限公司 | Method and device for risk early warning, electronic equipment and storage medium |
| CN113642926B (en) * | 2021-08-31 | 2023-08-08 | 上海明略人工智能(集团)有限公司 | Method and device for risk early warning, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109345158A (en) | Business risk recognition methods, device and computer readable storage medium | |
| US6347313B1 (en) | Information embedding based on user relevance feedback for object retrieval | |
| CN109033387A (en) | A kind of Internet of Things search system, method and storage medium merging multi-source data | |
| Larbani et al. | A novel method for fuzzy measure identification. | |
| CN104239513A (en) | Semantic retrieval method oriented to field data | |
| DE112016003626T5 (en) | Natural language interface to databases | |
| CN108629413A (en) | Neural network model training, trading activity Risk Identification Method and device | |
| CN110310114A (en) | Object classification method, device, server and storage medium | |
| US8719779B2 (en) | Data object association based on graph theory techniques | |
| CN105512465B (en) | Based on the cloud platform safety quantitative estimation method for improving VIKOR methods | |
| CN109299245A (en) | The method and apparatus that knowledge point is recalled | |
| CN110377751A (en) | Courseware intelligent generation method, device, computer equipment and storage medium | |
| CN110737805A (en) | Method and device for processing graph model data and terminal equipment | |
| CN116662509A (en) | Open domain question-answering implementation method, device and equipment of large-scale language model | |
| CN115756919A (en) | Root cause positioning method and system for multidimensional data | |
| CN108154024B (en) | Data retrieval method and device and electronic equipment | |
| CN116541166A (en) | Super-computing power scheduling server and resource management method | |
| CN110532282A (en) | Data query method and device | |
| CN109299473B (en) | Developer portrait-based software engineering task recommendation method | |
| CN109359205A (en) | A kind of remote sensing image cutting method and equipment based on geographical grid | |
| CN109558522A (en) | Method for building up, device and the computer readable storage medium of enterprise network figure | |
| DE112021005210T5 (en) | Indexing metadata to manage information | |
| US20100049733A1 (en) | Systems and methods for assigning hosts in response to a data query | |
| CN105677745A (en) | General efficient self-service data search system and implementation method | |
| Liu et al. | Research on discovering Deep Web entries based ontopic crawling and ontology |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190215 |
|
| WD01 | Invention patent application deemed withdrawn after publication |