US2007162442A1PendingUtilityA1

User intent discovery

Assignee: MICROSOFT CORPPriority: Mar 9, 2004Filed: Dec 29, 2006Published: Jul 12, 2007
Est. expiryMar 9, 2024(expired)· nominal 20-yr term from priority
G01B 5/0007G06F 16/3322G01B 5/255B60S 9/04G01B 2210/10G06F 16/9535G06F 16/3338Y10S707/99934Y10S707/99933Y10S707/99931
40
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A system that facilitates determining a user's intent given a user search query comprises a search engine that is employed to search over a collection of objects within a data store to retrieve a user search result set. The objects within the result set are associated with queries that were previously utilized to locate such objects. A level of relatedness between the previous queries and the user search query is determined, and previous queries that are associated with a result set that is novel and related to the user search result set are returned to the user.

Claims

exact text as granted — not AI-modified
1 . A system that facilitates determining intent of a user, comprising: 
 a search component that identifies a result set for a user search query;    a data store that maintains objects, the data store correlates the objects with queries that were previously employed to retrieve the objects;    a user intent discovery component that determines a set of potential search areas based at least in part upon the result set of the user search query and results of previous queries; and    a query relation calculator that determines a level of relatedness between the user search query and the previous queries, the query relation calculator selects previous queries to display to the user based at least in part upon the calculated level of relatedness;    wherein a level of relation between the previous queries and the user search query is obtained at least in part by determining distance metrics between the previous queries and the user search query.    
   
   
       2 . The system of  claim 1 , wherein the previous queries are obtained via reviewing the result set of the user search query.  
   
   
       3 . The system of  claim 1 , wherein the distance metrics are determined by utilizing the algorithm  
     
       
         
           
             
               
                  
                 
                   q 
                   , 
                   
                     q 
                     ′ 
                   
                 
                  
               
               = 
               
                 1 
                 - 
                 
                   
                      
                     
                       
                         R 
                         ⁡ 
                         
                           [ 
                           q 
                           ] 
                         
                       
                       ⋂ 
                       
                         R 
                         ⁡ 
                         
                           [ 
                           
                             q 
                             ′ 
                           
                           ] 
                         
                       
                     
                      
                   
                   
                      
                     
                       
                         R 
                         ⁡ 
                         
                           [ 
                           q 
                           ] 
                         
                       
                       ⋃ 
                       
                         R 
                         ⁡ 
                         
                           [ 
                           
                             q 
                             ′ 
                           
                           ] 
                         
                       
                     
                      
                   
                 
               
             
             , 
           
         
       
     
     where ∥q,q′∥ is a distance metric between the user search query q and one or more previous queries q′, and R is a binary relation on Q×D, wherein Q is a set of queries previously employed by the search component and D is a set of objects within a data store that is searched over by the search component.  
   
   
       4 . The system of  claim 3  wherein the level of relation between the previous queries and the user search query is obtained at least in part by utilizing a modified maximal marginal relevance scheme.  
   
   
       5 . The system of  claim 4 , the maximal marginal relevance scheme employs the algorithm  
     
       
         
           
             
               
                 
                   arg 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   min 
                 
                 
                   q 
                   ′ 
                 
               
               ⁡ 
               
                 [ 
                 
                   
                     λ 
                     ⁢ 
                     
                        
                       
                         q 
                         , 
                         
                           q 
                           ′ 
                         
                       
                        
                     
                   
                   - 
                   
                     
                       ( 
                       
                         1 
                         - 
                         λ 
                       
                       ) 
                     
                     ⁢ 
                     
                       
                         min 
                         
                           q 
                           ″ 
                         
                       
                       ⁢ 
                       
                          
                         
                           
                             q 
                             ′ 
                           
                           , 
                           
                             q 
                             ″ 
                           
                         
                          
                       
                     
                   
                 
                 ] 
               
             
             , 
           
         
       
     
     where λ is an interpolation factor that is established a priori, and q″ represents one or more previous queries that have already been considered prior to the consideration of q′.  
   
   
       6 . The system of  claim 1 , further comprising a filter component that limits a number of objects within the result set of the user search query.  
   
   
       7 . The system of  claim 1 , further comprising a filter component that removes previous queries that have fewer words than the user search query from consideration.  
   
   
       8 . The system of  claim 1 , further comprising a filter component that removes previous queries that include pre-defined strings from consideration.  
   
   
       9 . The system of  claim 1 , further comprising a filter component that removes previous queries that are lexically similar to the user search query from consideration.  
   
   
       10 . The system of  claim 1 , further comprising a filter component that removes previous queries that comprise characters that are not printable ASCII characters from consideration.  
   
   
       11 . The system of  claim 1 , further comprising a feedback component that facilitates customization of the system according to user preference.  
   
   
       12 . The system of  claim 1 , further comprising an artificial intelligence component that makes inferences with respect to at least one of selection and arrangement of the potential search areas according to one or more of user state, user history, user context, and contextual information.  
   
   
       13 . A system that facilitates determining user intent, comprising: 
 a search engine that receives a user search query, the search engine searches over objects within a data store according to the user search query, the objects being associated with queries previously employed to locate the objects; and    a query relation calculator that determines a level of relatedness between the user search query and the previous queries, the query relation calculator selects previous queries to display to the user based at least in part upon the calculated level of relatedness;    wherein the level of relatedness is based at least in part upon distance metrics between the user search query and the previous queries.    
   
   
       14 . The system of  claim 12 , wherein the distance metrics are determined by utilizing the algorithm  
     
       
         
           
             
               
                  
                 
                   q 
                   , 
                   
                     q 
                     ′ 
                   
                 
                  
               
               = 
               
                 1 
                 - 
                 
                   
                      
                     
                       
                         R 
                         ⁡ 
                         
                           [ 
                           q 
                           ] 
                         
                       
                       ⋂ 
                       
                         R 
                         ⁡ 
                         
                           [ 
                           
                             q 
                             ′ 
                           
                           ] 
                         
                       
                     
                      
                   
                   
                      
                     
                       
                         R 
                         ⁡ 
                         
                           [ 
                           q 
                           ] 
                         
                       
                       ⋃ 
                       
                         R 
                         ⁡ 
                         
                           [ 
                           
                             q 
                             ′ 
                           
                           ] 
                         
                       
                     
                      
                   
                 
               
             
             , 
           
         
       
     
     where ∥q,q′∥ is a distance metric between the user search query q and one or more previous queries q′, and R is a binary relation on Q×D, wherein Q is a set of queries previously employed by the search engine and D is a set of objects within a data store that is searched over by the search engine.  
   
   
       15 . The system of  claim 14 , wherein the level of relatedness between the previous queries and the user search query is obtained at least in part by utilizing a modified maximal marginal relevance scheme.  
   
   
       16 . The system of  claim 13 , the maximal marginal relevance scheme employs the algorithm  
     
       
         
           
             
               
                 
                   arg 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   min 
                 
                 
                   q 
                   ′ 
                 
               
               ⁡ 
               
                 [ 
                 
                   
                     λ 
                     ⁢ 
                     
                        
                       
                         q 
                         , 
                         
                           q 
                           ′ 
                         
                       
                        
                     
                   
                   - 
                   
                     
                       ( 
                       
                         1 
                         - 
                         λ 
                       
                       ) 
                     
                     ⁢ 
                     
                       
                         min 
                         
                           q 
                           ″ 
                         
                       
                       ⁢ 
                       
                          
                         
                           
                             q 
                             ′ 
                           
                           , 
                           
                             q 
                             ″ 
                           
                         
                          
                       
                     
                   
                 
                 ] 
               
             
             , 
           
         
       
     
     where λ is an interpolation factor that is established a priori, and q″ represents one or more previous queries that have already been considered prior to the consideration of q′.  
   
   
       17 . A method for assisting a user search over a plurality of objects, comprising: 
 receiving a user search query;    searching a data store for objects according to the user search query to create a user search result set, the objects being associated with queries previously employed to locate the objects;    reviewing the previously employed queries to locate one or more objects within the user search result set;    determining a level of relatedness between the user search query and the previously employed queries, wherein the level of relatedness is based at least in part upon distance metrics between the user search query and the previously employed queries;    selecting a query that was previously employed based upon a calculated level of relatedness between a result set of the previous query and the user search result set; and    displaying the retrieved query.    
   
   
       18 . The method of  claim 17 , further comprising utilizing a modified maximal marginal relevance scheme to calculate the level of relatedness between the result set of the previous query and the user search result set.  
   
   
       19 . The method of  claim 17 , further comprising positioning the selected query within a plurality of queries according to the level of relatedness.  
   
   
       20 . The system of  claim 17 , further comprising choosing the displayed query and utilizing the displayed query as the user search query.

Join the waitlist — get patent alerts

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

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