Advertisement putting link determination method and device

Abstract

The invention discloses a method and a device for determining an advertisement putting link. A specific embodiment of the method comprises the steps of obtaining an advertisement putting appeal of a user; target nodes existing in an advertisement putting graph are determined from the advertisement putting appeals through an advertisement putting intelligent agent, and the advertisement putting graph represents all advertisement links in the advertisement putting process; and determining an advertisement putting link between the target nodes from the advertisement putting graph through the advertisement putting intelligent agent. According to the new method for determining the advertisement putting link provided by the invention, the adaptation degree between the determined advertisement putting link and the user is improved, and the advertisement putting requirement of the user can be met.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of computer technology, specifically to the field of advertising and artificial intelligence technology, and in particular to a method, device, computer-readable medium, and electronic device for determining an advertising delivery link. Background Art

[0002] As a traditional business, advertising has reached a bottleneck after a long period of development. With the help of information technology, Internet advertising has achieved explosive growth in monetization efficiency. However, the extremely high monetization efficiency of Internet advertising has promoted the continuous improvement of the advertising business. From production to delivery, to broadcasting, to effect verification, the links of an advertisement are getting longer and longer, with more and more branches and more and more sophisticated operations. The existing advertising delivery process often cannot meet the advertising delivery needs of users. Summary of the invention

[0003] The embodiments of the present application provide a method, device, computer-readable medium, and electronic device for determining an advertisement delivery link.

[0004] In a first aspect, an embodiment of the present application provides a method for determining an advertising delivery link, including: obtaining a user's advertising delivery demand; determining, through an advertising delivery intelligent agent, target nodes existing in an advertising delivery graph from the advertising delivery demand, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; and determining, through an advertising delivery intelligent agent, advertising delivery links between target nodes from the advertising delivery graph.

[0005] In some examples, the above-mentioned determining the advertising delivery links between target nodes from the advertising delivery graph through the advertising delivery intelligent agent includes: using the advertising delivery intelligent agent to adopt a depth-first traversal algorithm to determine the advertising delivery links between target nodes from the advertising delivery graph.

[0006] In some examples, the above-mentioned advertising delivery agent uses a depth-first traversal algorithm to determine the advertising delivery link between target nodes from the advertising delivery graph, including: using the advertising delivery agent, taking the starting point of the advertising delivery business as the starting node, recursively performing the following search operations on the nodes in the advertising delivery graph: marking the status of the current node as visited, and adding the current node to the current path; in response to determining that the current node is the target node, adding the current path to the advertising delivery link list; in response to determining that there are unvisited nodes among the adjacent nodes of the current node, determining the current node corresponding to the next search operation from the unvisited nodes, and performing the next search operation; in response to determining that all adjacent nodes of the current node are visited, backtracking to the previous node of the current node, marking the access status of the current node as unvisited, and removing the current node from the current path; determining the links in the advertising delivery link list as advertising delivery links between target nodes in the advertising delivery graph.

[0007] In some examples, the above-mentioned advertising delivery graph is created by: extracting key points related to the delivery business in the advertising delivery sub-process; merging the same key points to obtain an advertising delivery graph, wherein the nodes in the advertising delivery graph include node identifiers and node values ​​representing the advertising revenue of the nodes.

[0008] In some examples, the above-mentioned advertisement delivery links include multiple links, and the above-mentioned method also includes: using a preset compression method to compress each of the multiple advertisement delivery links, and displaying the compressed multiple advertisement delivery links.

[0009] In some examples, the above method further includes: determining an advertisement delivery link to be executed from a plurality of advertisement delivery links according to the received link selection operation.

[0010] In some examples, the above method also includes: determining a supplementary demand based on the received supplementary demand operation; determining, through an advertising delivery intelligent agent, an updated target node from an advertising delivery graph based on the advertising delivery demand and the supplementary demand; and determining, through an advertising delivery intelligent agent, an advertising delivery link between the updated target nodes from the advertising delivery graph.

[0011] In a second aspect, an embodiment of the present application provides a device for determining an advertising delivery link, comprising: an acquisition unit, configured to acquire a user's advertising delivery demand; a first determination unit, configured to determine, through an advertising delivery intelligent entity, target nodes existing in an advertising delivery graph from the advertising delivery demand, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; and a second determination unit, configured to determine, through an advertising delivery intelligent entity, advertising delivery links between target nodes from the advertising delivery graph.

[0012] In some examples, the second determination unit is further configured to: determine the advertising delivery links between target nodes from the advertising delivery graph by using a depth-first traversal algorithm through an advertising delivery agent.

[0013] In some examples, the above-mentioned second determination unit is further configured to: through the advertising delivery intelligent agent, with the starting point of the advertising delivery business as the starting node, recursively perform the following search operations on the nodes in the advertising delivery graph: mark the status of the current node as visited, and add the current node to the current path; in response to determining that the current node is the target node, add the current path to the advertising delivery link list; in response to determining that there are unvisited nodes among the adjacent nodes of the current node, determine the current node corresponding to the next search operation from the unvisited nodes, and perform the next search operation; in response to determining that all adjacent nodes of the current node have been visited, trace back to the previous node of the current node, mark the access status of the current node as unvisited, and remove the current node from the current path; determine the links in the advertising delivery link list as advertising delivery links between target nodes in the advertising delivery graph.

[0014] In some examples, the above-mentioned advertising delivery graph is created by: extracting key points related to the delivery business in the advertising delivery sub-process; merging the same key points to obtain an advertising delivery graph, wherein the nodes in the advertising delivery graph include node identifiers and node values ​​representing the advertising revenue of the nodes.

[0015] In some examples, the above-mentioned advertising delivery links include multiple links, and the above-mentioned device also includes: a compression display unit, which is configured to use a preset compression method to compress each of the multiple advertising delivery links and display the compressed multiple advertising delivery links.

[0016] In some examples, the above-mentioned apparatus further includes: a selection unit configured to determine an advertisement delivery link to be executed from a plurality of advertisement delivery links according to a received link selection operation.

[0017] In some examples, the above-mentioned device also includes: a supplementing unit, configured to: determine a supplementary demand based on a received supplementary demand operation; determine an updated target node from an advertising delivery graph based on the advertising delivery demand and the supplementary demand through an advertising delivery intelligent agent; and determine an advertising delivery link between updated target nodes from the advertising delivery graph through an advertising delivery intelligent agent.

[0018] In a third aspect, an embodiment of the present application provides a computer-readable medium having a computer program stored thereon, wherein when the program is executed by a processor, the method described in any implementation manner of the first aspect is implemented.

[0019] In a fourth aspect, an embodiment of the present application provides an electronic device, comprising: one or more processors; a storage device on which one or more programs are stored, and when the one or more programs are executed by one or more processors, the one or more processors implement the method described in any implementation manner of the first aspect.

[0020] The method and device for determining the advertising delivery link provided in the embodiments of the present application obtain the user's advertising delivery demand; determine the target nodes existing in the advertising delivery graph from the advertising delivery demand through an advertising delivery intelligent agent, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; determine the advertising delivery links between the target nodes from the advertising delivery graph through an advertising delivery intelligent agent, thereby providing a new method for determining the advertising delivery link, improving the compatibility between the determined advertising delivery link and the user, and being able to meet the user's advertising delivery needs. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] Other features, objects and advantages of the present application will become more apparent by reading the detailed description of non-limiting embodiments made with reference to the following drawings:

[0022] Figure 1 is an exemplary system architecture diagram in which an embodiment of the present application may be applied;

[0023] Figure 2 is a flow chart of an embodiment of a method for determining an advertisement delivery link according to the present application;

[0024] Figure 3 is a schematic diagram of an advertisement placement diagram according to this embodiment;

[0025] Figure 4 is a schematic diagram of a user interface of multiple compressed advertisement delivery links according to this embodiment;

[0026] Figure 5 is a schematic diagram of an application scenario of the method for determining an advertisement delivery link according to this embodiment;

[0027] Figure 6 is a flow chart of another embodiment of a method for determining an advertisement delivery link according to the present application;

[0028] Figure 7 is a structural diagram of an embodiment of a device for determining an advertisement delivery link according to the present application;

[0029] Figure 8 It is a structural diagram of a computer system suitable for implementing the embodiments of the present application. DETAILED DESCRIPTION

[0030] The present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the relevant invention, rather than to limit the invention. It should also be noted that, for ease of description, only the parts related to the relevant invention are shown in the accompanying drawings.

[0031] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0032] It should be noted that the collection, collection, updating, analysis, processing, use, transmission, storage and other aspects of user personal information involved in the technical solution of this disclosure are in compliance with the provisions of relevant laws and regulations, are used for legitimate purposes, and do not violate public order and good morals. Necessary measures are taken for user personal information to prevent illegal access to user personal information data and maintain the security of user personal information, network security and national security.

[0033] Figure 1 An exemplary architecture 100 is shown to which the method and apparatus for determining an advertisement delivery link of the present application can be applied.

[0034] like Figure 1 As shown, the system architecture 100 may include terminal devices 101, 102, 103, a network 104 and a server 105. The communication connection between the terminal devices 101, 102, 103 constitutes a topological network, and the network 104 is used to provide a medium for the communication link between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0035] The terminal devices 101, 102, 103 can interact with the server 105 through the network 104 to receive or send data, etc. The terminal devices 101, 102, 103 can be hardware devices or software that support network connection for data interaction and data processing. When the terminal devices 101, 102, 103 are hardware, they can be various electronic devices that support network connection, information acquisition, interaction, display, processing and other functions, including but not limited to smart phones, car computers, tablet computers, e-book readers, laptop portable computers and desktop computers, etc. When the terminal devices 101, 102, 103 are software, they can be installed in the electronic devices listed above. It can be implemented as multiple software or software modules for providing distributed services, for example, or it can be implemented as a single software or software module. No specific limitation is made here.

[0036] The server 105 may be a server that provides various services, for example, a backend processing server that obtains the advertisement delivery request issued by the user through the terminal devices 101, 102, 103 and determines the advertisement delivery link that meets the advertisement delivery request based on the advertisement delivery graph. As an example, the server 105 may be a cloud server.

[0037] It should be noted that the server can be hardware or software. When the server is hardware, it can be implemented as a distributed server cluster consisting of multiple servers, or it can be implemented as a single server. When the server is software, it can be implemented as multiple software or software modules (for example, software or software modules used to provide distributed services), or it can be implemented as a single software or software module. No specific limitation is made here.

[0038] It should also be noted that the method for determining the advertisement delivery link provided in the embodiment of the present application can be executed by a server, or by a terminal device, or by the server and the terminal device in cooperation with each other. Accordingly, the various parts (such as various units) included in the device for determining the advertisement delivery link can be all set in the server, or all set in the terminal device, or can be set in the server and the terminal device respectively.

[0039] It should be understood that Figure 1 The number of terminal devices, networks, and servers in the system is only illustrative. Any number of terminal devices, networks, and servers may be provided as required. When the electronic device on which the method for determining an advertisement delivery link is running does not need to perform data transmission with other electronic devices, the system architecture may only include the electronic device (e.g., server or terminal device) on which the method for determining an advertisement delivery link is running.

[0040] Continue to refer Figure 2 , a process 200 of an embodiment of a method for determining an advertisement delivery link is shown, comprising the following steps:

[0041] Step 201, obtaining the user's advertising demand.

[0042] In this embodiment, the execution subject of the method for determining the advertisement delivery link (for example Figure 1 The terminal device or server in the network can obtain the user's advertising demand remotely or locally through a wired network connection or a wireless network connection.

[0043] Users can input advertising demands to the above-mentioned execution entities based on advertising terms and / or non-advertising terms. For example, the advertising engine uses public web services to provide front-end pages and back-end servers, and provides login and advertising delivery functions; users (for example, merchants) use the advertising platform account to log in to the advertising engine and enter the advertising delivery function page. The front-end page supports the input function of advertising demands to support users to input advertising delivery demands. Advertising delivery demands can be represented in the form of text, voice, pictures, videos, etc.

[0044] In order to ensure the feasibility of user advertising demands, user advertising demands generally include at least two types of demand information: advertising budget and advertising effect. The advertising target refers to the revenue that the advertiser hopes to obtain through this advertising.

[0045] The delivery target can be a classification of effects, such as: get 1,000 impressions, get 500 clicks, get 20 conversions; it can also be a classification of business, such as: promote stores, promote products, promote activity pages; it can also be a vague description, such as: get good off-site effects, mainly new customers on the site. The delivery target can be one of the above, or a combination of multiple. Budget refers to the cost that the advertiser can provide, mainly including the amount and period.

[0046] Step 202: The target node existing in the advertising delivery graph is determined from the advertising delivery demand through the advertising delivery agent.

[0047] In this embodiment, the execution subject can determine the target node existing in the advertisement delivery graph from the advertisement delivery demand through the advertisement delivery intelligent agent, wherein the advertisement delivery graph represents all advertisement links in the advertisement delivery process.

[0048] Advertising delivery agents are agents applied in the field of advertising delivery, such as neural network models such as recurrent neural network models and residual network models, and large language models such as GPT (Generative Pre-Trained Transformer) and BERT (Bidirectional Encoder Representations from Transformers).

[0049] In this implementation, the process of determining the advertising agent is as follows:

[0050] 1. Data preparation and preprocessing: First, collect and clean historical data related to the advertising field, including advertising data, user behavior data, etc.; then, preprocess the cleaned data to obtain data in the input format corresponding to the large language model.

[0051] 2. Model training and fine-tuning: Select a large language model (such as ChatGPT) and fine-tune it on advertising domain data to adapt to the advertising delivery task. In addition to loading advertising domain knowledge, the advertising delivery agent needs to load the advertising delivery graph.

[0052] The fine-tuned advertising agent is integrated into the advertising delivery system to determine the advertising delivery link in real time. The advertising delivery system needs to ensure that users' advertising demands are responded to quickly and accurately. During the application process, the monitoring system is used to monitor the advertising effect in real time, and the system is optimized based on the monitoring results, which generally involves adjusting the advertising delivery link and updating the advertising delivery agent.

[0053] Continue to refer Figure 3 , showing a schematic diagram of an advertisement delivery graph 300. The advertisement link includes a plurality of nodes, and there is a connection relationship between the nodes that have a sequential relationship.

[0054] As an example, the execution subject first determines the nodes included in the advertising delivery demand, then matches each node included in the advertising delivery demand with each node in the advertising delivery graph, and determines the matched nodes as target nodes. Generally, the number of determined target nodes is multiple.

[0055] Step 203: determine the advertisement delivery links between target nodes from the advertisement delivery graph through the advertisement delivery agent.

[0056] In this embodiment, the above-mentioned execution subject can determine the advertisement delivery link between the target nodes from the advertisement delivery graph through the advertisement delivery intelligent agent.

[0057] In this embodiment, the above-mentioned execution subject can determine the feasible connection between the target nodes as the advertising delivery link between the target nodes. Among them, the feasible connection between the target nodes means: if the target nodes are not directly connected, then the connection that can connect all the target nodes is a feasible connection; if the target nodes are directly connected, then the connection that is extended so that a closed loop can be formed between the target nodes is a feasible connection.

[0058] In some optional implementations of this embodiment, the execution subject may perform step 203 in the following manner: by using an advertising delivery agent and a depth-first traversal algorithm, the advertising delivery links between target nodes are determined from the advertising delivery graph.

[0059] The depth-first search (DFS) algorithm is a traversal method for graphs or trees. It starts from a node and recursively traverses the depth of the graph by exploring its adjacent nodes. Since the advertising delivery link between target nodes is specifically manifested as the connection relationship between the target nodes in time sequence, the depth-first traversal algorithm is more suitable for the determination process of the advertising delivery link.

[0060] In this implementation, an advertising delivery intelligent agent is used to determine the advertising delivery link using a depth-first traversal algorithm, thereby improving the efficiency and accuracy of determining the advertising delivery link.

[0061] In some optional implementations of this embodiment, the execution subject may perform the process of determining the advertisement delivery link in the following manner:

[0062] First, through the advertising agent, taking the starting point of the advertising business as the starting node, recursively perform the following search operations on the nodes in the advertising graph:

[0063] Mark the status of the current node as visited, and add the current node to the current path; in response to determining that the current node is a target node, add the current path to the advertising delivery link list; in response to determining that there are unvisited nodes among the adjacent nodes of the current node, determine the current node corresponding to the next search operation from the unvisited nodes, and perform the next search operation; in response to determining that all adjacent nodes of the current node have been visited, backtrack to the previous node of the current node, mark the access status of the current node as unvisited, and remove the current node from the current path.

[0064] As an example, the determination process includes the following steps:

[0065] 1. Select the starting point of the advertising service as the starting node and mark it as visited.

[0066] 2. At the same time, initialize an empty advertising link list to store all feasible paths found.

[0067] 3. Recursive search: Starting from the starting node, perform the following steps for each adjacent unvisited node:

[0068] 3.1. Mark the current node as visited.

[0069] 3.2. Add the current node to the current path.

[0070] 3.3. Recursively perform the above steps for unvisited adjacent nodes.

[0071] 3.4. If the current node is the target node, add the current path to the feasible path list.

[0072] 4. Backtracking: After all the adjacent nodes of the current node have been visited, backtrack to the previous node, unmark the current node, and remove the current node from the path. Continue to perform recursive search on other unvisited nodes.

[0073] Repeat steps 3 and 4 until all feasible paths are found. This set is the feasible link set.

[0074] Second, the links in the advertisement delivery link list are determined as advertisement delivery links between target nodes in the advertisement delivery graph.

[0075] For example, if a merchant enters "spend 5,000 yuan to place a certain sku", the calculated advertising links include:

[0076] 1. Use 5,000 yuan to place CPC product ads and add X crowd packages to obtain click effects from targeted groups.

[0077] 2. Use 5,000 yuan to place CPS ads, set X commission, and use a certain expert to get conversion and investment-output ratio.

[0078] 3. Using 5,000 yuan to place contact ads can get better exposure.

[0079] It should be noted that the above example is only a schematic description of the advertisement delivery link. In practice, there are advertisement delivery businesses involving hundreds or thousands of business units, and there will be many advertisement delivery links determined, and the structure will be more complex.

[0080] In this implementation, a specific implementation method of using a depth-first traversal algorithm to determine an advertisement delivery link is provided, which further improves the efficiency and accuracy of determining the advertisement delivery link.

[0081] In some optional implementations of this embodiment, the advertisement placement graph is created in the following manner:

[0082] First, extract the key points related to the advertising business in the advertising delivery sub-process; then, merge the same key points to obtain an advertising delivery graph. The nodes in the advertising delivery graph include node identifiers and node values ​​representing the advertising revenue of the nodes.

[0083] As an example, firstly, various existing advertising delivery processes are sorted out. Then, the following operations are performed on various advertising delivery processes: each business-related key point in the delivery process is extracted; and nodes are merged for the same key points.

[0084] After all the advertising delivery processes are disassembled and the above operations are performed, a complete advertising delivery graph knowledge base can be formed.

[0085] Each node in the advertising graph contains two pieces of information: node identification and node value. The node identification is used to represent the advertising action of this node, and the node value is the advertising revenue of this node. For example, the advertising revenue of the CPS (Cost Per Sale) node includes the highest investment-output ratio and high conversion rate.

[0086] In this implementation, a method for generating an advertisement placement map is provided, which improves the comprehensiveness and accuracy of the information in the advertisement placement map.

[0087] In some optional implementations of this embodiment, the advertisement delivery links between the target nodes include multiple links. In this implementation, the execution subject may also perform the following operations:

[0088] A preset compression method is used to compress each of the multiple advertisement delivery links, and the compressed multiple advertisement delivery links are displayed. The preset compression method can be specifically set according to actual conditions and is not limited here.

[0089] In this implementation, the execution subject may first construct a data structure of an advertisement delivery link, and the data structure mainly includes two parts: feasible delivery behavior and expected revenue.

[0090] Specifically, the execution subject above takes the input information (node ​​identifier and node value) of the nodes in the advertising delivery graph as the basis to form a two-dimensional data structure: {feasible delivery behavior: expected return}; and then, the feasible link is expressed by the above structure. The following is an example of a set of feasible links:

[0091] {Advertising demand}-{Feasible advertising behavior 1: Expected return 1}-{Feasible advertising behavior 2: Expected return 2}

[0092] {Advertising demand}-{Feasible advertising behavior 1: Expected return 1}-{Feasible advertising behavior 3: Expected return 3}

[0093] {Advertising demand}-{Feasible advertising behavior 2: Expected return 2}-{Feasible advertising behavior 3: Expected return 3}

[0094] The preset compression method is, for example, to select only nodes directly connected to the target node to represent a feasible link, and to deduplicate repeated expected benefits, and to combine the deduplicated results together.

[0095] Continuing with the above advertising demand of "spending 5,000 yuan to place a certain sku", refer to the attached Figure 4 , showing a user interface 400 of compressed multiple advertisement delivery links. The compressed multiple advertisement delivery links are:

[0096] Viable link 1: CPC (Cost Per Click), expected effect XXX

[0097] Feasible link 2: CPS, expected effect XXX

[0098] Viable link 3: Touch point advertising, expected effect XXX

[0099] The advertising delivery agent uses the above compression method to output and display the first N feasible links on the front end. Users can view the links and can choose to expand them to view the details of each feasible link.

[0100] In this implementation, multiple compressed advertising delivery links are displayed to the user, which improves the user experience and information acquisition efficiency.

[0101] In some optional implementations of this embodiment, the execution subject may further perform the following operation: determining an advertisement delivery link to be executed from multiple advertisement delivery links according to the received link selection operation.

[0102] Users can use voice commands, click, touch and other action commands to issue link selection operations. Figure 4 The above-mentioned execution subject can directly click the display area corresponding to the advertisement delivery link to issue a link selection operation.

[0103] In this implementation, users can flexibly select the advertising delivery link to be executed based on their own demands, which helps to further improve the user experience and meet the user's advertising delivery demands.

[0104] In some optional implementations of this embodiment, the above execution subject may also perform the following operations:

[0105] First, the supplementary demands are determined according to the received supplementary demands operation.

[0106] Continue to refer to the above Figure 4 , users can click the "Supplementary Demand" button to enter additional demands.

[0107] Then, through the advertising delivery agent, according to the advertising delivery demands and supplementary demands, the updated target node is determined from the advertising delivery graph.

[0108] As an example, the execution subject first determines the nodes included in the supplementary appeal, and then matches each node included in the advertising demand and each node included in the supplementary appeal with each node in the advertising graph, and determines the matched nodes as updated target nodes. Generally, there are multiple target nodes.

[0109] Finally, the advertising delivery links between the updated target nodes are determined from the advertising delivery graph through the advertising delivery agent.

[0110] In this implementation, the execution subject may refer to the above process of determining the advertisement delivery link based on the target node to determine the advertisement delivery link between the updated target nodes, which will not be described in detail here.

[0111] In this implementation, the user can perform multiple demand supplement operations based on the advertising delivery demand to express the demand information as perfectly as possible, so that the final advertising delivery link is more adapted to the user's expectations.

[0112] Continue to see Figure 5 , Figure 5 FIG. 5 is a schematic diagram 500 of an application scenario of the method for determining an advertisement delivery link according to this embodiment. Figure 5 In the application scenario, user 501 sends an advertisement delivery request to server 503 through terminal device 502. Server 503 first obtains the user's advertisement delivery request; then, through the advertisement delivery agent, it determines the target nodes existing in the advertisement delivery graph from the advertisement delivery request, wherein the advertisement delivery graph represents all advertisement links in the advertisement delivery process; finally, through the advertisement delivery agent, it determines the advertisement delivery links between the target nodes from the advertisement delivery graph.

[0113] The method provided by the above-mentioned embodiment of the present application obtains the user's advertising delivery demand; determines the target nodes existing in the advertising delivery graph from the advertising delivery demand through an advertising delivery intelligent agent, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; determines the advertising delivery links between the target nodes from the advertising delivery graph through an advertising delivery intelligent agent, thereby providing a new method for determining the advertising delivery link, improving the compatibility between the determined advertising delivery link and the user, and being able to meet the user's advertising delivery needs.

[0114] Continue to refer Figure 6 , shows a schematic process 600 of another embodiment of a method for determining an advertisement delivery link according to the present application, comprising the following steps:

[0115] Step 601, obtaining the user's advertising demand.

[0116] Step 602: Determine the target node existing in the advertising delivery graph from the advertising delivery demand through the advertising delivery intelligent agent.

[0117] Among them, the advertisement delivery graph represents all advertisement links in the advertisement delivery process.

[0118] Step 603: The advertisement delivery agent uses the starting point of the advertisement delivery service as the starting node to recursively perform the following search operations on the nodes in the advertisement delivery graph:

[0119] Step 6031, mark the state of the current node as visited, and add the current node to the current path.

[0120] Step 6032: In response to determining that the current node is a target node, the current path is added to the advertisement delivery link list.

[0121] Step 6033, in response to determining that there are unvisited nodes among the neighboring nodes of the current node, determine the current node corresponding to the next search operation from the unvisited nodes, and perform the next search operation.

[0122] Step 6034, in response to determining that all adjacent nodes of the current node have been visited, backtrack to the previous node of the current node, mark the access status of the current node as unvisited, and remove the current node from the current path.

[0123] Step 604: determine the links in the advertisement delivery link list as advertisement delivery links between target nodes in the advertisement delivery graph.

[0124] Step 605: compress each of the multiple advertisement delivery links using a preset compression method, and display the compressed multiple advertisement delivery links.

[0125] Step 606: Determine a supplementary demand according to the received supplementary demand operation.

[0126] Step 607, through the advertising delivery agent, according to the advertising delivery demands and supplementary demands, determine the updated target node from the advertising delivery graph.

[0127] Step 608: Determine the advertising delivery links between the updated target nodes from the advertising delivery graph through the advertising delivery agent.

[0128] It can be seen from this embodiment that Figure 2 Compared with the corresponding embodiments, process 600 of the method for determining the advertising delivery link in this embodiment specifically illustrates the determination process and display process of the advertising delivery link, the supplementation process of the advertising delivery demands, and the process of redetermining the advertising delivery link based on the supplemented demands, which further improves the compatibility between the determined advertising delivery link and the user and can meet the user's advertising delivery needs.

[0129] Continue to refer Figure 7 As an implementation of the methods shown in the above figures, the present application provides an embodiment of a device for determining an advertisement delivery link. Figure 2Corresponding to the method embodiment shown, the device can be specifically applied to various electronic devices.

[0130] like Figure 7 As shown, the device 700 for determining the advertising delivery link includes: an acquisition unit 701, configured to acquire the user's advertising delivery demand; a first determination unit 702, configured to determine the target nodes existing in the advertising delivery graph from the advertising delivery demand through the advertising delivery intelligent agent, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; a second determination unit 703, configured to determine the advertising delivery links between the target nodes from the advertising delivery graph through the advertising delivery intelligent agent.

[0131] In some optional implementations of this embodiment, the second determination unit 703 is further configured to: determine the advertisement delivery links between target nodes from the advertisement delivery graph by using a depth-first traversal algorithm through an advertisement delivery agent.

[0132] In some optional implementations of the present embodiment, the second determination unit 703 is further configured to: through the advertising delivery agent, with the starting point of the advertising delivery business as the starting node, recursively perform the following search operations on the nodes in the advertising delivery graph: mark the status of the current node as visited, and add the current node to the current path; in response to determining that the current node is the target node, add the current path to the advertising delivery link list; in response to determining that there are unvisited nodes among the adjacent nodes of the current node, determine the current node corresponding to the next search operation from the unvisited nodes, and perform the next search operation; in response to determining that all adjacent nodes of the current node have been visited, trace back to the previous node of the current node, mark the access status of the current node as unvisited, and remove the current node from the current path; determine the links in the advertising delivery link list as advertising delivery links between target nodes in the advertising delivery graph.

[0133] In some optional implementations of the present embodiment, the above-mentioned advertising delivery graph is created in the following manner: extracting key points related to the delivery business in the advertising delivery sub-process; merging the same key points to obtain an advertising delivery graph, wherein the nodes in the advertising delivery graph include node identifiers and node values ​​representing the advertising revenue of the nodes.

[0134] In some optional implementations of this embodiment, the above-mentioned advertising delivery links include multiple links, and the above-mentioned device also includes: a compression display unit (not shown in the figure), which is configured to use a preset compression method to compress each of the multiple advertising delivery links and display the compressed multiple advertising delivery links.

[0135] In some optional implementations of this embodiment, the above-mentioned device also includes: a selection unit (not shown in the figure), which is configured to determine an advertisement delivery link to be executed from multiple advertisement delivery links according to the received link selection operation.

[0136] In some optional implementations of the present embodiment, the above-mentioned device also includes: a supplementing unit (not shown in the figure), which is configured to: determine the supplementary demand based on the received supplementary demand operation; determine the updated target node from the advertising delivery graph through the advertising delivery intelligent agent according to the advertising delivery demand and the supplementary demand; determine the advertising delivery link between the updated target nodes from the advertising delivery graph through the advertising delivery intelligent agent.

[0137] In this embodiment, an acquisition unit in a device for determining an advertising delivery link acquires a user's advertising delivery demand; a first determination unit determines, through an advertising delivery intelligent agent, target nodes existing in an advertising delivery graph from the advertising delivery demand, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; a second determination unit determines, through an advertising delivery intelligent agent, advertising delivery links between target nodes from the advertising delivery graph, thereby providing a new device for determining advertising delivery links, improving the compatibility between the determined advertising delivery links and the user, and being able to meet the user's advertising delivery needs.

[0138] Reference below Figure 8 , which shows a device suitable for implementing the embodiments of the present application (eg Figure 1 Schematic diagram of the structure of a computer system 800 of the devices 101, 102, 103, 105 shown. Figure 8 The device shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0139] like Figure 8 As shown, the computer system 800 includes a processor (e.g., CPU, central processing unit) 801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 802 or a program loaded from a storage part 808 into a random access memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the system 800 are also stored. The processor 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An input / output (I / O) interface 805 is also connected to the bus 804.

[0140] The following components are connected to the I / O interface 805: an input section 806 including a keyboard, a mouse, etc.; an output section 807 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 808 including a hard disk, etc.; and a communication section 809 including a network interface card such as a LAN card, a modem, etc. The communication section 809 performs communication processing via a network such as the Internet. A drive 810 is also connected to the I / O interface 805 as needed. A removable medium 811, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 810 as needed, so that a computer program read therefrom is installed into the storage section 808 as needed.

[0141] In particular, according to an embodiment of the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication part 809, and / or installed from a removable medium 811. When the computer program is executed by the processor 801, the above-mentioned functions defined in the method of the present application are executed.

[0142] It should be noted that the computer-readable medium of the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, 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), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. This propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the above.

[0143] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the client computer, partially on the client computer, as a separate software package, partially on the client computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the client computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0144] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the device, method and computer program product according to various embodiments of the present application. 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 module, the program segment or a part of the 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 and / or flow chart, and the combination of the boxes in the block diagram and / 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.

[0145] The units involved in the embodiments described in the present application may be implemented by software or by hardware. The described units may also be set in a processor, for example, may be described as: a processor, comprising an acquisition unit, a first determination unit, and a second determination unit. Among them, the names of these units do not constitute a limitation on the unit itself under certain circumstances. For example, the first determination unit may also be described as "a unit that determines the target node existing in the advertising delivery graph from the advertising delivery demand through an advertising delivery intelligent agent."

[0146] As another aspect, the present application also provides a computer-readable medium, which may be included in the device described in the above embodiment; or it may exist independently without being assembled into the device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by the device, the computer device: obtains the user's advertising delivery demand; determines the target nodes existing in the advertising delivery graph from the advertising delivery demand through the advertising delivery intelligent agent, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; determines the advertising delivery links between the target nodes from the advertising delivery graph through the advertising delivery intelligent agent.

[0147] The above description is only a preferred embodiment of the present application and an explanation of the technical principles used. Those skilled in the art should understand that the scope of the invention involved in the present application is not limited to the technical solution formed by a specific combination of the above technical features, but should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above invention concept. For example, the above features are replaced with the technical features with similar functions disclosed in this application (but not limited to) by each other to form a technical solution.

Claims

1. A method for determining an advertisement delivery link, comprising: Obtain users' advertising demands; Determine, by means of an advertising delivery agent, a target node existing in an advertising delivery graph from the advertising delivery demand, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; The advertisement delivery link between the target nodes is determined from the advertisement delivery graph through the advertisement delivery agent.

2. The method according to claim 1, wherein: The step of determining the advertisement delivery link between the target nodes from the advertisement delivery graph by the advertisement delivery agent includes: The advertisement delivery intelligent agent adopts a depth-first traversal algorithm to determine the advertisement delivery links between the target nodes from the advertisement delivery graph.

3. The method according to claim 2, wherein: The step of determining the advertisement delivery links between the target nodes from the advertisement delivery graph by using the advertisement delivery agent and adopting a depth-first traversal algorithm includes: The advertisement delivery agent uses the starting point of the advertisement delivery business as the starting node to recursively perform the following search operations on the nodes in the advertisement delivery graph: Mark the state of the current node as visited, and add the current node to the current path; in response to determining that the current node is the target node, add the current path to the advertisement delivery link list; in response to determining that there is an unvisited node among the adjacent nodes of the current node, determine the current node corresponding to the next search operation from the unvisited nodes, and perform the next search operation; in response to determining that all adjacent nodes of the current node are visited, backtrack to the previous node of the current node, mark the access state of the current node as unvisited, and remove the current node from the current path; The links in the advertisement delivery link list are determined as advertisement delivery links between the target nodes in the advertisement delivery graph.

4. The method according to claim 1, wherein: The advertising placement graph is created in the following way: Extracting key points related to the advertising delivery business in the advertising delivery sub-process; The same key points are merged to obtain the advertisement placement graph, wherein the nodes in the advertisement placement graph include node identifiers and node values ​​representing the advertisement revenue of the nodes.

5. The method according to claim 1, wherein: The advertisement delivery link includes multiple links, and The method further comprises: A preset compression method is adopted to compress each of the multiple advertisement delivery links, and the compressed multiple advertisement delivery links are displayed.

6. The method according to claim 5, wherein: Also includes: According to the received link selection operation, an advertisement delivery link to be executed is determined from the multiple advertisement delivery links.

7. The method according to any one of claims 1 to 6, wherein: Also includes: Determine the supplementary demands according to the received supplementary demands operation; Determine, by the advertising delivery agent, an updated target node from the advertising delivery graph according to the advertising delivery demand and the supplementary demand; The advertisement delivery link between the updated target nodes is determined from the advertisement delivery graph through the advertisement delivery agent.

8. A method for determining an advertisement delivery link, comprising: An acquisition unit, configured to acquire a user's advertising demand; A first determination unit is configured to determine, through an advertising delivery agent, a target node existing in an advertising delivery graph from the advertising delivery demand, wherein the advertising delivery graph represents all advertising links in the advertising delivery process; The second determining unit is configured to determine the advertisement delivery links between the target nodes from the advertisement delivery graph through the advertisement delivery agent.

9. A computer readable medium having a computer program stored thereon, wherein: When the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

10. An electronic device comprising: one or more processors; a storage device having one or more programs stored thereon, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 7.

11. A computer program product comprising: A computer program which, when executed by a processor, implements the method according to any one of claims 1 to 7.

Images