Springer Science and Business Media LLC

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Special issue on learning from user interactions
Springer Science and Business Media LLC - Tập 23 - Trang 525-527 - 2020
Rishabh Mehrotra, Ahmed Hassan Awadallah, Emine Yilmaz
Latent entity space: a novel retrieval approach for entity-bearing queries
Springer Science and Business Media LLC - Tập 18 - Trang 473-503 - 2015
Xitong Liu, Hui Fang
Analysis on Web search query logs has revealed that there is a large portion of entity-bearing queries, reflecting the increasing demand of users on retrieving relevant information about entities such as persons, organizations, products, etc. In the meantime, significant progress has been made in Web-scale information extraction, which enables efficient entity extraction from free text. Since an e...... hiện toàn bộ
Adding Compression to Block Addressing Inverted Indexes
Springer Science and Business Media LLC - Tập 3 - Trang 49-77 - 2000
Gonzalo Navarro, Edleno Silva de Moura, Marden Neubert, Nivio Ziviani, Ricardo Baeza-Yates
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for efficient, low-overhead text retrieval. Modern text compression techniques can reduce the text to less than 30% of its size and allow searching it directly and faster than the uncompressed text. Inverted index compression obtains significant reduction o...... hiện toàn bộ
Knowledge Management in the Socio Technical World—The Graffiti Continues
Springer Science and Business Media LLC - Tập 6 - Trang 281-284 - 2003
Patricia Katopol
Efficient query processing techniques for next-page retrieval
Springer Science and Business Media LLC - Tập 25 - Trang 27-43 - 2022
Joel Mackenzie, Matthias Petri, Alistair Moffat
In top-k ranked retrieval the goal is to efficiently compute an ordered list of the highest scoring k documents according to some stipulated similarity function such as the well-known BM25 approach. In most implementation techniques a min-heap of size k is used to track the top scoring candidates. In this work we consider the question of how best to retrieve the second page of search results, give...... hiện toàn bộ
Dempster-Shafer Theory for a Query-Biased Combination of Evidence on the Web
Springer Science and Business Media LLC - Tập 8 - Trang 197-218 - 2005
Vassilis Plachouras, Iadh Ounis
This paper reports on a large-scale experiment for the evaluation of a formal query-biased combination of evidence mechanism. We use the Dempster-Shafer theory of evidence to combine optimally results obtained by content and link analyses on the Web. The query-biased mechanism is based on the query scope, a measure of the query specificity. The query scope is defined using a probabilistic propagat...... hiện toàn bộ
John Davies, Marko Grobelnik and Dunja Mladenic: Semantic knowledge management
Springer Science and Business Media LLC - Tập 13 - Trang 403-406 - 2010
David Vallet
Learning to rank for why-question answering
Springer Science and Business Media LLC - Tập 14 - Trang 107-132 - 2010
Suzan Verberne, Hans van Halteren, Daphne Theijssen, Stephan Raaijmakers, Lou Boves
In this paper, we evaluate a number of machine learning techniques for the task of ranking answers to why-questions. We use TF-IDF together with a set of 36 linguistically motivated features that characterize questions and answers. We experiment with a number of machine learning techniques (among which several classifiers and regression techniques, Ranking SVM and SVM ...... hiện toàn bộ
Statistical biases in Information Retrieval metrics for recommender systems
Springer Science and Business Media LLC - Tập 20 Số 6 - Trang 606-634 - 2017
Alejandro Bellogín, Pablo Castells, Iván Cantador
Robust keyword search in large attributed graphs
Springer Science and Business Media LLC - Tập 23 - Trang 502-524 - 2020
Spencer Bryson, Heidar Davoudi, Lukasz Golab, Mehdi Kargar, Yuliya Lytvyn, Piotr Mierzejewski, Jaroslaw Szlichta, Morteza Zihayat
There is a growing need to explore attributed graphs such as social networks, expert networks, and biological networks. A well-known mechanism for non-technical users to explore such graphs is keyword search, which receives a set of query keywords and returns a connected subgraph that contains the keywords. However, existing approaches, such as methods based on shortest paths between nodes contain...... hiện toàn bộ
Tổng số: 410   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10