CN110533524B - Offline restoration method and system based on enterprise relationship map - Google Patents

Offline restoration method and system based on enterprise relationship map Download PDF

Info

Publication number
CN110533524B
CN110533524B CN201910665140.3A CN201910665140A CN110533524B CN 110533524 B CN110533524 B CN 110533524B CN 201910665140 A CN201910665140 A CN 201910665140A CN 110533524 B CN110533524 B CN 110533524B
Authority
CN
China
Prior art keywords
enterprise
weight
manager
person
contact
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
Application number
CN201910665140.3A
Other languages
Chinese (zh)
Other versions
CN110533524A (en
Inventor
李晨光
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ping An Technology Shenzhen Co Ltd
Original Assignee
Ping An Technology Shenzhen Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ping An Technology Shenzhen Co Ltd filed Critical Ping An Technology Shenzhen Co Ltd
Priority to CN201910665140.3A priority Critical patent/CN110533524B/en
Publication of CN110533524A publication Critical patent/CN110533524A/en
Application granted granted Critical
Publication of CN110533524B publication Critical patent/CN110533524B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/03Credit; Loans; Processing thereof
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

The embodiment of the invention provides an offline repairing method based on an enterprise relationship graph, which comprises the following steps: establishing an enterprise relation map according to the information of the target enterprise where the loss contact person is located; determining a first weight of the related enterprise and a second weight of each manager in the related enterprise according to the enterprise relationship graph; respectively calculating the association degree of each manager and the unconnected persons according to the first weight and the second weight; and sequencing each manager according to the sequence of the association degrees from high to low according to the calculation result of the association degrees, and sequentially sending the information of the person who is searched for the loss of contact to the manager terminal corresponding to the association degrees according to the sequence of the association degrees from high to low so as to provide information for the person who is searched for the loss of contact and repair the contact with the person who is lost contact. By the embodiment of the invention, the contact with the lost loan personnel can be quickly repaired, and the person searching efficiency is greatly improved.

Description

Offline restoration method and system based on enterprise relationship map
Technical Field
The embodiment of the invention relates to the field of big data, in particular to an offline repair method, an offline repair system, computer equipment and a readable storage medium based on an enterprise relationship graph.
Background
In the financial industry, after loan, the loan officer often loses contact, and at the moment, rescue repair contact work needs to be carried out on the related loan loss officer. In the prior art, a financial company provides relevant encrypted information to a telecom operator, and the telecom operator determines whether a telephone used by the loser is recently available by searching a respective database, and tries to make a telephone call to the loser when the telephone used by the loser is recently available. However, the method has great contingency and high cost, and when the telephone is dialed, the loan unlink person changes the telephone again, so that the loan person loses contact for the second time.
Therefore, the invention aims to solve the problem of how to effectively repair the contacts with the offline loan personnel, mainly the contacts of the offline loan enterprise personnel.
Disclosure of Invention
In view of this, it is necessary to provide an offline loan repair method, an offline loan repair system, a computer device, and a computer-readable storage medium based on an enterprise relationship graph, which can quickly repair the contact with the offline loan personnel and greatly improve the efficiency of searching people.
In order to achieve the above object, an embodiment of the present invention provides an offline repair method based on an enterprise relationship graph, where the method includes:
establishing an enterprise relation map according to the information of the target enterprise where the loss contact person is located;
determining a first weight of the related enterprises and a second weight of each manager according to the enterprise relationship map;
respectively calculating the association degree of each manager and the unconnected persons according to the first weight and the second weight;
according to the calculation result of the association degree, sequencing each manager according to the sequence of the association degree from high to low, and sequentially sending the information of the person who is searched for the loss of contact to the manager terminal corresponding to the association degree according to the sequence of the association degree from high to low so as to provide information for the person who is searched for the loss of contact to repair the contact with the person who is searched for the loss of contact;
when first feedback information which is sent by a first manager terminal with high association degree and succeeds in searching for the loss of contact person is received, stopping sending the loss of contact person information to a second manager terminal with low association degree; and
and when second feedback information sent by the first manager terminal and used for finding the lost connection personnel fails or third feedback information sent by the first manager terminal is not received after the preset time, the lost connection personnel information is continuously sent to the second manager terminal.
Optionally, the step of establishing an enterprise relationship map according to information of a target enterprise where the person without contact is located further includes:
acquiring the information;
acquiring the business transaction situation of the target enterprise according to the information, wherein the business transaction situation at least comprises a transaction amount, a transaction frequency and/or a supply and sale relationship, related enterprises and identities and relationships among a plurality of managers of the related enterprises, wherein the identities comprise enterprise legal persons, directors and financial supervisors; and
and establishing the enterprise map according to the business transaction traffic condition.
Optionally, the step of determining the first weight of the related enterprise and the second weight of each manager according to the enterprise relationship graph further includes the steps of:
when the first weight is determined according to the transaction amount, the calculation formula of the first weight is
Figure BDA0002139850980000021
(i>0 and is an integer), wherein W i First weight, W, representing Business i 0 Represents the basis weight, is a constant, m i Represents the transaction amount of the target business with the business i, and M represents the total transaction amount of the target business with the other businesses.
Optionally, the step of determining the first weight of the related enterprise and the second weight of each manager according to the enterprise relationship graph further includes the steps of:
when the first weight is determined according to the transaction amount, the calculation formula of the first weight is
Figure BDA0002139850980000031
(i>0 and is an integer), wherein W i A first weight representing enterprise i, S represents a basis weight, which is a constant, m i Representing the transaction amount of the target business with the business i, and M representing the total transaction amount of the target business with the other businesses.
Optionally, the step of determining the first weight of the related enterprise and the second weight of each manager according to the enterprise relationship graph further includes the steps of:
when the first weight is determined according to the transaction frequency, the calculation formula of the first weight is
Figure BDA0002139850980000032
(j>0 and is an integer), wherein W j First weight, W, representing Enterprise j 0 Represents the basis weight as a constant, f j Representing the transaction frequency of the target business with the business j, and F representing the total transaction frequency of the target business with the other businesses.
Optionally, the step of determining the first weight of the related enterprise and the second weight of each manager according to the enterprise relationship graph further includes the steps of:
when the first weight is determined according to the supply and marketing relationship, acquiring the supply and marketing level of the related enterprise;
matching the supply and marketing grades with preset supply and marketing grades in a supply and marketing grade weight table stored in a database; and
and when the matching is successful, outputting the weight corresponding to the supply and marketing level to obtain the first weight.
Optionally, the step of calculating the association degree between each manager and the unconnected person according to the first weight and the second weight further includes:
and calculating the first weight and the second weight according to a preset calculation formula to obtain the association degree, wherein the calculation formula is D = W Q, D represents the association degree of a manager and the loss contact person, W represents the first weight of the enterprise where the manager is located, and Q represents the second weight of the loss contact person found by the manager.
In order to achieve the above object, an embodiment of the present invention further provides an offline repair system, including:
the establishing module is used for establishing an enterprise relation map according to the information of the target enterprise where the loss contact person is located;
the determining module is used for determining a first weight of the related enterprise and a second weight of each manager in the related enterprise according to the enterprise relationship map;
the calculation module is used for calculating the association degree of each manager and the loss-of-contact person according to the first weight and the second weight;
the repairing module is used for sequencing each manager according to the sequence of the association degrees from high to low according to the calculation result of the association degrees, sequentially sending the information of the person who is searched for the lost connection to the manager terminal corresponding to the association degrees according to the sequence of the association degrees from high to low, and providing information for the person who is searched for the lost connection so as to repair the contact with the person who is lost connection;
the repairing module is further used for stopping sending the information of the loss of contact staff to a second manager terminal with a low association degree when first feedback information which is sent by a first manager terminal with a high association degree and used for searching for the success of the loss of contact staff is received; and
the repairing module is further used for continuously sending the information of the person losing the contact to the second management person terminal when second feedback information sent by the first management person terminal and used for finding the failure of the person losing the contact is received or third feedback information sent by the first management person terminal is not received after the preset time.
Optionally, the establishing module is further configured to:
acquiring the information;
acquiring the business transaction situation of the target enterprise according to the information, wherein the business transaction situation at least comprises a transaction amount, a transaction frequency and/or a supply and sale relationship, related enterprises and identities and relationships among a plurality of managers of the related enterprises, wherein the identities comprise enterprise legal persons, directors and financial supervisors; and
and establishing the enterprise map according to the business transaction traffic condition.
Optionally, the determining module is further configured to calculate the first weight according to a formula of the first weight when the first weight is determined according to the transaction amount
Figure BDA0002139850980000041
(i>0 and is an integer), wherein W i First weight, W, representing enterprise i 0 Represents the basis weight, is a constant, m i Represents the transaction amount of the target business with the business i, and M represents the total transaction amount of the target business with the other businesses.
Optionally, the determining module is further configured to, when the first weight is determined according to the transaction amount, calculate the first weight according to a formula of
Figure BDA0002139850980000051
(i>0 and is an integer), wherein W i A first weight representing business i, S represents a basis weight, is a constant, m i Representing the transaction amount of the target business with the business i, and M representing the total transaction amount of the target business with the other businesses.
Optionally, the determining module is further configured to calculate the first weight according to the formula when the first weight is determined according to the transaction frequency
Figure BDA0002139850980000052
(j>0 and is an integer), wherein W j First weight, W, representing Enterprise j 0 Represents the basis weight as a constant, f j Representing the transaction frequency of the target business with the business j, and F representing the total transaction frequency of the target business with the other businesses.
Optionally, the determining module is further configured to:
when the first weight is determined according to the supply and marketing relationship, acquiring the supply and marketing level of the related enterprise;
matching the supply and marketing grades with preset supply and marketing grades in a supply and marketing grade weight table stored in a database; and
and when the matching is successful, outputting the weight corresponding to the supply and sale grade to obtain the first weight.
Optionally, the calculation module is further configured to calculate the first weight and the second weight according to a preset calculation formula to obtain the association degree, where the calculation formula is D = W × Q, where D represents the association degree between a manager and the loss contact person, W represents the first weight of the enterprise where the manager is located, and Q represents the second weight when the manager finds the loss contact person.
In order to achieve the above object, an embodiment of the present invention further provides a computer device, a memory of the computer device, a processor, and a computer program stored on the memory and executable on the processor, where when executed by the processor, the computer program implements the steps of the method for repairing an offline connection based on an enterprise relationship graph as described above.
To achieve the above object, an embodiment of the present invention further provides a computer-readable storage medium, in which a computer program is stored, where the computer program is executable by at least one processor, so as to cause the at least one processor to execute the steps of the method for repairing an offline connection based on an enterprise relationship graph as described above.
According to the method, the system, the computer equipment and the computer readable storage medium for repairing the loss connection based on the enterprise relation graph, the business traffic situation of a target enterprise is obtained according to the information of the target enterprise where the loss connection personnel are located, the relation between the relevant enterprise and a plurality of management personnel of the relevant enterprise is obtained according to the business traffic situation, the enterprise relation graph is established, the first weight of the relevant enterprise is determined according to the transaction amount and/or the supply and sales relation, the second weight of each management personnel is determined according to the identity of each management personnel, the association degree of each management personnel is respectively calculated according to the first weight and the second weight, each management personnel is sequenced from top to bottom according to the association degree, and the information of the searched loss connection personnel is sequentially sent to each management personnel so as to provide information for the searched loss connection personnel to repair the contact with the loss connection personnel. By the embodiment of the invention, the contact with the offline loan personnel can be quickly repaired, and the person searching efficiency is greatly improved.
Drawings
Fig. 1 is a flowchart illustrating steps of an offline repair method based on an enterprise relationship graph according to an embodiment of the present invention.
Fig. 2 is a schematic hardware architecture diagram of a computer device according to a second embodiment of the present invention.
Fig. 3 is a schematic diagram of program modules of a system for performing offline repair according to a third embodiment of the present invention.
Reference numerals:
Figure BDA0002139850980000061
/>
Figure BDA0002139850980000071
the implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the description relating to "first", "second", etc. in the present invention is for descriptive purposes only and is not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present invention.
Example one
Referring to fig. 1, a flowchart illustrating steps of an offline repairing method based on an enterprise relationship graph according to an embodiment of the present invention is shown. It is to be understood that the flow charts in the embodiments of the present method are not intended to limit the order in which the steps are performed. It should be noted that the present embodiment is exemplarily described with the computer device 2 as an execution subject. The method comprises the following specific steps:
and S100, establishing an enterprise relation map according to the information of the target enterprise where the loss contact person is located.
In a preferred embodiment, if the lost contact person is the user a, the information of the enterprise where the user a is located is obtained as an enterprise a through the information of the user a stored in the database, and the enterprise a is obtained to have business transactions with an enterprise B, an enterprise C, an enterprise D and an enterprise E. The invoice information of the enterprise A is obtained to obtain relevant enterprise information (such as suppliers and sellers) related to the enterprise A, a plurality of manager information (such as enterprise legal persons, directors, financial chief and the like) of the relevant enterprise, supply and sale relations, transaction amount and transaction frequency. And establishing an enterprise relation map by the related enterprise information and the plurality of manager information according to the supply and marketing relation. For example: establishing an enterprise relationship map, wherein a supplier of an enterprise A comprises an enterprise B and an enterprise C, a seller comprises an enterprise D, and the enterprise A comprises: a legal person a1, a financial chief manager b1 and a board of directors c1; the enterprise B comprises: a legal person a2, a financial chief manager b2 and a board of directors c2; the enterprise C includes: a legal person a3, a financial chief manager b3 and a board of directors c3; the enterprise D includes: a legal person a4, a financial chief manager b4 and a board of directors c4.
Step S102, determining a first weight of the related enterprise and a second weight of each manager in the related enterprise according to the enterprise relationship graph.
In a preferred embodiment, when determining the first weight of the associated business based on the transaction amount, the first weight is calculated by
Figure BDA0002139850980000081
(i>0 and is an integer), wherein W i First weight, W, representing enterprise i 0 Represents the basis weight as a constant,m i Representing the transaction amount of the target business with the business i, and M representing the total transaction amount of the target business with the other businesses.
Illustratively, if the transaction amount of the enterprise a and the enterprise B is 5 million, the transaction amount of the enterprise a and the enterprise C is 2 million, the total transaction amount of the enterprise a and the other enterprises is 1 hundred million, and the basis weight is 1, the weight of the enterprise B is determined to be 1.5 through calculation, and the weight of the enterprise C is determined to be 1.2.
In another preferred embodiment, when determining the first weight of the associated business based on the transaction amount, the first weight is calculated by the formula
Figure BDA0002139850980000082
(i>0 and is an integer), wherein W i A first weight representing enterprise i, S represents a basis weight, which is a constant, m i Represents the transaction amount of the target business with the business i, and M represents the total transaction amount of the target business with the other businesses.
In another preferred embodiment, when determining the first weight of the related enterprise according to the transaction frequency, the calculation formula of the first weight is
Figure BDA0002139850980000083
(j>0 and is an integer), wherein W j First weight, W, representing Enterprise j 0 Represents the basis weight, is a constant, f j Representing the transaction frequency of the target business with the business j, and F representing the total transaction frequency of the target business with the other businesses.
Illustratively, if the transaction frequency of enterprise a and enterprise B in one month is 50, the transaction frequency of enterprise a and enterprise C in one month is 20, the total transaction frequency of the target enterprise and the other enterprises in one month is 100, the base weight is 1, the weight of enterprise B is determined to be 1.5 by calculation, and the weight of enterprise C is determined to be 1.2.
In another preferred embodiment, when the first weight is determined according to the supply and marketing relationship, the supply and marketing level of the related enterprise is obtained, the supply and marketing level is matched with a preset supply and marketing level in a supply and marketing level weight table stored in a database, and when the matching is successful, the weight corresponding to the supply and marketing level is output, and the output weight is the first weight.
Illustratively, if enterprise B is the supplier of enterprise a and enterprise D is the seller of enterprise a, then enterprise B is determined to have a weight of 2 and enterprise C is determined to have a weight of 0.2. It should be noted that, due to the supply and sale relationship, the weight of the supplier for finding the person who loses contact is much higher than the weight of the seller for finding the person who loses contact.
Illustratively, if enterprise B is the provider of enterprise a and enterprise E is the provider of enterprise B, then the weight of enterprise B is determined to be 2 and the weight of enterprise E is determined to be 0.05. It should be noted that, because the supplier has a supply chain relationship with the target enterprise, and the supplier of the supplier has no direct interest relationship with the target enterprise, the direct supplier has a higher weight for finding the losers.
In another preferred embodiment, the determining the second weight according to the identity and the relationship between the plurality of managers includes: and respectively matching the identities of the plurality of managers with preset identities in an identity weight table stored in a database in advance, and outputting weights respectively corresponding to the plurality of identities when the matching is successful, wherein the output weight is the second weight.
Illustratively, in Enterprise A, because the finance chief prison b1 is closer to money than the legal person is to the board of directors, the finance chief prison b1 has the highest weight (e.g., Q1), secondly, the legal person a1 has the second highest weight (e.g., Q2), and secondly, the board of directors c3 has the lowest weight (e.g., Q3), wherein Q1> Q2> Q3. It should be noted that, since the close degree of the manager and the money is different, the manager and the target enterprise are different in weight, and the higher the close degree is, the manager and the target enterprise have higher weight for finding the unconnectorized person.
And step S104, respectively calculating the association degree of each manager and the unconnection person according to the first weight and the second weight.
Illustratively, the calculation formula of the association degree is D = W × Q, where D represents the association degree of the manager with the unconnected person, W represents a first weight of the enterprise where the manager is located, and Q represents a second weight of finding the unconnected person by the manager.
And S106, sequencing each manager according to the sequence of the association degrees from high to low according to the calculation result of the association degrees, sequentially sending the information of the person who is searched for the lost connection to the manager terminal corresponding to the association degrees according to the sequence of the association degrees from high to low, and providing information for the person who is searched for the lost connection so as to repair the contact with the person who is lost connection.
Illustratively, the weight of the supplier enterprise B is 1.5, the weight of the supplier enterprise C is 1.2, and the weight of the seller enterprise D is 0.2, wherein the weights of the financial supervisors of enterprise B, enterprise C and enterprise D are all 0.5, the weights of the legal persons are all 0.2, and the weights of the board of directors are all 0.05. The highest correlation degree of the financial chief of the enterprise B is calculated to be 0.75, the financial chief of the enterprise C is calculated to be 0.6, and the corporate of the enterprise B is calculated to be 0.3. And then, the information of the searched lost contact persons is sequentially sent according to the financial chief of the enterprise B, the financial chief of the enterprise C and the order of the legal persons of the enterprise B, and the feedback information of the financial chief of the enterprise B, the financial chief of the enterprise C, the legal persons of the enterprise B and the like is respectively received to help the searched lost contact persons to further repair the contact with the lost contact persons.
In another embodiment, the association degrees are respectively compared with preset association degree values, and when the association degrees are higher than the preset association degree values, information of the person seeking the person losing the contact is sent to a manager terminal with the high association degree, so that the manager with the high association degree and the preset association degree values provides information for the person seeking the person losing the contact so as to repair the contact with the person losing the contact.
And S108, when first feedback information which is sent by the first manager terminal with high association degree and used for successfully searching the loss of contact person is received, stopping sending the loss of contact person information to the second manager terminal with low association degree.
Step S110, when second feedback information sent by the first manager terminal and used for finding the lost connection person fails to be received or third feedback information sent by the first manager terminal is not received after the preset time, the lost connection person information is continuously sent to the second manager terminal.
Illustratively, when the managers with high relevance degree from low to high are A — > B > C in sequence, the person who loses contact is D, and the computer device 2 sends the information for searching the person who loses contact D to the managers A, B and C in sequence. In the process that the computer device 2 sends the information for searching the loss of contact person D, if first feedback information sent by the management person A for successfully searching the loss of contact person D is received after the information for searching the loss of contact person D is sent to the management person A, the information for searching the loss of contact person D is stopped being sent to loss of contact persons B and C of the next association degree. If second feedback information sent by the manager A and failed to find the unlink person D is received or third feedback information sent by the manager A cannot be received after 1 minute of preset time is exceeded after the information for finding the unlink person D is sent to the manager A, the information for finding the unlink person D is continuously sent to the unlink person B of the next association degree, and the information for finding the unlink person D is sent in the same way.
By the embodiment of the invention, the contact with the offline loan personnel can be quickly repaired, and the person searching efficiency is greatly improved.
Example two
Referring to fig. 2, a schematic diagram of a hardware architecture of a computer device according to a second embodiment of the invention is shown. The computer device 2 includes, but is not limited to, a memory 21, a processor 22, and a network interface 23 communicatively coupled to each other via a system bus, and fig. 2 illustrates only the computer device 2 having components 21-23, but it is to be understood that not all of the illustrated components are required and that more or fewer components may alternatively be implemented.
The memory 21 includes at least one type of readable storage medium including a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the storage 21 may be an internal storage unit of the computer device 2, such as a hard disk or a memory of the computer device 2. In other embodiments, the memory may also be an external storage device of the computer device 2, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), and the like provided on the computer device 2. Of course, the memory 21 may also comprise both an internal storage unit of the computer device 2 and an external storage device thereof. In this embodiment, the memory 21 is generally used for storing an operating system installed in the computer device 2 and various types of application software, such as program codes of the offline repair system 20. Further, the memory 21 may also be used to temporarily store various types of data that have been output or are to be output.
The processor 22 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 22 is typically used to control the overall operation of the computer device 2. In this embodiment, the processor 22 is configured to execute the program code stored in the memory 21 or process data, for example, execute the outage repair system 20.
The network interface 23 may comprise a wireless network interface or a wired network interface, and the network interface 23 is generally used for establishing communication connection between the computer device 2 and other electronic devices. For example, the network interface 23 is used to connect the computer device 2 to an external terminal through a network, establish a data transmission channel and a communication connection between the computer device 2 and the external terminal, and the like. The network may be an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, bluetooth (Bluetooth), wi-Fi, or other wireless or wired network.
EXAMPLE III
Referring to fig. 3, a schematic diagram of program modules of a system for failover repair according to a third embodiment of the present invention is shown. In this embodiment, the offline repair system 20 may include or be divided into one or more program modules, and the one or more program modules are stored in a storage medium and executed by one or more processors to implement the present invention and implement the above-mentioned offline repair method based on the enterprise relationship graph. The program module referred to in the embodiments of the present invention refers to a series of computer program instruction segments capable of performing specific functions, and is more suitable than the program itself for describing the execution process of the offline repair system 20 in the storage medium. The following description will specifically describe the functions of the program modules of the present embodiment:
the establishing module 201 is configured to establish an enterprise relationship map according to information of a target enterprise where the loss contact person is located.
In a preferred embodiment, if the lost contact person is the user a, the information of the enterprise where the user a is located is obtained as an enterprise a through the information of the user a stored in the database, and the enterprise a is obtained to have business transactions with an enterprise B, an enterprise C, an enterprise D and an enterprise E. By acquiring the invoice information of the enterprise A, relevant enterprise information (such as a supplier and a seller) related to the enterprise A, a plurality of managers of the relevant enterprise (such as enterprise legal persons, directors, financial chief and the like), supply and sales relations, transaction amount and transaction frequency are acquired. The establishing module 201 establishes an enterprise relationship map according to the supply and marketing relationship with the related enterprise information and the plurality of manager information. For example: establishing an enterprise relationship map, wherein a supplier of an enterprise A comprises an enterprise B and an enterprise C, a seller comprises an enterprise D, and the enterprise A comprises: a legal person a1, a financial chief manager b1 and a board of directors c1; the enterprise B comprises: a legal person a2, a financial chief manager b2 and a board of directors c2; the enterprise C includes: a legal person a3, a financial chief manager b3 and a board of directors c3; the enterprise D includes: a legal person a4, a financial chief manager b4 and a board of directors c4.
A determining module 202, configured to determine a first weight of the relevant enterprise and a second weight of each administrator in the relevant enterprise according to the enterprise relationship graph.
In a preferred embodiment, when the determining module 202 determines the first weight of the associated enterprise based on the transaction amount, the first weight is calculated by the formula
Figure BDA0002139850980000131
(i>0 and is an integer), wherein W i First weight, W, representing Business i 0 Represents the basis weight, is a constant, m i Representing the transaction amount of the target business with the business i, and M representing the total transaction amount of the target business with the other businesses.
Illustratively, if the transaction amount of the enterprise a and the enterprise B is 5 million, the transaction amount of the enterprise a and the enterprise C is 2 million, the total transaction amount of the enterprise a and the other enterprises is 1 hundred million, and the basis weight is 1, the determining module 202 determines that the weight of the enterprise B is 1.5 and the weight of the enterprise C is 1.2.
In another preferred embodiment, when the determining module 202 determines the first weight of the associated enterprise based on the transaction amount, the first weight is calculated by
Figure BDA0002139850980000132
(i>0 and is an integer), wherein W i A first weight representing enterprise i, S represents a basis weight, which is a constant, m i Representing the transaction amount of the target business with the business i, and M representing the total transaction amount of the target business with the other businesses.
In another preferred embodiment, when the determining module 202 determines the first weight of the related enterprise according to the transaction frequency, the calculation formula of the first weight is
Figure BDA0002139850980000141
(j>0 and is an integer), wherein W j First weight, W, representing Enterprise j 0 Represents the basis weight, is a constant, f j Representing the transaction frequency of the target business with the business j, and F representing the total transaction frequency of the target business with the other businesses.
Illustratively, if the transaction frequency of the enterprise a and the enterprise B within one month is 50 times, the transaction frequency of the enterprise a and the enterprise C within one month is 20 times, the total transaction frequency of the target enterprise and the other enterprises within one month is 100, the basis weight is 1, the weight of the enterprise B is determined to be 1.5 by calculating the determination module 202, and the weight of the enterprise C is determined to be 1.2.
In another preferred embodiment, when the determining module 202 determines the first weight according to the supply and marketing relationship, the supply and marketing level of the relevant enterprise is obtained, the supply and marketing level is matched with a preset supply and marketing level in a supply and marketing level weight table stored in a database, and when the matching is successful, the weight corresponding to the supply and marketing level is output, and the output weight is the first weight.
Illustratively, if enterprise B is the supplier of enterprise a and enterprise D is the seller of enterprise a, the determination module 202 determines that enterprise B is weighted 2 and enterprise C is weighted 0.2. It should be noted that, due to the supply and sale relationship, the weight of the supplier for finding the person who loses contact is much higher than the weight of the seller for finding the person who loses contact.
Illustratively, if enterprise B is the supplier of enterprise a and enterprise E is the supplier of enterprise B, then the determination module 202 determines that the weight of enterprise B is 2 and that of enterprise E is 0.05. It should be noted that, because the supplier has a supply chain relationship with the target enterprise, and the supplier of the supplier has no direct interest relationship with the target enterprise, the direct supplier has a higher weight for finding the losers.
In another preferred embodiment, the determining module 202 determines the second weight according to the identity and the relationship between the managers, specifically: and respectively matching the identities of the plurality of managers with preset identities in an identity weight table stored in a database in advance, and outputting weights respectively corresponding to the plurality of identities when the matching is successful, wherein the output weight is the second weight.
Illustratively, in Enterprise A, because the finance chief prison b1 is closer to money than the legal person is to the board of directors, the finance chief prison b1 has the highest weight (e.g., Q1), secondly, the legal person a1 has the second highest weight (e.g., Q2), and secondly, the board of directors c3 has the lowest weight (e.g., Q3), wherein Q1> Q2> Q3. It should be noted that, since the close degree of the manager and the money is different, the manager and the target enterprise are different in weight, and the higher the close degree is, the manager and the target enterprise have higher weight for finding the unconnectorized person.
A calculating module 203, configured to calculate, according to the first weight and the second weight, a degree of association between each manager and the unconnected person.
Illustratively, the calculation formula of the association degree is D = W × Q, where D represents the association degree of the manager with the unconnected person, W represents a first weight of the enterprise where the manager is located, and Q represents a second weight of finding the unconnected person by the manager.
And the repairing module 204 is configured to sort each manager according to the sequence of the association degrees from high to low according to the calculation result of the association degrees, send the information of the person who is looking for the lost connection to the manager terminal corresponding to the association degrees in sequence according to the sequence of the association degrees from high to low, and provide information for the person who is looking for the lost connection so as to repair the contact with the person who is looking for the lost connection.
Illustratively, the weight of the supplier enterprise B is 1.5, the weight of the supplier enterprise C is 1.2, and the weight of the seller enterprise D is 0.2, wherein the weights of the financial supervisors of enterprise B, enterprise C and enterprise D are all 0.5, the weights of the legal persons are all 0.2, and the weights of the board of directors are all 0.05. The calculated association degree of the financial chief of the enterprise B is the highest and is 0.75, the calculated association degree of the financial chief of the enterprise C is 0.6, the calculated association degree of the financial chief of the enterprise B is 0.3, and the calculated association degree of the financial chief of the enterprise C is calculated sequentially. Then, the searched information of the loss contact person is sequentially sent according to the financial chief of the enterprise B, the financial chief of the enterprise C and the order of the legal person of the enterprise B, and the feedback information of the financial chief of the enterprise B, the financial chief of the enterprise C and the legal person of the enterprise B is respectively received to help the loss contact person to be found, and then the repairing module 204 repairs the contact with the loss contact person.
In another embodiment, the repairing module 204 compares the association degrees with preset association degree values, and when the association degree is higher than the preset association degree value, sends the information of the person seeking the person who loses contact to the manager terminal with the high association degree, so that the manager with the high association degree and the preset association degree value provides information for finding the person who loses contact, so as to repair the contact with the person who loses contact.
The repairing module 204 is further configured to stop sending the information of the loss of contact staff to the second administrator terminal with the low association degree when receiving first feedback information that is sent by the first administrator terminal with the high association degree and that is used for finding the success of the loss of contact staff.
The repairing module 204 is further configured to, when second feedback information sent by the first manager terminal and used for finding the lost contact person fails to be received or third feedback information sent by the first manager terminal is not received after a preset time, continue to send the lost contact person information to the second manager terminal.
Illustratively, when the managers with high relevance degree from low to high are A-, B-and C in sequence, the person with lost contact is D, and the repairing module 204 sends the information for searching the person with lost contact D to the managers A, B and C in sequence. In the process that the repairing module 204 sends the information for searching the loss of contact person D, if first feedback information sent by the manager a for successfully searching the loss of contact person D is received after the information for searching the loss of contact person D is sent to the manager a, the information for searching the loss of contact person D is stopped from being sent to the loss of contact persons B and C of the next association degree. If second feedback information sent by the manager A and failed to find the unlink person D is received or third feedback information sent by the manager A cannot be received after 1 minute of preset time is exceeded after the information for finding the unlink person D is sent to the manager A, the information for finding the unlink person D is continuously sent to the unlink person B of the next association degree, and the information for finding the unlink person D is sent in the same way.
By the embodiment of the invention, the contact with the offline loan personnel can be quickly repaired, and the person searching efficiency is greatly improved.
The present invention also provides a computer device, such as a smart phone, a tablet computer, a notebook computer, a desktop computer, a rack server, a blade server, a tower server or a rack server (including an independent server or a server cluster composed of a plurality of servers) capable of executing programs, and the like. The computer device of the embodiment at least includes but is not limited to: memory, processor, etc. communicatively coupled to each other via a system bus.
The present embodiments also provide a computer-readable storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, a server, an App application mall, etc., on which a computer program is stored, which when executed by a processor, implements corresponding functions. The computer-readable storage medium of this embodiment is used to store the offline repair system 20, and when executed by a processor, the offline repair method based on the enterprise relationship graph of the first embodiment is implemented.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.

Claims (10)

1. An offline restoration method based on an enterprise relationship graph is characterized by comprising the following steps:
establishing an enterprise relation map according to the information of the target enterprise where the loss contact person is located;
determining a first weight of a related enterprise and a second weight of each manager in the related enterprise according to the enterprise relationship graph;
respectively calculating the association degree of each manager and the unconnected persons according to the first weight and the second weight;
according to the calculation result of the association degree, sequencing each manager according to the sequence of the association degree from high to low, sequentially sending the information of the person who is searched for the loss of contact to the manager terminal corresponding to the association degree according to the sequence of the association degree from high to low, and providing information for the person who is searched for the loss of contact so as to repair the contact with the loss of contact;
when first feedback information which is sent by a first manager terminal with high association degree and succeeds in searching for the loss of contact person is received, stopping sending the loss of contact person information to a second manager terminal with low association degree; and
and when second feedback information sent by the first manager terminal and used for finding the lost connection personnel fails or third feedback information sent by the first manager terminal is not received after the preset time, the lost connection personnel information is continuously sent to the second manager terminal.
2. The method for repairing the loss of association based on the enterprise relationship graph as claimed in claim 1, wherein the step of establishing the enterprise relationship graph according to the information of the target enterprise where the loss of association personnel is located further comprises:
acquiring the information;
acquiring the business transaction situation of the target enterprise according to the information, wherein the business transaction situation at least comprises a transaction amount, a transaction frequency and/or a supply and sale relationship, related enterprises and identities and relationships among a plurality of managers of the related enterprises, wherein the identities comprise enterprise legal persons, directors and financial supervisors; and
and establishing the enterprise map according to the business transaction traffic condition.
3. The method of claim 2, wherein the step of determining the first weight of the related enterprise and the second weight of each manager according to the enterprise relationship graph further comprises the steps of:
when the first weight is determined according to the transaction amount, the calculation formula of the first weight is
Figure QLYQS_1
(i>0 and is an integer), wherein W i First weight, W, representing Business i 0 Represents the basis weight, is a constant, m i Representing the transaction amount of the target business with the business i, and M representing the total transaction amount of the target business with other businesses.
4. The method of claim 2, wherein the step of determining the first weight of the related enterprise and the second weight of each manager according to the enterprise relationship graph further comprises the steps of:
when the first weight is determined according to the transaction amount, the calculation formula of the first weight is
Figure QLYQS_2
(i>0 and is an integer), wherein W i A first weight representing enterprise i, S represents a basis weight, which is a constant, m i Representing the transaction amount of the target business with the business i, and M representing the total transaction amount of the target business with other businesses.
5. The method of claim 2, wherein the step of determining the first weight of the related enterprise and the second weight of each manager according to the enterprise relationship graph further comprises the steps of:
when the first weight is determined according to the transaction frequency, the calculation formula of the first weight is
Figure QLYQS_3
(j>0 and is an integer), wherein W j First weight, W, representing Enterprise j 0 Represents the basis weight, is a constant, f j Representing the transaction frequency of the target business with the business j, and F representing the total transaction frequency of the target business with other businesses.
6. The method of claim 2, wherein the step of determining a first weight of the associated business and a second weight of each manager based on the business relationship graph further comprises the steps of:
when the first weight is determined according to the supply and marketing relationship, acquiring the supply and marketing level of the related enterprise;
matching the supply and marketing grade with a preset supply and marketing grade in a supply and marketing grade weight table stored in a database; and
and when the matching is successful, outputting the weight corresponding to the supply and marketing level to obtain the first weight.
7. The method for repairing the loss of contact based on the enterprise relationship graph as claimed in claim 1, wherein the step of calculating the degree of association between each manager and the loss of contact person according to the first weight and the second weight further comprises:
and calculating the first weight and the second weight according to a preset calculation formula to obtain the association degree, wherein the calculation formula is D = W Q, D represents the association degree of a manager and the loss contact person, W represents the first weight of the enterprise where the manager is located, and Q represents the second weight of the loss contact person found by the manager.
8. An offline repair system, comprising:
the establishing module is used for establishing an enterprise relation map according to the information of the target enterprise where the loss contact person is located;
the determining module is used for determining a first weight of a related enterprise and a second weight of each manager in the related enterprise according to the enterprise relationship map;
the calculation module is used for calculating the association degree of each manager and the unconnection person according to the first weight and the second weight;
the repairing module is used for sequencing each manager according to the sequence of the association degrees from high to low according to the calculation result of the association degrees, sequentially sending the information of the person who is searched for the lost connection to the manager terminal corresponding to the association degrees according to the sequence of the association degrees from high to low, and providing information for the person who is searched for the lost connection so as to repair the contact with the person who is lost connection;
the repairing module is further used for stopping sending the information of the loss of contact staff to a second manager terminal with a low association degree when first feedback information which is sent by a first manager terminal with a high association degree and used for searching for the success of the loss of contact staff is received; and
the repairing module is further used for continuously sending the information of the person losing the contact to the second management person terminal when second feedback information sent by the first management person terminal and used for finding the failure of the person losing the contact is received or third feedback information sent by the first management person terminal is not received after the preset time.
9. A computer device, characterized by a computer device memory, a processor and a computer program stored on the memory and executable on the processor, which computer program, when executed by the processor, performs the steps of the enterprise relationship graph based outage repair method according to any of claims 1-7.
10. A computer-readable storage medium, having stored therein a computer program, the computer program being executable by at least one processor to cause the at least one processor to perform the steps of the enterprise relationship graph-based offline repair method of any one of claims 1-7.
CN201910665140.3A 2019-07-23 2019-07-23 Offline restoration method and system based on enterprise relationship map Active CN110533524B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910665140.3A CN110533524B (en) 2019-07-23 2019-07-23 Offline restoration method and system based on enterprise relationship map

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910665140.3A CN110533524B (en) 2019-07-23 2019-07-23 Offline restoration method and system based on enterprise relationship map

Publications (2)

Publication Number Publication Date
CN110533524A CN110533524A (en) 2019-12-03
CN110533524B true CN110533524B (en) 2023-04-07

Family

ID=68660747

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910665140.3A Active CN110533524B (en) 2019-07-23 2019-07-23 Offline restoration method and system based on enterprise relationship map

Country Status (1)

Country Link
CN (1) CN110533524B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111414490A (en) * 2020-04-07 2020-07-14 中国建设银行股份有限公司 Method and device for determining lost connection restoration information, electronic equipment and storage medium
CN115002074B (en) * 2021-04-27 2023-08-15 中移互联网有限公司 Information acquisition method, device, equipment and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015025189A1 (en) * 2013-08-18 2015-02-26 Yogesh Chunilal Rathod Enable user to establish request data specific connections with other users for communication, participation and collaboration
CN109191281A (en) * 2018-08-21 2019-01-11 重庆富民银行股份有限公司 A kind of group's fraud identifying system of knowledge based map
CN109816519A (en) * 2019-01-25 2019-05-28 宜人恒业科技发展(北京)有限公司 A kind of recognition methods of fraud clique, device and equipment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015025189A1 (en) * 2013-08-18 2015-02-26 Yogesh Chunilal Rathod Enable user to establish request data specific connections with other users for communication, participation and collaboration
CN109191281A (en) * 2018-08-21 2019-01-11 重庆富民银行股份有限公司 A kind of group's fraud identifying system of knowledge based map
CN109816519A (en) * 2019-01-25 2019-05-28 宜人恒业科技发展(北京)有限公司 A kind of recognition methods of fraud clique, device and equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
钟雪灵等.网络个人信贷大数据风险控制.《电子科技大学学报(社科版)》.2018,第7-11页. *

Also Published As

Publication number Publication date
CN110533524A (en) 2019-12-03

Similar Documents

Publication Publication Date Title
CN111274045B (en) Multi-platform docking method and device, computer equipment and readable storage medium
CN110457311B (en) Method, server and storage medium for automatically generating reconciliation document
CN110533524B (en) Offline restoration method and system based on enterprise relationship map
CN113435197B (en) Data pushing method and device, pushing server and storage medium
CN110533286B (en) Block chain-based coalition member management method and device and computer equipment
CN110610431A (en) Intelligent claim settlement method and intelligent claim settlement system based on big data
CN107133233B (en) Processing method and device for configuration data query
CN108897729B (en) Transaction template sharing method and device, electronic equipment and storage medium
CN112286997A (en) Salary data query method based on distributed deployment and related equipment
CN111292178A (en) Demand matching method and device, storage medium and electronic equipment
CN110489416B (en) Information storage method based on data processing and related equipment
US20090271231A1 (en) Solution utilizing commodity-oriented correction guidelines to correct defective electronic business transactions
CN106708869B (en) Group data processing method and device
CN111414490A (en) Method and device for determining lost connection restoration information, electronic equipment and storage medium
JP2002157422A (en) Credit method and recording medium
CN112214506B (en) Information acquisition method, device and storage medium
CN109885710B (en) User image depicting method based on differential evolution algorithm and server
WO2019062016A1 (en) Electronic device, outsourced person selection and employment method and storage medium
CN113902415A (en) Financial data checking method and device, computer equipment and storage medium
CN114186976A (en) Workflow transfer method and device, computer equipment and storage medium
CN114693358A (en) Data processing method and device, electronic equipment and storage medium
CN110503563B (en) Risk control method and system
CN116805219A (en) Vendor management method and device for realizing classification and grading based on four dimensions
CN113128595A (en) Method, apparatus, device and computer readable medium for integrating customer information
CN111427778A (en) Test method, test device, terminal equipment and storage medium

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