CN113743974A - Resource recommendation method and device, equipment and storage medium - Google Patents

Resource recommendation method and device, equipment and storage medium Download PDF

Info

Publication number
CN113743974A
CN113743974A CN202110051017.XA CN202110051017A CN113743974A CN 113743974 A CN113743974 A CN 113743974A CN 202110051017 A CN202110051017 A CN 202110051017A CN 113743974 A CN113743974 A CN 113743974A
Authority
CN
China
Prior art keywords
node
resource
attribute
elements
target
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202110051017.XA
Other languages
Chinese (zh)
Inventor
王苑青
黄栋
沈俊杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Wodong Tianjun Information Technology Co Ltd
Original Assignee
Beijing Wodong Tianjun Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Wodong Tianjun Information Technology Co Ltd filed Critical Beijing Wodong Tianjun Information Technology Co Ltd
Priority to CN202110051017.XA priority Critical patent/CN113743974A/en
Publication of CN113743974A publication Critical patent/CN113743974A/en
Priority to PCT/CN2022/070845 priority patent/WO2022152061A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0251Targeted advertisements
    • G06Q30/0269Targeted advertisements based on user profile or attribute
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • G06F16/24553Query execution of query operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0241Advertisements
    • G06Q30/0277Online advertisement

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Development Economics (AREA)
  • Finance (AREA)
  • Theoretical Computer Science (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the application discloses a resource recommendation method, which comprises the following steps: obtaining elements included in the material to obtain a first element set, and obtaining elements included in the resource to obtain a second element set; mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node; connecting edges between the first node and the second node to construct a node relation graph; searching for a match in the node relationship graph; and under the condition that the matching is found, taking the resource as the resource to be recommended, and outputting the resource identifier of the resource to be recommended. In addition, the embodiment of the application also discloses a resource recommendation device, equipment and a storage medium.

Description

Resource recommendation method and device, equipment and storage medium
Technical Field
The embodiment of the application relates to the field of information processing, and relates to but is not limited to a resource recommendation method, a resource recommendation device, resource recommendation equipment and a storage medium.
Background
Currently, advertisements are generally put on internet websites, so that the business revenue of the websites is increased, the display forms of the advertisements are various, such as banner modes, floating animations, slides and the like, the advertisement materials also have various expression forms of pictures, videos, animations and the like, and the advertisement materials can be dynamically adjusted according to schedules, customer requirements, activity arrangement and the like.
At present, when an advertiser puts an advertisement, the advertiser needs to select an advertisement space first and then upload advertisement materials to the advertisement space, but the problems that the pattern requirements of the advertisement materials and the advertisement space are not consistent, such as picture size is not consistent, video duration is too long, code rate is not consistent are often encountered, at the moment, the advertiser needs to modify the materials or select the advertisement space in a backspacing mode, and after the advertisement space is selected in a backspacing mode, the problem that the pattern requirements of the uploaded advertisement materials and the advertisement space are not consistent still exists, so that a large amount of workload and complex operation are brought to the advertiser.
Disclosure of Invention
In view of this, embodiments of the present application provide a resource recommendation method, device, apparatus, and storage medium for solving at least one problem in the related art, so as to recommend an advertisement slot adapted to a material to a user, and improve the work efficiency of the user.
The technical scheme of the embodiment of the application is realized as follows:
in a first aspect, an embodiment of the present application provides a resource recommendation method, where the method includes:
obtaining elements included in the material to obtain a first element set, and obtaining elements included in the resource to obtain a second element set;
mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node;
connecting edges between the first node and the second node to construct a node relation graph;
searching for a match in the node relationship graph;
and under the condition that the matching is found, taking the resource as the resource to be recommended, and outputting the resource identifier of the resource to be recommended.
In a second aspect, an embodiment of the present application provides a resource recommendation apparatus, where the apparatus includes:
the acquisition unit is used for acquiring elements included in the material to obtain a first element set, and acquiring elements included in the resource to obtain a second element set;
a mapping unit, configured to map each first element in the first element set as a first node, and map each second element in the second element set as a second node;
the building unit is used for connecting edges between the first node and the second node and building a node relation graph;
the matching unit is used for searching matching in the node relation graph;
and the output unit is used for taking the resource as the resource to be recommended and outputting the resource identifier of the resource to be recommended under the condition that the matching is found.
In a third aspect, an embodiment of the present application provides a computer device, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the steps in the resource recommendation method when executing the computer program.
In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps in the resource recommendation method.
In the embodiment of the application, a resource recommendation method is provided, elements included in a material are obtained to obtain a first element set, elements included in a resource are obtained to obtain a second element set; mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node; connecting edges between the first node and the second node to construct a node relation graph; searching for a match in the node relationship graph; under the condition that the matching is found, the resource is taken as a resource to be recommended, and a resource identifier of the resource to be recommended is output; therefore, before the user uploads the material, whether the material is matched with the resource can be effectively judged, the matched resource is recommended to the user as the resource to be recommended, the user is prevented from blindly selecting the resource, the problem of material modification or resource reselection caused by the fact that the material to be uploaded of the selected resource is not matched is avoided, and the working efficiency of the user is improved.
Drawings
FIG. 1 is a schematic diagram of an alternative configuration of an information processing system according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an alternative configuration of an information processing system according to an embodiment of the present application;
fig. 3 is an optional flowchart schematic diagram of a resource recommendation method provided in an embodiment of the present application;
fig. 4 is an optional structural schematic diagram of a node relationship diagram provided in the embodiment of the present application;
fig. 5 is an optional flowchart schematic diagram of a resource recommendation method provided in an embodiment of the present application;
fig. 6 is an optional flowchart schematic diagram of a resource recommendation method provided in an embodiment of the present application;
fig. 7 is an optional structural schematic diagram of a node relationship diagram provided in the embodiment of the present application;
fig. 8 is an alternative flow diagram of a resource recommendation method provided in an embodiment of the present application;
fig. 9 is an alternative structural diagram of a resource recommendation device according to an embodiment of the present application;
fig. 10 is an alternative structural schematic diagram of an electronic device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the following will describe the specific technical solutions of the present application in further detail with reference to the accompanying drawings in the embodiments of the present application. The following examples are intended to illustrate the present application but are not intended to limit the scope of the present application.
Before further detailed description of the embodiments of the present application, terms and expressions referred to in the embodiments of the present application are described for better understanding of the present application, and the terms and expressions referred to in the embodiments of the present application are applied to the following explanations.
1) Web content composed of material, text, picture, video and other content, such as: advertising material.
2) Resources, page display areas capable of carrying material, such as: an ad slot.
3) An element, individual ones of the content that the material comprises, or individual ones of the content that the asset can carry. Elements may include text, pictures, video, audio, etc., depending on the type.
4) Attributes, which can characterize the requirements of the elements comprised by the material, include: type, size, etc.
5) The attribute requirement can characterize the capability of the elements which can be carried by the resource, and comprises the following steps: type requirements, size requirements, and the like.
5) And the node relation graph takes the elements as nodes, and edges are connected between a first node corresponding to the elements of the materials and a second node corresponding to the elements of the resources. When an edge is connected between the first node and the second node, the element corresponding to the first node is characterized to be adapted to the element corresponding to the second node, that is, the element corresponding to the second node can bear the element corresponding to the first node. Such as: a bipartite graph.
6) The graph comprises two sections, wherein two nodes related to each edge in the graph respectively belong to two different node sets.
7) And matching, in a subgraph in the node relationship graph, any two edges in the subgraph are not attached to the same node, and the subgraph is called as a match.
The embodiment of the application can provide a resource recommendation method, a resource recommendation device, equipment and a storage medium. In practical application, the resource recommendation method may be implemented by a text error correction apparatus, and each functional entity in the text error correction apparatus may be cooperatively implemented by hardware resources of a computer device (such as a terminal device, a server, or a server cluster), such as computing resources of a processor and communication resources (for example, for supporting communication in various manners such as optical cables and cells).
The resource recommendation method of the embodiment of the application can be applied to the information processing system shown in fig. 1, and the resource recommendation device in the information processing system can determine whether a resource is a resource to be recommended.
In one example, as shown in FIG. 1, the information handling system includes a client 10 and a server 20; the client 10 is installed with an input application APP capable of receiving user input operations or a browser providing an input page, and a user can receive materials input by the user through the input application APP or the input page. The server 20 serves the client 10, and the server 20 includes resources and can receive the material sent by the client 10, determine whether a resource is a resource to be recommended for the received material, and output the resource to be recommended to the client 10. The client 10 and the server 20 interact with each other via the network 30.
The server 20 may be implemented as a resource recommendation device implementing the resource recommendation method. The server 20 obtains elements included in the material to obtain a first element set, and obtains elements included in the resource to obtain a second element set; mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node; connecting edges between the first node and the second node to construct a node relation graph; searching for a match in the node relationship graph; and under the condition that the matching is found, taking the resource as the resource to be recommended, outputting the resource identifier of the resource, and outputting the resource identifier of the resource to the client 10. The resource identifier of the resource to be recommended can be presented to the user in the client 10 through the display.
In one example, as shown in fig. 2, only the client 40 is included in the information processing system, and the client 40 is implemented as a resource recommendation device that implements the resource recommendation method.
The method comprises the steps that a client receives a material input by a user through an input application program APP or an input page, obtains elements included in the material to obtain a first element set, and obtains elements included in resources to obtain a second element set; mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node; connecting edges between the first node and the second node to construct a node relation graph; searching for a match in the node relationship graph; and under the condition that the matching is found, the resource is taken as the resource to be recommended, and the resource identifier of the resource to be recommended is presented to the user through the display.
In combination with the information processing system, the embodiment provides a resource recommendation method, which can recommend an advertisement space adapted to a material to a user, and improve the work efficiency of the user.
Embodiments of a resource recommendation method, an apparatus, a device, and a storage medium according to the embodiments of the present application are described below with reference to schematic diagrams of information processing systems shown in fig. 1 or fig. 2.
The embodiment provides a resource recommendation method, which is applied to resource recommendation equipment, wherein the resource recommendation equipment can be computer equipment or a distributed network formed by the computer equipment. The functions implemented by the method may be implemented by calling program code by a processor in a computer device, which may, of course, be stored in a computer storage medium, which may comprise at least a processor and a storage medium.
Fig. 3 is a schematic flow chart of an implementation of a resource recommendation method according to an embodiment of the present application, and as shown in fig. 3, the method may include the following steps:
s301, obtaining elements included in the material to obtain a first element set, and obtaining elements included in the resource to obtain a second element set.
The resource recommendation device receives a material input by a user, and analyzes elements in the material to obtain elements included in the material, wherein the elements in the material are referred to as first elements, and a set formed by the first elements is referred to as a first element set. In the embodiment of the application, one material corresponds to one first element set. Wherein the type of the first element included in the material includes one or more of the following types: text, pictures, audio, video, etc. In one example, the first set of elements corresponding to material 1 is: text 1, text 2, and video 2. In one example, the first set of elements corresponding to material 2 is: text 1, text 2, picture 1, picture 2, picture 3, video 1, and video 2.
The resource recommendation equipment obtains the elements which can be carried by the resources for analysis, and obtains the elements included by the resources. Here, an element in the resource is referred to as a second element, and a set of the second elements is referred to as a second element set. In the embodiment of the present application, one resource corresponds to one second element set. In one example, the second set of elements corresponding to resource 1 is: title 1, main picture, sub picture and video 1. The type of the title is text, the type of the main graph is picture, the type of the sub graph is picture, and the type of the video 1 is video. In one example, the first set of elements corresponding to material 2 is: text 1, text 2, picture 1, picture 2, picture 3, video 1, and video 2.
S302, mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node.
Such as: the first set of elements includes: element 11, element 12, and element 13. Mapping element 11, element 12, and element 13 to a first node in a one-to-one correspondence: node s11, node s12, and node s13, where node s11, node s12, and the nodes form a first set of nodes.
Such as: the second set of elements includes: element 21, element 22, element 23, element 24, and element 25, and mapping element 21, element 22, element 23, element 24, and element 25 to the second node in a one-to-one correspondence: node s21, node s22, node s23, node s24, and node s25, where node s21, node s22, node s23, node s24, and node s25 form a second set of nodes.
S303, connecting edges between the first node and the second node to construct a node relation graph.
Edges are connected between the first nodes of the first node set and the second nodes of the second node set, and the formed node relation graph is a bipartite graph.
In the embodiment of the present application, an edge is connected between a first node and a second node according to a relationship between an attribute of an element corresponding to the first node and an attribute requirement of an element corresponding to the second node. When the attribute of the element corresponding to the first node is in accordance with the attribute requirement of the element corresponding to the second node, connecting an edge between the first node and the second node; and when the attribute of the element corresponding to the first node does not accord with the attribute requirement of the element corresponding to the second node, no edge is connected between the first node and the second node.
In one example, the constructed node relationship diagram is shown in fig. 4, the node s11, the node s12, and the node 13 form a first node set, the node s21, the node s22, the node s23, the node s24, and the node s25 form a second node set, and the connecting edges include: edges between node s11 and node s21, node s23, node s24 and node s25, edges between node s12 and node s21, node s22, node s24 and node s25, and edges between node s13 and node s21, node s22, node s23, node s24 and node s 25.
S304, searching matching in the node relation graph.
After the node relation graph is obtained, a subgraph is searched in the node relation graph based on a matching algorithm, any two edges in the searched subgraph are not attached to the same node, and the subgraph is called as a match.
In the embodiment of the present application, the matching algorithm used for searching for matching may include: maximum Flow (Maximal Flow) or Hungarian Algorithm (Hungarian Algorithm).
In the embodiment of the present application, the matching algorithm used for searching for matching is not limited at all.
In an example, for the node relationship graph shown in fig. 4, the first set of elements includes: element 11, element 12, and element 13, the second set of elements comprising: element 21, element 22, element 23, element 24, and element 25, corresponding to a first node in the first set of nodes comprising: node s11, node s12, and node 13, a second node of the second set of nodes comprising: node s21, node s22, node s23, node s24, and node s25, the found matches including: node S11-node S23, node S12-node S25, node S13-node S21.
In an example, the first set of elements includes: element 11, element 12, and element 13. The second set of elements includes: element 21, element 22, element 23, element 24, and element 25, corresponding to a first node in the first set of nodes comprising: node s11, node s12, and node 13, a second node of the second set of nodes comprising: the node s21, the node s22, the node s23, the node s24 and the node s25, and the matching searched based on the node relationship graph formed by the first node in the first node set and the second node in the second node set comprises the following steps: node s 11-node s23, node s 13-node s 25.
S305, under the condition that the matching is found, taking the resource as a resource to be recommended, and outputting a resource identifier of the resource to be recommended.
And when the matching is found in the node relation graph corresponding to the resource, determining that the resource is the resource to be recommended, acquiring a resource identifier of the resource, and outputting the resource identifier of the resource to be recommended to present to a user, so that the user can know that the presented resource can bear the material.
In practical applications, the resource recommendation device may perform the steps S301 to S304 for a material and a plurality of resources, respectively, determine a recommendable resource from the plurality of resources, and output a resource identifier of the determined recommendable resource to the user. Each resource corresponds to a node relation graph, and when matching is found from the node relation graph, the resource corresponding to the node relation graph is considered as a resource to be recommended, and the resource can bear current materials; and when the matching is not found in the node relation graph, the resource corresponding to the node relation graph is not considered to be the resource to be recommended, and the resource cannot bear the current material.
In one example, the material uploaded by the user is material 1, and the resources provided by the resource provider include: resource 1, resource 2, and resource 3. Obtaining a node relation graph 1 according to the elements of the material 1 and the elements of the resource 1, and finding a match in the node relation graph 1: matching 1; obtaining a node relation graph 2 according to the elements of the material 1 and the elements of the resource 2, wherein matching is not found in the node relation graph 2; obtaining a node relation graph 3 according to the elements of the material 1 and the elements of the resource 3, and finding a match in the node relation graph 3: and matching 2, if the resources 1 and 3 can bear the material 1, recommending the resources 1 and 3 to the user.
When the user knows that the resources can bear the materials, namely the resources can be adapted to the materials, and the resources comprise a plurality of resources, the user can select the target resources of the material displayed by the user from the plurality of resources according to the resource information such as the charging and the position of each resource.
In practical application, when the resource to be recommended determined by the resource recommendation device includes a plurality of resources, the resource information such as the charging rate and the position of each resource to be recommended can be acquired, the recommendation degree of each resource is calculated according to the resource information, and the recommendation degree of each resource to be recommended is output while the resource identifier of the resource to be recommended is output.
According to the resource recommendation method provided by the embodiment of the application, elements included in a material are obtained to obtain a first element set, and elements included in a resource are obtained to obtain a second element set; mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node; connecting edges between the first node and the second node to construct a node relation graph; searching for a match in the node relationship graph; under the condition that the matching is found, the resource is taken as a resource to be recommended, and a resource identifier of the resource to be recommended is output; therefore, before the user uploads the material, whether the material is matched with the resource can be effectively judged, the matched resource is recommended to the user as the resource to be recommended, the user is prevented from blindly selecting the resource, the problem of material modification or resource reselection caused by the fact that the material to be uploaded of the selected resource is not matched is avoided, and the working efficiency of the user is improved.
In some embodiments, as shown in fig. 5, the implementation of S303 includes:
s3031, acquiring the attribute of the first element and the attribute requirement of the second element.
The attributes of the first element include: a type and an element parameter, wherein the type comprises: the style of the representation elements such as texts, pictures and videos, the size of the representation elements of the element parameters, and the like. When the type is text, the element parameters include: length, when the type is picture, the element parameters include: one or more of size, dimension, resolution. When the type is video, the element parameters include: aspect ratio, size, code rate, duration.
The attribute requirements of the second element include: type requirements and parameter requirements, wherein the type requirements include: the style of the elements which can be carried by resources such as the book, the picture, the video and the like, and the parameter requirement represent the specific requirement on the style of the carried elements. When the type requirement is a text, the parameter requirement includes: length, when the type requirement is a picture, the parameter requirement includes: one or more of size, dimension, resolution. When the type requirement is video, the parameter requirements include: aspect ratio, size, code rate, duration.
S3032, establishing a connection edge between the corresponding first node and the corresponding second node according to the attribute of the first element and the attribute requirement of the second element, and constructing the node relation graph.
After determining the attribute of each first element in the material and the attribute requirement of each second element in the resource, determining whether each first element is consistent with each second element, and connecting edges between the first node and the second node corresponding to the consistent first element and the consistent second element respectively to obtain a node relation graph. In some embodiments, the implementation of S3032 comprises: traversing the attribute of each first element and the attribute requirement of each second element, and determining an element pair with the attribute requirement in accordance with the attribute; and connecting edges between the first nodes and the second nodes corresponding to the first elements and the second elements in the element pairs respectively to obtain a node relation graph.
In an example, for the node relationship graph shown in fig. 4, the first set of elements includes: element 11, element 12, and element 13, the second set of elements comprising: element 21, element 22, element 23, element 24, and element 25, corresponding to a first node in the first set of nodes comprising: node s11, node s12, and node 13, a second node of the second set of nodes comprising: node s21, node s22, node s23, node s24, and node s 25; determining an element pair with the attribute requirements in accordance with the attributes by respectively matching the attribute of the element 11, the attribute of the element 12 and the attribute of the element 13 with the attribute requirements of the element 21, the attribute requirements of the element 22, the attribute requirements of the element 23, the attribute requirements of the element 24 and the attribute requirements of the element 25, wherein the determined element pair comprises: elements 11 and 21, elements 11 and 23, elements 11 and 24, elements 11 and 25, elements 12 and 21, elements 12 and 22, elements 12 and 24, elements 12 and 25, elements 13 and 21, elements 13 and 22, elements 13 and 23, elements 13 and 24, and elements 13 and 25; the connected edges include: edges between node s11 and node s21, node s23, node s24 and node s25, edges between node s12 and node s21, node s22, node s24 and node s25, and edges between node s13 and node s21, node s22, node s23, node s24 and node s 25.
Here, the first nodes corresponding to different first elements are not connected by edges, and the second nodes corresponding to different second elements are not connected by edges, so that the obtained node relation graph is a bipartite graph.
In some embodiments, traversing the attribute of each first element and the attribute requirement of each second element, and determining the element pair whose attribute requirement conforms to the attribute, comprises: and taking each first element as a reference element, and executing the following processing: respectively comparing the attribute of the reference element with the attribute requirement of each second element; and searching for the attribute requires that a second element which is consistent with the attribute of the first reference element is a reach element, and an element pair comprising the reference element and the reach element is obtained.
Here, when traversing the attribute of each first element and the attribute requirement of each second element, each first element can be used as a reference element, and the element pair corresponding to each reference element can be determined. Here, another element other than the reference element in the element pair is referred to as a reach element.
In an example, for the node relationship graph shown in fig. 4, the first set of elements includes: element 11, element 12, and element 13, the second set of elements comprising: element 21, element 22, element 23, element 24, and element 25, corresponding to a first node in the first set of nodes comprising: node s11, node s12, and node 13, a second node of the second set of nodes comprising: node s21, node s22, node s23, node s24, and node s 25; first, with element 11 as a reference element, it is determined whether the attribute of element 11 matches each of the second elements: and after determining the element pair corresponding to the element 11, determining the element pair corresponding to the element 12 by taking the element 12 as a reference element, and so on until all the first elements are respectively taken as reference elements to obtain the element pairs corresponding to all the first elements.
In some embodiments, the attributes include: type, correspondingly, the attribute requirements include: a type requirement, in which the search attribute requires that a second element that matches the attribute of the first element is the reach element, including: searching at least one target second element with the same type as the target first element; in the at least one target second element, the reach element is determined.
In the embodiment of the application, for determining the element pair corresponding to the reference element by using the reference element, the resource recommendation device firstly searches for the second element which is consistent with the reference element in type based on the type requirement of the second element. In an example, the first set of elements includes: element 11, element 12, and element 13, the second set of elements comprising: when determining an element pair corresponding to the element 11, based on that the type of the element 11 is a text, the type of the element 21 is required to be the text, the type of the element 22 is required to be the text, the type of the element 23 is required to be a picture, the type of the element 24 is required to be a picture, and the type of the element 25 is required to be a video, the determined target second element includes: element 21 and element 22.
After determining the target second element, among the at least one target second element, a reach element is determined. Wherein the determination of the reach element in the at least one target element comprises one of:
determining a first mode, and determining all target second elements as reach elements.
And determining a second target element capable of completely bearing the first target element as a reach element.
In the case where the determination method is determination method one, all the target second elements are directly determined as reach elements. In one example, as in the above example, the determined target second element includes: element 21 and element 22, then element 21 and element 22 are reach elements.
When the determination mode is determination mode two, the determining, in the at least one target second element, the reach element includes: calculating the adaptation degree between the target first element and each target second element according to the element parameters of the target first element and the parameter requirements of each target second element in the at least one target second element; and determining a target second element with the suitability meeting the set suitability range as the reach element.
Here, the degree of adaptation between the reference element and each target second element is determined according to the element parameters of the reference element and the parameter requirements of each target second element.
The calculation mode of the fitness may be different according to the type.
In one example, when the type is text, the calculation formula of the fitness is as shown in formula (1):
(1- (| length-avgLength |/avgLength)). 100 equation (1)
Wherein, length is a reference element, namely the length of a text element in the material, and avgLength represents the parameter requirement of the target second element. In practical applications, the parameter requirements of the target second element may include a minimum length and a maximum length, and in this case, the avgLength may be an intermediate value between the minimum length and the maximum length in the element requirements.
In an example, when the type is a picture, when the parameter requirements of the element of the reference element and the parameter requirements of the target second element are identical, the adaptation degree is considered to be 100, and otherwise, the adaptation degree is 0. Here, strict requirements are made on the pictures in the material and the pictures in the resources, so that the resources can be effectively utilized while the material is displayed.
In one example, when the type is a picture, when the error between the parameter of the element of the reference element and the parameter requirement of the target second element is smaller than the set error, the adaptation degree is considered to be 100, otherwise, the adaptation degree is 0.
In one example, when the type is video, the calculation formula of the adaptation degree is as shown in formula (2):
(bitRate/maxBitrate + size/maxSize + duration/maxDentation)/3 x 100 equation (2);
the bitRate is the bitRate of the reference element, namely the material element, the maxBitrate is the maximum bitRate required by the target second element, the size is the size of the reference element, namely the material element, the maxSize is the maximum size required by the target second element, the duration is the duration of the reference element, namely the material element, and the maxdata is the maximum duration required by the target second element.
In the embodiment of the application, after the fitness of the reference element and the target second element is calculated, whether the fitness is within a set fitness range is judged. And if the adaptation degree is within the set adaptation degree range, considering that the corresponding target second element is a touch element, and the reference element and the target second element are a pair of elements.
The range of fitness may be: greater than or equal to 20. In practical application, the adaptation degree range can be set according to practical requirements.
In the embodiment of the application, when the types of the first element and the second element are different, the first element and the second element do not conform to each other, and the corresponding first node and the corresponding second node are unreachable. When the types of the first element and the second element are the same and the adaptation degree between the first element and the second element does not meet the adaptation degree range, the first element and the second element do not meet the adaptation degree range, and the corresponding first node and the corresponding second node are not reachable. When the types of the first element and the second element are the same and the adaptation degree between the first element and the second element meets the adaptation degree range, the first element and the second element are consistent, and the corresponding first node and the corresponding second node can reach and are connected into an edge.
In some embodiments, before S304, further comprising:
marking the adaptation degree between the first node and the second node connected by the edge, the corresponding first element and the corresponding second element as the weight of the corresponding edge; correspondingly, the implementation of S304 includes: and searching for matching in the node relation graph according to the weight of the edge.
And the resource recommendation equipment determines the adaptation degree between the reference element and each target second element according to the element parameters of the reference element and the parameter requirements of each target second element. The calculation mode of the fitness may be different according to the type. The calculation of the fitness may refer to the above description, and will not be described herein.
And after the adaptation degree between the elements corresponding to the two nodes connected by each edge is obtained, marking the adaptation degree as the weight of the edge, and searching for matching in the node relationship graph according to the edge between the nodes in the node relationship graph and the weight of each edge. The matching algorithm used to find matches based on edges and their weights may include: the Kuhn-munkres (km) algorithm, the max flow algorithm, etc. In the embodiment of the present application, the matching algorithm used for searching for matching is not limited at all.
In some embodiments, after S305, as shown in fig. 6, further comprising:
s306, determining the target edge included in the matching;
s307, establishing an incidence relation between a first element represented by the first node and a second element represented by the second node which are connected with the target edge, and outputting the incidence relation.
After finding the matching in the node relationship graph, the resource recommendation device determines all edges included in the matching, establishes a connection relationship between the first element and the second element respectively corresponding to the first node and the second node connected with each edge, and outputs the connection relationship so that a user can know which materials in the materials can be displayed in one resource and which position of the resource is specifically displayed.
The resource recommendation method provided by the embodiment of the present application is further described below by taking an advertisement scene with resources as advertisement slots as an example.
Here, the KM algorithm will be described first.
The KM algorithm can be used for solving the optimal weighted matching problem of the bipartite graph.
Bipartite graphs are a special class of graphs whose vertices can be divided into two independent sets U and V, so that all edges are points that join one U with one V. That is, the edge from which the vertex in U starts is connected only to V, and not to U itself. And V has the same principle.
Matching means that any two edges in the edge set of the bipartite graph G do not have a common vertex, and the frame sub-graph M is matched. That is, some set of edges that do not have a common vertex.
The optimal weighted matching of bipartite graphs refers to finding a match on a given weighted bipartite graph such that the sum of all matching edge weights is the largest.
In one example, as shown in FIG. 7, weighted bipartite graph 701 includes two sets: u and V, wherein node A and node B belong to the set U, node a and node B belong to the set V, and the weights of the edges between the nodes are shown in FIG. 7. The KM algorithm is used to find the best match of weighted bipartite graph 301, and the matching result is shown in fig. 7, which includes edges 702, where the edges 702 include the edges between a-B and the edges between B-a, and the maximum weight is 10+20 — 30. Here, the other matches (a-a, B-B, weight 100+ (-101) — 1) in the weighted bipartite graph 701 shown in fig. 7 have a weight of-1 and less than 30.
The execution process of the KM algorithm used in the embodiment of the present application includes:
initializing the value of the feasible vertex, and executing the following operations on each vertex in the set U: a) finding a match in the equal subgraph by using a Hungarian algorithm, b) modifying the value of the feasible top mark if an augmentation path is not found, and repeating the steps a) and b) until a perfect match of the equal subgraph is found.
Under the scene of the advertisement space, the advertisement space elements and the material elements are abstracted into vertexes of two sets, the advertisement space elements are located in the set U, the material elements are located in the set V, the edges of the advertisement space elements and the material elements represent whether the material elements meet the requirements of the advertisement space elements, the weight of the edges represents the degree that the material elements meet the requirements of the advertisement space elements, the weight is higher if the material elements meet the requirements, meanwhile, the edges from the advertisement space elements to the advertisement space elements and the edges from the material elements to the material elements do not exist, and therefore a weighted bipartite graph of the advertisement space and the material can be constructed. On the weighted bipartite graph, a matching with the largest weight can be found by using a KM algorithm, namely, the material elements which are most in line with the conditions are found for all the elements in the advertising space.
The resource recommendation method provided by the embodiment of the application can be as shown in fig. 8, and includes:
s801, the user 81 submits the material to the resource recommendation device 82.
Here, the user submits the material set to the resource recommendation device, which may be any number of text messages, pictures and videos (each text is regarded as a material element, and the pictures and videos are treated in the same way)
S802, the resource recommendation device 82 pulls the advertisement space from the advertisement space pool 83.
The resource recommendation device pulls a set of ad spots from the pool of target ad spots. Wherein each ad slot has a different style and is composed of one or more ad slot elements, and the ad slot elements comprise a text field, a picture field and a video field.
S803, the resource recommendation device 82 calculates the adaptation degree;
the resource recommendation device 82 calculates the degree of fit between the elements of the material and the elements of the ad spots.
S804, the resource recommendation device 82 constructs a weighted bipartite graph.
The resource recommendation device 82 outputs a weighted bipartite graph of the material-ad spots based on the calculated suitability.
S805, the resource recommendation device 82 searches for a match.
And the resource recommending device carries out KM matching on the weighted bipartite graph, and if the matching is successful, the resource recommending device indicates that the material element is matched with the advertising space and is the optimal matching.
S806, the resource recommendation device 82 outputs the result set.
The resource recommendation device 82 outputs a combination of material elements-ad spot elements to the user 81 based on the matching.
Here, the resource recommendation device adds the matched material elements and the advertisement spots as one combination to the result set, and outputs the result set.
In this embodiment of the application, the calculation rule of the edge correspondence weight, i.e., the degree of adaptation between the material element and the advertisement space element, connecting the material element and the advertisement space element may include:
1. the weight values are normalized to 0-100, and a very small weight (e.g., -2 to the power of 20) indicates that the corresponding material element does not meet the requirements of the ad slot element, which is not reachable (UNREACHABLE).
2. Unreadable between different types of material elements and ad slot elements.
3. For the same type of element, UNREADABLE is between the elements whose attributes and attribute requirements do not meet the requirements. The method for calculating the fitness between the elements meeting the requirements is as follows:
elements corresponding to the text class: the closer the length is to the average of the ad slot element requirements, the higher the weight of the material element. In one example, the calculation formula of the fitness is shown in formula (1):
(1- (| length-avgLength |/avgLength)). 100 formula (1);
wherein, length is the length of the text element in the material, and avgLength | is the intermediate value of the minimum length and the maximum length required by the text element in the advertisement space.
For elements of the picture class: the width and height of the material elements strictly meet the requirements of the advertisement space elements, and the adaptation degree is 100.
For video-like elements: the aspect ratio of the material elements strictly meets the requirements of the advertisement space elements; the code rate, the size and the duration of the material elements are closer to the maximum value required by the advertisement space elements, the score is higher, and at the moment, the scores of various different attributes are averaged to obtain the final adaptation degree.
In practical applications, for picture elements, when the aspect ratio of the material element and the advertisement element is consistent, the material element and the advertisement element are considered to be consistent.
In one example, as shown in equation (2), for scores of different attributes, averaging yields a weight:
(bitRate/maxBitrate + size/maxSize + duration/maxDentation)/3 x 100 equation (2);
wherein, bitRate is the bitRate of the material element, maxBitrate is the maximum bitRate required by the advertisement space element, size is the size of the material element, maxSize is the maximum size required by the advertisement space element, duration is the duration of the material element, and maxDuration is the maximum duration required by the advertisement space element.
Based on the rules, a weighted bipartite graph can be constructed for one advertising space and one material set, and a matching result can be obtained by running a KM algorithm on the bipartite graph.
In one example, the elements of ad slot A are shown in Table 1 and the elements of the material uploaded by the user are shown in Table 2.
Table 1, example of elements of ad slot A
Figure BDA0002899110810000161
Figure BDA0002899110810000171
Table 2 example of elements of material a
Figure BDA0002899110810000172
Taking each element in the ad slot a as a vertex in the first set, and taking each element in the material a as a vertex in the second set, a weighted bipartite graph formed by the vertices in the first set and the vertices in the second set is shown in table 3, where UN represents unreachable.
TABLE 3 weighted bipartite graph consisting of advertisement space A and material a
Figure BDA0002899110810000173
The maximum weight matching of the weighted bipartite graph shown in table 3 obtained by using the KM algorithm is:
main title-text 2, subtitle-text 1, main picture-picture 3, sub picture-picture 1, main video-video 2.
Fig. 9 is a schematic flow chart of an implementation of a resource recommendation device according to an embodiment of the present application, and as shown in fig. 9, the device 900 includes:
an obtaining unit 901, configured to obtain elements included in a material to obtain a first element set, and obtain elements included in a resource to obtain a second element set;
a mapping unit 902, configured to map each first element in the first element set as a first node, and map each second element in the second element set as a second node;
a constructing unit 903, configured to connect an edge between a first node and a second node, and construct a node relationship graph;
a matching unit 904, configured to search for a match in the node relationship graph;
and the output unit 905 is configured to, under the condition that the matching is found, take the resource as a resource to be recommended, and output a resource identifier of the resource to be recommended.
In some embodiments, the building unit 903 is further configured to:
acquiring the attribute of the first element and the attribute requirement of the second element;
and establishing a connecting edge between the corresponding first node and the corresponding second node according to the attribute of the first element and the attribute requirement of the second element, and constructing the node relation graph.
In some embodiments, the building unit 903 is further configured to:
traversing the attribute of each first element and the attribute requirement of each second element, and determining an element pair with the attribute requirement in accordance with the attribute;
and connecting edges between the first nodes and the second nodes corresponding to the first elements and the second elements in the element pairs respectively to obtain a node relation graph.
In some embodiments, the building unit 903 is further configured to:
and taking each first element as a reference element, and executing the following processing:
respectively comparing the attribute of the reference element with the attribute requirement of each second element;
and searching for the attribute requires that a second element which is consistent with the attribute of the first reference element is a reach element, and an element pair comprising the reference element and the reach element is obtained.
In some embodiments, the attributes include: a type, the attribute requirement comprising a type requirement; a building unit 903, further configured to:
finding at least one second target element of which the type requires the same type as the reference element;
in the at least one second target element, the reach element is determined.
In some embodiments, the attributes further include: an element parameter, the attribute requirement comprising a parameter requirement; a building unit 903, further configured to:
calculating the adaptation degree between the reference element and each second target element according to the element parameters of the reference element and the parameter requirements of each second target element in the at least one second target element;
and determining a second target element with the adaptation degree meeting the set adaptation degree range as the touch element.
In some embodiments, the apparatus 900, further comprises: the marking unit is used for marking the adaptation degree between the first node and the second node connected by the edge, the corresponding first element and the corresponding second element as the weight of the corresponding edge;
correspondingly, the matching unit 904 is further configured to:
and searching for matching in the node relation graph according to the weight of the edge.
In some embodiments, the apparatus 900, further comprises: an association unit configured to:
determining a target edge included in the match;
and establishing an incidence relation between a first element represented by a first node and a second element represented by a second node which are connected with the target edge, and outputting the incidence relation.
It should be noted that the resource recommendation apparatus provided in the embodiment of the present application includes each included unit, and may be implemented by a processor in an electronic device; of course, the implementation can also be realized through a specific logic circuit; in the implementation process, the Processor may be a Central Processing Unit (CPU), a microprocessor Unit (MPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), or the like.
The above description of the apparatus embodiments, similar to the above description of the method embodiments, has similar beneficial effects as the method embodiments. For technical details not disclosed in the embodiments of the apparatus of the present application, reference is made to the description of the embodiments of the method of the present application for understanding.
It should be noted that, in the embodiment of the present application, if the resource recommendation method is implemented in the form of a software functional module and sold or used as a standalone product, the resource recommendation method may also be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially implemented or portions thereof contributing to the related art may be embodied in the form of a software product stored in a storage medium, and including several instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read Only Memory (ROM), a magnetic disk, or an optical disk. Thus, embodiments of the present application are not limited to any specific combination of hardware and software.
Correspondingly, an embodiment of the present application provides an electronic device, which includes a memory and a processor, where the memory stores a computer program that is executable on the processor, and the processor executes the computer program to implement the steps in the resource recommendation method provided in the foregoing embodiment. The electronic device can be a client or a server.
Accordingly, embodiments of the present application provide a storage medium, that is, a computer-readable storage medium, on which a computer program is stored, and the computer program, when executed by a processor, implements the steps in the resource recommendation method provided in the above embodiments.
Here, it should be noted that: the above description of the storage medium and device embodiments is similar to the description of the method embodiments above, with similar advantageous effects as the method embodiments. For technical details not disclosed in the embodiments of the storage medium and apparatus of the present application, reference is made to the description of the embodiments of the method of the present application for understanding.
It should be noted that fig. 10 is a schematic hardware entity diagram of an electronic device according to an embodiment of the present application, and as shown in fig. 10, the electronic device 1000 includes: a processor 1001, at least one communication bus 1002, at least one external communication interface 1004, and memory 1005. Wherein the communication bus 1002 is configured to enable connective communication between these components. In an example, the electronic device 1000 further comprises: a user interface 1003, wherein the user interface 1003 may comprise a display screen, and the external communication interface 1004 may comprise a standard wired interface and a wireless interface.
The Memory 1005 is configured to store instructions and applications executable by the processor 1001, and may also buffer data (e.g., image data, audio data, voice communication data, and video communication data) to be processed or already processed by the processor 1001 and modules in the electronic device, and may be implemented by a FLASH Memory (FLASH) or a Random Access Memory (RAM).
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present application. Thus, the appearances of the phrases "in one embodiment" or "in some embodiments" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present application. The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some attributes may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as a removable Memory device, a Read Only Memory (ROM), a magnetic disk, or an optical disk.
Alternatively, the integrated units described above in the present application may be stored in a computer-readable storage medium if they are implemented in the form of software functional modules and sold or used as independent products. Based on such understanding, the technical solutions of the embodiments of the present application may be essentially implemented or portions thereof contributing to the related art may be embodied in the form of a software product stored in a storage medium, and including several instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.
The above description is only for the embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (11)

1. A method for resource recommendation, the method comprising:
obtaining elements included in the material to obtain a first element set, and obtaining elements included in the resource to obtain a second element set;
mapping each first element in the first element set to be a first node, and mapping each second element in the second element set to be a second node;
connecting edges between the first node and the second node to construct a node relation graph;
searching for a match in the node relationship graph;
and under the condition that the matching is found, taking the resource as the resource to be recommended, and outputting the resource identifier of the resource to be recommended.
2. The method of claim 1, wherein connecting edges between the first node and the second node, constructing a node relationship graph, comprises:
acquiring the attribute of the first element and the attribute requirement of the second element;
and establishing a connecting edge between the corresponding first node and the corresponding second node according to the attribute of the first element and the attribute requirement of the second element, and constructing the node relation graph.
3. The method according to claim 2, wherein the establishing a connection edge between a corresponding first node and a corresponding second node according to the attribute of the first element and the attribute requirement of the second element to construct the node relationship graph comprises:
traversing the attribute of each first element and the attribute requirement of each second element, and determining an element pair with the attribute requirement in accordance with the attribute;
and connecting edges between the first nodes and the second nodes corresponding to the first elements and the second elements in the element pairs respectively to obtain a node relation graph.
4. The method of claim 3, wherein traversing the attribute of each first element and the attribute requirement of each second element to determine the pair of elements whose attribute requirements conform to the attribute comprises:
and taking each first element as a reference element, and executing the following processing:
respectively comparing the attribute of the reference element with the attribute requirement of each second element;
and searching for the attribute requires that a second element which is consistent with the attribute of the first reference element is a reach element, and an element pair comprising the reference element and the reach element is obtained.
5. The method of claim 4, wherein the attributes comprise: a type, the attribute requirement comprising a type requirement; the finding attribute requires that a second element that matches the attribute of the first reference element is a reach element, including:
finding at least one second target element of which the type requires the same type as the reference element;
in the at least one second target element, the reach element is determined.
6. The method of claim 5, wherein the attributes further comprise: an element parameter, the attribute requirement comprising a parameter requirement; said determining, in the at least one second target element, the reach element comprises:
calculating the adaptation degree between the reference element and each second target element according to the element parameters of the reference element and the parameter requirements of each second target element in the at least one second target element;
and determining a second target element with the adaptation degree meeting the set adaptation degree range as the touch element.
7. The method of claim 1 or 6, further comprising:
marking the adaptation degree between the first node and the second node connected by the edge, the corresponding first element and the corresponding second element as the weight of the corresponding edge;
correspondingly, in the node relationship graph, searching for a match includes:
and searching for matching in the node relation graph according to the weight of the edge.
8. The method of claim 1, further comprising:
determining a target edge included in the match;
and establishing an incidence relation between a first element represented by a first node and a second element represented by a second node which are connected with the target edge, and outputting the incidence relation.
9. An apparatus for resource handling, the apparatus comprising:
the acquisition unit is used for acquiring elements included in the material to obtain a first element set, and acquiring elements included in the resource to obtain a second element set;
a mapping unit, configured to map each first element in the first element set as a first node, and map each second element in the second element set as a second node;
the building unit is used for connecting edges between the first node and the second node and building a node relation graph;
the matching unit is used for searching matching in the node relation graph;
and the output unit is used for taking the resource as the resource to be recommended and outputting the resource identifier of the resource to be recommended under the condition that the matching is found.
10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the steps of the resource recommendation method of any one of claims 1 to 8 when executing the computer program.
11. A storage medium having stored thereon a computer program, characterized in that the computer program, when being executed by a processor, implements the resource recommendation method of any one of claims 1 to 8.
CN202110051017.XA 2021-01-14 2021-01-14 Resource recommendation method and device, equipment and storage medium Pending CN113743974A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202110051017.XA CN113743974A (en) 2021-01-14 2021-01-14 Resource recommendation method and device, equipment and storage medium
PCT/CN2022/070845 WO2022152061A1 (en) 2021-01-14 2022-01-07 Resource recommendation method and apparatus, device, and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110051017.XA CN113743974A (en) 2021-01-14 2021-01-14 Resource recommendation method and device, equipment and storage medium

Publications (1)

Publication Number Publication Date
CN113743974A true CN113743974A (en) 2021-12-03

Family

ID=78728224

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110051017.XA Pending CN113743974A (en) 2021-01-14 2021-01-14 Resource recommendation method and device, equipment and storage medium

Country Status (2)

Country Link
CN (1) CN113743974A (en)
WO (1) WO2022152061A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022152061A1 (en) * 2021-01-14 2022-07-21 北京沃东天骏信息技术有限公司 Resource recommendation method and apparatus, device, and storage medium

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108805642A (en) * 2017-05-02 2018-11-13 合信息技术(北京)有限公司 Recommend method and device
CN109471978A (en) * 2018-11-22 2019-03-15 腾讯科技(深圳)有限公司 A kind of e-sourcing recommended method and device
CN110175295A (en) * 2019-06-21 2019-08-27 卓尔智联(武汉)研究院有限公司 Advertisement position recommended method, electronic equipment and computer readable storage medium
CN110264269A (en) * 2019-06-20 2019-09-20 卓尔智联(武汉)研究院有限公司 Advertisement position recommended method, device, electronic equipment and storage medium
CN110968708A (en) * 2019-12-20 2020-04-07 华中师范大学 Method and system for labeling education information resource attributes
CN111382352A (en) * 2020-03-02 2020-07-07 腾讯科技(深圳)有限公司 Data recommendation method and device, computer equipment and storage medium
CN111522967A (en) * 2020-04-27 2020-08-11 北京百度网讯科技有限公司 Knowledge graph construction method, device, equipment and storage medium
CN111708964A (en) * 2020-05-27 2020-09-25 北京百度网讯科技有限公司 Multimedia resource recommendation method and device, electronic equipment and storage medium
US20200359073A1 (en) * 2018-04-10 2020-11-12 Tencent Technology (Shenzhen) Company Limited Promotion content push method and apparatus, and storage medium
CN112069423A (en) * 2020-08-14 2020-12-11 京华信息科技股份有限公司 Information recommendation method and device, storage medium and computer equipment
CN112199733A (en) * 2020-09-24 2021-01-08 王海宏 Information processing method based on block chain and cloud computing and digital financial service center

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8106903B2 (en) * 2006-05-04 2012-01-31 Bentley Systems, Incorporated System and method for visually representing a project using graphic elements
CN105160538A (en) * 2015-10-27 2015-12-16 武汉改图网技术有限公司 Printed matter on-line design service cloud platform and on-line design method thereof
CN108573515B (en) * 2017-03-10 2022-03-01 阿里巴巴集团控股有限公司 Method and device for generating combined graph and method and device for generating combined graph template
CN111580788B (en) * 2019-02-15 2024-04-09 阿里巴巴集团控股有限公司 Template collocation information recommendation method and device and electronic equipment
CN113743974A (en) * 2021-01-14 2021-12-03 北京沃东天骏信息技术有限公司 Resource recommendation method and device, equipment and storage medium

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108805642A (en) * 2017-05-02 2018-11-13 合信息技术(北京)有限公司 Recommend method and device
US20200359073A1 (en) * 2018-04-10 2020-11-12 Tencent Technology (Shenzhen) Company Limited Promotion content push method and apparatus, and storage medium
CN109471978A (en) * 2018-11-22 2019-03-15 腾讯科技(深圳)有限公司 A kind of e-sourcing recommended method and device
CN110264269A (en) * 2019-06-20 2019-09-20 卓尔智联(武汉)研究院有限公司 Advertisement position recommended method, device, electronic equipment and storage medium
CN110175295A (en) * 2019-06-21 2019-08-27 卓尔智联(武汉)研究院有限公司 Advertisement position recommended method, electronic equipment and computer readable storage medium
CN110968708A (en) * 2019-12-20 2020-04-07 华中师范大学 Method and system for labeling education information resource attributes
CN111382352A (en) * 2020-03-02 2020-07-07 腾讯科技(深圳)有限公司 Data recommendation method and device, computer equipment and storage medium
CN111522967A (en) * 2020-04-27 2020-08-11 北京百度网讯科技有限公司 Knowledge graph construction method, device, equipment and storage medium
CN111708964A (en) * 2020-05-27 2020-09-25 北京百度网讯科技有限公司 Multimedia resource recommendation method and device, electronic equipment and storage medium
CN112069423A (en) * 2020-08-14 2020-12-11 京华信息科技股份有限公司 Information recommendation method and device, storage medium and computer equipment
CN112199733A (en) * 2020-09-24 2021-01-08 王海宏 Information processing method based on block chain and cloud computing and digital financial service center

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
WANG, GUOXIA 等: "Bipartite network projection and its application in recommendation systems", 2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 8 January 2014 (2014-01-08) *
孙林;吴相林;罗松涛;周莉;张红艳;: "基于二分图资源分配动力学的推荐排序研究", 计算机工程与设计, no. 23, 16 December 2010 (2010-12-16) *
李强 等: "基于情景要素适配的高校图书馆资源推荐服务研究", 数字图书馆论坛, no. 08, 25 August 2020 (2020-08-25) *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022152061A1 (en) * 2021-01-14 2022-07-21 北京沃东天骏信息技术有限公司 Resource recommendation method and apparatus, device, and storage medium

Also Published As

Publication number Publication date
WO2022152061A9 (en) 2022-09-01
WO2022152061A1 (en) 2022-07-21

Similar Documents

Publication Publication Date Title
US20200294086A1 (en) Managing associations between device identifiers
JP6968100B2 (en) How to identify user behavioral preferences and how to present recommended information and devices
CN109636488B (en) Advertisement putting method and device
US10511568B2 (en) Method for identifying multiple devices belonging to the same group
CN111932318B (en) Region division method and device, electronic equipment and computer readable storage medium
CN105528459B (en) Information processing method, server and terminal
US10672025B2 (en) System and method for traffic quality based pricing via deep neural language models
US20160180406A1 (en) Combined advertisements
US11803875B2 (en) Method and system to utilize advertisement fraud data for blacklisting fraudulent entities
CN112070524A (en) Advertisement service recommendation method and device
CN113743974A (en) Resource recommendation method and device, equipment and storage medium
CN110264283B (en) Popularization resource display method and device
JP2014529113A (en) Information redirection
KR102312420B1 (en) Method and apparatus for providing digital advertisement solution using artificial intelligence learning based on big data
US11973733B2 (en) Enhancing a social media post with content that is relevant to the audience of the post
EP4167109A1 (en) Metadata tag identification
KR101911536B1 (en) Marketing server and marketing method
US10755308B2 (en) Local-search optimization and pricing for rich ad allocation
JP2020024609A (en) Advertisement controller and advertisement control system
CN112100507B (en) Object recommendation method, computing device and computer-readable storage medium
US20210142365A1 (en) Method and system for real time advertisement auction on telecommunication notification channels
JP2023539273A (en) Methods, devices, electronic devices and media for determining target addition methods
US20130282497A1 (en) Assigning an advertisement
KR20200055576A (en) Operating Method of parameter and service device supporting the same
KR102663802B1 (en) Method and apparatus for rebalancing advertisement exposure operation information based on advertisement performance in a communication system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination