DETERMINING AND MAINTAINING A LIST OF NEWS STORIES FROM NEWS FEEDS MOST RELEVANT TO A TOPIC

1 . A method, comprising:

obtaining, by a server, a first list of stories pertaining to a topic belonging to a set of first news feeds;

computing, by the server, an initial story score for each story in the first list of stories from a set of key terms scores, wherein each key term score is based on the number of times that the key term appears in a second list of stories pertaining to the topic belonging to a set of second news feeds; and

outputting, by the server, a set of top stories from the first list of stories based on a tradeoff between the amount of overlap in key terms among the stories in the first list of stories and key terms among the stories in the second list of stories in view of the initial story scores of the stories in the second list of stories,

wherein a first story from the first list of stories is included in the set of top stories when the degree of overlap between the key terms in the first story and the key terms in a second story is above a threshold, and

wherein the first story is outputted based on the similarity of the first story to the second story against which the first story is measured.

2 . The method of claim 1 , further comprising receiving, by the server from a client, a request for the list of stories pertaining to the topic.

3 . The method of claim 1 , further comprising initiating pushing, by the server to a client, the list of stories pertaining to the topic.

4 . The method of claim 3 , wherein initiating pushing to the client the list of stories pertaining to the topic is a scheduled event or triggered event.

5 . The method of claim 1 , wherein outputting the set of top stories comprises outputting, by the server, a story from the first list of stories having the highest initial story score into a set of top stories pertaining to the topic.

6 . The method of claim 5 , further comprising, for each story of the remaining stories pertaining to the topic belonging to the set of first news feeds:

reducing, by the server, a key term score for each key term in the set of key terms of the story by a fixed positive factor when the same key term appears in the set of top stories pertaining to the topic; and

re-computing, by the server, the story score of the story based on the reduced key term score; and

repeating said reducing, said re-computing, and said outputting for the remaining stories until there are no stories having a positive story score to obtain the list of stories pertaining to the topic.

7 . The method of claim 6 , further comprising, outputting, by the server, a story having the highest positive re-computed story score into the set of top stories pertaining to the topic.

8 . The method of claim 1 , wherein a key term of a story is associated with a plurality of terms appearing most prominently in the story.

9 . The method of claim 1 , wherein the set of first news feeds is a set of low cost or free news feeds and the set of second news feeds comprises a set of premium cost news feeds.

10 . (canceled)

11 . (canceled)

12 . The method of claim 1 , wherein a key term score is equal to a score corresponding to scores of the sum of the terms that appear most prominently in a story.

13 . The method of claim 1 , wherein a score of a term in the set of terms that appear most prominently in a story is incremented each time the term appears in the story.

14 . The method of claim 1 , wherein the topic is pre-specified.

15 . The method of claim 1 , further comprising identifying, by the server, a list of topics in a story.

16 . The method of claim 1 , further comprising

accepting or rejecting, by the server, each story in the first list of stories and the second list of stories based on one or more heuristic quality filters.

17 . The method of claim 16 , further comprising:

adding the accepted story to the first list of stories pertaining to the topic belonging to a set of first news feeds if the story came from one of the feeds associated with the set of first news feeds.

18 . (canceled)

19 . The method of claim 1 , wherein the fixed positive factor ranges between a factor permitting full overlap of key words, to a factor that does not permit any overlap of key words.

20 . A system, comprising:

a memory;

a server, coupled to the memory, the server to:

obtain a first list of stories pertaining to a topic belonging to a set of first news feeds;

compute an initial story score for each story in the first list of stories from a set of key terms scores, wherein each key term score is based on the number of times that the key term appears in a second list of stories pertaining to the topic belonging to a set of second news feeds; and

output a set of top stories from the first list of stories based on a tradeoff between the amount of overlap in key terms among the stories in the first list of stories and key terms among the stories in the second list of stories in view of the initial story scores of the stories in the second list of stories,

wherein a first story from the first list of stories is included in the set of top stories when the degree of overlap between the key terms in the first story and the key terms in a second story is above a threshold, and

wherein the first story is outputted based on the similarity of the first story to the second story against which the first story is measured.

21 . The system of claim 20 , wherein the server is further to receive from a client a request for the list of stories pertaining to the topic.

22 . The system of claim 20 , wherein the server is further to initiate pushing to a client the list of stories pertaining to the topic.

23 . The system of claim 20 , wherein the server outputting the set of top stories comprises the server to, for each story of the remaining stories pertaining to the topic belonging to the set of first news feeds:

reduce a key term score for each key term in the set of key terms of the story by a fixed positive factor when the same key term appears in the set of top stories pertaining to the topic; and

re-compute the story score of the story based on the reduced key term score; and

repeat said reducing, said re-computing, and said outputting for the remaining stories until there are no stories having a positive story score to obtain the list of stories pertaining to the topic.

24 . The system of claim 23 , wherein the server is further to output a story having the highest positive re-computed story score into the set of top stories pertaining to the topic.

25 . A non-transitory computer readable storage medium including instructions that, when executed by a server, cause the server to:

obtain, by the server, a first list of stories pertaining to a topic belonging to a set of first news feeds;

computer, by the server, an initial story score for each story in the first list of stories from a set of key terms scores, wherein each key term score is based on the number of times that the key term appears in a second list of stories pertaining to the topic belonging to a set of second news feeds; and

output, by the server, a set of top stories from the first list of stories based on a tradeoff between the amount of overlap in key terms among the stories in the first list of stories and key terms among the stories in the second list of stories in view of the initial story scores of the stories in the second list of stories,

wherein a first story from the first list of stories is included in the set of top stories when the degree of overlap between the key terms in the first story and the key terms in a second story is above a threshold, and

wherein the first story is outputted based on the similarity of the first story to the second story against which the first story is measured.

26 . The non-transitory computer readable storage medium of claim 25 , wherein the server is further to receive, from a client, a request for the list of stories pertaining to the topic.

27 . The non-transitory computer readable storage medium of claim 25 , wherein the server is further to initiate pushing, to a client, the list of stories pertaining to the topic.

28 . The non-transitory computer readable storage medium of claim 25 , wherein outputting the set of top stories comprises the server to output a story from the first list of stories having the highest initial story score into a set of top stories pertaining to the topic.

29 . The non-transitory computer readable storage medium of claim 25 , wherein the server is further to, for each story of the remaining stories pertaining to the topic belonging to the set of first news feeds:

reduce a key term score for each key term in the set of key terms of the story by a fixed positive factor when the same key term appears in the set of top stories pertaining to the topic; and

re-compute the story score of the story based on the reduced key term score; and

repeat said reducing, said re-computing, and said outputting for the remaining stories until there are no stories having a positive story score to obtain the list of stories pertaining to the topic.

30 . The non-transitory computer readable storage medium of claim 29 , wherein the server is further to output a story having the highest positive re-computed story score into the set of top stories pertaining to the topic.