Predicting the Size of Candidate Document Set for Implicit Web Search Result Diversification

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-45442-5_51
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Explicit Search Result Diversification Through Sub-Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Timestamp-Based Result Cache Invalidation for Web Search Engines

2011English

Effectiveness of Additional Representations for the Search Result Presentation on the Web

Information Processing and Management
Media TechnologyInformation SystemsInformation SciencesLibraryManagement ScienceComputer Science ApplicationsOperations Research
2008English

A Search Engine for Web Images Using Document Text Stemming

2008English

PictureBook: A Text-And-Image Summary System for Web Search Result

2008English

Web Document Clustering and Visualization Results of Semantic Web Search Engine Using V-Ranking

International Journal of Computer Theory and Engineering
2011English

Dissimilar Alternative Path Search Algorithm Using a Candidate Path Set

2011English

Optimizing Result Prefetching in Web Search Engines With Segmented Indices

2002English

Semantic Entity Search Diversification

2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy