Selective content delivery in a real-time streaming environment

Patent metadata

Field	Value
Publication number	US-9602563-B2
Application number	US-201313864274-A
Country	US
Kind code	B2
Filing date	Apr 17, 2013
Priority date	Apr 17, 2013
Publication date	Mar 21, 2017
Grant date	Mar 21, 2017

Abstract

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.

First claim

What is claimed is:

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

⁢

Assignees

• IBM

Inventors

• Barkai Gilad
• Carmel David
• Guy Ido
• Kutiel Gilad
• Steier Tal

Classifications

• G06Q10/40

  Business processes related to social networking or social networking services · CPC title

• H04N21/25891

  being end-user preferences (retrieval of video data in a video database based on user preferences G06F16/739; arrangements for recognizing users' preferences H04H60/46; user profiles in network data switching protocols H04L67/306; processing of user preferences or user profiles in wireless networks H04W8/18) · CPC title

• G06Q50/01

  Physics · mapped topic

• H04N21/4532

  involving end-user characteristics, e.g. viewer profile, preferences (monitoring of user activities for profile generation for accessing a video database G06F16/739; user profiles in network data switching protocols H04L67/306; processing of user preferences or user profiles in wireless networks H04W8/18) · CPC title

• H04L65/4084 Primary

  Electricity · mapped topic