1,160 results on '"Kamps, Jaap"'
Search Results
2. Query Generation Using Large Language Models : A Reproducibility Study of Unsupervised Passage Reranking
- Author
-
Rau, David, Kamps, Jaap, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Goharian, Nazli, editor, Tonellotto, Nicola, editor, He, Yulan, editor, Lipani, Aldo, editor, McDonald, Graham, editor, Macdonald, Craig, editor, and Ounis, Iadh, editor
- Published
- 2024
- Full Text
- View/download PDF
3. Advances in information retrieval collection on the European conference on information retrieval 2023
- Author
-
Kamps, Jaap, Goeuriot, Lorraine, and Crestani, Fabio
- Published
- 2024
- Full Text
- View/download PDF
4. Bcubed revisited: elements like me
- Author
-
van Heusden, Ruben, Kamps, Jaap, and Marx, Maarten
- Published
- 2024
- Full Text
- View/download PDF
5. The Role of Complex NLP in Transformers for Text Ranking?
- Author
-
Rau, David and Kamps, Jaap
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Even though term-based methods such as BM25 provide strong baselines in ranking, under certain conditions they are dominated by large pre-trained masked language models (MLMs) such as BERT. To date, the source of their effectiveness remains unclear. Is it their ability to truly understand the meaning through modeling syntactic aspects? We answer this by manipulating the input order and position information in a way that destroys the natural sequence order of query and passage and shows that the model still achieves comparable performance. Overall, our results highlight that syntactic aspects do not play a critical role in the effectiveness of re-ranking with BERT. We point to other mechanisms such as query-passage cross-attention and richer embeddings that capture word meanings based on aggregated context regardless of the word order for being the main attributions for its superior performance., Comment: Proceedings of the 2022 ACM SIGIR International Conference on the Theory of Information Retrieval (ICTIR '22)
- Published
- 2022
- Full Text
- View/download PDF
6. How Different are Pre-trained Transformers for Text Ranking?
- Author
-
Rau, David and Kamps, Jaap
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
In recent years, large pre-trained transformers have led to substantial gains in performance over traditional retrieval models and feedback approaches. However, these results are primarily based on the MS Marco/TREC Deep Learning Track setup, with its very particular setup, and our understanding of why and how these models work better is fragmented at best. We analyze effective BERT-based cross-encoders versus traditional BM25 ranking for the passage retrieval task where the largest gains have been observed, and investigate two main questions. On the one hand, what is similar? To what extent does the neural ranker already encompass the capacity of traditional rankers? Is the gain in performance due to a better ranking of the same documents (prioritizing precision)? On the other hand, what is different? Can it retrieve effectively documents missed by traditional systems (prioritizing recall)? We discover substantial differences in the notion of relevance identifying strengths and weaknesses of BERT that may inspire research for future improvement. Our results contribute to our understanding of (black-box) neural rankers relative to (well-understood) traditional rankers, help understand the particular experimental setting of MS-Marco-based test collections., Comment: ECIR 2022
- Published
- 2022
7. CLEF 2023 SimpleText Track : What Happens if General Users Search Scientific Texts?
- Author
-
Ermakova, Liana, SanJuan, Eric, Huet, Stéphane, Augereau, Olivier, Azarbonyad, Hosein, Kamps, Jaap, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Kamps, Jaap, editor, Goeuriot, Lorraine, editor, Crestani, Fabio, editor, Maistro, Maria, editor, Joho, Hideo, editor, Davis, Brian, editor, Gurrin, Cathal, editor, Kruschwitz, Udo, editor, and Caputo, Annalina, editor
- Published
- 2023
- Full Text
- View/download PDF
8. Enticing Local Governments to Produce FAIR Freedom of Information Act Dossiers
- Author
-
Marx, Maarten, Larooij, Maik, Perasedillo, Filipp, Kamps, Jaap, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Kamps, Jaap, editor, Goeuriot, Lorraine, editor, Crestani, Fabio, editor, Maistro, Maria, editor, Joho, Hideo, editor, Davis, Brian, editor, Gurrin, Cathal, editor, Kruschwitz, Udo, editor, and Caputo, Annalina, editor
- Published
- 2023
- Full Text
- View/download PDF
9. Overview of the CLEF 2023 SimpleText Lab: Automatic Simplification of Scientific Texts
- Author
-
Ermakova, Liana, SanJuan, Eric, Huet, Stéphane, Azarbonyad, Hosein, Augereau, Olivier, Kamps, Jaap, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Arampatzis, Avi, editor, Kanoulas, Evangelos, editor, Tsikrika, Theodora, editor, Vrochidis, Stefanos, editor, Giachanou, Anastasia, editor, Li, Dan, editor, Aliannejadi, Mohammad, editor, Vlachos, Michalis, editor, Faggioli, Guglielmo, editor, and Ferro, Nicola, editor
- Published
- 2023
- Full Text
- View/download PDF
10. HiTR: Hierarchical Topic Model Re-estimation for Measuring Topical Diversity of Documents
- Author
-
Azarbonyad, Hosein, Dehghani, Mostafa, Kenter, Tom, Marx, Maarten, Kamps, Jaap, and de Rijke, Maarten
- Subjects
Computer Science - Computation and Language ,Computer Science - Information Retrieval ,Computer Science - Machine Learning - Abstract
A high degree of topical diversity is often considered to be an important characteristic of interesting text documents. A recent proposal for measuring topical diversity identifies three distributions for assessing the diversity of documents: distributions of words within documents, words within topics, and topics within documents. Topic models play a central role in this approach and, hence, their quality is crucial to the efficacy of measuring topical diversity. The quality of topic models is affected by two causes: generality and impurity of topics. General topics only include common information of a background corpus and are assigned to most of the documents. Impure topics contain words that are not related to the topic. Impurity lowers the interpretability of topic models. Impure topics are likely to get assigned to documents erroneously. We propose a hierarchical re-estimation process aimed at removing generality and impurity. Our approach has three re-estimation components: (1) document re-estimation, which removes general words from the documents; (2) topic re-estimation, which re-estimates the distribution over words of each topic; and (3) topic assignment re-estimation, which re-estimates for each document its distributions over topics. For measuring topical diversity of text documents, our HiTR approach improves over the state-of-the-art measured on PubMed dataset., Comment: IEEE Transactions on Knowledge and Data Engineering
- Published
- 2018
11. Overview of the CLEF 2022 SimpleText Lab: Automatic Simplification of Scientific Texts
- Author
-
Ermakova, Liana, SanJuan, Eric, Kamps, Jaap, Huet, Stéphane, Ovchinnikova, Irina, Nurbakova, Diana, Araújo, Sílvia, Hannachi, Radia, Mathurin, Elise, Bellot, Patrice, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Barrón-Cedeño, Alberto, editor, Da San Martino, Giovanni, editor, Degli Esposti, Mirko, editor, Sebastiani, Fabrizio, editor, Macdonald, Craig, editor, Pasi, Gabriella, editor, Hanbury, Allan, editor, Potthast, Martin, editor, Faggioli, Guglielmo, editor, and Ferro, Nicola, editor
- Published
- 2022
- Full Text
- View/download PDF
12. Automatic Simplification of Scientific Texts: SimpleText Lab at CLEF-2022
- Author
-
Ermakova, Liana, Bellot, Patrice, Kamps, Jaap, Nurbakova, Diana, Ovchinnikova, Irina, SanJuan, Eric, Mathurin, Elise, Araújo, Sílvia, Hannachi, Radia, Huet, Stéphane, Poinsu, Nicolas, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hagen, Matthias, editor, Verberne, Suzan, editor, Macdonald, Craig, editor, Seifert, Christin, editor, Balog, Krisztian, editor, Nørvåg, Kjetil, editor, and Setty, Vinay, editor
- Published
- 2022
- Full Text
- View/download PDF
13. Learning to Rank from Samples of Variable Quality
- Author
-
Dehghani, Mostafa and Kamps, Jaap
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence - Abstract
Training deep neural networks requires many training samples, but in practice, training labels are expensive to obtain and may be of varying quality, as some may be from trusted expert labelers while others might be from heuristics or other sources of weak supervision such as crowd-sourcing. This creates a fundamental quality-versus quantity trade-off in the learning process. Do we learn from the small amount of high-quality data or the potentially large amount of weakly-labeled data? We argue that if the learner could somehow know and take the label-quality into account when learning the data representation, we could get the best of both worlds. To this end, we introduce "fidelity-weighted learning" (FWL), a semi-supervised student-teacher approach for training deep neural networks using weakly-labeled data. FWL modulates the parameter updates to a student network (trained on the task we care about) on a per-sample basis according to the posterior confidence of its label-quality estimated by a teacher (who has access to the high-quality labels). Both student and teacher are learned from the data. We evaluate FWL on document ranking where we outperform state-of-the-art alternative semi-supervised methods., Comment: Presented at The First International SIGIR2016 Workshop on Learning From Limited Or Noisy Data For Information Retrieval. arXiv admin note: substantial text overlap with arXiv:1711.02799
- Published
- 2018
14. Learning to Learn from Weak Supervision by Full Supervision
- Author
-
Dehghani, Mostafa, Severyn, Aliaksei, Rothe, Sascha, and Kamps, Jaap
- Subjects
Statistics - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language ,Computer Science - Learning - Abstract
In this paper, we propose a method for training neural networks when we have a large set of data with weak labels and a small amount of data with true labels. In our proposed model, we train two neural networks: a target network, the learner and a confidence network, the meta-learner. The target network is optimized to perform a given task and is trained using a large set of unlabeled data that are weakly annotated. We propose to control the magnitude of the gradient updates to the target network using the scores provided by the second confidence network, which is trained on a small amount of supervised data. Thus we avoid that the weight updates computed from noisy labels harm the quality of the target network model., Comment: Accepted at NIPS Workshop on Meta-Learning (MetaLearn 2017), Long Beach, CA, USA
- Published
- 2017
15. Words are Malleable: Computing Semantic Shifts in Political and Media Discourse
- Author
-
Azarbonyad, Hosein, Dehghani, Mostafa, Beelen, Kaspar, Arkut, Alexandra, Marx, Maarten, and Kamps, Jaap
- Subjects
Computer Science - Computation and Language - Abstract
Recently, researchers started to pay attention to the detection of temporal shifts in the meaning of words. However, most (if not all) of these approaches restricted their efforts to uncovering change over time, thus neglecting other valuable dimensions such as social or political variability. We propose an approach for detecting semantic shifts between different viewpoints--broadly defined as a set of texts that share a specific metadata feature, which can be a time-period, but also a social entity such as a political party. For each viewpoint, we learn a semantic space in which each word is represented as a low dimensional neural embedded vector. The challenge is to compare the meaning of a word in one space to its meaning in another space and measure the size of the semantic shifts. We compare the effectiveness of a measure based on optimal transformations between the two spaces with a measure based on the similarity of the neighbors of the word in the respective spaces. Our experiments demonstrate that the combination of these two performs best. We show that the semantic shifts not only occur over time, but also along different viewpoints in a short period of time. For evaluation, we demonstrate how this approach captures meaningful semantic shifts and can help improve other tasks such as the contrastive viewpoint summarization and ideology detection (measured as classification accuracy) in political texts. We also show that the two laws of semantic change which were empirically shown to hold for temporal shifts also hold for shifts across viewpoints. These laws state that frequent words are less likely to shift meaning while words with many senses are more likely to do so., Comment: In Proceedings of the 26th ACM International on Conference on Information and Knowledge Management (CIKM2017)
- Published
- 2017
16. Fidelity-Weighted Learning
- Author
-
Dehghani, Mostafa, Mehrjou, Arash, Gouws, Stephan, Kamps, Jaap, and Schölkopf, Bernhard
- Subjects
Computer Science - Learning ,Computer Science - Computation and Language ,Computer Science - Neural and Evolutionary Computing - Abstract
Training deep neural networks requires many training samples, but in practice training labels are expensive to obtain and may be of varying quality, as some may be from trusted expert labelers while others might be from heuristics or other sources of weak supervision such as crowd-sourcing. This creates a fundamental quality versus-quantity trade-off in the learning process. Do we learn from the small amount of high-quality data or the potentially large amount of weakly-labeled data? We argue that if the learner could somehow know and take the label-quality into account when learning the data representation, we could get the best of both worlds. To this end, we propose "fidelity-weighted learning" (FWL), a semi-supervised student-teacher approach for training deep neural networks using weakly-labeled data. FWL modulates the parameter updates to a student network (trained on the task we care about) on a per-sample basis according to the posterior confidence of its label-quality estimated by a teacher (who has access to the high-quality labels). Both student and teacher are learned from the data. We evaluate FWL on two tasks in information retrieval and natural language processing where we outperform state-of-the-art alternative semi-supervised methods, indicating that our approach makes better use of strong and weak labels, and leads to better task-dependent data representations., Comment: Published as a conference paper at ICLR 2018
- Published
- 2017
17. On Search Powered Navigation
- Author
-
Dehghani, Mostafa, Jagfeld, Glorianna, Azarbonyad, Hosein, Olieman, Alex, Kamps, Jaap, and Marx, Maarten
- Subjects
Computer Science - Information Retrieval - Abstract
Query-based searching and browsing-based navigation are the two main components of exploratory search. Search lets users dig in deep by controlling their actions to focus on and find just the information they need, whereas navigation helps them to get an overview to decide which content is most important. In this paper, we introduce the concept of "search powered navigation" and investigate the effect of empowering navigation with search functionality on information seeking behavior of users and their experience by conducting a user study on exploratory search tasks, differentiated by different types of information needs. Our main findings are as follows: First, we observe radically different search tactics. Using search, users are able to control and augment their search focus, hence they explore the data in a depth-first, bottom-up manner. Conversely, using pure navigation they tend to check different options to be able to decide on their path into the data, which corresponds to a breadth-first, top-down exploration. Second, we observe a general natural tendency to combine aspects of search and navigation, however, our experiments show that the search functionality is essential to solve exploratory search tasks that require finding documents related to a narrow domain. Third, we observe a natural need for search powered navigation: users using a system without search functionality find creative ways to mimic searching using navigation., Comment: Accepted for publication in ACM SIGIR International Conference on the Theory of Information Retrieval
- Published
- 2017
- Full Text
- View/download PDF
18. Avoiding Your Teacher's Mistakes: Training Neural Networks with Controlled Weak Supervision
- Author
-
Dehghani, Mostafa, Severyn, Aliaksei, Rothe, Sascha, and Kamps, Jaap
- Subjects
Computer Science - Learning ,Computer Science - Computation and Language ,Computer Science - Neural and Evolutionary Computing ,Statistics - Machine Learning - Abstract
Training deep neural networks requires massive amounts of training data, but for many tasks only limited labeled data is available. This makes weak supervision attractive, using weak or noisy signals like the output of heuristic methods or user click-through data for training. In a semi-supervised setting, we can use a large set of data with weak labels to pretrain a neural network and then fine-tune the parameters with a small amount of data with true labels. This feels intuitively sub-optimal as these two independent stages leave the model unaware about the varying label quality. What if we could somehow inform the model about the label quality? In this paper, we propose a semi-supervised learning method where we train two neural networks in a multi-task fashion: a "target network" and a "confidence network". The target network is optimized to perform a given task and is trained using a large set of unlabeled data that are weakly annotated. We propose to weight the gradient updates to the target network using the scores provided by the second confidence network, which is trained on a small amount of supervised data. Thus we avoid that the weight updates computed from noisy labels harm the quality of the target network model. We evaluate our learning strategy on two different tasks: document ranking and sentiment classification. The results demonstrate that our approach not only enhances the performance compared to the baselines but also speeds up the learning process from weak labels.
- Published
- 2017
19. Finding Talk About the Past in the Discourse of Non-Historians
- Author
-
Olieman, Alex, Beelen, Kaspar, and Kamps, Jaap
- Subjects
Computer Science - Information Retrieval ,Computer Science - Digital Libraries - Abstract
A heightened interest in the presence of the past has given rise to the new field of memory studies, but there is a lack of search and research tools to support studying how and why the past is evoked in diachronic discourses. Searching for temporal references is not straightforward. It entails bridging the gap between conceptually-based information needs on one side, and term-based inverted indexes on the other. Our approach enables the search for references to (intersubjective) historical periods in diachronic corpora. It consists of a semantically-enhanced search engine that is able to find references to many entities at a time, which is combined with a novel interface that invites its user to actively sculpt the search result set. Until now we have been concerned mostly with user-friendly retrieval and selection of sources, but our tool can also contribute to existing efforts to create reusable linked data from and for research in the humanities., Comment: Presented at Drift-a-LOD 2017
- Published
- 2017
20. Overview of SimpleText 2021 - CLEF Workshop on Text Simplification for Scientific Information Access
- Author
-
Ermakova, Liana, Bellot, Patrice, Braslavski, Pavel, Kamps, Jaap, Mothe, Josiane, Nurbakova, Diana, Ovchinnikova, Irina, SanJuan, Eric, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Candan, K. Selçuk, editor, Ionescu, Bogdan, editor, Goeuriot, Lorraine, editor, Larsen, Birger, editor, Müller, Henning, editor, Joly, Alexis, editor, Maistro, Maria, editor, Piroi, Florina, editor, Faggioli, Guglielmo, editor, and Ferro, Nicola, editor
- Published
- 2021
- Full Text
- View/download PDF
21. Text Simplification for Scientific Information Access : CLEF 2021 SimpleText Workshop
- Author
-
Ermakova, Liana, Bellot, Patrice, Braslavski, Pavel, Kamps, Jaap, Mothe, Josiane, Nurbakova, Diana, Ovchinnikova, Irina, San-Juan, Eric, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hiemstra, Djoerd, editor, Moens, Marie-Francine, editor, Mothe, Josiane, editor, Perego, Raffaele, editor, Potthast, Martin, editor, and Sebastiani, Fabrizio, editor
- Published
- 2021
- Full Text
- View/download PDF
22. Good Applications for Crummy Entity Linkers? The Case of Corpus Selection in Digital Humanities
- Author
-
Olieman, Alex, Beelen, Kaspar, van Lange, Milan, Kamps, Jaap, and Marx, Maarten
- Subjects
Computer Science - Information Retrieval - Abstract
Over the last decade we have made great progress in entity linking (EL) systems, but performance may vary depending on the context and, arguably, there are even principled limitations preventing a "perfect" EL system. This also suggests that there may be applications for which current "imperfect" EL is already very useful, and makes finding the "right" application as important as building the "right" EL system. We investigate the Digital Humanities use case, where scholars spend a considerable amount of time selecting relevant source texts. We developed WideNet; a semantically-enhanced search tool which leverages the strengths of (imperfect) EL without getting in the way of its expert users. We evaluate this tool in two historical case-studies aiming to collect a set of references to historical periods in parliamentary debates from the last two decades; the first targeted the Dutch Golden Age, and the second World War II. The case-studies conclude with a critical reflection on the utility of WideNet for this kind of research, after which we outline how such a real-world application can help to improve EL technology in general., Comment: Accepted for presentation at SEMANTiCS '17
- Published
- 2017
23. Share your Model instead of your Data: Privacy Preserving Mimic Learning for Ranking
- Author
-
Dehghani, Mostafa, Azarbonyad, Hosein, Kamps, Jaap, and de Rijke, Maarten
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language ,Computer Science - Learning - Abstract
Deep neural networks have become a primary tool for solving problems in many fields. They are also used for addressing information retrieval problems and show strong performance in several tasks. Training these models requires large, representative datasets and for most IR tasks, such data contains sensitive information from users. Privacy and confidentiality concerns prevent many data owners from sharing the data, thus today the research community can only benefit from research on large-scale datasets in a limited manner. In this paper, we discuss privacy preserving mimic learning, i.e., using predictions from a privacy preserving trained model instead of labels from the original sensitive training data as a supervision signal. We present the results of preliminary experiments in which we apply the idea of mimic learning and privacy preserving mimic learning for the task of document re-ranking as one of the core IR tasks. This research is a step toward laying the ground for enabling researchers from data-rich environments to share knowledge learned from actual users' data, which should facilitate research collaborations., Comment: SIGIR 2017 Workshop on Neural Information Retrieval (Neu-IR'17)}{}{August 7--11, 2017, Shinjuku, Tokyo, Japan
- Published
- 2017
24. Neural Ranking Models with Weak Supervision
- Author
-
Dehghani, Mostafa, Zamani, Hamed, Severyn, Aliaksei, Kamps, Jaap, and Croft, W. Bruce
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language ,Computer Science - Learning - Abstract
Despite the impressive improvements achieved by unsupervised deep neural networks in computer vision and NLP tasks, such improvements have not yet been observed in ranking for information retrieval. The reason may be the complexity of the ranking problem, as it is not obvious how to learn from queries and documents when no supervised signal is available. Hence, in this paper, we propose to train a neural ranking model using weak supervision, where labels are obtained automatically without human annotators or any external resources (e.g., click data). To this aim, we use the output of an unsupervised ranking model, such as BM25, as a weak supervision signal. We further train a set of simple yet effective ranking models based on feed-forward neural networks. We study their effectiveness under various learning scenarios (point-wise and pair-wise models) and using different input representations (i.e., from encoding query-document pairs into dense/sparse vectors to using word embedding representation). We train our networks using tens of millions of training instances and evaluate it on two standard collections: a homogeneous news collection(Robust) and a heterogeneous large-scale web collection (ClueWeb). Our experiments indicate that employing proper objective functions and letting the networks to learn the input representation based on weakly supervised data leads to impressive performance, with over 13% and 35% MAP improvements over the BM25 model on the Robust and the ClueWeb collections. Our findings also suggest that supervised neural ranking models can greatly benefit from pre-training on large amounts of weakly labeled data that can be easily obtained from unsupervised IR models., Comment: In proceedings of The 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR2017)
- Published
- 2017
25. Hierarchical Re-estimation of Topic Models for Measuring Topical Diversity
- Author
-
Azarbonyad, Hosein, Dehghani, Mostafa, Kenter, Tom, Marx, Maarten, Kamps, Jaap, and de Rijke, Maarten
- Subjects
Computer Science - Information Retrieval - Abstract
A high degree of topical diversity is often considered to be an important characteristic of interesting text documents. A recent proposal for measuring topical diversity identifies three elements for assessing diversity: words, topics, and documents as collections of words. Topic models play a central role in this approach. Using standard topic models for measuring diversity of documents is suboptimal due to generality and impurity. General topics only include common information from a background corpus and are assigned to most of the documents in the collection. Impure topics contain words that are not related to the topic; impurity lowers the interpretability of topic models and impure topics are likely to get assigned to documents erroneously. We propose a hierarchical re-estimation approach for topic models to combat generality and impurity; the proposed approach operates at three levels: words, topics, and documents. Our re-estimation approach for measuring documents' topical diversity outperforms the state of the art on PubMed dataset which is commonly used for diversity experiments., Comment: Proceedings of the 39th European Conference on Information Retrieval (ECIR2017)
- Published
- 2017
26. Revisiting Bag of Words Document Representations for Efficient Ranking with Transformers.
- Author
-
Rau, David, Dehghani, Mostafa, and Kamps, Jaap
- Abstract
The article focuses on enhancing efficiency in modern transformer-based information retrieval models, addressing the limitations posed by the self-attention mechanism for long input, such as in document retrieval, by exploring bag-of-words document representations that encode documents using only a fraction of their characteristic terms. It mentions through experiments on MS MARCO and Robust04 datasets.
- Published
- 2024
- Full Text
- View/download PDF
27. How Different are Pre-trained Transformers for Text Ranking?
- Author
-
Rau, David, primary and Kamps, Jaap, additional
- Published
- 2022
- Full Text
- View/download PDF
28. Designing Multistage Search Systems to Support the Information Seeking Process
- Author
-
Huurdeman, Hugo C., Kamps, Jaap, Tan, Desney, Editor-in-Chief, Vanderdonckt, Jean, Editor-in-Chief, Fu, Wai Tat, editor, and van Oostendorp, Herre, editor
- Published
- 2020
- Full Text
- View/download PDF
29. Argument Retrieval from Web
- Author
-
Shahshahani, Mahsa S., Kamps, Jaap, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Arampatzis, Avi, editor, Kanoulas, Evangelos, editor, Tsikrika, Theodora, editor, Vrochidis, Stefanos, editor, Joho, Hideo, editor, Lioma, Christina, editor, Eickhoff, Carsten, editor, Névéol, Aurélie, editor, Cappellato, Linda, editor, and Ferro, Nicola, editor
- Published
- 2020
- Full Text
- View/download PDF
30. Generalized Group Profiling for Content Customization
- Author
-
Dehghani, Mostafa, Azarbonyad, Hosein, Kamps, Jaap, and Marx, Maarten
- Subjects
Computer Science - Information Retrieval ,Computer Science - Human-Computer Interaction ,68P20 - Abstract
There is an ongoing debate on personalization, adapting results to the unique user exploiting a user's personal history, versus customization, adapting results to a group profile sharing one or more characteristics with the user at hand. Personal profiles are often sparse, due to cold start problems and the fact that users typically search for new items or information, necessitating to back-off to customization, but group profiles often suffer from accidental features brought in by the unique individual contributing to the group. In this paper we propose a generalized group profiling approach that teases apart the exact contribution of the individual user level and the "abstract" group level by extracting a latent model that captures all, and only, the essential features of the whole group. Our main findings are the followings. First, we propose an efficient way of group profiling which implicitly eliminates the general and specific features from users' models in a group and takes out the abstract model representing the whole group. Second, we employ the resulting models in the task of contextual suggestion. We analyse different grouping criteria and we find that group-based suggestions improve the customization. Third, we see that the granularity of groups affects the quality of group profiling. We observe that grouping approach should compromise between the level of customization and groups' size., Comment: Short paper (4 pages) published in proceedings of ACM SIGIR Conference on Human Information Interaction and Retrieval (CHIIR'16)
- Published
- 2016
- Full Text
- View/download PDF
31. On Horizontal and Vertical Separation in Hierarchical Text Classification
- Author
-
Dehghani, Mostafa, Azarbonyad, Hosein, Kamps, Jaap, and Marx, Maarten
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language ,Computer Science - Information Theory ,68P20 - Abstract
Hierarchy is a common and effective way of organizing data and representing their relationships at different levels of abstraction. However, hierarchical data dependencies cause difficulties in the estimation of "separable" models that can distinguish between the entities in the hierarchy. Extracting separable models of hierarchical entities requires us to take their relative position into account and to consider the different types of dependencies in the hierarchy. In this paper, we present an investigation of the effect of separability in text-based entity classification and argue that in hierarchical classification, a separation property should be established between entities not only in the same layer, but also in different layers. Our main findings are the followings. First, we analyse the importance of separability on the data representation in the task of classification and based on that, we introduce a "Strong Separation Principle" for optimizing expected effectiveness of classifiers decision based on separation property. Second, we present Hierarchical Significant Words Language Models (HSWLM) which capture all, and only, the essential features of hierarchical entities according to their relative position in the hierarchy resulting in horizontally and vertically separable models. Third, we validate our claims on real-world data and demonstrate that how HSWLM improves the accuracy of classification and how it provides transferable models over time. Although discussions in this paper focus on the classification problem, the models are applicable to any information access tasks on data that has, or can be mapped to, a hierarchical structure., Comment: Full paper (10 pages) accepted for publication in proceedings of ACM SIGIR International Conference on the Theory of Information Retrieval (ICTIR'16)
- Published
- 2016
- Full Text
- View/download PDF
32. Topical Generalization for Presentation of User Profiles
- Author
-
Olieman, Alex, Kamps, Jaap, Satyukov, Gleb, and de Valk, Emil
- Subjects
Computer Science - Information Retrieval - Abstract
Fine-grained user profile generation approaches have made it increasingly feasible to display on a profile page in which topics a user has expertise or interest. Earlier work on topical user profiling has been directed at enhancing search and personalization functionality, but making such profiles useful for human consumption presents new challenges. With this work, we have taken a first step toward a semantic layout mode for topical user profiles. We have developed a topical generalization approach which finds coherent groups of topics and adds labels to them, based on their association with broader topics in the Wikipedia category graph. A nested layout mode, employing topical generalization, is compared with a simpler flat layout mode in our user study. The results indicate that users favor the nested structure over flat profiles, but tend to overlook the specific topics on the lower level. We propose a third layout mode to address this issue., Comment: (to be) presented at DIR'16, November 25, 2016, Delft, The Netherlands
- Published
- 2016
33. Beyond Movie Recommendations: Solving the Continuous Cold Start Problem in E-commerceRecommendations
- Author
-
Kiseleva, Julia, Tuzhilin, Alexander, Kamps, Jaap, Mueller, Melanie J. I., Bernardi, Lucas, Davis, Chad, Kovacek, Ivan, Einarsen, Mats Stafseng, and Hiemstra, Djoerd
- Subjects
Computer Science - Information Retrieval - Abstract
Many e-commerce websites use recommender systems or personalized rankers to personalize search results based on their previous interactions. However, a large fraction of users has no prior inter-actions, making it impossible to use collaborative filtering or rely on user history for personalization. Even the most active users mayvisit only a few times a year and may have volatile needs or different personas, making their personal history a sparse and noisy signal at best. This paper investigates how, when we cannot rely on the user history, the large scale availability of other user interactions still allows us to build meaningful profiles from the contextual data and whether such contextual profiles are useful to customize the ranking, exemplified by data from a major online travel agentBooking.com.Our main findings are threefold: First, we characterize the Continuous Cold Start Problem(CoCoS) from the viewpoint of typical e-commerce applications. Second, as explicit situational con-text is not available in typical real world applications, implicit cues from transaction logs used at scale can capture essential features of situational context. Third, contextual user profiles can be created offline, resulting in a set of smaller models compared to a single huge non-contextual model, making contextual ranking available with negligible CPU and memory footprint. Finally we conclude that, in an online A/B test on live users, our contextual ranker in-creased user engagement substantially over a non-contextual base-line, with click-through-rate (CTR) increased by 20%. This clearly demonstrates the value of contextual user profiles in a real world application.
- Published
- 2016
- Full Text
- View/download PDF
34. The Impact of Technical Domain Expertise on Search Behavior and Task Outcome
- Author
-
Kiseleva, Julia, García, Alejandro Montes, Kamps, Jaap, and Spirin, Nikita
- Subjects
Computer Science - Information Retrieval - Abstract
Domain expertise is regarded as one of the key factors impacting search success: experts are known to write more effective queries, to select the right results on the result page, and to find answers satisfying their information needs. Search transaction logs play the crucial role in the result ranking. Yet despite the variety in expertise levels of users, all prior interactions are treated alike, suggesting that weighting in expertise can improve the ranking for informational tasks. The main aim of this paper is to investigate the impact of high levels of technical domain expertise on both search behavior and task outcome. We conduct an online user study with searchers proficient in programming languages. We focus on Java and Javascript, yet we believe that our study and results are applicable for other expertise-sensitive search tasks. The main findings are three-fold: First, we constructed expertise tests that effectively measure technical domain expertise and correlate well with the self-reported expertise. Second, we showed that there is a clear position bias, but technical domain experts were less affected by position bias. Third, we found that general expertise helped finding the correct answers, but the domain experts were more successful as they managed to detect better answers. Our work is using explicit tests to determine user expertise levels, which is an important step toward fully automatic detection of expertise levels based on interaction behavior. A deeper understanding of the impact of expertise on search behavior and task outcome can enable more effective use of expert behavior in search logs - essentially make everyone search as an expert.
- Published
- 2015
35. LocLinkVis: A Geographic Information Retrieval-Based System for Large-Scale Exploratory Search
- Author
-
Olieman, Alex, Kamps, Jaap, and Claros, Rosa Merino
- Subjects
Computer Science - Information Retrieval - Abstract
In this paper we present LocLinkVis (Locate-Link-Visualize); a system which supports exploratory information access to a document collection based on geo-referencing and visualization. It uses a gazetteer which contains representations of places ranging from countries to buildings, and that is used to recognize toponyms, disambiguate them into places, and to visualize the resulting spatial footprints., Comment: SEM'15
- Published
- 2015
36. A Hybrid Approach to Domain-Specific Entity Linking
- Author
-
Olieman, Alex, Kamps, Jaap, Marx, Maarten, and Nusselder, Arjan
- Subjects
Computer Science - Information Retrieval ,Computer Science - Computation and Language ,H.3.1 - Abstract
The current state-of-the-art Entity Linking (EL) systems are geared towards corpora that are as heterogeneous as the Web, and therefore perform sub-optimally on domain-specific corpora. A key open problem is how to construct effective EL systems for specific domains, as knowledge of the local context should in principle increase, rather than decrease, effectiveness. In this paper we propose the hybrid use of simple specialist linkers in combination with an existing generalist system to address this problem. Our main findings are the following. First, we construct a new reusable benchmark for EL on a corpus of domain-specific conversations. Second, we test the performance of a range of approaches under the same conditions, and show that specialist linkers obtain high precision in isolation, and high recall when combined with generalist linkers. Hence, we can effectively exploit local context and get the best of both worlds., Comment: SEM'15
- Published
- 2015
37. The Continuous Cold Start Problem in e-Commerce Recommender Systems
- Author
-
Bernardi, Lucas, Kamps, Jaap, Kiseleva, Julia, and Müller, Melanie JI
- Subjects
Computer Science - Information Retrieval - Abstract
Many e-commerce websites use recommender systems to recommend items to users. When a user or item is new, the system may fail because not enough information is available on this user or item. Various solutions to this `cold-start problem' have been proposed in the literature. However, many real-life e-commerce applications suffer from an aggravated, recurring version of cold-start even for known users or items, since many users visit the website rarely, change their interests over time, or exhibit different personas. This paper exposes the `Continuous Cold Start' (CoCoS) problem and its consequences for content- and context-based recommendation from the viewpoint of typical e-commerce applications, illustrated with examples from a major travel recommendation website, Booking.com., Comment: 6 pages, 3 figures. 2nd Workshop on New Trends in Content-Based Recommender Systems, RecSys 2015
- Published
- 2015
38. Where to Go on Your Next Trip? Optimizing Travel Destinations Based on User Preferences
- Author
-
Kiseleva, Julia, Müller, Melanie J. I., Bernardi, Lucas, Davis, Chad, Kovacek, Ivan, Einarsen, Mats Stafseng, Kamps, Jaap, Tuzhilin, Alexander, and Hiemstra, Djoerd
- Subjects
Computer Science - Information Retrieval - Abstract
Recommendation based on user preferences is a common task for e-commerce websites. New recommendation algorithms are often evaluated by offline comparison to baseline algorithms such as recommending random or the most popular items. Here, we investigate how these algorithms themselves perform and compare to the operational production system in large scale online experiments in a real-world application. Specifically, we focus on recommending travel destinations at Booking.com, a major online travel site, to users searching for their preferred vacation activities. To build ranking models we use multi-criteria rating data provided by previous users after their stay at a destination. We implement three methods and compare them to the current baseline in Booking.com: random, most popular, and Naive Bayes. Our general conclusion is that, in an online A/B test with live users, our Naive-Bayes based ranker increased user engagement significantly over the current online system., Comment: 6 pages, 2 figures in SIGIR 2015, SIRIP Symposium on IR in Practice
- Published
- 2015
- Full Text
- View/download PDF
39. From XML Retrieval to Semantic Search and Beyond : The INEX, SBS, and MC2 Labs of CLEF 2012–2018
- Author
-
Kamps, Jaap, Koolen, Marijn, Geva, Shlomo, Schenkel, Ralf, SanJuan, Eric, Bogers, Toine, Zhai, ChengXiang, Series Editor, de Rijke, Maarten, Series Editor, Belkin, Nicholas J., Editorial Board Member, Clarke, Charles, Editorial Board Member, Kelly, Diane, Editorial Board Member, Sebastiani, Fabrizio, Editorial Board Member, Ferro, Nicola, editor, and Peters, Carol, editor
- Published
- 2019
- Full Text
- View/download PDF
40. Integrated DB and IR Approaches
- Author
-
Schenkel, Ralf, Theobald, Martin, Kamps, Jaap, Section editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
41. Initiative for the Evaluation of XML Retrieval
- Author
-
Kazai, Gabriella, Kamps, Jaap, Section editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
42. Indexing Units of Structured Text Retrieval
- Author
-
Kamps, Jaap, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
43. Evaluation Metrics for Structured Text Retrieval
- Author
-
Pehcevski, Jovan, Piwowarski, Benjamin, Kamps, Jaap, Section Editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
44. XML Retrieval
- Author
-
Lalmas, Mounia, Trotman, Andrew, Kamps, Jaap, Section Editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
45. Structured Text Retrieval Models
- Author
-
Hiemstra, Djoerd, Baeza-Yates, Ricardo, Kamps, Jaap, Section Editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
46. Processing Structural Constraints
- Author
-
Trotman, Andrew, Kamps, Jaap, Section Editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
47. Processing Overlaps in Structured Text Retrieval
- Author
-
Ramírez, Georgina, Kamps, Jaap, Section Editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
48. Presenting Structured Text Retrieval Results
- Author
-
Kamps, Jaap, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
49. Aggregation-Based Structured Text Retrieval
- Author
-
Tsikrika, Theodora, Kamps, Jaap, Section Editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
50. Narrowed Extended XPath I
- Author
-
Trotman, Andrew, Kamps, Jaap, Section editor, Liu, Ling, editor, and Özsu, M. Tamer, editor
- Published
- 2018
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.