CN112925976B - Method, device, server and storage medium for allocating denomination data - Google Patents

Method, device, server and storage medium for allocating denomination data Download PDF

Info

Publication number
CN112925976B
CN112925976B CN202110125642.4A CN202110125642A CN112925976B CN 112925976 B CN112925976 B CN 112925976B CN 202110125642 A CN202110125642 A CN 202110125642A CN 112925976 B CN112925976 B CN 112925976B
Authority
CN
China
Prior art keywords
parameter
target
display quality
allocation
objects
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110125642.4A
Other languages
Chinese (zh)
Other versions
CN112925976A (en
Inventor
程波波
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Dajia Internet Information Technology Co Ltd
Original Assignee
Beijing Dajia Internet 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 Dajia Internet Information Technology Co Ltd filed Critical Beijing Dajia Internet Information Technology Co Ltd
Priority to CN202110125642.4A priority Critical patent/CN112925976B/en
Publication of CN112925976A publication Critical patent/CN112925976A/en
Application granted granted Critical
Publication of CN112925976B publication Critical patent/CN112925976B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9535Search customisation based on user profiles and personalisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9538Presentation of query results

Abstract

The present disclosure relates to a method, a device, a server and a storage medium for allocating denomination data, which belong to the technical field of the internet, and the method comprises: and acquiring a first display quality parameter of the first object and a second display quality parameter of the second object, and determining a name allocation result of the second object based on a difference value between the first display quality parameter and the second display quality parameter. The embodiment of the disclosure provides a method for dynamically distributing name data, which judges whether to allow an object to obtain name data according to a display quality parameter of each object and a difference value between display quality parameters of objects with the parameters smaller than a target threshold value in a queue, and considers the display quality parameters of the objects, so that the object with better display quality can obtain the name data, the object with poorer display quality is prevented from obtaining the name data, and the display quality of the object can be ensured while the name data is distributed to the object.

Description

Method, device, server and storage medium for allocating denomination data
Technical Field
The disclosure relates to the technical field of internet, and in particular relates to a method and device for allocating denomination data, a server and a storage medium.
Background
With the rapid development of internet technology and the gradual expansion of the scale of network users, services such as internet advertising, internet propaganda and the like have penetrated into aspects of life of people, and in the internet, service objects are usually required to be recommended for users. When recommending a business object, an object queue is usually created first, and the objects stored in the object queue are recommended.
In the case that there are multiple objects, the multiple objects are ordered, and the object with the top order is selected and added to the object queue. However, in order to recommend some target objects preferentially, a certain amount of names are allocated to the target objects, so that the target objects with the acquired names are also added to the object queue, so as to improve the opportunity that the target objects are recommended.
However, if the number of target objects is large, how to allocate a limited amount of names to a plurality of target objects becomes a problem to be solved.
Disclosure of Invention
The present disclosure provides a method, an apparatus, a server, and a storage medium for allocating denomination data, which can provide a method for dynamically allocating the denomination data, and can ensure the display quality of an object while allocating the denomination data to the object. The technical scheme of the present disclosure is as follows:
According to a first aspect of embodiments of the present disclosure, there is provided a method for allocating reputation data, the method comprising:
acquiring a first display quality parameter of a first object, wherein the first object is determined based on an object of which the current display quality parameter in an object queue to be recommended is smaller than a target threshold;
acquiring a second display quality parameter of a second object, wherein the second object is any object in a target object set, and the target object set comprises a plurality of objects;
and determining a title allocation result of the second object based on the difference between the first display quality parameter and the second display quality parameter, wherein the title allocation result is used for indicating whether the second object is allowed to obtain title data, and the title data represents the title added to the object queue to be recommended.
The present disclosure provides a method for dynamically allocating the name data, for each object to be allocated with the name data, determining whether to allow the object to obtain the name data according to a difference between a display quality parameter of the object and a display quality parameter of an object whose parameter in a queue is smaller than a target threshold, considering the display quality parameter of the object, so that the object with better display quality can obtain the name data, avoiding that the object with worse display quality obtains the name data, and ensuring the display quality of the object while allocating the name data to the object.
In some embodiments, the determining the reputation assignment result for the second object based on the difference between the first presentation quality parameter and the second presentation quality parameter comprises:
determining a target allocation parameter for the second object based on a difference between the first display quality parameter and the second display quality parameter, the target allocation parameter representing a probability of the second object being added to the object queue;
and determining a name allocation result of the second object based on the target allocation parameter.
According to the difference value between the display quality parameter of the object to be allocated with the name and the display quality parameter of the object with the score smaller than the target threshold value in the queue, the probability that the object is added into the object queue is determined, and the probability can represent the probability that the object is added into the queue, so that whether the name data are allocated to the object can be quickly obtained according to the probability, and the allocation efficiency of the name data is improved.
In some embodiments, the determining the target allocation parameter for the second object based on the difference between the first display quality parameter and the second display quality parameter comprises:
determining a difference parameter based on a difference between the first display quality parameter and the second display quality parameter and the first display quality parameter, the difference parameter being positively correlated with the difference and negatively correlated with the first display quality parameter;
Based on the difference parameter, a target allocation parameter of the second object is determined, the target allocation parameter being inversely related to the difference parameter.
According to the difference between the display quality parameters of the objects to be allocated with the names and the display quality parameters of the objects with the scores smaller than the target threshold value in the queue, the difference parameters positively correlated with the difference are determined, and further the target allocation parameters negatively correlated with the difference parameters are determined based on the difference parameters, namely, the larger the difference between the display quality parameters of the objects to be allocated with the names and the display quality parameters of the objects with the scores smaller than the target threshold value in the queue is, the smaller the probability that the objects are added into the object queue is, so that the probability that the objects with the better display quality are added into the object queue can be improved, the objects with the better display quality obtain the name data, and the accuracy of the allocation of the name data is improved while the display quality is ensured.
In some embodiments, the determining the target allocation parameter for the second object based on the discrepancy parameter comprises:
based on a Gaussian function, determining the probability that an independent variable of the Gaussian function is located in a first interval, wherein the first interval is an interval larger than the difference parameter;
And determining a target allocation parameter of the second object based on the probability that the independent variable is located in the first interval, wherein the target allocation parameter is determined based on the characteristic that the Gaussian function is symmetrical to the longitudinal axis of the coordinates.
The Gaussian function is skillfully adopted to represent the negative correlation between the difference parameter and the target distribution parameter, on one hand, the probability that the independent variable is positioned in a section larger than the difference parameter is adopted to represent the probability that the object is added into the object queue, and on the other hand, the probability that the object is added into the object queue can be determined more accurately by considering that the difference degree is positive and the symmetry characteristic of the Gaussian function, and the accuracy of determining the target distribution parameter is improved.
In some embodiments, the determining the reputation allocation result for the second object based on the target allocation parameter comprises:
issuing a random number in a second interval for the second object;
dividing the second interval into a first subinterval and a second subinterval according to the target allocation parameter, wherein the ratio between the length of the first subinterval and the length of the second interval is equal to the target allocation parameter;
and if the random number is positioned in the first subinterval, allowing the second object to occupy the nominal data, and if the random number is positioned in the second subinterval, not allowing the second object to occupy the nominal data.
The method for dynamically allocating the name data is provided, so that the exploring effect is increased, the name data can be obtained for the object with better display quality, the name data can be prevented from being obtained for the object with poor display quality, and the display quality of the object can be ensured while the name data is allocated for the object.
In some embodiments, after determining the reputation assignment result for the second object based on the difference between the first presentation quality parameter and the second presentation quality parameter, the method further comprises:
and if the number of the objects added to the object queue in the target object set reaches the total number of the nameplate data, stopping allocating the nameplate data.
The total number of the name data is set for the target object set, so that the number of the objects needing to be allocated with the name data in the object set is limited within a certain number, and excessive allocation of the name data for the objects is avoided.
In some embodiments, the target object set is a subset of the original object set, and prior to the obtaining the first presentation quality parameter for the first object, the method further comprises:
Sequencing according to the sequence from high to low of the display quality parameters of a plurality of objects in the original object set;
and adding the object with the target number with the front display quality parameter in the plurality of objects in the original object set into the object queue.
In the above embodiment, when determining the object queue, the object with higher display quality parameter is selected, so that the subsequent display quality can be ensured, and the subsequent process of adding the object queue and the determination process of the target object set are facilitated by performing the sorting process.
In some embodiments, after adding the target number of objects of the original object set that exhibit the quality parameter first to the object queue, the method further comprises:
and selecting an object which is not added into the object queue but meets the recommended condition from the original object set to form the target object set.
In the above embodiment, among the plurality of objects that do not enter the object queue, the object satisfying the recommendation condition is selected, so that the target object set can be determined quickly, the subsequent process of judging whether to allocate the name data for the object is facilitated, and the efficiency of allocating the name data for the object is improved.
According to a second aspect of embodiments of the present disclosure, there is provided a reputation data allocation apparatus comprising:
a first acquisition unit configured to perform acquisition of a first presentation quality parameter of a first object determined based on an object in an object queue to be recommended for which a current presentation quality parameter is smaller than a target threshold;
a second acquisition unit configured to perform acquisition of a second presentation quality parameter of a second object, the second object being any one of a target object set including a plurality of objects therein;
and a determining unit configured to perform determining a ranking assignment result of the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter, the ranking assignment result indicating whether the second object is allowed to obtain ranking data representing a ranking added to the object queue to be recommended.
In some embodiments, the determining unit comprises:
an allocation parameter determining unit configured to perform determining a target allocation parameter of the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter, the target allocation parameter representing a probability that the second object is added to the object queue;
And an allocation result determining unit configured to perform determination of a name allocation result of the second object based on the target allocation parameter.
In some embodiments, the allocation parameter determining unit comprises:
a difference parameter determination subunit configured to perform determining a difference parameter based on a difference between the first display quality parameter and the second display quality parameter and the first display quality parameter, the difference parameter being positively correlated with the difference and negatively correlated with the first display quality parameter;
an allocation parameter determination subunit configured to perform determining a target allocation parameter of the second object based on the difference parameter, the target allocation parameter being inversely related to the difference parameter.
In some embodiments, the allocation parameter determining subunit is configured to perform:
based on a Gaussian function, determining the probability that an independent variable of the Gaussian function is located in a first interval, wherein the first interval is an interval larger than the difference parameter;
and determining a target allocation parameter of the second object based on the probability that the independent variable is located in the first interval, wherein the target allocation parameter is determined based on the characteristic that the Gaussian function is symmetrical to the longitudinal axis of the coordinates.
In some embodiments, the allocation result determining unit is configured to perform:
Issuing a random number in a second interval for the second object;
dividing the second interval into a first subinterval and a second subinterval according to the target allocation parameter, wherein the ratio between the length of the first subinterval and the length of the second interval is equal to the target allocation parameter;
and if the random number is positioned in the first subinterval, allowing the second object to occupy the nominal data, and if the random number is positioned in the second subinterval, not allowing the second object to occupy the nominal data.
In some embodiments, the apparatus further comprises:
and the allocation unit is configured to execute the step of stopping allocating the name data if the number of the objects added to the object queue in the target object set reaches the total number of the name data.
In some embodiments, the set of target objects is a subset of the set of original objects, the apparatus further comprising:
a sorting unit configured to perform sorting in order of high to low display quality parameters of a plurality of objects in the original object set;
and the adding unit is configured to execute the object with the front target number of the display quality parameters in the plurality of objects in the original object set and add the object into the object queue.
In some embodiments, the apparatus further comprises:
and a selecting unit configured to perform selecting an object which is not added to the object queue but satisfies a recommendation condition from the original object set, to constitute the target object set.
According to a third aspect of embodiments of the present disclosure, there is provided a server comprising:
one or more processors;
a memory for storing the processor-executable program code;
wherein the processor is configured to execute the program code to implement the denomination data allocation method described above.
According to a fourth aspect of embodiments of the present disclosure, there is provided a computer-readable storage medium comprising: the program code in the computer readable storage medium, when executed by a processor of a server, enables the server to perform the above-described method of allocating reputation data.
According to a fifth aspect of embodiments of the present disclosure, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the above-described method of allocating reputation data.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure and do not constitute an undue limitation on the disclosure.
FIG. 1 is a schematic diagram of an implementation environment of a method for allocating denomination data according to an exemplary embodiment;
FIG. 2 is a flow chart illustrating a method of allocating denomination data according to an exemplary embodiment;
FIG. 3 is a flow chart illustrating a method of allocating denomination data according to an exemplary embodiment;
FIG. 4 is a flowchart illustrating a method of allocating denomination data according to an exemplary embodiment;
FIG. 5 is a block diagram of a denomination data distribution device, according to an exemplary embodiment;
fig. 6 is a block diagram of a server, according to an example embodiment.
Detailed Description
In order to enable those skilled in the art to better understand the technical solutions of the present disclosure, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the foregoing figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the disclosure described herein may be capable of operation in sequences other than those illustrated or described herein. The implementations described in the following exemplary examples are not representative of all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present disclosure as detailed in the accompanying claims.
The data referred to in this disclosure may be data authorized by the user or sufficiently authorized by the parties.
Fig. 1 is a schematic diagram of an implementation environment of a method for allocating denomination data according to an embodiment of the present disclosure, referring to fig. 1, where the implementation environment includes: a terminal 101 and a server 102.
The terminal 101 may be at least one of a smart phone, a smart watch, a desktop computer, a portable computer, a virtual reality terminal, an augmented reality terminal, a wireless terminal, a laptop portable computer, etc., the terminal 101 has a communication function, may access the internet, and the terminal 101 may refer to one of a plurality of terminals, which is only exemplified by the terminal 101 in this embodiment. Those skilled in the art will recognize that the number of terminals may be greater or lesser.
In some embodiments, the terminal 101 may be running a video application, a live application, a social application, or the like. During use of the video application, live application, or social application by a user, server 102 may push business objects such as advertising videos, promotional videos, etc. to these applications.
The server 102 may be an independent physical server, a server cluster or a distributed file system formed by a plurality of physical servers, or a cloud server providing cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, a content delivery network (Content Delivery Network, CDN), basic cloud computing services such as big data and an artificial intelligence platform. The server 102 may be a background server of the application programs referred to above. The server 102 and the terminal 101 may be directly or indirectly connected through wired or wireless communication, which is not limited by the embodiments of the present disclosure. In some embodiments, the number of servers 102 may be greater or lesser, as the embodiments of the present disclosure are not limited in this respect. Of course, the server 102 may also include other functional servers to provide more comprehensive and diverse services.
In the embodiment of the disclosure, the server 102 is configured to determine a value allocation result of the second object based on a difference between the first display quality parameter of the first object and the second display quality parameter of the second object, and further allocate value data based on the content indicated by the value allocation result. Wherein the reputation data represents a reputation added to an object queue to be recommended. The first object is determined based on objects in the object queue having a current presentation quality parameter less than a target threshold. The second object is any object in the target object set. The reputation allocation result is used to indicate whether the second object is allowed to obtain reputation data.
The method for allocating the denomination data can be applied to business scenes such as internet advertisements and internet propaganda, for example, can be applied to recommended scenes of business objects such as advertisement videos and propaganda videos. It should be noted that, when recommending a business object, the server 102 generally needs to go through three stages of recall, coarse ranking, and fine ranking. The recall stage is a first recommended stage, and is to quickly retrieve a part of objects potentially interested by the user from a massive object library according to the characteristics of the user and the characteristics of the object, and add the part of objects to a recall queue. The coarse ranking stage is a recommended second stage, which is to sort the objects in the recall queue according to some business indexes (such as click rate) of the coarse ranking, screen out the objects with the top sorting, and add the screened objects into the coarse ranking queue so as to reduce the number of the recalled objects and the sorting pressure of the fine ranking stage. The fine ranking stage is a third recommending stage, and objects in the coarse ranking queue are further ranked according to some fine ranking business indexes (such as expected benefits and bidding information) and the objects with the forefront ranking are screened out to obtain objects to be recommended.
The method for allocating the denomination data provided by the embodiment of the disclosure can be applied to a recall stage or a coarse ranking stage to recommend the target object preferentially. The target object refers to an object of a specific industry or an innovative industry, that is, an object containing specific content or innovative content, such as public welfare propaganda video, innovative advertisement video and the like. It should be noted that, in the context of advertisement service or propaganda service, there is a need to display objects in some specific industries or innovative industries preferentially, so as to achieve the purpose of propaganda of the industries. That is, in the recall stage or coarse-ranking stage, a certain number of names are allocated to the target objects which do not enter the recall queue or coarse-ranking queue, so that the target objects with acquired names are added into the corresponding queue, the opportunity of the target objects entering the next stage is improved, and the purpose of supporting specific services and innovative services is achieved.
Fig. 2 is a flowchart of a method for allocating denomination data according to an exemplary embodiment, as shown in fig. 2, in which the embodiment uses a server as an execution body, and includes the following steps:
in step 201, the server obtains a first presentation quality parameter of a first object, which is determined based on an object in the object queue to be recommended, whose current presentation quality parameter is smaller than a target threshold.
In step 202, the server obtains a second presentation quality parameter for a second object, the second object being any one of a set of target objects, the set of target objects including a plurality of objects.
In step 203, the server determines a ranking assignment result of the second object based on the difference between the first presentation quality parameter and the second presentation quality parameter, the ranking assignment result being used to indicate whether the second object is allowed to obtain ranking data, the ranking data representing a ranking added to the object queue to be recommended.
The embodiment of the disclosure provides a method for dynamically distributing name data, which judges whether to allow an object to obtain name data according to a display quality parameter of each object and a difference value between display quality parameters of objects with the parameters smaller than a target threshold value in a queue, and considers the display quality parameters of the objects, so that the object with better display quality can obtain the name data, the object with poorer display quality is prevented from obtaining the name data, and the display quality of the object can be ensured while the name data is distributed to the object.
The foregoing fig. 2 is merely a basic flow of the disclosure, and the scheme provided in the disclosure is further described below based on a specific embodiment, and fig. 3 is a flowchart illustrating a method for allocating denomination data according to an exemplary embodiment, and referring to fig. 3, the method includes:
In step 301, the server responds to the display request of the terminal, and sorts the display quality parameters of the plurality of objects in the original object set according to the order from high to low.
Wherein the presentation request is used to trigger presentation of one or more objects. In some embodiments, if the present embodiment is applied to a recall phase, the original set of objects refers to a set of massive objects, for example, the original set of objects may be an object library. In other embodiments, if the present embodiment is applied to the coarse-rank stage, the original set of objects refers to a set of objects determined by the recall stage, and for example, the original set of objects may be a recall queue. The presentation quality parameter of the object is used to represent the presentation quality of the object. In some embodiments, the display quality parameter is a thousand display benefits (effective cost per mile, eCPM), which is the benefit that each thousand displays can obtain, or a distribution rate, which is the proportion of the number of times objects are distributed to the client. It will be appreciated that the higher the display quality parameter of an object, the better the display quality of the object, and the greater the revenue generated by the object.
In some embodiments, the terminal sends the presentation request to the server based on a trigger operation by the user. Taking a video application program as an example, a user operates the terminal and starts the video application program, a plurality of control controls, such as a view control or a play control, are displayed in an interface of the video application program, if the terminal detects the click operation of the user on the view control or the play control, a display request is sent to the server, and after receiving the display request, the server performs subsequent operations.
In some embodiments, the server responds to a display request of the terminal to obtain thousands of display benefits of a plurality of objects in the original object set, and orders the thousands of display benefits of the plurality of objects according to the order from high to low, so as to obtain the arrangement order of the plurality of objects. Optionally, the process of obtaining thousands of display benefits by the server is as follows: and predicting the click rate of any object in the original object set to obtain the predicted click rate of the object, and determining the product of the predicted click rate of the object, the single click benefits of the object and a constant 1000 as thousands of display benefits of the object. In the embodiment, the display quality parameters are adopted for sorting, so that the display quality of the objects can be better represented, and the subsequent process of allocating the name data to the objects is facilitated.
In still other embodiments, the server responds to a display request of the terminal to obtain the issuing rates of a plurality of objects in the original object set, and sorts the plurality of objects according to the order of the issuing rates from high to low, so as to obtain the arrangement order of the plurality of objects. Optionally, the process of obtaining the issuing rate by the server is as follows: in this embodiment, the distribution rates of the objects in the original object set are adopted to sort, which can also better represent the display quality of the objects, and facilitate the subsequent process of allocating the name data to the objects.
In other embodiments, the server may further perform weighted summation on the thousand times of display benefits, the first weight of the thousand times of display benefits, the issuing rate and the second weight of the issuing rate based on the thousand times of display benefits of the plurality of objects in the original object set, to obtain display quality parameters of the plurality of objects in the original object set, and then order the plurality of objects according to the order of the display quality parameters of the plurality of objects from high to low, to obtain an arrangement order of the plurality of objects. In the embodiment, the display quality parameters are adopted for sorting, so that the display quality of the objects can be better represented, and the sorting is performed in a weighted summation mode, so that the sorting can be performed more accurately by considering the two sorting parameters, and the subsequent process of allocating the name data to the objects is facilitated.
The above process illustrates the ranking process by taking thousands of display benefits and delivery rates as examples. In other embodiments, other dimensional parameters may be selected for ranking, for example, a thousand-time display click rate, a user click frequency, a user interaction frequency, a user interest score, and the like, or a comprehensive dimensional score of the above dimensional parameters may be used for ranking. It should be understood that the display quality parameter, i.e. the parameter that is capable of representing the positive effect that occurs when the object is displayed. The display quality parameters selected for use in the embodiments of the present disclosure are not limited.
In step 302, the server adds a target number of objects in the original object set that exhibit a quality parameter that is a front of the plurality of objects to the object queue.
Wherein the target number is a fixed number, such as 20, which is preset. The target number of objects refers to a plurality of objects to be recommended which are preliminarily determined. Optionally, the object queue is an object queue of a recall stage or a coarse-rank stage. The object queue is used for storing a plurality of objects to be recommended determined in one presentation request.
In some embodiments, the server selects a target number of objects in the original set of objects that exhibit a quality parameter that is a top of the plurality of objects based on a ranking order of the plurality of objects in the original set of objects, and adds the selected objects to the object queue. In this embodiment, when determining the object queue, selecting the object with a higher display quality parameter can ensure the subsequent display quality.
In step 303, the server selects an object that is not added to the object queue but satisfies a recommendation condition from the original object set, and forms a target object set, where the target object set includes a plurality of objects.
Wherein the target object set is a subset of the original object set. The target object set refers to a set of objects meeting recommendation conditions in the original object set, namely, a set of objects needing to be recommended preferentially. The object satisfying the recommendation condition refers to an object containing specific content or innovative content, such as a public welfare advertisement video, an innovative advertisement video, etc., that is, the above-mentioned target object.
In some embodiments, after the server adds the selected object to the object queue, selecting an object that is not added to the object queue but satisfies a recommendation condition from the original object set, and forming the target object set according to the object that satisfies the recommendation condition. In the embodiment, the object meeting the recommendation condition is selected from a plurality of objects which do not enter the object queue, so that the target object set can be rapidly determined, the subsequent process of judging whether to allocate the name data for the object is facilitated, and the efficiency of allocating the name data for the object is improved.
In step 304, the server obtains a first presentation quality parameter for a first object that is determined based on objects in the queue of objects to be recommended for which the current presentation quality parameter is less than a target threshold.
The target threshold is a preset fixed threshold.
In some embodiments, the process of the server determining the first object includes any one of:
(1) If the display quality parameter of one object exists in the object queue and is smaller than the target threshold, the server takes the object as a first object.
(2) If the display quality parameters of the plurality of objects in the object queue are smaller than the target threshold, the server randomly selects one object from the plurality of objects as a first object, or the server takes the object with the lowest display quality parameter in the plurality of objects as the first object. In the process, if a plurality of objects with the display quality parameters smaller than the target threshold exist, one of the objects or the object with the lowest display quality parameters can be selected as the first object, the first object can be rapidly determined, and subsequent operations can be conveniently executed.
(3) And the server selects an object with the lowest currently displayed quality parameter in the object queue to be recommended as a first object. That is, the server acquires the objects with the later arrangement order from the object queue as the first object. Therefore, the first object can be determined more quickly by directly selecting the objects with the rear arrangement sequence in the queue, the efficiency of determining the first object is improved, and the efficiency of allocating the denomination data is further improved. The embodiment of the disclosure takes the object with the lowest display quality parameter as the first object as an example.
For example, if the object queue includes N objects, since the objects in the object queue are arranged in the order of from high to low in the presentation quality parameter, the object in the object queue with the order of N is used as the first object, and the first presentation quality parameter of the first object may be expressed as rank_score_n.
After the first object is determined in the steps (1) to (3), the display quality parameter of the first object is obtained, so that the first display quality parameter can be obtained. In other embodiments, if the display quality parameters of the plurality of objects in the object queue are less than the target threshold, the server obtains the display quality parameters of the plurality of objects, and determines an average value of the display quality parameters of the plurality of objects as the first display quality parameter. In the process, the server adopts the average value of the display quality parameters as the first display quality parameter, so that the first display quality parameter can be determined quickly, the display quality parameters of a plurality of objects are comprehensively considered, and the accuracy of the subsequent name data distribution is improved.
In step 305, the server obtains a second presentation quality parameter for a second object, the second object being any object in the set of target objects.
In some embodiments, the server selects a presentation quality parameter for an object from the set of target objects as a second presentation quality parameter for the second object.
In some embodiments, the process of selecting the second object by the server includes any one of:
(1) The server randomly selects an object from the target object set as the second object. In the embodiment, the second object is selected in a random selection mode, so that the second object can be rapidly determined, and the efficiency of name data distribution is improved.
(2) And the server selects an object with the highest display quality parameter from the target object set as the second object. In this embodiment, the second object can be determined quickly by selecting the object with the highest display quality parameter, and the probability of allocating the name data to the second object can be improved, so that the speed of allocating the name data to the object can be increased, and the efficiency of allocating the name data can be further improved.
Illustratively, one object is selected from the target object set as a second object, and a second presentation quality parameter of the second object may be represented as rank_score_h.
In step 306, the server determines a target allocation parameter for the second object based on the difference between the first presentation quality parameter and the second presentation quality parameter, the target allocation parameter representing a probability of the second object being added to the object queue, the reputation data representing a reputation to be added to the object queue to be recommended.
The name data refers to a queue quota (quota) of the object queue, that is, a queue name occupied by an object when the object joins the object queue.
In the above process, the probability that the object is added to the object queue is determined according to the difference between the display quality parameter of the object to be allocated with the name and the display quality parameter of the object with the lowest score in the queue, and the probability can represent the probability that the object is added to the queue, so that whether the name data is allocated to the object can be quickly obtained according to the probability, and the allocation efficiency of the name data is improved.
In some embodiments, after obtaining a first display quality parameter of a first object and a second display quality parameter of a second object, a server determines a difference parameter based on a difference between the first display quality parameter and the second display quality parameter and the first display quality parameter, the difference parameter being positively correlated with the difference and negatively correlated with the first display quality parameter. And determining a target allocation parameter of the second object based on the difference parameter, wherein the target allocation parameter is inversely related to the difference parameter.
In this embodiment, according to the difference between the display quality parameter of the object to be allocated with the title and the display quality parameter of the object with the lowest score in the queue, a difference parameter positively correlated with the difference is determined, and then a target allocation parameter negatively correlated with the difference is determined based on the difference parameter, that is, the larger the difference between the display quality parameter of the object to be allocated with the title and the display quality parameter of the object with the lowest score in the queue is, the smaller the probability that the object is added into the object queue is, so that the opportunity that the object with the better display quality is added into the object queue can be improved, the object with the better display quality obtains the title data, and the accuracy of allocating the title data is improved while the display quality is ensured.
The process of determining the target allocation parameter of the second object based on the first display quality parameter and the second display quality parameter is described in detail below:
the server determines a difference between the first display quality parameter and the second display quality parameter based on the first display quality parameter, the second display quality parameter, and equation (1).
Δ rank_score =rank_score N -rank_score H (1)
In the formula delta rank_score For the difference between the first display quality parameter and the second display quality parameter, rank_score N For the first presentation quality parameter, rank_score H And displaying the quality parameter for the second display.
The server determines a difference parameter based on the difference between the first display quality parameter and the second display quality parameter, the first display quality parameter, and equation (2).
In the formula, rank_score norm As a difference parameter, delta rank_score For the difference between the first display quality parameter and the second display quality parameter, rank_score N The quality parameter is displayed for the first.
In some embodiments, the process of the server determining the target allocation parameters is: the server determines a probability that an argument of the gaussian is located in a first section based on the gaussian, the first section being a section greater than the difference parameter, and determines a target allocation parameter of the second object based on the probability that the argument is located in the first section, wherein the target allocation parameter is determined based on a characteristic that the gaussian is symmetrical to a coordinate longitudinal axis. Specifically, the server determines the target allocation parameter of the second object based on the difference parameter and equation (3).
P 2 =2×P 1 (v>rank_score norm /v~Gauss(μ,δ))(μ=0,δ=1) (3)
Wherein P is 2 Assigning parameters to the targets of the second object, P 1 v-Gauss (μ, δ)) (μ=0, δ=1) is a gaussian function whose mean is 0, variance is 1, v is the independent of the gaussian function, rank_score norm Is a difference parameter.
It should be noted that, the plurality of objects in the target object set are all objects that are not added to the object queue when being ordered in step 302, that is, the plurality of objects with lower display quality parameters when being ordered, so that the display quality parameters of the plurality of objects in the target object set are lower than the display quality parameters of the objects in the object queue, so that the difference degree between any object in the target object set and the object with the lowest current display quality parameter in the object queue, that is, the degree of how much lower any object is than the object with the lowest parameter in the object queue.
It should be further noted that, if the degree of difference (difference parameter) between an object with the lowest currently displayed quality parameter in the object queue is greater, the smaller the profit brought by the object is, the smaller the probability of finally allocating the value data to the object (i.e. the target allocation parameter) is, if the degree of difference between the object with the lowest currently displayed quality parameter in the object queue is smaller, the greater the profit brought by the object is, the greater the probability of allocating the value data to the object is, and it can be found that the probability of allocating the value data to an object is inversely related to the degree of difference between the object with the lowest currently displayed quality parameter in the object queue. Therefore, in the embodiment of the disclosure, the gaussian function is skillfully adopted to represent the negative correlation between the difference parameter and the target allocation parameter, on one hand, the probability that the object is added to the object queue can be represented by adopting the probability that the independent variable is located in a section larger than the difference parameter, and on the other hand, the probability that the object is added to the object queue can be more accurately determined by considering that the difference degree is positive and the symmetry characteristic of the gaussian function, the gaussian distribution is converted into abs (x) (the function of solving the absolute value), that is, the probability that the object is preliminarily determined is multiplied by 2, so that the accuracy of determining the target allocation parameter is improved.
In step 307, the server determines a reputation allocation result for the second object based on the target allocation parameter, the reputation allocation result indicating whether the second object is permitted to obtain reputation data.
In some embodiments, the server performs random probability value sampling based on the determined target allocation parameter (i.e., probability) to determine whether to allow the second object to obtain a reputation data. The corresponding process comprises the following steps: the server issues a random number in a second interval, the second interval is divided into a first subinterval and a second subinterval according to the target allocation parameter, wherein the ratio between the length of the first subinterval and the length of the second interval is equal to the target allocation parameter, if the random number is located in the first subinterval, the second object is allowed to occupy the title data, and if the random number is located in the second subinterval, the second object is not allowed to occupy the title data.
Illustratively, taking the second interval as 0-100 as an example, if the target allocation parameter of the second object is 9/10, the second interval is divided into 0-10 and 10-100 according to 9/10, or the second interval is divided into 0-90 and 90-100. It will be appreciated that in the first case of division, 10-100 is the first sub-interval, i.e. the sub-interval taking up 9/10 of the total length of 0-100, and in the second case of division, 90-100 is the first sub-interval, i.e. the sub-interval taking up 9/10 of the total length of 0-100. For any of the above division cases, if the random number issued for the second object falls within the subinterval (first subinterval) of 9/10 of the total length of 0-100, it indicates that the probability of the second object displaying the name data is high in the random case, the second object is added to the object queue, and if the random number issued for the second object falls within the subinterval (second subinterval) of 1/10 of the total length of 0-100, it indicates that the probability of the second object displaying the name data is low in the random case, the second object is not added to the object queue.
In the above embodiment, the random probability value is used to sample to determine whether to allocate a piece of name data to the second object, so as to provide a method for dynamically allocating name data, which increases the exploring effect, can enable the object with better display quality to obtain the name data, avoid the object with poor display quality from obtaining the name data, and ensure the display quality of the object while allocating the name data to the object.
In step 308, if the result of the allocation of the second object indicates that the second object is allowed to obtain the name data, the server allocates the name data for the second object and adds the second object to the object queue.
In some embodiments, if the result of the allocation of the second object indicates that the second object is allowed to obtain a piece of name data, the server obtains an object identifier of the second object, selects a tag of the name data, and generates a correspondence between the object identifier and the tag of the name data, so as to add the second object to the object queue.
Optionally, the tag of the name data selected by the server may be a tag of the name data of the first object, that is, the object with the lowest display quality parameter in the object queue is deleted, and the second object is added to the object queue. In the process, the object with the lowest quality parameter displayed in the object queue is replaced by a second object, so that the priority recommendation of the second object is realized.
In other embodiments, if the result of the allocation of the second object indicates that the second object is not allowed to obtain the value data, the server does not allocate the value data to the second object, continues traversing the remaining objects in the target object set, and sequentially performs the above-mentioned value data allocation process on the remaining objects.
The above steps 301 to 308 are described with respect to the determination process of allocating the reputation data to any object in the target object set based on the second object. For the whole target object set, the server also presets the total amount of the name data allocated to the target object set, namely the upper limit of the amount of the name data, further judges whether to allocate the name data to a plurality of objects in the target object set based on the total amount of the name data, if the amount of the objects added to the object queue in the target object set reaches the total amount of the name data, the server stops allocating the name data, and if the amount of the objects added to the object queue in the target object set does not reach the total amount of the name data, the server continues to allocate the name data.
It should be noted that, the execution timing of the server to determine whether to allocate the name data to the plurality of objects in the target object set based on the total number of the name data may include any one of the following:
In some embodiments, the server determines whether to allocate the name data to the plurality of objects in the target object set based on the total number of the name data, and the step of acquiring the display quality parameters of any object in the target object set is performed before step 305. The corresponding process is as follows: when the server acquires the display quality parameters of any object in the target object set each time, judging whether the number of the objects added into the object queue in the target object set reaches the total number of the name data, if so, not executing the step of acquiring the display quality parameters of any object in the target object set, and if not, continuing executing the step of acquiring the display quality parameters of any object in the target object set. Therefore, before judging whether the name data is allocated to the object, whether the total number of the name data is reached or not can be obtained in advance, the server continues to allocate the name data under the condition that the name data with the surplus number exists, and does not continue to allocate the name data under the condition that the name data with the surplus number does not exist, so that the processing content of the server is greatly reduced.
In other embodiments, the server determines whether to allocate the reputation data to a plurality of objects in the target object set based on the total number of the reputation data, and performs the determining that the second object occupies one of the reputation data. The corresponding process is as follows: if the result of the allocation of the second object indicates that the second object is allowed to obtain one piece of name data, the server judges whether the number of the objects added to the object queue in the target object set reaches the total number of the name data, if so, the second object is not allocated with the name data, and if not, the second object is allocated with one piece of name data. In the process, when determining that the second object is allocated with the name data, a judging process of the total number of the name data is carried out, so that excessive objects are prevented from occupying the name data.
In the above embodiment, by setting the total number of the amount of the name data for the target object set, the number of the objects needing to be allocated with the amount of the name data in the object set is limited to a certain number, so that the excessive amount of the name data allocated for the objects is avoided.
The above-described procedure is a procedure of setting the total number of the reputation data for the target object set, and in other embodiments, the server is preset with an upper number limit (num_max) and a lower number limit (num_min) of the reputation data, and further determines whether to allocate the reputation data for any object in the target object set based on the upper number limit and the lower number limit when allocating the reputation data for the object.
Similarly, the server determining, based on the upper and lower limits of the number of the reputation data, whether to allocate the reputation data for the plurality of objects in the target object set may include any one of:
in some embodiments, when the server obtains the display quality parameter of any object in the target object set each time, firstly judging the relationship between the number of objects added to the object queue in the target object set and the upper limit and the lower limit of the number, and if the number of objects added to the object queue in the target object set is smaller than the lower limit of the number of the nominal data, executing the step of obtaining the display quality parameter of any object in the target object set by the server; if the number of the objects added to the object queue in the target object set is greater than the lower limit of the number of the nametag data and less than the upper limit of the number of the nametag data, the server executes the step of acquiring the display quality parameters of any object in the target object set; if the number of the objects added to the object queue in the target object set is greater than the upper limit of the number of the nameplate data, the step of acquiring the display quality parameters of any object in the target object set is not executed.
In other embodiments, when determining that the second object occupies one of the namespaces, the server determines a relationship between the number of objects added to the object queue in the target object set and an upper limit and a lower limit of the number, and if the number of objects added to the object queue in the target object set is smaller than the lower limit of the number of namespaces, the server allocates one of the namespaces for the second object; if the number of the objects added to the object queue in the target object set is greater than the lower limit of the number of the nominal data and less than the upper limit of the number of the nominal data, the server allocates nominal data for the second object; if the number of the objects added to the object queue in the target object set is greater than the upper limit of the number of the nametag data, the nametag data is not allocated to the second object.
The upper and lower limits of the amount of the denomination data may be in the form of an amount interval. In the embodiment, the upper limit and the lower limit of the number of the denomination data are adopted to limit the number of the denomination data in one display request, so that excessive or insufficient objects to be allocated with the denomination data determined in each display request can be avoided, and the number of the objects allocated with the denomination data in each display request is limited in a range.
In the above-mentioned process of allocating the name data to the plurality of objects, the object with higher display quality parameter among the plurality of objects is selected based on the display quality parameter of the object, and the name data is allocated to the selected object.
The embodiment of the disclosure provides a method for dynamically distributing name data, which judges whether to allow an object to obtain name data according to a display quality parameter of each object and a difference value between display quality parameters of objects with the parameters smaller than a target threshold value in a queue, and considers the display quality parameters of the objects, so that the object with better display quality can obtain the name data, the object with poorer display quality is prevented from obtaining the name data, and the display quality of the object can be ensured while the name data is distributed to the object.
Fig. 3 illustrates how to assign a title to an object in a set of target objects. Fig. 4 is a flow chart illustrating a method of allocating denomination data according to an exemplary embodiment, see fig. 4, the method comprising:
In step 401, the server responds to the display request of the terminal, and sorts the display quality parameters of the objects in the original object set according to the order from high to low.
In step 402, the server adds a target number of objects in the original object set that exhibit a quality parameter that is a front of the plurality of objects to the object queue.
In step 403, the server selects, from the original object set, an object that is not added to the object queue but satisfies a recommendation condition, and forms the target object set, where the target object set includes a plurality of objects.
In step 404, the server obtains a first presentation quality parameter for a first object that is determined based on objects in the queue of objects to be recommended for which the current presentation quality parameter is less than a target threshold.
In step 405, the server obtains a second presentation quality parameter for a second object, the second object being any object in the set of target objects.
In step 406, the server determines a target allocation parameter for the second object based on the difference between the first presentation quality parameter and the second presentation quality parameter, the target allocation parameter representing a probability of the second object being added to the object queue, the reputation data representing a reputation to be added to the object queue to be recommended.
In step 407, the server determines, based on the target allocation parameter, a reputation allocation result of the second object, the reputation allocation result being used to indicate whether the second object is allowed to obtain reputation data.
In step 408, if the result of the allocation of the second object indicates that the second object is allowed to obtain the name data, the server allocates the name data for the second object and adds the second object to the object queue.
The content of the steps 401 to 408 is referred to steps 301 to 308, and will not be described again.
In step 409, the server obtains the display quality parameters of the objects whose current display quality parameters are smaller than the target threshold from the objects in the object queue except the newly added object.
In step 410, the server obtains a display quality parameter of a next object from the set of target objects, and determines a target allocation parameter of the next object based on a difference between the display quality parameter of the object whose display quality parameter is less than a target threshold and the display quality parameter of the next object.
In some embodiments, the server selects, from the target object set, the display quality parameter of the object having the highest display quality parameter except the second object as the display quality parameter of the next object. Therefore, the speed of allocating the name data to the object can be increased, and the efficiency of allocating the name data is improved. Of course, in other embodiments, the server may also select the next object by randomly selecting. Optionally, the plurality of objects in the target object set are ordered in order of high to low. In this way, the object with the highest quality parameter can be conveniently determined, and the efficiency of allocating the name data is improved.
It should be noted that, the process of determining the target allocation parameter by the server is referred to step 306, and will not be described again.
In step 411, the server determines a next object's name allocation result based on the next object's target allocation parameter, and if the next object's name allocation result indicates that the next object is allowed to obtain name data, the server allocates name data for the next object and adds the next object to the object queue.
In other embodiments, if the result of the allocation of the next object indicates that the object is not allowed to obtain a piece of name data, the server does not allocate a piece of name data for the next object, continues traversing the remaining objects in the target object set, and sequentially performs the above-mentioned process of allocating name data for the remaining objects.
In step 412, the above step of allocating the name to the object in the target object set is repeatedly performed until the number of objects added to the object queue in the target object set reaches the total number of the name data, and the server stops allocating the name data.
In some embodiments, when the server allocates a name to an object in the target object set, if the name allocation result of the object indicates that the object is allowed to obtain one name data for any object in the target object set, determining whether the number of objects added to the object queue in the target object set reaches the total number of the name data, if so, stopping allocating the name data, if not, allocating the name data for the object, and continuing traversing other objects in the target object set.
It should be appreciated that in some embodiments, when the server traverses all objects in the target object set, the number of objects in the target object set that are added to the object queue may not yet reach the total number of the reputation data, at which point the server stops distributing the reputation data.
The embodiment of the disclosure provides a method for dynamically distributing name data, which judges whether to allow each object to obtain name data according to the display quality parameter of the object and the difference value between the display quality parameters of the objects with the parameters smaller than a target threshold value in a queue, and considers the display quality parameters of each object, so that the object with better display quality can obtain the name data, the object with poorer display quality is prevented from obtaining the name data, and the display quality of the object can be ensured while the name data is distributed to the object.
Fig. 5 is a block diagram illustrating a denomination data allocation apparatus according to an exemplary embodiment. Referring to fig. 5, the apparatus includes a first acquisition unit 501, a second acquisition unit 502, and a determination unit 503.
A first obtaining unit 501 configured to perform obtaining a first display quality parameter of a first object, where the first object is determined based on an object in a queue of objects to be recommended, where the current display quality parameter is smaller than a target threshold;
A second obtaining unit 502 configured to perform obtaining a second display quality parameter of a second object, where the second object is any object in a target object set, and the target object set includes a plurality of objects;
a determining unit 503 configured to perform determining a reputation allocation result of the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter, the reputation allocation result being used to indicate whether the second object is allowed to obtain reputation data, the reputation data representing a reputation added to the object queue to be recommended.
In some embodiments, the determining unit 503 includes:
an allocation parameter determining unit configured to perform determining a target allocation parameter of the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter, the target allocation parameter representing a probability that the second object is added to the object queue;
and an allocation result determining unit configured to perform determination of a name allocation result of the second object based on the target allocation parameter.
In some embodiments, the allocation parameter determining unit comprises:
a difference parameter determination subunit configured to perform determining a difference parameter based on a difference between the first display quality parameter and the second display quality parameter and the first display quality parameter, the difference parameter being positively correlated with the difference and negatively correlated with the first display quality parameter;
An allocation parameter determination subunit configured to perform determining a target allocation parameter of the second object based on the difference parameter, the target allocation parameter being inversely related to the difference parameter.
In some embodiments, the allocation parameter determining subunit is configured to perform:
based on a Gaussian function, determining the probability that an independent variable of the Gaussian function is located in a first interval, wherein the first interval is an interval larger than the difference parameter;
and determining a target allocation parameter of the second object based on the probability that the independent variable is located in the first interval, wherein the target allocation parameter is determined based on the characteristic that the Gaussian function is symmetrical to the longitudinal axis of the coordinates.
In some embodiments, the allocation result determining unit is configured to perform:
issuing a random number in a second interval for the second object;
dividing the second interval into a first subinterval and a second subinterval according to the target allocation parameter, wherein the ratio between the length of the first subinterval and the length of the second interval is equal to the target allocation parameter;
and if the random number is positioned in the first subinterval, allowing the second object to occupy the nominal data, and if the random number is positioned in the second subinterval, not allowing the second object to occupy the nominal data.
In some embodiments, the apparatus further comprises:
and the allocation unit is configured to execute the step of stopping allocating the name data if the number of the objects added to the object queue in the target object set reaches the total number of the name data.
In some embodiments, the set of target objects is a subset of the set of original objects, the apparatus further comprising:
a sorting unit configured to perform sorting in order of high to low display quality parameters of a plurality of objects in the original object set;
and the adding unit is configured to execute the object with the front target number of the display quality parameters in the plurality of objects in the original object set and add the object into the object queue.
In some embodiments, the apparatus further comprises:
and a selecting unit configured to perform selecting an object which is not added to the object queue but satisfies a recommendation condition from the original object set, to constitute the target object set.
The embodiment of the disclosure provides a method for dynamically distributing name data, which judges whether to allow each object to obtain name data according to the display quality parameter of the object and the difference value between the display quality parameters of the objects with the parameters smaller than a target threshold value in a queue, and considers the display quality parameters of each object, so that the object with better display quality can obtain the name data, the object with poorer display quality is prevented from obtaining the name data, and the display quality of the object can be ensured while the name data is distributed to the object.
It should be noted that: the name data allocation device provided in the above embodiment only uses the division of the above functional modules to illustrate when allocating name data, in practical application, the above functional allocation may be performed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules, so as to complete all or part of the functions described above. In addition, the title data allocation device and the title data allocation method provided in the foregoing embodiments belong to the same concept, and specific implementation processes thereof are detailed in the method embodiments, which are not repeated herein.
Fig. 6 is a block diagram illustrating a server 600, which may be configured or perform differently to generate a larger difference, and may include one or more processors (Central Processing Units, CPU) 601 and one or more memories 602, wherein the one or more memories 602 store at least one program code that is loaded and executed by the one or more processors 601 to implement the denomination data allocation method provided in the above-described method embodiments, according to an exemplary embodiment. Of course, the server 600 may also have a wired or wireless network interface, a keyboard, an input/output interface, and other components for implementing the functions of the device, which are not described herein.
In an exemplary embodiment, a computer readable storage medium is also provided, e.g., a memory 602, comprising program code executable by the processor 601 of the server 600 to perform the above-described reputation data allocation method. Alternatively, the computer readable storage medium may be a read-only memory (ROM), a random access memory (random access memory), a RAM), a compact-disk read-only memory (CD-ROM), a magnetic tape, a floppy disk, an optical data storage device, and the like.
In an exemplary embodiment, a computer program product is also provided, comprising a computer program which, when executed by a processor, implements the above-described method of allocating denomination data.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any adaptations, uses, or adaptations of the disclosure following the general principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (18)

1. A method of allocating denomination data, the method comprising:
acquiring a first display quality parameter of a first object, wherein the first object is determined based on an object of which the current display quality parameter in an object queue to be recommended is smaller than a target threshold;
acquiring a second display quality parameter of a second object, wherein the second object is any object in a target object set, and the target object set comprises a plurality of objects;
and determining a name allocation result of the second object based on the difference value between the first display quality parameter and the second display quality parameter, wherein the name allocation result is used for indicating whether the second object is allowed to obtain name data, and the name data represents names added to the object queue to be recommended.
2. The method of claim 1, wherein determining the denomination allocation result for the second object based on the difference between the first presentation quality parameter and the second presentation quality parameter comprises:
Determining a target allocation parameter for the second object based on a difference between the first and second display quality parameters, the target allocation parameter representing a probability of the second object joining into the object queue;
and determining a name allocation result of the second object based on the target allocation parameter.
3. The method of claim 2, wherein the determining a target allocation parameter for the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter comprises:
determining a difference parameter based on a difference between the first display quality parameter and the second display quality parameter and the first display quality parameter, the difference parameter being positively correlated with the difference and negatively correlated with the first display quality parameter;
based on the difference parameter, a target allocation parameter of the second object is determined, the target allocation parameter being inversely related to the difference parameter.
4. A method of allocating denomination data according to claim 3, wherein said determining a target allocation parameter for said second object based on said variance parameter comprises:
Based on a Gaussian function, determining the probability that an independent variable of the Gaussian function is located in a first interval, wherein the first interval is an interval larger than the difference parameter;
and determining a target distribution parameter of the second object based on the probability that the independent variable is located in the first interval, wherein the target distribution parameter is determined based on the characteristic that the Gaussian function is symmetrical to the coordinate longitudinal axis.
5. The method of claim 2, wherein determining a denomination allocation result for the second object based on the target allocation parameter comprises:
issuing a random number in a second interval for the second object;
dividing the second interval into a first subinterval and a second subinterval according to the target allocation parameter, wherein the ratio between the length of the first subinterval and the length of the second interval is equal to the target allocation parameter;
and if the random number is positioned in the first subinterval, allowing the second object to occupy the nominal data, and if the random number is positioned in the second subinterval, not allowing the second object to occupy the nominal data.
6. The method of claim 1, wherein after determining a denomination allocation result for the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter, the method further comprises:
And if the number of the objects added to the object queue in the target object set reaches the total number of the nameplate data, stopping distributing the nameplate data.
7. The method of claim 1, wherein the target object set is a subset of the original object set, and wherein prior to the obtaining the first presentation quality parameter for the first object, the method further comprises:
sorting according to the sequence from high to low of the display quality parameters of the objects in the original object set;
and adding the target number of objects with the front display quality parameters in the plurality of objects in the original object set into the object queue.
8. The method for allocating denomination data according to claim 7, wherein said adding a target number of objects showing a quality parameter in front of said plurality of objects in said original object set to said object queue, said method further comprises:
and selecting an object which is not added into the object queue but meets the recommended condition from the original object set to form the target object set.
9. A denomination data distribution device, the device comprising:
The first acquisition unit is configured to acquire a first display quality parameter of a first object, wherein the first object is determined based on an object of which the current display quality parameter is smaller than a target threshold value in an object queue to be recommended;
a second obtaining unit configured to perform obtaining a second display quality parameter of a second object, where the second object is any one object in a target object set, and the target object set includes a plurality of objects;
and a determining unit configured to perform determining a denomination allocation result of the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter, the denomination allocation result indicating whether the second object is allowed to obtain denomination data representing a denomination added to the object queue to be recommended.
10. The name data distribution device according to claim 9, wherein the determination unit includes:
an allocation parameter determination unit configured to perform determining a target allocation parameter of the second object based on a difference between the first presentation quality parameter and the second presentation quality parameter, the target allocation parameter representing a probability that the second object is added to the object queue;
And an allocation result determining unit configured to perform determination of a denomination allocation result of the second object based on the target allocation parameter.
11. The name data allocation device according to claim 10, wherein the allocation parameter determining unit includes:
a difference parameter determination subunit configured to perform determining a difference parameter based on a difference between the first display quality parameter and the second display quality parameter and the first display quality parameter, the difference parameter being positively correlated with the difference and negatively correlated with the first display quality parameter;
an allocation parameter determination subunit configured to perform determining a target allocation parameter of the second object based on the difference parameter, the target allocation parameter being inversely related to the difference parameter.
12. The title data allocation device according to claim 11, wherein the allocation parameter determination subunit is configured to perform:
based on a Gaussian function, determining the probability that an independent variable of the Gaussian function is located in a first interval, wherein the first interval is an interval larger than the difference parameter;
and determining a target distribution parameter of the second object based on the probability that the independent variable is located in the first interval, wherein the target distribution parameter is determined based on the characteristic that the Gaussian function is symmetrical to the coordinate longitudinal axis.
13. The name data allocation device according to claim 10, wherein the allocation result determination unit is configured to perform:
issuing a random number in a second interval for the second object;
dividing the second interval into a first subinterval and a second subinterval according to the target allocation parameter, wherein the ratio between the length of the first subinterval and the length of the second interval is equal to the target allocation parameter;
and if the random number is positioned in the first subinterval, allowing the second object to occupy the nominal data, and if the random number is positioned in the second subinterval, not allowing the second object to occupy the nominal data.
14. The title data allocation device of claim 9, wherein the device further comprises:
and the allocation unit is configured to execute the step of stopping allocating the amount of the name data if the number of the objects added to the object queue in the target object set reaches the total number of the amount of the name data.
15. The reputation data allocation apparatus of claim 9, wherein the target set of objects is a subset of the original set of objects, the apparatus further comprising:
A sorting unit configured to perform sorting in order of high to low display quality parameters of a plurality of objects in the original object set;
and the adding unit is configured to perform adding the target number of objects with the front display quality parameters in the plurality of objects in the original object set into the object queue.
16. The title data allocation device of claim 15, wherein the device further comprises:
and the selecting unit is configured to select an object which is not added into the object queue but meets the recommendation condition from the original object set to form the target object set.
17. A server, the server comprising:
one or more processors;
a memory for storing the processor-executable program code;
wherein the processor is configured to execute the program code to implement the method of allocating denomination data according to any one of claims 1 to 8.
18. A computer readable storage medium, characterized in that program code in the computer readable storage medium, when executed by a processor of a server, enables the server to perform the method of allocating reputation data according to any of claims 1 to 8.
CN202110125642.4A 2021-01-29 2021-01-29 Method, device, server and storage medium for allocating denomination data Active CN112925976B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110125642.4A CN112925976B (en) 2021-01-29 2021-01-29 Method, device, server and storage medium for allocating denomination data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110125642.4A CN112925976B (en) 2021-01-29 2021-01-29 Method, device, server and storage medium for allocating denomination data

Publications (2)

Publication Number Publication Date
CN112925976A CN112925976A (en) 2021-06-08
CN112925976B true CN112925976B (en) 2023-11-21

Family

ID=76168480

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110125642.4A Active CN112925976B (en) 2021-01-29 2021-01-29 Method, device, server and storage medium for allocating denomination data

Country Status (1)

Country Link
CN (1) CN112925976B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9129313B1 (en) * 2012-04-06 2015-09-08 MaxPoint Interactive, Inc. System and method for optimizing real-time bidding on online advertisement placements utilizing mixed probability methods
CN107203558A (en) * 2016-03-17 2017-09-26 腾讯科技(深圳)有限公司 Object recommendation method and apparatus, recommendation information treating method and apparatus
CN108076358A (en) * 2016-12-23 2018-05-25 北京市商汤科技开发有限公司 Processing method, device and the equipment of business object
CN111382349A (en) * 2018-12-29 2020-07-07 广州市百果园网络科技有限公司 Information recommendation method and device, computer equipment and storage medium
CN111538912A (en) * 2020-07-07 2020-08-14 腾讯科技(深圳)有限公司 Content recommendation method, device, equipment and readable storage medium

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9129313B1 (en) * 2012-04-06 2015-09-08 MaxPoint Interactive, Inc. System and method for optimizing real-time bidding on online advertisement placements utilizing mixed probability methods
CN107203558A (en) * 2016-03-17 2017-09-26 腾讯科技(深圳)有限公司 Object recommendation method and apparatus, recommendation information treating method and apparatus
CN108076358A (en) * 2016-12-23 2018-05-25 北京市商汤科技开发有限公司 Processing method, device and the equipment of business object
CN111382349A (en) * 2018-12-29 2020-07-07 广州市百果园网络科技有限公司 Information recommendation method and device, computer equipment and storage medium
CN111538912A (en) * 2020-07-07 2020-08-14 腾讯科技(深圳)有限公司 Content recommendation method, device, equipment and readable storage medium

Also Published As

Publication number Publication date
CN112925976A (en) 2021-06-08

Similar Documents

Publication Publication Date Title
CN108763502B (en) Information recommendation method and system
CN109902849B (en) User behavior prediction method and device, and behavior prediction model training method and device
CN108334568B (en) House resource pushing method, device, equipment and computer readable storage medium
CN107451785B (en) Method and apparatus for outputting information
JP2011090353A (en) Advertisement distribution device and method
CN109862100B (en) Method and device for pushing information
CN109640176B (en) Method and apparatus for generating information
CN108600780B (en) Method for pushing information, electronic device and computer readable medium
CN111159553A (en) Information pushing method and device, computer equipment and storage medium
CN111552835A (en) File recommendation method and device and server
CN112905879B (en) Recommendation method, recommendation device, server and storage medium
CN109087139B (en) Advertisement putting method and device for feed stream
CN107844932B (en) Order processing method and device
CN112925976B (en) Method, device, server and storage medium for allocating denomination data
CN112449217B (en) Method and device for pushing video, electronic equipment and computer readable medium
CN109344327B (en) Method and apparatus for generating information
JP2014126964A (en) Advertisement distribution management device and advertisement distribution management method
CN115760296A (en) Page data processing and browsing method, terminal device and storage medium
CN112784159B (en) Content recommendation method and device, terminal equipment and computer readable storage medium
CN115456691A (en) Recommendation method and device for offline advertisement space, electronic equipment and storage medium
CN112532406B (en) Data processing method and device for contrast experiment, computer equipment and storage medium
CN111026956B (en) Data list processing method and device, electronic equipment and computer storage medium
CN112487277B (en) Data distribution method and device, readable storage medium and electronic equipment
CN110738554B (en) Task processing method and device, electronic equipment and computer readable storage medium
CN113468354A (en) Method and device for recommending chart, electronic equipment and computer readable medium

Legal Events

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