Bill matching method and device, equipment and medium

Abstract

The invention provides a bill matching method which can be applied to the field of data transmission and the technical field of financial science and technology. The bill matching method comprises the following steps: in response to a bill matching request of a requester, determining at least one transaction party in the same transaction group with the requester; determining at least one candidate transaction party from the at least one transaction party based on the bill information in the bill matching request of the requester and the respective quotation information of the at least one transaction party; transaction information for the bill matching request is sent to at least one candidate transaction party; and determining a target transaction party from the at least one candidate transaction party based on the respective delisting moments of the at least one candidate transaction party, and generating a bill matchmaking delivery order for the bill matchmaking request based on the target transaction party and the requester. The invention further provides a bill matching device, equipment and a medium.

Description

Technical Field

[0001] The present disclosure relates to the fields of data transmission and financial technology, and specifically to a bill matching method, device, equipment and medium. Background Art

[0002] With the continuous development of social economy, bills can be circulated among different users as exchange resources. However, the construction of bill-related infrastructure lags behind the innovation and development related to bills, which has local and regional problems.

[0003] The existing infrastructure construction related to bills includes a bill trading system. Users can log in to the bill trading system to find trading users according to their needs and complete the bill circulation in the bill trading system. However, due to the different needs of different users, the efficiency of bill circulation between different users is low. If the needs are not met, users may continue to use the bill trading system to perform related operations until the bill circulation is completed. In this process, the bill trading system will process a large number of related operations, thus occupying more memory resources and computing resources.

[0004] In addition, due to the low efficiency of bill circulation, when multiple users use bills to log in to the system at the same time, the server related to the bill trading system will receive a large number of related operation requests from each user. The response time for the related operation requests will be longer, which will make the related operation requests exposed to the network for a correspondingly longer time. It is easier for other applications to obtain related operation requests and process them as false requests, thereby increasing the security risks of the bill trading system and server. Summary of the invention

[0005] In view of the above problems, the present disclosure provides a bill matching method, apparatus, device and medium.

[0006] According to the first aspect of the present disclosure, a bill matching method is provided, characterized in that the method includes: in response to a bill matching request of a requesting party, determining at least one trading party in the same trading group as the requesting party, and determining at least one candidate trading party from at least one trading party based on the bill information in the bill matching request of the requesting party and the quotation information of at least one trading party; sending transaction information for the bill matching request to at least one candidate trading party respectively; determining a target trading party from at least one candidate trading party based on the delisting moment of each of the at least one candidate trading party, and generating a bill matching delivery document for the bill matching request based on the target trading party and the requesting party.

[0007] According to an embodiment of the present disclosure, a transaction group is obtained based on clustering of historical bill transaction information of multiple group members. The group members include objects that have executed bill transactions. The delisting time represents the time when the delisting request is received. The delisting request is a request from the candidate transaction party based on transaction information feedback.

[0008] According to an embodiment of the present disclosure, in response to a bill matching request from a requesting party, at least one transaction party in the same transaction group as the requesting party is determined, including: based on the identity of the requesting party, determining the transaction group to which the requesting party belongs, and taking the members of the transaction group as transaction parties.

[0009] According to an embodiment of the present disclosure, historical bill transaction information includes credit rating, transaction frequency and bill resource value. The credit rating is used to characterize the ability of team members to complete bill matching, and the transaction frequency characterizes the frequency of completing bill matching and delivery.

[0010] According to an embodiment of the present disclosure, a transaction group is determined in the following manner: each information element in the historical bill transaction information is converted separately to obtain a standard credit rating, a standard transaction frequency and a standard resource value; based on the standard credit rating, the standard transaction frequency and the standard resource value in the historical bill transaction information, the characteristic parameters of each group member are determined; based on the characteristic parameters of multiple group members, multiple group members are clustered to obtain a transaction group.

[0011] According to an embodiment of the present disclosure, the method also includes: determining the distance between the first trading group and at least one second trading group based on the characteristic parameters of the central group member of the first trading group and the characteristic parameters of the central group member of at least one second trading group to obtain a distance set; based on the distance set, sorting the at least one second trading group according to a preset sorting order to obtain at least one sorted second trading group; in the event that it is determined that generation of a bill matching and delivery document has failed, determining the target trading party based on the bill information in the bill matching request of the requesting party and the sorted at least one second trading group.

[0012] According to an embodiment of the present disclosure, the central group member represents the cluster center of the transaction group.

[0013] According to an embodiment of the present disclosure, when it is determined that generation of a bill matching and delivery has failed, a target transaction party is determined based on the bill information in the bill matching request of the requesting party and at least one sorted second transaction group, including: when it is determined that generation of a bill matching and delivery for the bill matching request has failed, matching the target transaction party in turn from at least one sorted second transaction group according to the bill information in the bill matching request of the requesting party until the match is successful.

[0014] According to an embodiment of the present disclosure, a target transaction party is determined from at least one candidate transaction party based on the delisting moment of each candidate transaction party, including: determining a target delisting moment that is closest to the sending moment of the delisting request among the delisting moments of each candidate transaction party; and determining the candidate transaction party corresponding to the target delisting moment as the target transaction party.

[0015] According to an embodiment of the present disclosure, the quotation information includes resource quotation information and resource estimation rate matched with the bill information; based on the bill information in the bill matching request of the requesting party and the quotation information of at least one trading party, at least one candidate trading party is determined from at least one trading party, including: matching the bill information in the bill matching request of the requesting party with the resource quotation information of at least one trading party respectively to obtain at least one initial candidate trading party; determining the minimum resource estimation rate of the resource estimation rates of at least one initial candidate trading party; and determining the initial candidate trading party corresponding to the minimum resource estimation rate as the candidate trading party.

[0016] A second aspect of the present disclosure provides a bill matching device, comprising:

[0017] The first determination module is used to determine at least one transaction party in the same transaction group as the requesting party in response to the bill matching request of the requesting party.

[0018] According to an embodiment of the present disclosure, a transaction group is obtained by clustering historical bill transaction information of a plurality of group members, and the group members include objects that have executed bill transactions.

[0019] The second determination module is used to determine at least one candidate transaction party from at least one transaction party based on the bill information in the bill matching request of the requesting party and the quotation information of each of the at least one transaction party.

[0020] The sending module is used to send transaction information for the bill matching request to at least one candidate transaction party.

[0021] The third determination module is used to determine a target transaction party from at least one candidate transaction party based on the delisting time of each candidate transaction party, and generate a bill matching transaction document for the bill matching request based on the target transaction party and the requesting party.

[0022] According to an embodiment of the present disclosure, the delisting moment represents the time when the delisting request is received, and the delisting request is a request from the candidate transaction party based on the transaction information feedback.

[0023] A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; and a memory for storing one or more computer programs, wherein the one or more processors execute the one or more computer programs to implement the steps of the above method.

[0024] The fourth aspect of the present disclosure further provides a computer-readable storage medium having a computer program or instructions stored thereon, which implements the steps of the above method when the above computer program or instructions are executed by a processor.

[0025] The fifth aspect of the present disclosure further provides a computer program product, including a computer program or instructions, which implement the steps of the above method when the above computer program or instructions are executed by a processor.

[0026] According to an embodiment of the present disclosure, by determining the transaction parties from the same transaction group and intersecting with determining the transaction parties from multiple unordered initial transaction parties, the reliability of the obtained transaction parties for subsequent transactions is high, and the speed of obtaining the transaction parties is faster, so that the efficiency of bill matching is higher. Since the acquisition of the transaction group precedes the determination of the transaction parties, the computing resources required when determining the transaction parties are greatly reduced, and the computing efficiency of determining the transaction parties can be improved. By matching the bill information of the bill matching request of the requesting party with the quotation information of the transaction parties, since the transaction group is obtained by clustering the historical bill transaction information of multiple group members, the transaction parties and the requesting party have relatively equal trading strengths, which can improve the probability of subsequent transaction success, reduce the exposure time of the bill matching request, make it difficult for other applications to obtain the bill matching request, and improve the security of bill matching. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The above contents and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0028] Figure 1 The application scenario diagram of the bill matching method, device, equipment, medium and program product according to the embodiment of the present disclosure is schematically shown;

[0029] Figure 2 A flowchart of a bill matching method according to an embodiment of the present disclosure is schematically shown;

[0030] Figure 3 Schematically shows a flow chart of determining a transaction group according to an embodiment of the present disclosure;

[0031] Figure 4 A flowchart for determining a target transaction party according to an embodiment of the present disclosure is schematically shown;

[0032] Figure 5 A flowchart of a bill matching operation according to an embodiment of the present disclosure is schematically shown;

[0033] Figure 6 A schematic diagram of the structure of a bill matching device according to an embodiment of the present disclosure is shown; and

[0034] Figure 7 A block diagram of an electronic device suitable for implementing a bill matching method according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0035] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0036] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0037] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification and should not be interpreted in an idealized or overly rigid manner.

[0038] When using expressions such as "at least one of A, B, and C, etc.", they should generally be interpreted according to the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0039] In the technical solution of the present disclosure, the user information (including but not limited to user personal information, user image information, user device information, such as location information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved are all information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of the relevant data comply with relevant laws, regulations and standards, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or refuse.

[0040] In the scenario of using personal information for automated decision-making, the methods, devices, and systems provided by the embodiments of the present disclosure provide users with corresponding operation portals for users to choose to agree or reject the automated decision-making results; if the user chooses to reject, the expert decision-making process will be entered. The expression "automated decision-making" here refers to the activity of automatically analyzing and evaluating a person's behavioral habits, interests and hobbies, or economic, health, credit status, etc. through computer programs, and making decisions. The expression "expert decision-making" here refers to the activity of making decisions by people who specialize in a certain field, have specialized experience, knowledge and skills, and have reached a certain level of professionalism.

[0041] An embodiment of the present disclosure provides a bill matching method, which responds to a bill matching request from a requesting party, determines at least one trading party in the same trading group as the requesting party; determines at least one candidate trading party from at least one trading party based on the bill information in the bill matching request from the requesting party and the quotation information of at least one trading party; sends transaction information for the bill matching request to at least one candidate trading party respectively; determines a target trading party from at least one candidate trading party based on the delisting time of at least one candidate trading party, and generates a bill matching delivery document for the bill matching request based on the target trading party and the requesting party.

[0042] Figure 1 The application scenario diagram of bill matching according to an embodiment of the present disclosure is schematically shown.

[0043] like Figure 1 As shown, the application scenario according to this embodiment may include a first terminal device 101, a second terminal device 102, a third terminal device 103, a network 104, and a server 105. The network 104 is used to provide a medium for a communication link between the first terminal device 101, the second terminal device 102, the third terminal device 103, and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or optical fiber cables, etc.

[0044] The user can use the first terminal device 101, the second terminal device 102, and the third terminal device 103 to interact with the server 105 through the network 104 to receive or send messages, etc. Various communication client applications can be installed on the first terminal device 101, the second terminal device 102, and the third terminal device 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only for example).

[0045] The first terminal device 101, the second terminal device 102, and the third terminal device 103 may be various electronic devices having display screens and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

[0046] The server 105 may be a server that provides various services, such as a background management server (only as an example) that provides support for websites browsed by users using the first terminal device 101, the second terminal device 102, and the third terminal device 103. The background management server may analyze and process the received data such as user requests, and feed back the processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

[0047] It should be noted that the bill matching method provided in the embodiment of the present disclosure can generally be executed by the server 105. Accordingly, the bill matching device provided in the embodiment of the present disclosure can generally be set in the server 105. The bill matching method provided in the embodiment of the present disclosure can also be executed by a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105. Accordingly, the bill matching device provided in the embodiment of the present disclosure can also be set in a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105.

[0048] It should be understood that Figure 1 The number of the first terminal device, the second terminal device, the third terminal device, the network and the server in the embodiment is only for illustration. According to the implementation requirements, there may be any number of the first terminal device, the second terminal device, the third terminal device, the network and the server.

[0049] The following will be based on Figure 1 The scene described by Figure 2~Figure 4 The bill matching method of the disclosed embodiment is described in detail.

[0050] Figure 2 The flowchart of the bill matching method according to the embodiment of the present disclosure is schematically shown.

[0051] like Figure 2 As shown, the bill matching of this embodiment includes operations S210 to S240.

[0052] In operation S210 , in response to a bill matching request from a requesting party, at least one transaction party in the same transaction group as the requesting party is determined.

[0053] In operation S220, at least one candidate transaction party is determined from the at least one transaction party based on the bill information in the bill matching request of the requesting party and the quotation information of the at least one transaction party.

[0054] According to an embodiment of the present disclosure, the bill information may include bill type, bill transaction elements, bill issuer, etc. The bill transaction elements may include par value, remaining term, and bill acceptor. The bill type may include institutional bills.

[0055] According to an embodiment of the present disclosure, a bill matching request may include relevant information of the bill information. For example, the relevant information may include an image of the bill information, and may also include an electronic document of the bill information. The image of the bill information may be an image obtained by scanning and optimizing a paper version of the bill or a printed version of the bill. After receiving the bill matching request from the requesting party, the text information of the image of the bill information may be located using an image processing algorithm, and the text information may be recognized using OCR recognition to obtain a text information group; the bill information may be determined from the text information group according to a preset recognition rule and a preset bill template.

[0056] According to an embodiment of the present disclosure, a transaction group is obtained by clustering historical bill transaction information of a plurality of group members, and the group members include objects that have executed bill transactions.

[0057] According to an embodiment of the present disclosure, the requesting party and the transaction party are different, and both need to meet preset verification rules. The preset verification rules may include preset risk rules, and specifically, the preset risk rules may include identity risk identification. The bill information needs to meet the preset bill rules. The preset bill rules may include that the bill accepting party in the bill information in the bill matching request is different from the bill issuing party, the bill information has integrity, and the bill information can be used for transactions, etc.

[0058] According to an embodiment of the present disclosure, historical bill transaction information may include relevant information of completing bill transactions according to bill matching requests, such as transaction frequency, etc.

[0059] According to an embodiment of the present disclosure, the quotation information may include information equivalent to the ticket information and the estimated value of the ticket resources.

[0060] According to an embodiment of the present disclosure, the bill information in the bill matching request of the requesting party can be matched with the information equivalent to the bill information included in the quotation information of at least one transaction party to obtain at least one matching transaction party. The par resource estimation rate of at least one matching transaction party can be sorted, the maximum par resource estimation rate is determined according to the sorting result, and the matching transaction party corresponding to the maximum par resource estimation rate is determined as a candidate transaction party.

[0061] In operation S230, transaction information for the bill matching request is sent to at least one candidate transaction party.

[0062] According to an embodiment of the present disclosure, the transaction information may include the bill information of the requesting party, the quotation information of the trading party, the quotation time of the trading party and the time of the bill matching request, etc.

[0063] According to an embodiment of the present disclosure, transaction information for a bill matching request may be sent to candidate parties respectively according to preset sending rules.

[0064] In operation S240, based on the delisting time of each of the at least one candidate transaction party, a target transaction party is determined from the at least one candidate transaction party, and a bill matching transaction document for the bill matching request is generated based on the target transaction party and the requesting party.

[0065] According to an embodiment of the present disclosure, the delisting moment represents the time when the delisting request is received, and the delisting request is a request from the candidate transaction party based on the transaction information feedback.

[0066] According to an embodiment of the present disclosure, it is possible to determine a target value that satisfies a preset time interval between the delisting moment of at least one candidate transaction party and the transaction information sent for the bill matching request, and determine the candidate transaction party corresponding to the target value as the target transaction party.

[0067] According to an embodiment of the present disclosure, when there is only one candidate transaction party, after the delisting time of the candidate transaction party is determined, the candidate transaction party is directly determined as the target transaction party.

[0068] According to the embodiments of the present disclosure, after the target transaction party is determined, the par value of the resource and the par value of the resource estimate can be calculated according to the preset calculation rules to obtain the transaction resource value. After the bill information is transferred to the transaction party through the bill transaction institution and the transaction resource value is transferred from the resource account of the transaction party to the resource account of the requesting party, the transaction resource value, the bill transaction elements in the bill information, and the par value of the resource estimate rate in the quotation information are combined into a bill matching and delivery document according to the preset generation rules and the preset generation template.

[0069] According to an embodiment of the present disclosure, the requesting party and the transaction parties in the transaction group have transaction strengths equal to that of the requesting party.

[0070] According to an embodiment of the present disclosure, after receiving the bill matching request from the requesting party, if the bill information in the bill matching request is directly matched with the quotation information of multiple trading parties that are not divided into groups, a candidate trading party is obtained in the case of a successful match. Since the trading strength of the candidate trading party and the requesting party is unequal, even if the trading information for the bill matching request is sent to the candidate trading party, the delisting time of the candidate trading party may not be obtained, which affects the efficiency of bill matching.

[0071] According to an embodiment of the present disclosure, by determining the transaction parties from the same transaction group and intersecting with determining the transaction parties from multiple unordered initial transaction parties, the reliability of the obtained transaction parties for subsequent transactions is high, and the speed of obtaining the transaction parties is faster, so that the efficiency of bill matching is higher. Since the acquisition of the transaction group precedes the determination of the transaction parties, the computing resources required when determining the transaction parties are greatly reduced, and the computing efficiency of determining the transaction parties can be improved. By matching the bill information of the bill matching request of the requesting party with the quotation information of the transaction parties, since the transaction group is obtained by clustering the historical bill transaction information of multiple group members, the transaction parties and the requesting party have relatively equal trading strengths, which can improve the probability of subsequent transaction success, reduce the exposure time of the bill matching request, make it difficult for other applications to obtain the bill matching request, and improve the security of bill matching.

[0072] According to an embodiment of the present disclosure, in response to a bill matching request from a requesting party, determining at least one transaction party in the same transaction group as the requesting party may include the following operations: based on the identity of the requesting party, determining the transaction group to which the requesting party belongs, and using the members of the transaction group as transaction parties.

[0073] According to an embodiment of the present disclosure, the identity of the requester may include the number of the transaction group it is in. The transaction group number included in the identity of the requester may be matched with the numbers of multiple transaction groups, and the transaction group that successfully matches may be determined as the transaction group of the requester.

[0074] According to an embodiment of the present disclosure, the members of the transaction group except the members corresponding to the requesting party and the members corresponding to the bill accepting party may be determined as transaction parties.

[0075] According to an embodiment of the present disclosure, historical bill transaction information includes credit rating, transaction frequency and bill resource value. The credit rating is used to characterize the ability of team members to complete bill matching, and the transaction frequency characterizes the frequency of completing bill matching and delivery.

[0076] According to an embodiment of the present disclosure, the credit rating can be calculated by the credit rating of the group member and the credit rating of the bill information in the bill matching according to the rating calculation rule. The credit rating of the group member and the credit rating of the bill information in the bill matching can be obtained through a third-party rating agency.

[0077] Figure 3 The flowchart of determining a transaction group according to an embodiment of the present disclosure is schematically shown.

[0078] like Figure 3 As shown, the process of determining a transaction group in this embodiment includes operations S310 to S330.

[0079] In operation S310, each information element in the historical bill transaction information is converted to obtain a standard credit rating, a standard transaction frequency, and a standard resource value.

[0080] According to an embodiment of the present disclosure, the credit rating can be converted according to a preset rating conversion rule to obtain a standard credit rating. The transaction frequency can be converted according to a preset frequency conversion rule to obtain a standard transaction frequency. The bill resource value can be converted according to a preset resource value conversion rule to obtain a standard resource value. The preset rating conversion rule can be, for example, a rule obtained by combining the average value and standard deviation obtained from multiple credit ratings. The preset frequency conversion rule can be, for example, a rule obtained by combining the average value and standard deviation obtained from multiple transaction frequencies. The preset resource value conversion rule can be, for example, a rule obtained by combining the average value and standard deviation obtained from multiple credit ratings.

[0081] In operation S320, characteristic parameters of each group member are determined based on the standard credit rating, standard transaction frequency, and standard resource value in the historical bill transaction information.

[0082] According to an embodiment of the present disclosure, the characteristic parameters may include a standard credit rating vector, a standard transaction frequency vector, and a standard resource value vector.

[0083] In operation S330, clustering is performed on the multiple group members based on their characteristic parameters to obtain a transaction group.

[0084] According to an embodiment of the present disclosure, for each team member, multiple historical bill transaction information within a preset period can be selected according to needs. The multiple historical bill transaction information can be sorted in time sequence to obtain the sorted multiple historical bill transaction information. The standard credit rating, standard transaction frequency and standard resource value of each of the sorted multiple historical bill transaction information are combined to obtain a standard credit rating vector, a standard transaction frequency vector and a standard resource value vector.

[0085] According to an embodiment of the present disclosure, a clustering algorithm can be used to cluster the characteristic parameters of multiple group members to obtain multiple cluster groups. The similarity between the characteristic parameters of the cluster center in the cluster group and the characteristic parameters of other group members in the cluster group meets a preset similarity condition. The group members included in the cluster group are combined according to the preset group member combination rule to obtain a transaction group. The clustering algorithm can be, for example, a mean clustering algorithm or a hierarchical clustering algorithm. For example, when the clustering algorithm is a mean clustering algorithm, multiple group members can be divided into transaction groups.

[0086] According to an embodiment of the present disclosure, characteristic parameters are determined through historical bill transaction information, and transaction groups are obtained based on clustering processing of the characteristic parameters, so that the similarity of members in the transaction group is relatively large, thereby improving the accuracy of matching transaction parties.

[0087] Figure 4 The flowchart of determining the target transaction party according to an embodiment of the present disclosure is schematically shown.

[0088] like Figure 4 As shown, the determination of the target transaction party in this embodiment includes operations S410 to S430.

[0089] In operation S410, based on the characteristic parameters of the central member of the first transaction group and the characteristic parameters of the central member of the at least one second transaction group, the distance between the first transaction group and the at least one second transaction group is determined to obtain a distance set.

[0090] In operation S420, at least one second transaction group is sorted according to a preset sorting order based on the distance set to obtain at least one sorted second transaction group.

[0091] In operation S430, when it is determined that the generation of the bill matching and delivery document fails, a target transaction party is determined based on the bill information in the bill matching request of the requesting party and the sorted at least one second transaction group.

[0092] According to an embodiment of the present disclosure, the central group member represents the cluster center of the transaction group. The first transaction group includes a requester and a transaction party, and the second transaction group includes a transaction party.

[0093] According to an embodiment of the present disclosure, the similarities of the characteristic parameters of the central member of the first trading group and the characteristic parameters of the central member of at least one second trading group can be calculated respectively to obtain multiple similarities. The similarities are used as distances to obtain multiple distances. The multiple distances are combined according to the order of at least one second trading group to obtain a distance set.

[0094] According to an embodiment of the present disclosure, the preset sorting order may include ascending order and descending order. When the preset sorting order is ascending order, the distance set may be sorted in ascending order to obtain a sorted distance set. The second transaction groups corresponding to the distances in the sorted distance set are sequentially determined to obtain at least one sorted second transaction group.

[0095] According to an embodiment of the present disclosure, the transaction resource values, the bill transaction elements in the bill information, and the estimated rate of the face value resources in the quotation information included in each of the multiple bill matching and delivery documents can be queried within a preset query period. By matching the bill transaction elements in the bill information in the bill matching request with the bill transaction elements in the bill information included in the bill matching and delivery document, if the matching fails, it is determined that the bill matching and delivery document fails to be generated.

[0096] According to an embodiment of the present disclosure, the sorted multiple intended transaction parties, the intended face value resource estimation rate, etc. included in the preference information of the requester can be obtained according to the bill matching request of the requester. The second transaction groups to which the sorted multiple intended transaction parties belong can be determined in sequence from the at least one sorted second transaction group to obtain the at least one sorted second transaction group. The second transaction group corresponding to the intended face value resource estimation rate can also be determined from the at least one sorted second transaction group to obtain the at least one sorted second transaction group. The target transaction party can be matched from the at least one sorted second transaction group according to the bill information in the bill matching request of the requester.

[0097] According to an embodiment of the present disclosure, the target transaction party may also be matched directly from at least one sorted second transaction group based on the bill information in the bill matching request of the requesting party.

[0098] According to an embodiment of the present disclosure, in the event that it is determined that generation of a bill matching and delivery has failed, determining the target transaction party based on the bill information in the bill matching request of the requesting party and at least one sorted second transaction group may include the following operations: in the event that it is determined that generation of a bill matching and delivery for the bill matching request has failed, matching the target transaction party in turn from at least one sorted second transaction group according to the bill information in the bill matching request of the requesting party until the match is successful.

[0099] According to an embodiment of the present disclosure, since the at least one sorted second transaction group is obtained according to a preset sorting order, the reliability of successful matching can be improved by matching the target transaction party in turn from the at least one sorted second transaction group according to the bill information in the bill matching request of the requesting party.

[0100] According to an embodiment of the present disclosure, determining a target transaction party from at least one candidate transaction party based on the delisting time of each candidate transaction party may include the following operations: determining a target delisting time that is closest to the time of sending a delisting request among the delisting times of each candidate transaction party; and determining the candidate transaction party corresponding to the target delisting time as the target transaction party.

[0101] According to an embodiment of the present disclosure, the delisting moments of at least one candidate transaction party may be sorted in ascending order to obtain the sorted delisting moments of at least one candidate transaction party, and the delisting moment corresponding to the first rank may be determined as the target delisting moment.

[0102] According to an embodiment of the present disclosure, the quotation information includes resource quotation information and resource estimation rate matched with the bill information; based on the bill information in the bill matching request of the requesting party and the respective quotation information of at least one trading party, determining at least one candidate trading party from at least one trading party may include the following operations: matching the bill information in the bill matching request of the requesting party with the respective resource quotation information of at least one trading party respectively to obtain at least one initial candidate trading party; determining the minimum resource estimation rate of the respective resource estimation rates of at least one initial candidate trading party; and determining the initial candidate trading party corresponding to the minimum resource estimation rate as the candidate trading party.

[0103] According to an embodiment of the present disclosure, when there is only one initial candidate party, the resource estimation rate corresponding to the resource quotation information can be obtained, and the resource estimation rate corresponding to the resource quotation information can be used as the minimum resource estimation rate, and the initial candidate transaction party can be used as the candidate transaction party.

[0104] According to an embodiment of the present disclosure, when there are multiple initial candidate parties, the resource estimation rate interval of the requesting party can be obtained according to the bill matching request of the requesting party. The resource estimation rates of the multiple initial candidate transaction parties can be obtained, and multiple interval resource estimation rates in the resource estimation rate interval can be screened from the resource estimation rates of the multiple initial candidate transaction parties, and the minimum interval resource estimation rate is determined from the multiple interval resource estimation rates, and the minimum interval resource estimation rate is used as the minimum resource estimation rate.

[0105] According to an embodiment of the present disclosure, the number of bill matching requests of the requesting party may include multiple bill matching requests, and the requesting time of each of the multiple bill matching requests may be obtained, and the bill matching requests of the requesting party are responded to in ascending order of the request time. The bill information of each bill matching request may be different.

[0106] According to a specific embodiment of the present disclosure, a plurality of transaction groups include transaction group 1 and transaction group 2, and the group members include institution 1, institution 2, institution 3, institution 4 and institution 5. Transaction group 1 includes institution 1, institution 2 and institution 5, and transaction group 2 includes institution 3 and institution 4. Institution 5 is the requester. The requester has bill matching request 1, bill matching request 2 and bill matching request 3, and the preference information of the requester includes that the sorted plurality of intended transaction parties are institution 1, institution 2 and institution 3. Institution 2 has quotation information 1, quotation information 2, quotation information 3 and quotation information 4, institution 3 has quotation information 5, and institution 4 has quotation information 6.

[0107] In the bill information of bill matching request 1, the party accepting the bill is the same as the party issuing the bill, the remaining term is 6 months, the face value of the bill is 500,000 yuan, and the party accepting the bill is institution 1.

[0108] In the bill information of bill matching request 2, the party accepting the bill is different from the party issuing the bill. The remaining term is 6 months, the face value is RMB 500,000, and the party accepting the bill is institution 1.

[0109] In the bill information of bill matching request 3, the party accepting the bill is different from the party issuing the bill, the remaining term is 6 months, the face value is RMB 500,000, and the party accepting the bill is institution 1.

[0110] Resource quotation information in quotation information 1: the party accepting the bill is institution 1, the face value of the resource is RMB 500,000, the remaining term is 6, and the resource estimation rate is 2.5%.

[0111] Resource quotation information in quotation information 2: the party accepting the bill is institution 3, the face value of resources is RMB 500,000, the remaining term is 6, and the resource estimation rate is 2.5%.

[0112] Resource quotation information in quotation information 3: the party accepting the bill is institution 1, the face value of the resource is RMB 1 million, the remaining term is 6, and the resource estimation rate is 2.8%.

[0113] Resource quotation information in quotation information 4: the party accepting the bill is institution 1, the face value of the resource is RMB 500,000, the remaining term is 12, and the resource estimation rate is 2.8%.

[0114] Resource quotation information in quotation information 5: the party accepting the bill is institution 1, the face value of resources is RMB 500,000, the remaining term is 6, and the resource estimation rate is 2.6%.

[0115] Resource quotation information in quotation information 6: the party accepting the bill is institution 1, the face value of resources is RMB 500,000, the remaining term is 6, and the resource estimation rate is 2.4%.

[0116] According to the preset inspection rules, the bill information of bill matching request 1, the bill information of bill matching request 2 and the bill information of bill matching request 3 are inspected in turn, and it is found that the bill information of bill matching request 1 does not meet the preset bill rules, the bill information of bill matching request 2 meets the preset bill rules, and the bill information of bill matching request 3 meets the preset bill rules and preset risk rules. Since the bill information of bill matching request 1 does not meet the preset bill rules, it is not necessary to determine the transaction party.

[0117] For the bill information of bill matching request 2, based on the identity of the requester, the transaction group to which the requester belongs is determined to be transaction group 1, and institutions 1 and 2 in the transaction group are used as transaction parties. The bill information in the bill matching request 2 of the requester is matched with quotation information 1, quotation information 2, quotation information 3 and quotation information 4 of institution 2 respectively. If the matching fails, a bill matching and delivery failure for the bill matching request is generated. The at least one second transaction group after sorting is transaction group 2. According to the bill information matching in the bill matching request of the requester, the target transaction party is institution 4.

[0118] For the bill information of bill matching request 3, based on the identity of the requester, the transaction group to which the requester belongs is determined to be transaction group 1, and institutions 1 and 2 in the transaction group are used as the transaction parties. The bill information in the bill matching request 2 of the requester is matched with quotation information 1, quotation information 2, quotation information 3 and quotation information 4 of institution 2 respectively, and the match with fare information 1 is successful, and the target transaction party is obtained as institution 2.

[0119] Figure 5 The flowchart of the bill matching operation according to the embodiment of the present disclosure is schematically shown.

[0120] like Figure 5 As shown, operations S501 to S510 describe the process of bill matching operation according to the present disclosure.

[0121] In operation S501 , in response to a bill matching request from a requesting party, at least one transaction party in the same transaction group as the requesting party is determined.

[0122] In operation S502, the bill information in the bill matching request of the requesting party is matched with the resource quotation information of at least one transaction party to obtain at least one initial candidate transaction party.

[0123] In operation S503 , a minimum resource estimation rate of respective resource estimation rates of at least one initial candidate transaction party is determined.

[0124] In operation S504, the initial candidate transaction party corresponding to the minimum resource estimation rate is determined as a candidate transaction party.

[0125] In operation S505 , a target transaction party is determined from at least one candidate transaction party based on the delisting time of each of the at least one candidate transaction party.

[0126] In operation S506, a bill matching and delivery document is generated for the bill matching request based on the target transaction party and the requesting party.

[0127] In operation S507, it is determined whether the bill matching and delivery is successfully generated. If it is determined to be successful, the bill matching ends. Otherwise, it proceeds to S508.

[0128] In operation S508, the target transaction parties are matched in turn from the at least one sorted second transaction group according to the bill information in the bill matching request of the requesting party until the matching is successful.

[0129] Based on the above-mentioned bill matching method, the present disclosure also provides a bill matching device. Figure 6 The device is described in detail.

[0130] Figure 6 The structural block diagram of the bill matching device according to the embodiment of the present disclosure is schematically shown.

[0131] like Figure 6 As shown, the bill matching device of this embodiment includes a first determination module 610 , a second determination module 620 , a sending module 630 and a third determination module 640 .

[0132] The first determination module is used to determine at least one transaction party in the same transaction group as the requesting party in response to the bill matching request of the requesting party.

[0133] According to an embodiment of the present disclosure, a transaction group is obtained by clustering historical bill transaction information of a plurality of group members, and the group members include objects that have executed bill transactions.

[0134] The second determination module is used to determine at least one candidate transaction party from at least one transaction party based on the bill information in the bill matching request of the requesting party and the quotation information of each of the at least one transaction party.

[0135] The sending module is used to send transaction information for the bill matching request to at least one candidate transaction party.

[0136] The third determination module is used to determine a target transaction party from at least one candidate transaction party based on the delisting time of each candidate transaction party, and generate a bill matching transaction document for the bill matching request based on the target transaction party and the requesting party.

[0137] According to an embodiment of the present disclosure, the first determining module 610 includes a first determining unit.

[0138] The first determining unit is used to determine the transaction group to which the requesting party belongs based on the identity of the requesting party, and use the members of the transaction group as transaction parties.

[0139] According to an embodiment of the present disclosure, historical bill transaction information includes credit rating, transaction frequency and bill resource value. The credit rating is used to characterize the ability of team members to complete bill matching, and the transaction frequency characterizes the frequency of completing bill matching and delivery.

[0140] According to an embodiment of the present disclosure, the first determining unit further includes a converting subunit, a determining subunit and a clustering subunit.

[0141] The conversion subunit is used to convert each information element in the historical bill transaction information to obtain a standard credit rating, a standard transaction frequency and a standard resource value.

[0142] The determination subunit is used to determine the characteristic parameters of each group member based on the standard credit rating, standard transaction frequency and standard resource value in the historical bill transaction information.

[0143] The clustering subunit is used to perform clustering processing on multiple group members based on the characteristic parameters of the multiple group members to obtain a transaction group.

[0144] According to an embodiment of the present disclosure, the bill matching device further includes: a fourth determination module, a sorting module and a fifth determination module.

[0145] The fourth determination module is used to determine the distance between the first transaction group and the at least one second transaction group based on the characteristic parameters of the central member of the first transaction group and the characteristic parameters of the central member of the at least one second transaction group to obtain a distance set.

[0146] According to an embodiment of the present disclosure, the central group member represents the cluster center of the transaction group.

[0147] The sorting module is used to sort the plurality of second transaction groups according to a preset sorting order based on the distance set to obtain at least one sorted second transaction group.

[0148] The fifth determination module is used to determine the target transaction party based on the bill information in the bill matching request of the requesting party and at least one sorted second transaction group when it is determined that the generation of the bill matching and delivery document fails.

[0149] According to an embodiment of the present disclosure, the fifth determination module includes a second determination unit.

[0150] The second determination unit is used to match the target transaction party in sequence from at least one sorted second transaction group according to the bill information in the bill matching request of the requester until the matching is successful when it is determined that the bill matching and delivery document generated for the bill matching request has failed.

[0151] The third determining module includes a third determining unit and a fourth determining unit.

[0152] Used to determine a target delisting time closest to the sending time of the delisting request among the delisting times of at least one candidate transaction party.

[0153] Used to determine the candidate transaction party corresponding to the target delisting moment as the target transaction party.

[0154] According to an embodiment of the present disclosure, the quotation information includes resource quotation information and resource estimation rate matched with the ticket information.

[0155] The second determining module includes a matching unit, a fifth determining unit and a sixth determining unit.

[0156] The matching unit is used to match the bill information in the bill matching request of the requesting party with the resource quotation information of at least one transaction party respectively, so as to obtain at least one initial candidate transaction party.

[0157] The fifth determining unit is used to determine a minimum resource estimation rate of respective resource estimation rates of at least one initial candidate transaction party.

[0158] The sixth determining unit is used to determine the initial candidate transaction party corresponding to the minimum resource estimation rate as the candidate transaction party.

[0159] According to an embodiment of the present disclosure, any multiple modules of the first determination module 610, the second determination module 620, the sending module 630, and the third determination module 640 can be combined into one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first determination module 610, the second determination module 620, the sending module 630, and the third determination module 640 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware, and firmware, or in any appropriate combination of any of them. Alternatively, at least one of the first determination module 610 , the second determination module 620 , the sending module 630 , and the third determination module 640 may be at least partially implemented as a computer program module, and when the computer program module is executed, a corresponding function may be performed.

[0160] Figure 7 A block diagram of an electronic device suitable for implementing a bill matching method according to an embodiment of the present disclosure is schematically shown.

[0161] like Figure 7As shown, the electronic device according to the embodiment of the present disclosure includes a processor 701, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 702 or the program loaded from the storage part 708 to the random access memory (RAM) 703. The processor 701 may include, for example, a general-purpose microprocessor (such as a CPU), an instruction set processor and / or a related chipset and / or a special-purpose microprocessor (for example, an application-specific integrated circuit (ASIC)), etc. The processor 701 may also include an onboard memory for caching purposes. The processor 701 may include a single processing unit or multiple processing units for performing different actions of the method flow according to the embodiment of the present disclosure.

[0162] In RAM 703, various programs and data required for the operation of the electronic device are stored. The processor 701, ROM 702, and RAM 703 are connected to each other via a bus 704. The processor 701 performs various operations of the method flow according to the embodiment of the present disclosure by executing the programs in ROM 702 and / or RAM 703. It should be noted that the program may also be stored in one or more memories other than ROM 702 and RAM 703. The processor 701 may also perform various operations of the method flow according to the embodiment of the present disclosure by executing the programs stored in the one or more memories.

[0163] According to an embodiment of the present disclosure, the electronic device may further include an input / output (I / O) interface 705, which is also connected to the bus 704. The electronic device may further include one or more of the following components connected to the I / O interface 705: an input portion 706 including a keyboard, a mouse, etc.; an output portion 707 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage portion 708 including a hard disk, etc.; and a communication portion 706 including a network interface card such as a LAN card, a modem, etc. The communication portion 706 performs communication processing via a network such as the Internet. A drive 710 is also connected to the I / O interface 705 as needed. A removable medium 711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 710 as needed, so that a computer program read therefrom is installed into the storage portion 708 as needed.

[0164] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the method according to the embodiment of the present disclosure is implemented.

[0165] According to an embodiment of the present disclosure, a computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, an apparatus or a device. For example, according to an embodiment of the present disclosure, a computer-readable storage medium may include the ROM 702 and / or the RAM 703 described above and / or one or more memories other than the ROM 702 and the RAM 703.

[0166] The embodiment of the present disclosure also includes a computer program product, which includes a computer program, and the computer program contains program code for executing the method shown in the flowchart. When the computer program product is run in a computer system, the program code is used to enable the computer system to implement the item recommendation method provided by the embodiment of the present disclosure.

[0167] The above functions defined in the system / device of the embodiment of the present disclosure are performed when the computer program is executed by the processor 701. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0168] In one embodiment, the computer program may be based on a tangible storage medium such as an optical storage device, a magnetic storage device, etc. In another embodiment, the computer program may also be transmitted and distributed in the form of a signal on a network medium, and downloaded and installed through the communication part 706, and / or installed from the removable medium 711. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0169] In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 706, and / or installed from the removable medium 711. When the computer program is executed by the processor 701, the above functions defined in the system of the embodiment of the present disclosure are performed. According to the embodiment of the present disclosure, the system, device, means, module, unit, etc. described above can be implemented by a computer program module.

[0170] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computing programs can be implemented using high-level process and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, Java, C++, python, "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on the remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect through the Internet).

[0171] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0172] It will be appreciated by those skilled in the art that the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways, even if such combinations and / or combinations are not explicitly described in the present disclosure. In particular, the features described in the various embodiments and / or claims of the present disclosure may be combined and / or combined in a variety of ways without departing from the spirit and teachings of the present disclosure. All of these combinations and / or combinations fall within the scope of the present disclosure.

[0173] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the attached claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. A bill matching method, characterized in that: The method comprises: In response to a bill matching request from a requesting party, determining at least one transaction party in the same transaction group as the requesting party, wherein the transaction group is obtained by clustering historical bill transaction information of a plurality of group members, and the group members include objects that have executed bill transactions; Determine at least one candidate transaction party from the at least one transaction party based on the bill information in the bill matching request of the requesting party and the quotation information of each of the at least one transaction party; Sending transaction information for the bill matching request to the at least one candidate transaction party respectively; Based on the delisting time of each of the at least one candidate transaction party, a target transaction party is determined from the at least one candidate transaction party, and based on the target transaction party and the requesting party, a bill matching and delivery document is generated for the bill matching request, wherein the delisting time represents the time when the delisting request is received, and the delisting request is a request from the candidate transaction party based on the transaction information feedback.

2. The method according to claim 1, wherein: The step of responding to the bill matching request of the requesting party and determining at least one transaction party in the same transaction group as the requesting party includes: determining the transaction group to which the requesting party belongs based on the identity of the requesting party, and using the members of the transaction group as the transaction parties.

3. The method according to claim 2, wherein: The historical bill transaction information includes credit rating, transaction frequency and bill resource value. The credit rating is used to represent the ability of the team member to complete the bill matching, and the transaction frequency represents the frequency of completing bill matching and transaction. The transaction group is determined as follows: Converting each information element in the historical bill transaction information to obtain a standard credit rating, a standard transaction frequency and a standard resource value; Determining characteristic parameters of each of the group members based on the standard credit rating, standard transaction frequency and standard resource value in the historical bill transaction information; Based on the characteristic parameters of the plurality of group members, the plurality of group members are clustered to obtain the transaction group.

4. The method according to claim 3, wherein: The first transaction group includes the requester and the transaction party, the second transaction group includes the transaction party, and the method further includes: Based on the characteristic parameters of the central member of the first trading group and the characteristic parameters of the central member of each of the at least one second trading group, determining the distance between the first trading group and the at least one second trading group to obtain a distance set, wherein the central member represents the cluster center of the trading group; Based on the distance set, sorting the plurality of second transaction groups according to a preset sorting order to obtain at least one sorted second transaction group; In the case where it is determined that generation of the bill matching and delivery document fails, a target transaction party is determined based on the bill information in the bill matching request of the requesting party and the at least one sorted second transaction group.

5. The method according to claim 4, wherein: In the case where it is determined that the generation of the bill matching and delivery fails, determining the target transaction party based on the bill information in the bill matching request of the requesting party and the at least one sorted second transaction group includes: When it is determined that the bill matching and delivery generated for the bill matching request fails, the target transaction party is matched in sequence from at least one of the sorted second transaction groups according to the bill information in the bill matching request of the requesting party until the matching is successful.

6. The method according to claim 1, wherein: Determining a target transaction party from the at least one candidate transaction party based on the delisting time of each of the at least one candidate transaction party includes: Determine a target delisting time which is closest to the sending time of the delisting request among the delisting times of the at least one candidate transaction party; The candidate transaction party corresponding to the target delisting moment is determined as the target transaction party.

7. The method according to claim 1, wherein: The quotation information includes resource quotation information and resource estimation rate matched with the bill information; the step of determining at least one candidate transaction party from the at least one transaction party based on the bill information in the bill matching request of the requesting party and the quotation information of each of the at least one transaction party includes: Respectively matching the bill information in the bill matching request of the requesting party with the resource quotation information of the at least one transaction party to obtain at least one initial candidate transaction party; Determining a minimum resource estimation rate of respective resource estimation rates of the at least one initial candidate transaction party; An initial candidate transaction party corresponding to the minimum resource estimation rate is determined as the candidate transaction party.

8. A bill matching device, characterized in that: The device comprises: A first determination module is used to determine, in response to a bill matching request from a requesting party, at least one transaction party in the same transaction group as the requesting party, wherein the transaction group is obtained by clustering historical bill transaction information of a plurality of group members, and the group members include objects that have executed bill transactions; A second determination module, configured to determine at least one candidate transaction party from the at least one transaction party based on the bill information in the bill matching request of the requesting party and the quotation information of each of the at least one transaction party; A sending module, used to send transaction information for the bill matching request to the at least one candidate transaction party respectively; The third determination module is used to determine the target transaction party from the at least one candidate transaction party based on the delisting time of each of the at least one candidate transaction party, and generate a bill matching transaction document for the bill matching request based on the target transaction party and the requesting party, wherein the delisting time represents the time when the delisting request is received, and the delisting request is a request from the candidate transaction party based on the transaction information feedback.

9. An electronic device, comprising: one or more processors; a memory for storing one or more computer programs, It is characterized in that the one or more processors execute the one or more computer programs to implement the steps of the method according to any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program or instruction stored thereon, characterized in that: When the computer program or instruction is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images