CN115080706B - Method and system for constructing enterprise relationship map - Google Patents
Method and system for constructing enterprise relationship map Download PDFInfo
- Publication number
- CN115080706B CN115080706B CN202210989518.7A CN202210989518A CN115080706B CN 115080706 B CN115080706 B CN 115080706B CN 202210989518 A CN202210989518 A CN 202210989518A CN 115080706 B CN115080706 B CN 115080706B
- Authority
- CN
- China
- Prior art keywords
- enterprise
- value
- enterprises
- matrix
- relation
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method and a system for constructing an enterprise relation atlas, which are used for acquiring an enterprise relation atlas of an enterprise to be inquired, constructing an enterprise relation matrix according to an enterprise name and an enterprise relation in the enterprise relation atlas, generating a deepened application matrix according to the enterprise relation matrix, updating the enterprise relation atlas according to the deepened application matrix and outputting the enterprise relation atlas. The method can improve the accuracy of the enterprise relation maps, fully reflect the association degree among enterprises, reinforce the weight value of enterprise information change in the construction process, effectively analyze the invisible relationship among the enterprises by coordinating the association of all the enterprises in the maps, correct and optimize the enterprise relation maps in the database, and effectively help to analyze the enterprise risk propagation paths and the enterprise operation activities.
Description
Technical Field
The invention relates to the technical field of knowledge graphs, in particular to a construction method of an enterprise relation graph.
Background
The enterprise relationship map is helpful for people to examine the composition structure and the associated information among enterprises. At present, a mainstream enterprise relationship spectrogram construction method mainly utilizes data analysis methods such as data mining and pattern matching to draw an enterprise relationship spectrogram which is convenient and intuitive to display in a logic association mode. However, the relationship between enterprises is often complicated, the position information and employee composition of the enterprises can change, new business comes and goes between large and small enterprises, meanwhile, implicit association can exist between different enterprises, and under the change of various information, the enterprise relationship map can have the phenomenon of inaccurate and incomplete information association.
In the Chinese invention patent with the prior art patent application number of 201810685605.7, an enterprise data knowledge table is constructed, a knowledge template related table is constructed, and a knowledge template ID field is established in the enterprise data knowledge table to realize the one-to-many relation between a knowledge template and enterprise data knowledge; constructing a knowledge master tree diagram, and establishing an ID field of the knowledge master tree diagram in a knowledge template table to realize the one-to-many relationship between the master tree diagram and the knowledge template; and constructing a knowledge logic tree diagram, establishing a knowledge logic tree diagram and an enterprise data knowledge relation table in the knowledge logic tree diagram, and storing an ID field of the knowledge logic tree diagram and an ID field of enterprise data knowledge to realize the many-to-many relation between nodes of the knowledge logic tree diagram and the enterprise data knowledge.
Disclosure of Invention
The invention aims to provide a method for constructing an enterprise relationship graph, which is used for solving one or more technical problems in the prior art and at least providing a beneficial selection or creation condition.
The invention provides a method and a system for constructing an enterprise relation atlas, which are used for acquiring an enterprise relation atlas of an enterprise to be inquired, constructing an enterprise relation matrix according to an enterprise name and an enterprise relation in the enterprise relation atlas, generating a deepened application matrix according to the enterprise relation matrix, updating the enterprise relation atlas according to the deepened application matrix and outputting the enterprise relation atlas. The method can improve the accuracy of the enterprise relation map, fully reflect the association degree among enterprises, reinforce the weight value of enterprise information change in the construction process, effectively analyze the invisible relation among the enterprises by coordinating the association of all the enterprises in the map, and effectively help the analysis of the enterprise risk propagation path and the enterprise operation activities.
In order to achieve the above object, according to an aspect of the present invention, there is provided a method for constructing an enterprise relationship graph, the method including the steps of:
s100, acquiring an enterprise relation map of an enterprise to be queried;
s200, constructing an enterprise relation matrix according to the enterprise name and the enterprise relation in the enterprise relation map;
s300, generating a deepened application matrix according to the enterprise relation matrix;
s400, updating the enterprise relationship map according to the deepened application matrix, and outputting the updated enterprise relationship map;
the enterprise relationship graph comprises at least two enterprises, each enterprise comprises a plurality of employees, each employee holds a mobile device and is used for obtaining positioning information of the employee, and the positioning information comprises longitude and latitude coordinates.
Preferably, in step S100, the enterprise relationship graph of the enterprise to be queried is obtained, and the specific method is as follows: the enterprise relationship map of the enterprise to be inquired is obtained through an enterprise relationship map generation method in a patent with the patent number of CN107229756A, or the enterprise relationship map of the enterprise to be inquired in a database of an enterprise inquiry website is obtained.
Further, in step S200, an enterprise relationship matrix is constructed according to the enterprise name and the enterprise relationship in the enterprise relationship map, and the specific steps are as follows: screening all enterprises from an enterprise relationship map, recording the number of all enterprises as N, and using N numbers as 1,2, \ 8230, wherein N numbers all the enterprises in sequence to obtain enterprise numbering relations, creating an all-zero matrix R with N rows and N columns, setting an integer variable i =1, and recording the value range of i as [1, N ];
and sequentially traversing the i, wherein in the enterprise relationship graph, the serial numbers of all enterprises which are marked as the connection relationship with the enterprise with the serial number of i are R1, R2, \8230, rn is set with an integer variable j, the values of j are sequentially R1, R2, \8230, rn is sequentially traversed by j, the element of the ith row and jth column in the updating matrix R is 1, R1 is a transposed matrix of R, R is R + R1, and R is an enterprise relationship matrix.
Further, in step S300, a deepened application matrix is generated according to the enterprise relationship matrix, and the specific method includes: recording the number of the enterprises with the largest number of the employees as E, recording the number of all the employees as st, acquiring the longitude and latitude coordinates of the mobile equipment of each employee in the E, sequentially constructing an array lal (the array lal is a two-dimensional array, the st row is 2, the 1 st column is the longitude coordinate of the mobile equipment of each employee, the 2 nd column is the latitude coordinate of the mobile equipment of each employee) by taking the longitude and latitude coordinates of the mobile equipment of each employee as one row, and recording the lal i1j1 The longitude and latitude coordinates of the enterprise position of E are (eg, et) for the elements of the ith 1 line and the jth 1 column in the two-dimensional array lal, and the enterprise pivot measured value of E is obtained through calculation according to the following formula
(the enterprise pivot measuring value is used as an index for judging whether the association state of the enterprise is abnormal or not according to the unknown change trend of the employee); i1 is the serial number of the row in the array lal, and j1 is the serial number of the column in the array lal;
acquiring longitude and latitude coordinates of each enterprise,sequentially constructing an array cc (the array cc is a two-dimensional array and is N rows and 2 columns) by taking the longitude and latitude coordinates of each enterprise as one line according to the ascending sequence of the enterprise numbers, sequentially constructing an array mdc (the array mdc is a two-dimensional array and is N rows and 2 columns) by taking the average value of the longitude and latitude coordinates of the mobile devices of all the employees in each enterprise as one line, and recording the cc i2j2 For the element in the i2 th row and the j2 th column in the array cc, mdc is used i3j3 For the elements in the i3 th row and the j3 th column in the array mdc, i2, j2=1,2, \ 8230, N, i3, j3=1,2, \ 8230, N, an integer variable p =1, p E [1, N]P is traversed sequentially, storing the values of all p that satisfy the condition con1 and satisfy the condition con2 in an array esc,
wherein, the condition con1 indicates that the enterprise pivot measurement value of the enterprise corresponding to the pth element in the group cc is less than or equal to cpp, or the condition con1 indicates that the enterprise pivot measurement value of the current enterprise is less than or equal to ccGV, and the condition con2 indicates mdc p1 ∈[cc p1 -K1, cc p1 +K1]And mdc p2 ∈[cc p2 -K2, cc p2 +K2](ii) a ccGV is the average of the enterprise pivot measurements of each enterprise in array cc; k1 is the difference between KT1 and KST 1; k2 is the difference between KT2 and KST 2; KT1 is an average value of each element in the 1 st column in the array lal, and KST1 is an average value of each element in the 1 st column of the array mdc corresponding to the current enterprise; KT2 is an average value of each element in the 2 nd column of the array lal, and KST2 is an average value of each element in the 2 nd column of the array mdc corresponding to the current enterprise;
or, wherein condition con1 refers to mdc p1 ∈[int1,int2]Condition con2 means mdc p2 ∈[int3,int4]Int1 has a value cc p1 The value of-cpp, int2 is cc p1 The value of + cpp, int3 is cc p2 The value of-cpp, int4 is cc p2 + cpp; remember esc i4 Traversing the value range of i4 for the ith 4 element in the array esc (the value range of i4 is determined by the number of p meeting the condition), and sequentially adding the ith esc in the enterprise relationship matrix R i4 All elements of the line and the esc i4 All elements of the column are updated to 0, and the matrix R is taken as the deepening application matrix DA.
The beneficial effects of this step do: the method comprises the steps of calculating a central measuring value of an enterprise through coordinates of mobile equipment, obtaining the central measuring value of the enterprise through the number of staff of the enterprise and position information, judging whether the enterprise normally operates or not, updating a matrix R according to a judgment result, reflecting the connection relation of each enterprise better in the process of establishing the enterprise relation map, and improving the accuracy of the enterprise map.
The method for calculating the enterprise pivot measuring value of the current enterprise (the same as the method for calculating the enterprise pivot measuring value of the enterprise with the most number of staff) comprises the following steps:
the number of all employees in the current enterprise EQ is recorded as st1, the longitude and latitude coordinates of the mobile equipment of each employee in the current enterprise EQ are obtained, an array lalC is constructed by taking the longitude and latitude coordinates of the mobile equipment of each employee in the current enterprise EQ as a row (the array lalC is a two-dimensional array, and is st1, lines and 2 columns in total, the 1 st column is the longitude coordinate of the mobile equipment of each employee, and the 2 nd column is the latitude coordinate of the mobile equipment of each employee), and the lalC is recorded i1j1 Recording longitude and latitude coordinates of the enterprise position of the current enterprise EQ as (EQgC, EQtC) for the elements in the ith 1 th row and the jth 1 th column in the two-dimensional array lalC, and calculating to obtain the enterprise pivot measuring value of the current enterprise EQ according to the following formula:
。
because the association degrees among enterprises are different, some enterprises have invisible cooperative relationships (namely, the enterprises do not have connection relationships in the enterprise graph), the accuracy of the enterprise relationship graph is influenced, and in order to solve the problem and further improve the available reference value of the enterprise relationship graph, the invention provides a method for improving the matrix DA preferentially, which comprises the following steps:
preferably, the deepening application matrix DA further needs to be optimized by the following steps:
s301, recording equipment regression measure erd = [ ln (| cpp/(1-cpp) |)]Wherein, the]Is expressed as rounding up, [ ln (| cpp/(1-cpp) |)]Represents rounding up ln (| cpp/(1-cpp) |), and | cpp/(1-cpp) | represents the absolute value of cpp/(1-cpp), setting integer variablesThe quantity i, i ∈ [1, N ]]Traversing i in the value range of i, and sequentially (cc) in the coordinate system i1 ,cc i2 ) Constructing N circles C by using center of circle and erd as radius 1 ,C 2 ,…,C N Recording longitude and latitude coordinates of mobile equipment of all employees in all enterprises as coordinates to be processed, and marking the mobile equipment falling on the circle C 1 ,C 2 ,…,C N The internal coordinate to be processed is a stable coordinate, and C is calculated in sequence 1 , C 2 ,…, C N Obtaining N load point coordinates which are (x) in sequence by averaging all stable coordinates 1 , y 1 ),(x 2 , y 2 ),…,(x N , y N ) Connecting all load points according to the connection relation in the matrix DA (the matrix DA is an adjacent matrix, the subscripts of rows and columns are respectively the serial numbers of all enterprises, 0 represents that two enterprises are not connected, 1 represents that two enterprises are connected, the matrix DA stores the connection relation of all enterprises, the enterprise position information represents the enterprises, the array cc stores the enterprise position information, and the circle C 1 , C 2 ,…, C N Taking the elements in the array cc as the circle center, and simultaneously, the load points fall in the circle, so that all load coordinates are connected according to the connection relation among enterprises in the matrix DA, and the connection relation of the enterprises can be reflected); wherein ln refers to a natural logarithm;
s302, set variable j =1, go to S303;
s303, setting a time period [0, t ], creating a sequence of 0,1, \ 8230in the time period [0, t ] at intervals of every second, and turning to S304;
s304, recording (x) j0 , y j0 ), (x j1 , y j1 ),…, (x jt , y jt ) Are respectively a load point (x) j , y j ) At 0,1, \8230, the coordinate value at t, increasing j by 1, and going to S305;
s305, if j is less than or equal to N, turning to S304, and if j is greater than N, turning to S306;
s306, setting variable p =1, and setting variable q =0;
s307, the difference value between the longitude of the p-th load point at the q +1 th time and the longitude of the p-th load point at the q-th time is recorded as h pq ，h pq The calculation formula of (2) is as follows: h is a total of pq =x p(q+1) -x pq Increasing the value of q by 1, and going to S308;
s308, if the value of q is less than or equal to t, turning to S307, and if the value of q is greater than t, turning to S309;
s309, setting the value of q as 1, and turning to S310;
s310, recording variable A p0 The value of (a) is 1,
recording variable B p0 Has a value of N (y) p1 - y p0 )/ h p0 ，
Recording variable A pt The value of (b) is 0,
note the variable B pt Has a value of N (y) pt - y p(t-1) )/ h p(t-1) ，
Note A pq Has a value of h p(q-1) /(h p(q-1) +h p )，
Note B pq Is of value N x (1-A) pq )*( y pq - y p(q-1) )/ h p(q-1) + N*A pq *( y p(q+1) -y pq )/ h pq ，
Increment the value of q by 1, and proceed to S311 (set variable A) p0 、B p0 、A pt 、B pt To calculate the subsequent a pq 、b pq ）；
S311, if the value of q is smaller than t, turning to S310, and if the value of q is larger than or equal to t, turning to S312;
s312, setting the value of q to be 0, and turning to S313;
s313, recording the variable a p0 Has a value of (-A) p0 ) /2, recording variable b p0 Has a value of B p0 /2，
Note the variable a pq Has a value of (-A) pq )/((N-1)+(1- A pq )* A p(q-1) )，
Note the variable b pq Has a value of (B) pq -(1- A pq )* B p(q-1) )/((N-1)+(1- A pq )* A p(q-1) )，
Increment the value of q by 1, go to S314 (set variable a) pq 、b pq To calculate the subsequent m pq ）；
S314, if the value of q is less than or equal to t, turning to S313, and if the value of q is greater than t, turning to S315;
s315, making the value of q t-1 and recording m pt Has a value of b pt Recording the variable m pq Has a value of pq *m p(q+1) +b pq Decreasing the value of q by 1, and going to S316;
s316, if the value of q is more than or equal to 0, going to S315, and if the value of q is less than 0, going to S317;
s317, let q be 0 and let x be a function Crf pq (x) The argument of (c), function Crf pq (x) The calculation method is as follows:
Crf pq (x)=(1+N*(x-x p(q+1) )/(x pq -x p(q+1) ))*((x-x pq )/(x p(q+1) -x pq )) 2 *y p(q+1) +(x-x pq )*(x-x p(q+1) )/(x pq - x p(q+1) ) 2 *m pq ，
increase the value of q by 1, go to S318 (calculate function Crf) pq (x) Has the advantage that in the interval 0, t]In each interval, a broken line formed by discrete longitude and latitude coordinates is replaced by a continuous function, so that the accuracy of judging the association degree of the enterprise can be improved);
s318, if the value of q is smaller than t, turning to S317, and if the value of q is larger than or equal to t, turning to S319;
s319, if the value of p is less than or equal to N, increasing the value of p by 1, resetting q =0, proceeding to S307, and if the value of p is greater than N, proceeding to S320;
s320, setting the value of p as 1, setting the value of q as 0, and setting a variable k;
s321, let k be p +1
Go to S322;
s322, recording
Keeping the enterprise intimacy synergy EISV = | (Crp-sign)/(min { Crp, sign }) |, wherein min { Crp, sign } represents the minimum value between Crp and sign, and if the EISV value is less than 1, setting the k line in the matrix DA to be the kth lineThe element of p column and the element of the kth column of the p row are updated to 1, and the process goes to S323 (setting variable a) p0 、B p0 、A pt 、B pt 、a pq 、b pq 、m pq Calculating function Crf pq (x) The purpose of the method is to calculate the EISV, judge whether the enterprises are linked or not by calculating the EISV and update the EISV into a matrix DA so as to correct the enterprise relationship map);
s323, if the value of k is less than N, increasing the value of k by 1, and going to S322, and if the value of k is more than or equal to N, going to S324;
s324, if the value of p is smaller than N, increasing the value of p by 1, and turning to S321, and if the value of p is larger than or equal to N, turning to S325;
s325, if the value of q is less than t, resetting the value of p to be 1, increasing the value of q by 1, and turning to S321, and if the value of q is more than or equal to t, turning to S326;
s326, ending the program;
wherein t is set to [1,2] years, i.e., [31536000, 63072000] seconds.
The beneficial effect of this step does: because the association degrees among enterprises are different, some enterprises have invisible cooperative relationships to influence the accuracy of enterprise relationship maps, the enterprise intimacy cooperation quantity is obtained by calculating the positions of the enterprises and the position information of mobile equipment of staff in the enterprises, and the matrix DA is updated by the enterprise intimacy cooperation quantity EISV, so that the association degree among the enterprises can be more accurately indicated compared with the original matrix DA, the problem that the associated connecting lines among the enterprise maps are inaccurate is solved, and the reference value of the enterprise maps is further fully improved.
Further, in step S400, the enterprise relationship map is updated according to the deepened application matrix, and the specific steps are as follows:
s401, recording the row m1 of the element with the value of 0 in the application matrix, column n1, row m2 of the element with the value of 1 and column n2, canceling the connection between the enterprise with the number of m1 and the enterprise with the number of n1 in the enterprise relationship map according to the enterprise number relationship, and connecting the enterprise with the number of m2 and the enterprise with the number of n 2;
s402, circularly executing S401 until all elements in the deepened application matrix are traversed;
and S403, deleting isolated enterprises in the enterprise relationship graph, wherein the isolated enterprises are the enterprises which do not have connection relationships with other enterprises in the enterprise relationship graph.
Preferably, in step S400, the enterprise relationship map is updated according to the deepened application matrix, and the specific steps are as follows:
traversing each element in the deepened application matrix according to a depth-first search algorithm, disconnecting two enterprises corresponding to the element with the value of 0 in the enterprise relationship graph, and connecting two enterprises corresponding to the element with the value of 1 (the meaning of the two enterprises corresponding to the element is that in the enterprise relationship graph, the row and the column of the element correspond to the two enterprises according to the enterprise numbering relationship); after traversing, deleting isolated enterprises in the enterprise relationship graph, wherein the isolated enterprises are the enterprises which do not have connection relations with other enterprises in the enterprise relationship graph.
The invention also provides a construction system of the enterprise relationship map, which comprises the following steps: the system comprises a processor, a memory and a computer program stored in the memory and capable of running on the processor, wherein the processor executes the computer program to implement steps in a method for constructing an enterprise relationship graph, the system for constructing the enterprise relationship graph can run in computing devices such as a desktop computer, a notebook computer, a mobile phone, a portable phone, a tablet computer, a palmtop computer and a cloud data center, and can run in a system including, but not limited to, the processor, the memory and a server cluster, and the processor executes the computer program to run in units of the following systems:
the system comprises an atlas acquisition unit, a mapping unit and a mapping unit, wherein the atlas acquisition unit is used for acquiring an enterprise relation atlas of an enterprise;
the matrix construction unit is used for constructing an enterprise relation matrix according to the enterprise names and the enterprise relations in the enterprise relation map;
the matrix generating unit is used for generating a deepened application matrix according to the enterprise relation matrix;
and the map updating unit is used for updating the enterprise relation map according to the deepened application matrix and outputting the enterprise relation map.
The invention has the beneficial effects that: the method can improve the accuracy of the enterprise relationship maps, fully reflect the association degree among enterprises, intensify the weight value of enterprise information change in the construction process, effectively analyze the invisible relationship among the enterprises by coordinating the association of all the enterprises in the maps, correct and optimize the enterprise relationship maps in the database, and has instant help for analyzing the enterprise risk propagation paths and the operation activities of the enterprises.
Drawings
The above and other features of the present invention will become more apparent by describing in detail embodiments thereof with reference to the attached drawings in which like reference numerals designate the same or similar elements, it being apparent that the drawings in the following description are merely exemplary of the present invention and other drawings can be obtained by those skilled in the art without inventive effort, wherein:
FIG. 1 is a flow chart of a method for constructing an enterprise relationship graph;
fig. 2 is a system structural diagram of a building system of an enterprise relationship map.
Detailed Description
The conception, the specific structure and the technical effects produced by the present invention will be clearly and completely described in conjunction with the embodiments and the attached drawings, so as to fully understand the objects, the schemes and the effects of the present invention. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
In the description of the present invention, the meaning of a plurality of means is one or more, the meaning of a plurality of means is two or more, and larger, smaller, larger, etc. are understood as excluding the number, and larger, smaller, inner, etc. are understood as including the number. If the first and second are described for the purpose of distinguishing technical features, they are not to be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated or implicitly indicating the precedence of the technical features indicated.
Fig. 1 is a flowchart illustrating a method for constructing an enterprise relationship graph according to the present invention, and the method for constructing an enterprise relationship graph according to the embodiment of the present invention is described below with reference to fig. 1.
The invention provides a construction method of an enterprise relationship map, which comprises the following steps:
s100, acquiring an enterprise relation map of an enterprise to be queried;
s200, constructing an enterprise relation matrix according to the enterprise names and the enterprise relations in the enterprise relation map;
s300, generating a deepened application matrix according to the enterprise relation matrix;
s400, updating the enterprise relationship map according to the deepened application matrix, and outputting the updated enterprise relationship map;
the enterprise relationship graph comprises at least two enterprises, each enterprise comprises a plurality of employees, each employee holds a mobile device and is used for obtaining positioning information of the employees, and the positioning information comprises longitude and latitude coordinates.
Preferably, in step S100, the enterprise relationship graph of the enterprise to be queried is obtained, and the specific method is as follows: acquiring an enterprise relationship map of an enterprise to be inquired by an enterprise relationship map generation method in a patent with the patent number of CN107229756A, or acquiring the enterprise relationship map of the enterprise to be inquired by an enterprise inquiry website (an enterprise information inquiry tool);
further, in step S200, an enterprise relationship matrix is constructed according to the enterprise names and the enterprise relationships in the enterprise relationship map, and the specific steps are as follows: screening all enterprises from an enterprise relation map, recording the number of all enterprises as N, and using N numbers as 1,2, \8230, wherein N numbers all the enterprises in sequence to obtain enterprise numbering relation (each enterprise in the map corresponds to a number, and can be positioned to the corresponding enterprise according to the number), creating an all-zero matrix R with N rows and N columns, setting an integer variable i =1, and recording the value range of i as [1, N ];
and sequentially traversing i, wherein in the enterprise relationship graph, the numbers of all enterprises which are marked as i and have connection relations are R1, R2, \8230, rn is set with integer variables j, the values of j are R1, R2, \8230, rn is sequentially traversed j, the j is updated, the element of the ith row and the jth column in the matrix R is 1 (namely the relation among all the enterprises in the enterprise relationship graph is marked by 0 or 1), R1 is a transposed matrix of R, R + R1 is updated, and the matrix R is marked as an enterprise relationship matrix (also called an adjacent matrix for representing the connection relations of the elements in the graph).
Further, in step S300, a deepened application matrix is generated according to the enterprise relationship matrix, and the specific method includes: recording the number of enterprises with the largest number of employees as E and the number of all employees as st, acquiring the longitude and latitude coordinates of the mobile equipment of each employee in the E, sequentially constructing an array lal (the array lal is a two-dimensional array, the st row is 2, the 1 st column is the longitude coordinate of the mobile equipment of each employee, and the 2 nd column is the latitude coordinate of the mobile equipment of each employee) by taking the longitude and latitude coordinates of the mobile equipment of each employee in the E as a row, and recording the lal i1j1 Recording longitude and latitude coordinates of the enterprise position of E as (eg, et) for the elements of the ith 1 row and the jth 1 column in the two-dimensional array lal, and calculating by the following formula to obtain the enterprise pivot measured value
The enterprise central measuring value is used as an index for judging whether the association state of the enterprise is abnormal or not according to the unknown change trend of the staff;
acquiring longitude and latitude coordinates of each enterprise, sequentially constructing an array cc (the array cc is a two-dimensional array, and is N rows and 2 columns) by taking the longitude and latitude coordinates of each enterprise as one row according to the ascending order of enterprise numbers, sequentially constructing an array mdc (the array mdc is a two-dimensional array, and is N rows and 2 columns) by taking the average value of the longitude and latitude coordinates of mobile devices of all employees in each enterprise as one row, and recording the cc i2j2 For the element in the i2 th row and the j2 th column in the array cc, mdc is written i3j3 The row i3 and column j3 elements in the array mdc, i2, j2=1,2, \ 8230;, N,i3, j3=1,2, \ 8230, N, setting the integer variable p =1, p e [1, N ∈]Sequentially traversing p, storing the values of all p that satisfy the condition con1 and satisfy the condition con2 in an array esc,
wherein, the condition con1 indicates that the enterprise pivot value of the p-th element in the group cc is less than or equal to cpp, or the condition con1 indicates that the enterprise pivot value of the current enterprise (i.e. the enterprise corresponding to the p-th element in the group cc) is less than or equal to ccGV, and the condition con2 indicates mdc p1 ∈[cc p1 -K1, cc p1 +K1]And mdc p2 ∈[cc p2 -K2, cc p2 +K2](ii) a ccGV is the average of the enterprise pivot measurements of each enterprise in the array cc; k1 is the difference between KT1 and KST 1; k2 is the difference between KT2 and KST 2; KT1 is the average value of each element in the 1 st row in the array lal, and KST1 is the average value of each element in the 1 st row of the array mdc corresponding to the current enterprise; KT2 is an average value of each element in the 2 nd column of the array lal, and KST2 is an average value of each element in the 2 nd column of the array mdc corresponding to the current enterprise;
or, wherein condition con1 refers to mdc p1 ∈[int1,int2]Condition con2 means mdc p2 ∈[int3,int4]Int1 has a value cc p1 The value of-cpp, int2 is cc p1 + cpp, int3 has a value cc p2 The value of-cpp, int4 is cc p2 + cpp; remember esc i4 Traversing the value range of i4 for the ith 4 element in the array esc (the value range of i4 is determined by the number of p meeting the condition), and sequentially adding the ith esc element in the enterprise relationship matrix R i4 All elements of the line and the esc i4 All elements of the column are updated to 0, and the matrix R is taken as the deepening application matrix DA.
The method for calculating the enterprise pivot measuring value of the current enterprise (the same as the method for calculating the enterprise pivot measuring value of the enterprise with the most number of staff) comprises the following steps:
the number of all employees in the current enterprise EQ is recorded as st1, the longitude and latitude coordinates of the mobile equipment of each employee in the current enterprise EQ are obtained, and an array lalC is constructed by taking the longitude and latitude coordinates of the mobile equipment of each employee in the current enterprise EQ as a row (the array lalC is a two-dimensional array, and is st1 row and 2 columns in total, and the 1 st column is the longitude of the mobile equipment of each employeeCoordinates, column 2 as latitude coordinates of each employee's mobile device), talc) i1j1 Recording longitude and latitude coordinates of the enterprise position of the current enterprise EQ as (EQgC, EQtC) for the elements in the ith 1 line and the jth 1 column in the two-dimensional array lalC, and calculating the enterprise pivot measuring value of the current enterprise EQ according to the following formula:
。
because the association degrees among enterprises are different, the invisible relationship exists in part of enterprises, the accuracy of the enterprise relationship maps is influenced, and in order to solve the problem and further improve the available reference value of the enterprise relationship maps, the invention provides a method for improving the application matrix DA more preferentially, which comprises the following steps:
preferably, the deepening application matrix DA further needs to be optimized by the following steps:
s301, recording equipment regression measure erd = [ ln (| cpp/(1-cpp) |)]Wherein [ 2], []Is expressed as rounding up, [ ln (| cpp/(1-cpp) |)]Represents rounding up ln (| cpp/(1-cpp) |), and | cpp/(1-cpp) | represents the absolute value of cpp/(1-cpp), and sets the integer variable i, i ∈ [1, N | ]]Traversing i in the value range of i, and sequentially (cc) in the coordinate system i1 ,cc i2 ) Constructing N circles C by taking circle center and erd as radius 1 ,C 2 ,…,C N Recording longitude and latitude coordinates of mobile equipment of all employees in all enterprises as coordinates to be processed, and marking the mobile equipment falling on the circle C 1 ,C 2 ,…,C N The internal coordinate to be processed is a stable coordinate, and C is calculated in sequence 1 , C 2 ,…, C N The average value of all stable coordinates in the load point coordinate system is obtained, and N load point coordinates are obtained and are sequentially (x) 1 , y 1 ),(x 2 , y 2 ),…,(x N , y N ) Connecting all load points according to the connection relation in the matrix DA (the matrix DA is a 01 matrix, the subscripts of rows and columns are respectively the serial numbers of all enterprises, 0 represents that two enterprises are not connected, 1 represents that two enterprises are connected, the matrix DA stores the connection relation of all enterprises, the position information of the enterprises represents the enterprises, the array cc stores the position information of the enterprises, and the circle C 1 , C 2 ,…, C N Taking the elements in the array cc as the circle center, and simultaneously, the load points fall in the circle, so that all load coordinates are connected according to the connection relation among enterprises in the matrix DA, and the connection relation of the enterprises can be reflected);
s302, set variable j =1, go to S303;
s303, setting a time period [0, t ], and establishing a number array 0,1, \8230inthe time period [0, t ] at intervals of one second, wherein t is transferred to S304;
s304, recording (x) j0 , y j0 ), (x j1 , y j1 ),…, (x jt , y jt ) Are respectively a load point (x) j , y j ) At 0,1, \8230, the coordinate value at t, increasing j by 1, and going to S305;
s305, if j is less than or equal to N, turning to S304, and if j is greater than N, turning to S306;
s306, setting variable p =1, and setting variable q =0;
s307, the difference value between the longitude of the p-th load point at the q +1 th time and the longitude of the p-th load point at the q-th time is recorded as h pq ，h pq The calculation formula of (c) is: h is a total of pq =x p(q+1) -x pq Increasing the value of q by 1, and going to S308;
s308, if the value of q is less than or equal to t, turning to S307, and if the value of q is greater than t, turning to S309;
s309, making the value of q be 1, and turning to S310;
s310, recording variable A p0 Has a value of 1, and records the variable B p0 Is value of N x (y) p1 - y p0 )/ h p0 Recording the variable A pt Is 0, and the variable B is recorded pt Is value of N x (y) pt - y p(t-1) )/ h p(t-1) Recording the variable A pq Has a value of h p(q-1) /(h p(q-1) +h p ) Record the variable B pq Is of value N x (1-A) pq )*( y pq - y p(q-1) )/ h p(q-1) + N*A pq *( y p(q+1) -y pq )/ h pq ，
Increasing the value of q by 1, and going to S311;
s311, if the value of q is smaller than t, turning to S310, and if the value of q is larger than or equal to t, turning to S312;
s312, setting the value of q to be 0, and turning to S313;
s313, recording the variable a p0 Has a value of (-A) p0 ) /2, recording variable b p0 Has a value of B p0 /2，
Note the variable a pq Has a value of (-A) pq )/((N-1)+(1- A pq )* A p(q-1) )，
Recording variable b pq Has a value of (B) pq -(1- A pq )* B p(q-1) )/((N-1)+(1- A pq )* A p(q-1) )，
Increasing the value of q by 1, and going to S314;
s314, if the value of q is less than or equal to t, turning to S313, and if the value of q is greater than t, turning to S315;
s315, let q be t-1, note m pt Has a value of b pt Remember m pq Has a value of pq *m p(q+1) +b pq Subtracting 1 from the value of q, and going to S316;
s316, if the value of q is more than or equal to 0, going to S315, and if the value of q is less than 0, going to S317;
s317, let q be 0 and let x be a function Crf pq (x) The argument of (c), function Crf pq (x) The calculation method of (A) is as follows: crf pq (x)=
(1+N*(x-x p(q+1) )/(x pq - x p(q+1) ))*((x-x pq )/(x p(q+1) - x pq )) 2 *y p(q+1) +(x-x pq )*(x-x p(q+1) )/(x pq - x p(q+1) ) 2 *m pq ，
Increasing the value of q by 1, and going to S318;
s318, if the value of q is smaller than t, turning to S317, and if the value of q is larger than or equal to t, turning to S319;
s319, if the value of p is less than or equal to N, increasing the value of p by 1, resetting q =0, proceeding to S307, and if the value of p is greater than N, proceeding to S320;
s320, setting the value of p to be 1, setting the value of q to be 0, and setting a variable k;
s321, let k be p +1
Go to S322;
s322, recording
Keeping the enterprise intimacy synergy EISV = | (Crp-sign)/(min { Crp, sign }) |, wherein min { Crp, sign } represents the minimum value between Crp and sign, and if the EISV value is less than 1, updating the element in the p-th row and the element in the k-th column in the k-th row in the matrix DA to be 1, and turning to S323; judging whether the enterprises are connected or not by calculating EISV, and updating the EISV into a matrix DA so as to correct the enterprise relationship map;
s323, if the value of k is less than N, increasing the value of k by 1, and going to S322, and if the value of k is more than or equal to N, going to S324;
s324, if the value of p is smaller than N, increasing the value of p by 1, and turning to S321, and if the value of p is larger than or equal to N, turning to S325;
s325, if the value of q is less than t, resetting the value of p to be 1, increasing the value of q by 1, and turning to S321, and if the value of q is more than or equal to t, turning to S326;
s326, ending the program;
wherein t is set to [1,2] years, i.e., [31536000, 63072000] seconds.
Further, in step S400, the enterprise relationship map is updated according to the deepened application matrix, and the specific steps are as follows:
s401, recording the row m1 of the element with the value of 0 in the application matrix, column n1, row m2 of the element with the value of 1 and column n2, canceling the connection between the enterprise with the number of m1 and the enterprise with the number of n1 in the enterprise relationship map according to the enterprise number relationship, and connecting the enterprise with the number of m2 and the enterprise with the number of n 2;
s402, circularly executing S401 until all elements in the deepened application matrix are traversed;
and S403, deleting isolated enterprises in the enterprise relationship graph, wherein the isolated enterprises are the enterprises which do not have connection relationships with other enterprises in the enterprise relationship graph.
Preferably, in step S400, the enterprise relationship map is updated according to the deepened application matrix, and the specific steps are as follows:
traversing each element in the deepened application matrix according to a depth-first search algorithm, disconnecting two enterprises corresponding to the element with the value of 0 in the enterprise relationship graph, and connecting two enterprises corresponding to the element with the value of 1 (the meaning of the two enterprises corresponding to the element is that in the enterprise relationship graph, the row and the column of the element correspond to the two enterprises according to the enterprise numbering relationship); after traversing, deleting isolated enterprises in the enterprise relationship graph, wherein the isolated enterprises are the enterprises which do not have connection relations with other enterprises in the enterprise relationship graph.
As shown in fig. 2, the system for constructing an enterprise relationship graph according to an embodiment of the present invention includes: a processor, a memory and a computer program stored in the memory and executable on the processor, the processor implementing the steps in the above embodiment of the method for building an enterprise relationship graph when executing the computer program, the processor executing the computer program to run in the units of the following system:
the system comprises an atlas acquisition unit, a mapping unit and a mapping unit, wherein the atlas acquisition unit is used for acquiring an enterprise relation atlas of a certain enterprise;
the matrix construction unit is used for constructing an enterprise relation matrix according to the enterprise names and the enterprise relations in the enterprise relation map;
the matrix generating unit is used for generating a deepened application matrix according to the enterprise relation matrix;
and the map updating unit is used for updating the enterprise relation map according to the deepened application matrix and outputting the enterprise relation map.
The construction system of the enterprise relationship graph can be operated in computing equipment such as a desktop computer, a notebook computer, a palm computer, a cloud data center and the like. The system for constructing the enterprise relationship graph comprises, but is not limited to, a processor and a memory. Those skilled in the art will appreciate that the example is only an example of the method and system for constructing the enterprise relationship graph, and does not constitute a limitation to the method and system for constructing the enterprise relationship graph, and may include more or less components than the other, or combine some components, or different components, for example, the system for constructing the enterprise relationship graph may further include input and output devices, network access devices, buses, and the like.
The Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete component Gate or transistor logic, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor, etc., and the processor is a control center of the building system of the enterprise relationship map and connects the sub-areas of the building system of the whole enterprise relationship map by using various interfaces and lines.
The memory can be used for storing the computer program and/or the module, and the processor realizes various functions of the method and the system for constructing the enterprise relationship graph by operating or executing the computer program and/or the module stored in the memory and calling the data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
The invention provides a method and a system for constructing an enterprise relationship map, which are used for acquiring the enterprise relationship map of an enterprise to be inquired, constructing an enterprise relationship matrix according to an enterprise name and an enterprise relationship in the enterprise relationship map, generating a deepened application matrix according to the enterprise relationship matrix, updating the enterprise relationship map according to the deepened application matrix and outputting the enterprise relationship map. Although the present invention has been described in considerable detail and with reference to certain illustrated embodiments, it is not intended to be limited to any such details or embodiments or any particular embodiment, so as to effectively encompass the intended scope of the invention. Furthermore, the foregoing describes the invention in terms of embodiments foreseen by the inventor for which an enabling description was available, notwithstanding that insubstantial modifications of the invention, not presently foreseen, may nonetheless represent equivalent modifications thereto.
Claims (5)
1. A method for constructing an enterprise relationship graph is characterized by comprising the following steps:
s100, acquiring an enterprise relation map of an enterprise to be queried;
s200, constructing an enterprise relation matrix according to the enterprise names and the enterprise relations in the enterprise relation map;
s300, generating a deepened application matrix according to the enterprise relation matrix;
s400, updating the enterprise relation map according to the deepened application matrix, and outputting the updated enterprise relation map;
in step S300, a deepened application matrix is generated according to the enterprise relationship matrix, and the specific method includes: recording the number of enterprises with the largest number of employees as E and the number of all employees as st, acquiring the longitude and latitude coordinates of the mobile equipment of each employee in the E, constructing an array lal by taking the longitude and latitude coordinates of the mobile equipment of each employee in the E as a row in sequence, and recording the lal i1j1 The longitude and latitude coordinates of the enterprise position of E are (eg, et) for the elements in the ith 1 th row and the jth column in the two-dimensional array lal, and the enterprise pivot measurement value cpp is obtained by the following calculation:
acquiring longitude and latitude coordinates of each enterprise, sequentially constructing an array cc by taking the longitude and latitude coordinates of each enterprise as a line according to the ascending order of enterprise numbers, sequentially constructing an array mdc by taking the average value of the longitude and latitude coordinates of mobile equipment of all employees in each enterprise as a line, and recording the cc i2j2 For the element in the i2 th row and the j2 th column in the array cc, mdc is used i3j3 For the element in row i3 and column j3 in array mdc, i2, j2=1,2, \ 8230, N, i3, j3=1,2, \ 8230, N, the integer variable p =1, p ∈ [1, N]P is traversed sequentially, storing the values of all p that satisfy the condition con1 and satisfy the condition con2 in an array esc,
wherein, the condition con1 indicates that the enterprise pivot value of the corresponding enterprise of the pth element in the group cc is less than or equal to cpp, or, the condition con1 indicates that the enterprise pivot value of the current enterprise is less than or equal to ccGV, and the condition con2 indicates mdc p1 ∈[cc p1 -K1, cc p1 +K1]And mdc p2 ∈[cc p2 -K2, cc p2 +K2](ii) a ccGV is the average of the enterprise pivot measurements of each enterprise in array cc; k1 is the difference between KT1 and KST 1; k2 is the difference between KT2 and KST 2; KT1 is the average value of each element in the 1 st row in the array lal, and KST1 is the average value of each element in the 1 st row of the array mdc corresponding to the current enterprise; KT2 is the average value of each element in the 2 nd row in the array lal, and KST2 is the average value of each element in the 2 nd row in the array mdc corresponding to the current enterprise;
alternatively, condition con1 refers to mdc p1 ∈[int1,int2]Condition con2 means mdc p2 ∈[int3,int4]Int1 has a value cc p1 The value of-cpp, int2 is cc p1 + cpp, int3 has a value cc p2 The value of-cpp, int4 is cc p2 +cpp；
Remember esc i4 Traversing i4 for the ith 4 element in the array esc, and sequentially enabling the ith esc in the enterprise relation matrix R i4 All elements of the line and the esc i4 All elements of the column are updated to be 0, and the enterprise relation matrix R is recorded as a deepening application matrix DA.
2. The method as claimed in claim 1, wherein the enterprise relationship graph includes at least two enterprises, each enterprise includes a plurality of employees, each employee holds a mobile device for obtaining location information of the employee, and the location information includes longitude and latitude coordinates.
3. The method for constructing an enterprise relationship graph according to claim 1, wherein in step S200, an enterprise relationship matrix is constructed according to the enterprise names and the enterprise relationships in the enterprise relationship graph, and the specific steps are as follows: screening all enterprises from an enterprise relationship map, recording the number of all enterprises as N, and using N numbers as 1,2, \ 8230, wherein N numbers all the enterprises in sequence to obtain enterprise numbering relations, creating an all-zero matrix R with N rows and N columns, setting an integer variable i =1, and recording the value range of i as [1, N ];
sequentially traversing i, in the enterprise relationship map, setting the numbers of all enterprises which are marked as the connection relation with the enterprise with the number i as R1, R2, \8230, setting integer variables j, and marking the values of j as R1, R2, \8230, sequentially traversing j, updating the element of the jth row and the jth column in the matrix R as 1, marking R1 as a transposed matrix of R, updating R as R + R1, and marking the matrix R as an enterprise relationship matrix.
4. The method for constructing the enterprise relationship graph according to claim 1, wherein in step S400, the enterprise relationship graph is updated according to the deepened application matrix, and the specific steps are as follows:
s401, deepening the row m1 where the element with the value of 0 in the application matrix is located, column n1, row m2 where the element with the value of 1 is located, column n2, canceling the connection between the enterprise with the number of m1 and the enterprise with the number of n1 in the enterprise relationship map according to the enterprise number relationship, and connecting the enterprise with the number of m2 and the enterprise with the number of n 2;
s402, circularly executing S401 until all elements in the deepened application matrix are traversed;
and S403, deleting isolated enterprises in the enterprise relationship graph, wherein the isolated enterprises are the enterprises which do not have connection relationships with other enterprises in the enterprise relationship graph.
5. The method for constructing the enterprise relationship graph according to claim 1, wherein in step S400, the enterprise relationship graph is updated according to the deepened application matrix, and the specific steps are as follows: traversing each element in the deepened application matrix according to a depth-first search algorithm, disconnecting two enterprises corresponding to the element with the value of 0 and connecting two enterprises corresponding to the element with the value of 1 in the enterprise relationship map; after the traversal is completed, the isolated enterprises, namely the enterprises which have no connection relation with other enterprises in the enterprise relation graph, are deleted from the enterprise relation graph.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210989518.7A CN115080706B (en) | 2022-08-18 | 2022-08-18 | Method and system for constructing enterprise relationship map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210989518.7A CN115080706B (en) | 2022-08-18 | 2022-08-18 | Method and system for constructing enterprise relationship map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115080706A CN115080706A (en) | 2022-09-20 |
| CN115080706B true CN115080706B (en) | 2022-11-08 |
Family
ID=83245213
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210989518.7A Active CN115080706B (en) | 2022-08-18 | 2022-08-18 | Method and system for constructing enterprise relationship map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115080706B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110968701A (en) * | 2019-11-05 | 2020-04-07 | 量子数聚（北京）科技有限公司 | Relationship map establishing method, device and equipment for graph neural network |
| WO2021213448A1 (en) * | 2020-04-24 | 2021-10-28 | 支付宝(杭州)信息技术有限公司 | Determination of map for information recommendation |
| CN113704496A (en) * | 2021-08-31 | 2021-11-26 | 平安科技（深圳）有限公司 | Medical knowledge map repairing method and device, computer equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108763507A (en) * | 2018-05-30 | 2018-11-06 | 北京百度网讯科技有限公司 | Enterprise's incidence relation method for digging and device |
-
2022
- 2022-08-18 CN CN202210989518.7A patent/CN115080706B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110968701A (en) * | 2019-11-05 | 2020-04-07 | 量子数聚（北京）科技有限公司 | Relationship map establishing method, device and equipment for graph neural network |
| WO2021213448A1 (en) * | 2020-04-24 | 2021-10-28 | 支付宝(杭州)信息技术有限公司 | Determination of map for information recommendation |
| CN113704496A (en) * | 2021-08-31 | 2021-11-26 | 平安科技（深圳）有限公司 | Medical knowledge map repairing method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115080706A (en) | 2022-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11748379B1 (en) | Systems and methods for generating and implementing knowledge graphs for knowledge representation and analysis | |
| CN106844781B (en) | Data processing method and device | |
| Pannatier | VARIOWIN: Software for spatial data analysis in 2D | |
| US20060101048A1 (en) | KStore data analyzer | |
| US20090105984A1 (en) | Methods and Apparatus for Dynamic Data Transformation for Visualization | |
| US11593322B1 (en) | Collaborative data mapping system | |
| JP5365254B2 (en) | Area check program, area check method and area check apparatus | |
| Zandbergen | Influence of street reference data on geocoding quality | |
| CN110008193A (en) | Data normalization method and device | |
| CN115080706B (en) | Method and system for constructing enterprise relationship map | |
| CN112632052B (en) | Heterogeneous data sharing method and intelligent sharing system | |
| CN111581197B (en) | Method and device for sampling and checking data table in data set | |
| WO2021147405A1 (en) | Customer-service statement quality detection method and related device | |
| CN116467896B (en) | Orthodontic treatment effect simulation system and method | |
| CN111949845A (en) | Method, apparatus, computer device and storage medium for processing mapping information | |
| CN111062626A (en) | Capability level evaluation method, device, equipment and storage medium | |
| CN108959381B (en) | Data management method and device and electronic equipment | |
| Cui et al. | A model-free Fourier cosine method for estimating the risk-neutral density | |
| Chen et al. | On Horn’s approximation to the sampling distribution of eigenvalues from random correlation matrices in parallel analysis | |
| CN113159504A (en) | Risk assessment method based on big data analysis, computer device and readable storage medium | |
| CN111859985A (en) | AI customer service model testing method, device, electronic equipment and storage medium | |
| CN111563137A (en) | Analysis method and system for coincident track | |
| CN114998560B (en) | Positive fault section three-dimensional attribute-based related wrinkle processing method and system | |
| CN112651764A (en) | Target user identification method, device, equipment and storage medium | |
| Lehmann | A universal and robust computation procedure for geometric observations |
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 |