US2014372451A1PendingUtilityA1

Discovering and scoring relationships extracted from human generated lists

Assignee: INTERTRUST TECH CORPPriority: Apr 4, 2007Filed: Aug 29, 2014Published: Dec 18, 2014
Est. expiryApr 4, 2027(~0.7 yrs left)· nominal 20-yr term from priority
G06F 17/30657G06F 17/30867G06F 17/30663G06F 16/9535G06F 16/3331G06F 16/3334G06F 16/4387
53
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A computer-implemented system and method for extracting Human Generated Lists from an electronic database is described. The system searches for objects of the same class within a context window to identify Human Generated Lists and stores them to an archive. The archive may be used to generate a relationship network. The system generates variable length data vectors to represent the relationships between the objects within each Human Generated List. This relationship network can then be queried to discover relationships between the objects in the Human Generated Lists and to provide related objects as recommendations.

Claims

exact text as granted — not AI-modified
1 - 26 . (canceled) 
     
     
         27 . A computer-implemented method of generating a response to a user search query, the method comprising:
 receiving a query object from a user;   searching a plurality of human-generated lists to identify a first object, the first object being included in a first human-generated list of the plurality of human-generated lists that includes the query object;   searching the plurality of human-generated lists to identify a second object, the second object being included in a second human-generated list of the plurality of human-generated lists that includes the first object; and   sending to the user a response to the query object comprising the first object and the second object.   
     
     
         28 . The computer-implemented method of  claim 27 , wherein the plurality of human-generated lists comprise a plurality of lists including data indicative of a human-compiled collection of non-randomly ordered objects. 
     
     
         29 . The computer-implemented method of  claim 27 , further comprising:
 searching the plurality of human-generated lists to identify a third object, the third object being included in a third human-generated list of the plurality of human-generated lists that includes the query object,   wherein the second human-generated list further includes the third object.   
     
     
         30 . The computer-implemented method of  claim 27 , wherein at least one human-generated list of the plurality of human-generated lists comprise a ranked list. 
     
     
         31 . The computer-implemented method of  claim 30 , wherein the at least one human-generated list is ranked based on a relationship between the query object and one or more objects included in the at least one human-generated list. 
     
     
         32 . The computer-implemented method of  claim 31 , wherein the at least one human-generated list is further ranked based on one or more scores associated with a relationship between the query object and the one or more objects included in the at least one human-generated list. 
     
     
         33 . The computer-implemented method of  claim 27 , wherein the query object comprises data related to at least one of a song title, an artist, an album title, a movie title, an actor, an actress, a director, an author, a video game, and a genre. 
     
     
         34 . The computer-implemented method of  claim 27 , wherein at least one human-generated list of the plurality of human-generated lists is generated based on the contents of a web page. 
     
     
         35 . The computer-implemented method of  claim 34 , further comprising:
 determining that the web page contains at least two objects from a same class; and   generating the at least one human-generated list by extracting the at least two objects from the web page.   
     
     
         36 . The computer-implemented method of  claim 35 , wherein the class comprises a plurality of objects of a same type. 
     
     
         37 . A non-transitory computer-readable storage medium storing instructions that, when executed by a processor of a computer system, cause the computer system to perform a method comprising:
 receiving a query object from a user;   searching a plurality of human-generated lists to identify a first object, the first object being included in a first human-generated list of the plurality of human-generated lists that includes the query object;   searching the plurality of human-generated lists to identify a second object, the second object being included in a second human-generated list of the plurality of human-generated lists that includes the first object; and   sending to the user a response to the query object comprising the first object and the second object.   
     
     
         38 . The non-transitory computer-readable storage medium of  claim 37 , wherein the plurality of human-generated lists comprise a plurality of lists including data indicative of a human-compiled collection of non-randomly ordered objects. 
     
     
         39 . The non-transitory computer-readable storage medium of  claim 37 , wherein the method further comprises:
 searching the plurality of human-generated lists to identify a third object, the third object being included in a third human-generated list of the plurality of human-generated lists that includes the query object,   wherein the second human-generated list further includes the third object.   
     
     
         40 . The non-transitory computer-readable storage medium of  claim 37 , wherein at least one human-generated list of the plurality of human-generated lists comprise a ranked list. 
     
     
         41 . The non-transitory computer-readable storage medium of  claim 40 , wherein the at least one human-generated list is ranked based on a relationship between the query object and one or more objects included in the at least one human-generated list. 
     
     
         42 . The non-transitory computer-readable storage medium of  claim 41 , wherein the at least one human-generated list is further ranked based on one or more scores associated with a relationship between the query object and the one or more objects included in the at least one human-generated list. 
     
     
         43 . The non-transitory computer-readable storage medium of  claim 37 , wherein the query object comprises data related to at least one of a song title, an artist, an album title, a movie title, an actor, an actress, a director, an author, a video game, and a genre. 
     
     
         44 . The non-transitory computer-readable storage medium of  claim 37 , wherein at least one human-generated list of the plurality of human-generated lists is generated based on the contents of a web page. 
     
     
         45 . The non-transitory computer-readable storage medium of  claim 44 , wherein the method further comprises:
 determining that the web page contains at least two objects from a same class; and   generating the at least one human-generated list by extracting the at least two objects from the web page.   
     
     
         46 . The non-transitory computer-readable storage medium of  claim 45 , wherein the class comprises a plurality of objects of a same type.

Join the waitlist — get patent alerts

Track US2014372451A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.