Block et al., 2022 - Google Patents
Counterfactual learning to rank for utility-maximizing query autocompletionBlock et al., 2022
View PDF- Document ID
- 1538948160769143632
- Author
- Block A
- Kidambi R
- Hill D
- Joachims T
- Dhillon I
- Publication year
- Publication venue
- Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval
External Links
Snippet
Conventional methods for query autocompletion aim to predict which completed query a user will select from a list. A shortcoming of this approach is that users often do not know which query will provide the best retrieval performance on the current information retrieval …
- 230000006399 behavior 0 abstract description 4
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
- G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
- G06F17/30867—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems with filtering and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30634—Querying
- G06F17/30657—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30705—Clustering or classification
- G06F17/30707—Clustering or classification into predefined classes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30705—Clustering or classification
- G06F17/3071—Clustering or classification including class or cluster creation or modification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30017—Multimedia data retrieval; Retrieval of more than one type of audiovisual media
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/20—Handling natural language data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce, e.g. shopping or e-commerce
- G06Q30/02—Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sugiyama et al. | Exploiting potential citation papers in scholarly paper recommendation | |
| Chen et al. | Location-aware personalized news recommendation with deep semantic analysis | |
| Frolov et al. | Tensor methods and recommender systems | |
| Wu et al. | Adapting boosting for information retrieval measures | |
| Duh et al. | Learning to rank with partially-labeled data | |
| Saraç et al. | An ant colony optimization based feature selection for web page classification | |
| US7809705B2 (en) | System and method for determining web page quality using collective inference based on local and global information | |
| Tong et al. | TCS: efficient topic discovery over crowd-oriented service data | |
| Jiang et al. | Cloud service recommendation based on unstructured textual information | |
| MA Basher et al. | Analyzing topics and authors in chat logs for crime investigation | |
| Hsieh et al. | A keyword-aware recommender system using implicit feedback on Hadoop | |
| Kang et al. | Learning to rank related entities in web search | |
| Liu et al. | A crowdsourcing-based topic model for service matchmaking in Internet of Things | |
| Li et al. | Characterizing and predicting downloads in academic search | |
| Ye et al. | Finding a good query‐related topic for boosting pseudo‐relevance feedback | |
| Liu et al. | Online recommendations based on dynamic adjustment of recommendation lists | |
| Block et al. | Counterfactual learning to rank for utility-maximizing query autocompletion | |
| Yao et al. | RLPS: A reinforcement learning–based framework for personalized search | |
| Natarajan et al. | CD-SemMF: Cross-domain semantic relatedness based matrix factorization model enabled with linked open data for user cold start issue | |
| Qian et al. | Interaction graph neural network for news recommendation | |
| Lin et al. | Simultaneously modeling semantics and structure of threaded discussions: a sparse coding approach and its applications | |
| Bing et al. | Learning a unified embedding space of web search from large-scale query log | |
| Muthusami et al. | A novelty analysis about an impact of tweets and twitter bios on topic quality discovery using the topic modeling | |
| Maidel et al. | Ontological content‐based filtering for personalised newspapers: A method and its evaluation | |
| Duh et al. | Flexible sample selection strategies for transfer learning in ranking |