English
Related papers

Related papers: Sequential Diversification with Provable Guarantee…

200 papers

Summarizing content contributed by individuals can be challenging, because people make different lexical choices even when describing the same events. However, there remains a significant need to summarize such content. Examples include the…

Computation and Language · Computer Science 2018-07-26 Wencan Luo , Fei Liu , Zitao Liu , Diane Litman

Ranking is a fundamental operation in information access systems, to filter information and direct user attention towards items deemed most relevant to them. Due to position bias, items of similar relevance may receive significantly…

Computers and Society · Computer Science 2021-11-01 Giorgio Maria Di Nunzio , Alessandro Fabris , Gianmaria Silvello , Gian Antonio Susto

There have been many recent studies on sequential pattern mining. The sequential pattern mining on progressive databases is relatively very new, in which we progressively discover the sequential patterns in period of interest. Period of…

Databases · Computer Science 2010-07-15 B. N. Keshavamurthy , Mitesh Sharma , Durga Toshniwal

Distributed systems, such as biological and artificial neural networks, process information via complex interactions engaging multiple subsystems, resulting in high-order patterns with distinct properties across scales. Investigating how…

Information Theory · Computer Science 2025-04-23 Aaron J. Gutknecht , Fernando E. Rosas , David A. Ehrlich , Abdullah Makkeh , Pedro A. M. Mediano , Michael Wibral

In this paper, we propose a simple global optimisation algorithm inspired by Pareto's principle. This algorithm samples most of its solutions within prominent search domains and is equipped with a self-adaptive mechanism to control the…

Optimization and Control · Mathematics 2021-03-30 Mahmoud Shaqfa , Katrin Beyer

The automatic ranking of word pairs as per their semantic relatedness and ability to mimic human notions of semantic relatedness has widespread applications. Measures that rely on raw data (distributional measures) and those that use…

Computation and Language · Computer Science 2012-03-09 Saif M Mohammad , Graeme Hirst

Semisort is a fundamental algorithmic primitive widely used in the design and analysis of efficient parallel algorithms. It takes input as an array of records and a function extracting a \emph{key} per record, and reorders them so that…

Data Structures and Algorithms · Computer Science 2023-04-21 Xiaojun Dong , Yunshu Wu , Zhongqi Wang , Laxman Dhulipala , Yan Gu , Yihan Sun

To advance the development of science and technology, research proposals are submitted to open-court competitive programs developed by government agencies (e.g., NSF). Proposal classification is one of the most important tasks to achieve…

Machine Learning · Computer Science 2022-09-20 Meng Xiao , Ziyue Qiao , Yanjie Fu , Yi Du , Pengyang Wang

Quality diversity is a recent family of evolutionary search algorithms which focus on finding several well-performing (quality) yet different (diversity) solutions with the aim to maintain an appropriate balance between divergence and…

Neural and Evolutionary Computing · Computer Science 2018-10-25 Daniele Gravina , Antonios Liapis , Georgios N. Yannakakis

In the past decade, matrix factorization has been extensively researched and has become one of the most popular techniques for personalized recommendations. Nevertheless, the dot product adopted in matrix factorization based recommender…

Information Retrieval · Computer Science 2018-06-05 Shuai Zhang , Lina Yao , Yi Tay , Xiwei Xu , Xiang Zhang , Liming Zhu

This work proposes and evaluates a novel approach to determine interesting categorical attributes for lists of entities. Once identified, such categories are of immense value to allow constraining (filtering) a current view of a user to…

Databases · Computer Science 2017-11-30 Koninika Pal , Sebastian Michel

This paper studies the problem of high-dimensional multiple testing and sparse recovery from the perspective of sequential analysis. In this setting, the probability of error is a function of the dimension of the problem. A simple…

Statistics Theory · Mathematics 2011-06-06 Matthew Malloy , Robert Nowak

We wish to measure the information coverage of an ad hoc retrieval algorithm, that is, how much of the range of available relevant information is covered by the search results. Information coverage is a central aspect for retrieval,…

Information Retrieval · Computer Science 2026-03-23 Saron Samuel , Andrew Yates , Dawn Lawrie , Ian Soboroff , Trevor Adriaanse , Benjamin Van Durme , Eugene Yang

Sequential recommendation leverages interaction sequences to predict forthcoming user behaviors, crucial for crafting personalized recommendations. However, the true preferences of a user are inherently complex and high-dimensional, while…

Information Retrieval · Computer Science 2024-07-26 Shu Chen , Jinwei Luo , Weike Pan , Jiangxing Yu , Xin Huang , Zhong Ming

We introduce and address the problem of ad hoc table retrieval: answering a keyword query with a ranked list of tables. This task is not only interesting on its own account, but is also being used as a core component in many other…

Information Retrieval · Computer Science 2018-03-09 Shuo Zhang , Krisztian Balog

The rankability of data is a recently proposed problem that considers the ability of a dataset, represented as a graph, to produce a meaningful ranking of the items it contains. To study this concept, a number of rankability measures have…

Combinatorics · Mathematics 2022-03-15 Nathan McJames , David Malone , Oliver Mason

Sequential recommender systems rank relevant items by modeling a user's interaction history and computing the inner product between the resulting user representation and stored item embeddings. To avoid the significant memory overhead of…

Fairness is a critical system-level objective in recommender systems that has been the subject of extensive recent research. A specific form of fairness is supplier exposure fairness where the objective is to ensure equitable coverage of…

Information Retrieval · Computer Science 2021-07-09 Masoud Mansoury , Himan Abdollahpouri , Mykola Pechenizkiy , Bamshad Mobasher , Robin Burke

What is the relationship between the complexity of a learner and the randomness of his mistakes? This question was posed in \cite{rat0903} who showed that the more complex the learner the higher the possibility that his mistakes deviate…

Information Theory · Computer Science 2009-09-01 Joel Ratsaby

Pharmaceutical companies regularly need to make decisions about drug development programs based on the limited knowledge from early stage clinical trials. In this situation, eliciting the judgements of experts is an attractive approach for…

‹ Prev 1 8 9 10 Next ›