English
Related papers

Related papers: Sequential Diversification with Provable Guarantee…

200 papers

Differential privacy is a leading protection setting, focused by design on individual privacy. Many applications, in medical / pharmaceutical domains or social networks, rather posit privacy at a group level, a setting we call integral…

Machine Learning · Statistics 2019-07-04 Hisham Husain , Zac Cranko , Richard Nock

The need to analyze information from streams arises in a variety of applications. One of its fundamental research directions is to mine sequential patterns over data streams. Current studies mine series of items based on the presence of the…

Databases · Computer Science 2022-04-12 Thomas Guyet , Wenbin Zhang , Albert Bifet

When selecting from a list of potential candidates, it is important to ensure not only that the selected items are of high quality, but also that they are sufficiently dissimilar so as to both avoid redundancy and to capture a broader range…

Methodology · Statistics 2026-02-25 Yash Nair , Ying Jin , James Yang , Emmanuel Candes

To analyze the topological properties of the given discrete data, one needs to consider a continuous transform called filtration. Persistent homology serves as a tool to track changes of homology in the filtration. The outcome of the…

Optimization and Control · Mathematics 2024-10-08 Keunsu Kim , Jae-Hun Jung

The $k$-Maximum Inner Product Search ($k$MIPS) serves as a foundational component in recommender systems and various data mining tasks. However, while most existing $k$MIPS approaches prioritize the efficient retrieval of highly relevant…

Information Retrieval · Computer Science 2024-02-22 Qiang Huang , Yanhao Wang , Yiqun Sun , Anthony K. H. Tung

Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may be prohibitively expensive if it is too big. In this case, outputting a small,…

Databases · Computer Science 2025-02-05 Timo Camillo Merkl , Reinhard Pichler , Sebastian Skritek

We extend previously proposed measures of complexity, emergence, and self-organization to continuous distributions using differential entropy. This allows us to calculate the complexity of phenomena for which distributions are known. We…

Adaptation and Self-Organizing Systems · Physics 2016-04-01 Guillermo Santamaría-Bonfil , Nelson Fernández , Carlos Gershenson

Modeling user sequential behaviors has recently attracted increasing attention in the recommendation domain. Existing methods mostly assume coherent preference in the same sequence. However, user personalities are volatile and easily…

Information Retrieval · Computer Science 2022-04-01 Weiqi Shao , Xu Chen , Long Xia , Jiashu Zhao , Dawei Yin

Diversity is a commonly known principle in the design of recommender systems, but also ambiguous in its conceptualization. Through semi-structured interviews we explore how practitioners at three different public service media organizations…

Information Retrieval · Computer Science 2024-05-06 Sanne Vrijenhoek , Savvina Daniil , Jorden Sandel , Laura Hollink

Financial statement auditing is conducted under a risk-based evidence approach to obtain reasonable assurance. In practice, auditors often perform additional sampling or related procedures when an initial sample does not provide a…

Statistical Finance · Quantitative Finance 2026-04-08 Masahiro Kato , Kei Nakagawa

Side information fusion for sequential recommendation (SR) aims to effectively leverage various side information to enhance the performance of next-item prediction. Most state-of-the-art methods build on self-attention networks and focus on…

Information Retrieval · Computer Science 2022-04-26 Yueqi Xie , Peilin Zhou , Sunghun Kim

The key of sequential recommendation lies in the accurate item correlation modeling. Previous models infer such information based on item co-occurrences, which may fail to capture the real causal relations, and impact the recommendation…

Information Retrieval · Computer Science 2022-12-14 Zhenlei Wang , Xu Chen , Rui Zhou , Quanyu Dai , Zhenhua Dong , Ji-Rong Wen

Similarity measures play a fundamental role in memory-based nearest neighbors approaches. They recommend items to a user based on the similarity of either items or users in a neighborhood. In this paper we argue that, although it keeps a…

Information Retrieval · Computer Science 2019-07-05 Vito Walter Anelli , Joseph Trotta , Tommaso Di Noia , Eugenio Di Sciascio , Azzurra Ragone

Recommendation systems have wide-spread applications in both academia and industry. Traditionally, performance of recommendation systems has been measured by their precision. By introducing novelty and diversity as key qualities in…

Information Retrieval · Computer Science 2015-01-12 Amin Javari , Mahdi Jalili

Dynamic diversification---finding a set of data points with maximum diversity from a time-dependent sample pool---is an important task in recommender systems, web search, database search, and notification services, to avoid showing users…

Data Structures and Algorithms · Computer Science 2018-06-19 Hannah Marienwald , Wikor Pronobis , Klaus-Robert Müller , Shinichi Nakajima

This work examines a novel question: how much randomness is needed to achieve local differential privacy (LDP)? A motivating scenario is providing {\em multiple levels of privacy} to multiple analysts, either for distribution or for…

Cryptography and Security · Computer Science 2020-05-26 Antonious M. Girgis , Deepesh Data , Kamalika Chaudhuri , Christina Fragouli , Suhas Diggavi

The diversity of the symbols of the information source is calculated following the definition that entropy is the information loss and following a new entropy-symbol similarity relation after the rejection of the Gibbs paradox statement.…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Shu-Kun Lin

In this paper we analyze the efficiency of various search results diversification methods. While efficacy of diversification approaches has been deeply investigated in the past, response time and scalability issues have been rarely…

Information Retrieval · Computer Science 2011-05-24 Gabriele Capannini , Franco Maria Nardini , Raffaele Perego , Fabrizio Silvestri

Maximum diversity problems arise in many practical settings from facility location to social networks, and constitute an important class of NP-hard problems in combinatorial optimization. There has been a growing interest in these problems…

Optimization and Control · Mathematics 2024-01-25 Francisco Parreño , Ramón Álvarez-Valdés , Rafael Martí

In this paper, we identify and study an important problem of gradient item retrieval. We define the problem as retrieving a sequence of items with a gradual change on a certain attribute, given a reference item and a modification text. For…

Information Retrieval · Computer Science 2021-06-02 Haonan Wang , Chang Zhou , Carl Yang , Hongxia Yang , Jingrui He
‹ Prev 1 4 5 6 7 8 10 Next ›