US2014324848A1PendingUtilityA1

Method and apparatus for a ranking engine

58
Assignee: FACEBOOK INCPriority: Nov 22, 2004Filed: Jul 3, 2014Published: Oct 30, 2014
Est. expiryNov 22, 2024(expired)· nominal 20-yr term from priority
G06F 17/30864G06F 17/30837G06F 17/3005G06F 17/3084G06F 17/3053G06F 16/783G06F 16/9535Y10S707/99931G06F 16/338G06F 16/951G06F 16/24578G06F 16/735G06F 16/438G06F 16/284Y10S707/99937Y10S707/914G06F 16/738Y10S707/99933G06F 16/9536G06F 16/9538
58
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A computer-implemented method is provided for ranking files from an Internet search. In one embodiment, the method comprises assigning a score to each file based on at least one of the following factors: recency, editorial popularity, clickthru popularity, favorites metadata, or favorites collaborative filtering. The file may be organized based on the assigned scores to provide users with more accurate search results.

Claims

exact text as granted — not AI-modified
What is claimed is: 
     
         1 . A computer-implemented method for a ranking engine, the method comprising:
 assigning a score to each file or record based on at least the following factors: recency, editorial popularity, and clickthru popularity; and   organizing the files based on the assigned scores.   
     
     
         2 . The method of  claim 1  wherein the score is R T  and is determined using the following formula: 
       
         
           
             
               
                 R 
                 T 
               
               = 
               
                 
                   
                     
                       W 
                       r 
                     
                      
                     
                       R 
                       r 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     1 
                   
                 
                 + 
                 
                   
                     
                       W 
                       e 
                     
                      
                     
                       R 
                       e 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     2 
                   
                 
                 + 
                 
                   
                     
                       W 
                       c 
                     
                      
                     
                       R 
                       c 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     3 
                   
                 
               
             
           
         
         where: 0<R i <1 
         and: 1=W r +W e +W c     0<R T <1 
       
     
     
         3 . The method of  claim 2  wherein recency is weighted based on the following formula for R r : 
       
         
           
             
               
                 R 
                 r 
               
                
               
                 { 
                 
                   
                     
                       
                         
                           1 
                           - 
                           
                             
                               1 
                               
                                 t 
                                 e 
                               
                             
                              
                             
                               ( 
                               
                                 
                                   d 
                                   c 
                                 
                                 - 
                                 
                                   d 
                                   F 
                                 
                               
                               ) 
                             
                           
                         
                         , 
                       
                     
                     
                       
                         
                           For 
                            
                           
                               
                           
                            
                           
                             ( 
                             
                               
                                 d 
                                 c 
                               
                               - 
                               
                                 d 
                                 F 
                               
                             
                             ) 
                           
                         
                         < 
                         
                           t 
                           e 
                         
                       
                     
                   
                   
                     
                       
                         0 
                         , 
                       
                     
                     
                       
                         
                           For 
                            
                           
                               
                           
                            
                           
                             ( 
                             
                               
                                 d 
                                 c 
                               
                               - 
                               
                                 d 
                                 F 
                               
                             
                             ) 
                           
                         
                         > 
                         
                           t 
                           e 
                         
                       
                     
                   
                 
               
             
           
         
         t e =expiration time (perhaps ˜30 days) 
         d c =current date 
         d F =date found. 
       
     
     
         4 . The method of  claim 2  wherein editorial popularity is weighted between 1 and 0 and is based on at least one of the following: Neilsen ratings, known brand names, website popularity (e.g. Alexa ranking), or the judgment of a professional or corporation with expertise in online media 
     
     
         5 . The method of  claim 2  wherein clickthru popularity is weighted based on the following formula for R c : 
       
         
           
             
               
                 R 
                 c 
               
               = 
               
                 
                   
                     W 
                     cpm 
                   
                    
                   
                     R 
                     cpm 
                   
                 
                 + 
                 
                   
                     W 
                     cph 
                   
                    
                   
                     R 
                     cph 
                   
                 
                 + 
                 
                   
                     W 
                     cph 
                   
                    
                   
                     R 
                     cpd 
                   
                 
               
             
           
         
         
           
             
               where 
                
               
                 : 
               
             
           
         
         
           
             
               
                 
                   R 
                   cpm 
                 
                 = 
                 
                   
                     clicks 
                      
                     
                         
                     
                      
                     per 
                      
                     
                         
                     
                      
                     minutes 
                      
                     
                         
                     
                      
                     ranking 
                   
                   = 
                   
                     CPM 
                     
                       
                         Max 
                          
                         
                           ( 
                           cpm 
                           ) 
                         
                       
                       
                         over 
                          
                         
                             
                         
                          
                         all 
                          
                         
                             
                         
                          
                         items 
                       
                     
                   
                 
               
               , 
               
                 
 
               
                
               
                 ( 
                 
                   0 
                   < 
                   
                     R 
                     cpm 
                   
                   < 
                   1 
                 
                 ) 
               
             
           
         
         
           
             
               
                 
                   R 
                   cph 
                 
                 = 
                 
                   
                     clicks 
                      
                     
                         
                     
                      
                     per 
                      
                     
                         
                     
                      
                     hour 
                      
                     
                         
                     
                      
                     ranking 
                   
                   = 
                   
                     
                       CPH 
                       
                         Max 
                          
                         
                           ( 
                           cph 
                           ) 
                         
                       
                     
                     
                       over 
                        
                       
                           
                       
                        
                       all 
                        
                       
                           
                       
                        
                       items 
                     
                   
                 
               
               , 
               
                 
 
               
                
               
                 ( 
                 
                   0 
                   , 
                   
                     
                       R 
                       cph 
                     
                     < 
                     1 
                   
                 
                 ) 
               
             
           
         
         
           
             
               
                 
                   R 
                   cpd 
                 
                 = 
                 
                   
                     clicks 
                      
                     
                         
                     
                      
                     per 
                      
                     
                         
                     
                      
                     day 
                      
                     
                         
                     
                      
                     ranking 
                   
                   = 
                   
                     
                       CPD 
                       
                         Max 
                          
                         
                           ( 
                           cpd 
                           ) 
                         
                       
                     
                     
                       over 
                        
                       
                           
                       
                        
                       all 
                        
                       
                           
                       
                        
                       items 
                     
                   
                 
               
               , 
               
                 
 
               
                
               
                 ( 
                 
                   0 
                   < 
                   
                     R 
                     cpd 
                   
                   < 
                   1 
                 
                 ) 
               
             
           
         
         
           
             and 
           
         
         
           
             
               1 
               = 
               
                 
                   W 
                   cpm 
                 
                 + 
                 
                   W 
                   cph 
                 
                 + 
                 
                   W 
                   cpd 
                 
               
             
           
         
       
     
     
         6 . The method of  claim 1  wherein the file is a video file. 
     
     
         7 . A computer-implemented method for organizing a collection of files from an Internet search, the method comprising:
 assigning a score to each file based on at least the following factors: recency, editorial popularity, clickthru popularity, favorites metadata, and favorites collaborative filtering; and   organizing the files based on the assigned scores.   
     
     
         8 . The method of  claim 7  wherein the file is a media file. 
     
     
         9 . The method of  claim 7  wherein the file is a video file. 
     
     
         10 . The method of  claim 7  wherein the score is R T  and is determined using the following formula: 
       
         
           
             
               
                 R 
                 T 
               
               = 
               
                 
                   
                     
                       W 
                       r 
                     
                      
                     
                       R 
                       r 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     1 
                   
                 
                 + 
                 
                   
                     
                       W 
                       e 
                     
                      
                     
                       R 
                       e 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     2 
                   
                 
                 + 
                 
                   
                     
                       W 
                       c 
                     
                      
                     
                       R 
                       c 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     3 
                   
                 
                 + 
                 
                   
                     
                       W 
                       md 
                     
                      
                     
                       R 
                       md 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     4 
                   
                 
                 + 
                 
                   
                     
                       W 
                       cF 
                     
                      
                     
                       R 
                       cF 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     5 
                   
                 
               
             
           
         
         where: 0<R i <1 
         and: 1=W r +W e +W c +W md +W cF    
            0<R T <1 
       
     
     
         11 . The method of  claim 10  wherein recency is weighted based on the following formula for R r : 
       
         
           
             
               
                 R 
                 r 
               
                
               
                 { 
                 
                   
                     
                       
                         
                           1 
                           - 
                           
                             
                               1 
                               
                                 t 
                                 e 
                               
                             
                              
                             
                               ( 
                               
                                 
                                   d 
                                   c 
                                 
                                 - 
                                 
                                   d 
                                   F 
                                 
                               
                               ) 
                             
                           
                         
                         , 
                       
                     
                     
                       
                         
                           For 
                            
                           
                               
                           
                            
                           
                             ( 
                             
                               
                                 d 
                                 c 
                               
                               - 
                               
                                 d 
                                 F 
                               
                             
                             ) 
                           
                         
                         < 
                         
                           t 
                           e 
                         
                       
                     
                   
                   
                     
                       
                         0 
                         , 
                       
                     
                     
                       
                         
                           For 
                            
                           
                               
                           
                            
                           
                             ( 
                             
                               
                                 d 
                                 c 
                               
                               - 
                               
                                 d 
                                 F 
                               
                             
                             ) 
                           
                         
                         > 
                         
                           t 
                           e 
                         
                       
                     
                   
                 
               
             
           
         
         t e =expiration time (perhaps ˜30 days) 
         d c =current date 
         d F =date found. 
       
     
     
         12 . The method of  claim 10  wherein editorial popularity is weighted between 1 and 0 and is based on at least one of the following: Neilsen ratings, known brand names, website popularity (e.g. Alexa ranking), or the judgment of a professional or corporation with expertise in online media. 
     
     
         13 . The method of  claim 10  wherein Clickthru popularity is weighted based on the following formula for 
       
         
           
             
               
                 R 
                 c 
               
               = 
               
                 
                   
                     W 
                     cpm 
                   
                    
                   
                     R 
                     cpm 
                   
                 
                 + 
                 
                   
                     W 
                     cph 
                   
                    
                   
                     R 
                     cph 
                   
                 
                 + 
                 
                   
                     W 
                     cph 
                   
                    
                   
                     R 
                     cpd 
                   
                 
               
             
           
         
         
           
             
               where 
                
               
                 : 
               
             
           
         
         
           
             
               
                 
                   R 
                   cpm 
                 
                 = 
                 
                   
                     clicks 
                      
                     
                         
                     
                      
                     per 
                      
                     
                         
                     
                      
                     minutes 
                      
                     
                         
                     
                      
                     ranking 
                   
                   = 
                   
                     CPM 
                     
                       
                         Max 
                          
                         
                           ( 
                           cpm 
                           ) 
                         
                       
                       
                         over 
                          
                         
                             
                         
                          
                         all 
                          
                         
                             
                         
                          
                         items 
                       
                     
                   
                 
               
               , 
               
                 
 
               
                
               
                 ( 
                 
                   0 
                   < 
                   
                     R 
                     cpm 
                   
                   < 
                   1 
                 
                 ) 
               
             
           
         
         
           
             
               
                 
                   R 
                   cph 
                 
                 = 
                 
                   
                     clicks 
                      
                     
                         
                     
                      
                     per 
                      
                     
                         
                     
                      
                     hour 
                      
                     
                         
                     
                      
                     ranking 
                   
                   = 
                   
                     
                       CPH 
                       
                         Max 
                          
                         
                           ( 
                           cph 
                           ) 
                         
                       
                     
                     
                       over 
                        
                       
                           
                       
                        
                       all 
                        
                       
                           
                       
                        
                       items 
                     
                   
                 
               
               , 
               
                 
 
               
                
               
                 ( 
                 
                   0 
                   , 
                   
                     
                       R 
                       cph 
                     
                     < 
                     1 
                   
                 
                 ) 
               
             
           
         
         
           
             
               
                 
                   R 
                   cpd 
                 
                 = 
                 
                   
                     clicks 
                      
                     
                         
                     
                      
                     per 
                      
                     
                         
                     
                      
                     day 
                      
                     
                         
                     
                      
                     ranking 
                   
                   = 
                   
                     
                       CPD 
                       
                         Max 
                          
                         
                           ( 
                           cpd 
                           ) 
                         
                       
                     
                     
                       over 
                        
                       
                           
                       
                        
                       all 
                        
                       
                           
                       
                        
                       items 
                     
                   
                 
               
               , 
               
                 
 
               
                
               
                 ( 
                 
                   0 
                   < 
                   
                     R 
                     cpd 
                   
                   < 
                   1 
                 
                 ) 
               
             
           
         
         
           
             and 
           
         
         
           
             
               1 
               = 
               
                 
                   W 
                   cpm 
                 
                 + 
                 
                   W 
                   cph 
                 
                 + 
                 
                   W 
                   cpd 
                 
               
             
           
         
       
     
     
         14 . The method of  claim 7  wherein weighting of favorites metadata is R md =0 if no matches are found or 1 if a keyword field in the metadata of the file matches any favorite titles in a user's favorite titles file, any favorite people in a user's favorite people file, or any keyword in a user's any favorite keywords file. 
     
     
         15 . The method of  claim 7  wherein weighting of collaborative filtering favorites metadata is R cf   
       
         
           
             
               
                 
                   R 
                   
                     cf 
                     , 
                     l 
                   
                 
                 = 
                 
                   
                     
                       W 
                       sim 
                     
                      
                     
                       ( 
                       
                         S 
                         
                           max 
                           , 
                           l 
                         
                       
                       ) 
                     
                   
                   + 
                   
                     
                       ( 
                       
                         1 
                         - 
                         
                           W 
                           sim 
                         
                       
                       ) 
                     
                      
                     
                       P 
                       l 
                     
                   
                 
               
               , 
               
                 
 
               
                
               
                 where 
                  
                 
                   : 
                 
               
             
           
         
         
           
             
               
                 
                   
                     
                       W 
                       sim 
                     
                     = 
                       
                      
                     
                       similarity 
                        
                       
                           
                       
                        
                       weighting 
                        
                       
                           
                       
                        
                       factor 
                     
                   
                 
               
               
                 
                   
                     
                       = 
                         
                        
                       
                         
                           C 
                           
                             max 
                              
                             
                               
                                   
                               
                                
                               
                                   
                               
                             
                              
                             sim 
                           
                         
                          
                         
                           ( 
                           
                             1 
                             - 
                             
                               1 
                               
                                 1 
                                 + 
                                 
                                   n 
                                   i 
                                 
                               
                             
                           
                           ) 
                         
                       
                     
                     , 
                   
                 
               
             
           
         
         where: 
         0≦C max sim ≦1 
       
     
     
         16 . The method of  claim 7  wherein R cf  is a weighted sum of the maximum user similarity for item l and the popularity of item l among KNN such that 0≦R cf ≦1. 
     
     
         17 . A computer system comprising:
 a ranking engine having programming code for displaying results of a search query based on scores,   wherein the scores for files found in the search are based on at least the following factors: recency, editorial popularity, and clickthru popularity.   
     
     
         18 . The system of  claim 17  wherein the files are media files. 
     
     
         19 . The system of  claim 17  wherein the files are video files. 
     
     
         20 . The system of  claim 17  wherein each of the scores is R T  and is determined using the following formula: 
       
         
           
             
               
                 R 
                 T 
               
               = 
               
                 
                   
                     
                       W 
                       r 
                     
                      
                     
                       R 
                       r 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     1 
                   
                 
                 + 
                 
                   
                     
                       W 
                       e 
                     
                      
                     
                       R 
                       e 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     2 
                   
                 
                 + 
                 
                   
                     
                       W 
                       c 
                     
                      
                     
                       R 
                       c 
                     
                   
                   
                     Term 
                      
                     
                         
                     
                      
                     3 
                   
                 
               
             
           
         
         where: 0<R i <1 
         and: 1=W r +W e +W c    
            0<R T <1

Cited by (0)

No later patents cite this yet.

References (0)

No backward citations on record.