Selective content delivery in a real-time streaming environment
View Patent ↗Machines, systems and methods for dynamic content filtering are provided. The method comprises receiving an indication for a preference for an approximate number of content to be delivered during an indicated time period; assigning a first score to the first content according to one or more factors, in response to receiving a first content at a first point in time during the first time period; delivering the first content, in response to determining that the first score is above a first dynamically calculated threshold, wherein the first dynamically calculated threshold is calculated based on: t: time of arrival of the first content, k(t): number of contents that has been delivered until the first point in time, K: the approximate number of events to be delivered during the indicated time period, and F: a distribution function calculated based on prior history of the content delivered.
1. A computer-implemented method for dynamic content filtering, the computer-implemented method comprising:
receiving, by a software executed by a computer, an indication for a preference for an approximate number of contents to be delivered during an indicated time period;
assigning, by the executed software, a first score to a first content according to one or more factors, in response to receiving the first content at a first point in time during the indicated time period;
delivering, by the executed software, the first content, in response to determining the first score is above a first dynamically calculated threshold,
wherein the first dynamically calculated threshold is calculated based on:
t: time of arrival of the first content,
k(t): number of contents that has been delivered until the first point in time,
K: the approximate number of contents to be delivered during the indicated time period, and
F: a distribution function calculated based on prior history of the contents delivered.
2. The method of claim 1 , wherein the first dynamically calculated threshold θ is calculated based on a solution to equation:
∫
θ
1
F
score
ⅆ
f
=
K
-
k
(
t
)
where: F score is a distribution of scores associated with past contents delivered.
3. The method of claim 1 , wherein the one or more factors comprise a user's preference for total number of contents to be delivered during the indicated time period.
4. The method of claim 1 , wherein the one or more factors comprise knowledge of a user's interest in the contents.
5. The method of claim 1 , wherein the one or more factors comprise age of the contents.
6. The method of claim 1 , wherein the one or more factors are related to whether the contents are trending.
7. The method of claim 1 , wherein the one or more factors are related to at least one of content's author popularity and content's ranking in a popularity index.
8. The method of claim 1 , wherein the first threshold is dynamically calculated at the first point in time using a Kleinberg algorithm.
9. The method of claim 1 , wherein a user provides K as the maximum number of contents to be delivered during the indicated time period.
10. The method of claim 9 , wherein the user provides K as a soft indication for the maximum number of contents to be delivered during the indicated time period, and a variance K±ε is provided to deliver approximately K contents to the user during the indicated time period.
11. A computer system for dynamic content filtering, the computer system comprising:
one or more computer processors;
one or more non-transitory computer readable storage media;
program instructions stored on the one or more non-transitory computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:
program instructions to receive an indication for a preference for an approximate number of contents to be delivered during an indicated time period;
program instructions to assign a first score to a first content according to one or more factors, in response to receiving the first content at a first point in time during the indicated time period;
program instructions to deliver the first content, in response to determining the first score is above a first dynamically calculated threshold,
wherein the first dynamically calculated threshold is calculated based on:
t: time of arrival of the first content,
k(t): number of contents that has been delivered until the first point in time,
K: the approximate number of contents to be delivered during the indicated time period, and
F: a distribution function calculated based on prior history of the contents delivered.
12. The computer system of claim 11 , wherein the first dynamically calculated threshold θ is calculated based on a solution to equation:
∫
θ
1
F
score
ⅆ
f
=
K
-
k
(
t
)
where: F score is a distribution of scores associated with past contents delivered.
13. The computer system of claim 11 , wherein the one or more factors comprise a user's preference for total number of contents to be delivered during the indicated time period.
14. The computer system of claim 11 , wherein the one or more factors comprise knowledge of a user's interest in the first content.
15. The computer system of claim 11 , wherein the one or more factors comprise age of the content.
16. A computer program product comprising a non-transitory computer readable storage medium having a computer readable program, wherein the computer readable program when executed on a computer causes the computer to:
receive an indication for a preference for an approximate number of contents to be delivered during an indicated time period;
assign a first score to a first content according to one or more factors, in response to receiving the first content at a first point in time during the indicated time period;
deliver the first content, in response to determining the first score is above a first dynamically calculated threshold,
wherein the first dynamically calculated threshold is calculated based on:
t: time of arrival of the first content,
k(t): number of contents that has been delivered until the first point in time,
K: the approximate number of contents to be delivered during the indicated time period, and
F: a distribution function calculated based on prior history of the contents delivered.
17. The computer program product of claim 16 , wherein the first dynamically calculated threshold θ is calculated based on a solution to equation:
∫
θ
1
F
score
ⅆ
f
=
K
-
k
(
t
)
where: F score is a distribution of scores associated with past contents delivered.
18. The computer program product of claim 16 , wherein the one or more factors comprise a user's preference for total number of contents to be delivered during the indicated time period.
19. The computer program product of claim 16 , wherein the one or more factors comprise knowledge of a user's possible interest in the first content.
20. The computer program product of claim 16 , wherein the one or more factors comprise age of the content.