English
Related papers

Related papers: OPR-Miner: Order-preserving rule mining for time s…

200 papers

Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example, "a given action is always followed by another action before a given deadline". This…

Systems and Control · Computer Science 2019-04-08 Étienne André , Ichiro Hasuo , Masaki Waga

Greedy algorithms for feature selection are widely used for recovering sparse high-dimensional vectors in linear models. In classical procedures, the main emphasis was put on the sample complexity, with little or no consideration of the…

Machine Learning · Statistics 2021-02-11 El Mehdi Saad , Gilles Blanchard , Sylvain Arlot

A general, variational approach to derive low-order reduced systems is presented. The approach is based on the concept of optimal parameterizing manifold (OPM) that substitutes the more classical notions of invariant or slow manifold when…

Dynamical Systems · Mathematics 2023-09-18 Mickaël D. Chekroun , Honghu Liu , James C. McWilliams

Frequent pattern mining is widely used to find ``important'' or ``interesting'' patterns in data. While it is not easy to mathematically define such patterns, maximal frequent patterns are promising candidates, as frequency is a natural…

Data Structures and Algorithms · Computer Science 2025-04-08 Giovanni Buzzega , Alessio Conte , Yasuaki Kobayashi , Kazuhiro Kurita , Giulia Punzi

Many modern machine learning applications, such as multi-task learning, require finding optimal model parameters to trade-off multiple objective functions that may conflict with each other. The notion of the Pareto set allows us to focus on…

Optimization and Control · Mathematics 2022-09-05 Mao Ye , Qiang Liu

Based on the analysis of the proportion of utility in the supporting transactions used in the field of data mining, high utility-occupancy pattern mining (HUOPM) has recently attracted widespread attention. Unlike high-utility pattern…

Databases · Computer Science 2021-11-25 Chien-Ming Chen , Lili Chen , Wensheng Gan

We propose a successive one-sided Hodrick-Prescott (SOHP) filter from multiple time scale decomposition perspective to derive trend estimate for a time series. The idea is to apply the one-sided HP (OHP) filter recursively on the updated…

Statistical Finance · Quantitative Finance 2023-06-23 Yuxia Liu , Qi Zhang , Wei Xiao , Tianguang Chu

Pattern matching in time series data streams is considered to be an essential data mining problem that still stays challenging for many practical scenarios. Different factors such as noise, varying amplitude scale or shift, signal stretches…

Databases · Computer Science 2020-04-09 Renzhi Wu , Sergey Sukhanov , Christian Debes

High utility sequential pattern mining (HUSPM) is a significant and valuable activity in knowledge discovery and data analytics with many real-world applications. In some cases, HUSPM can not provide an excellent measure to predict what…

Artificial Intelligence · Computer Science 2022-09-28 Chunkai Zhang , Maohua Lyu , Wensheng Gan , Philip S. Yu

Sequential pattern mining is an interesting research area with broad range of applications. Most prior research on sequential pattern mining has considered point-based data where events occur instantaneously. However, in many application…

Machine Learning · Computer Science 2020-09-16 S. Mohammad Mirbagheri , Howard J. Hamilton

This paper develops a memory-efficient approach for Sequential Pattern Mining (SPM), a fundamental topic in knowledge discovery that faces a well-known memory bottleneck for large data sets. Our methodology involves a novel hybrid trie data…

Databases · Computer Science 2024-07-30 Amin Hosseininasab , Willem-Jan van Hoeve , Andre A. Cire

Given a set $\Pi$ of permutation patterns of length at most $k$, we present an algorithm for building $S_{\le n}(\Pi)$, the set of permutations of length at most $n$ avoiding the patterns in $\Pi$, in time $O(|S_{\le n - 1}(\Pi)| \cdot k +…

Discrete Mathematics · Computer Science 2017-03-20 William Kuszmaul

We introduce ordered transfer hyperparameter optimisation (OTHPO), a version of transfer learning for hyperparameter optimisation (HPO) where the tasks follow a sequential order. Unlike for state-of-the-art transfer HPO, the assumption is…

Machine Learning · Computer Science 2023-06-30 Sigrid Passano Hellan , Huibin Shen , François-Xavier Aubet , David Salinas , Aaron Klein

Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example, "a given action is always followed by another action before a given deadline". This…

Formal Languages and Automata Theory · Computer Science 2024-07-26 Masaki Waga , Étienne André , Ichiro Hasuo

Frequent pattern (itemset) mining in transactional databases is one of the most well-studied problems in data mining. One obstacle that limits the practical usage of frequent pattern mining is the extremely large number of patterns…

Databases · Computer Science 2007-05-23 Zengyou He

Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database, but, in general, only a few ones are interesting for the user. Languages based on regular expressions (RE) have been proposed to…

Databases · Computer Science 2008-11-25 Leticia Gomez , Bart Kuijpers , Alejandro Vaisman

Reinforcement learning algorithms are fundamental to align large language models with human preferences and to enhance their reasoning capabilities. However, current reinforcement learning algorithms often suffer from training instability…

Machine Learning · Computer Science 2025-06-05 Yaru Hao , Li Dong , Xun Wu , Shaohan Huang , Zewen Chi , Furu Wei

For a machine learning model deployed in real world scenarios, the ability of detecting out-of-distribution (OOD) samples is indispensable and challenging. Most existing OOD detection methods focused on exploring advanced training skills or…

Machine Learning · Computer Science 2024-02-16 Chao Chen , Zhihang Fu , Kai Liu , Ze Chen , Mingyuan Tao , Jieping Ye

We consider the problem of sorting $n$ elements in the case of \emph{persistent} comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison between two elements can be wrong with some fixed (small) probability $p$,…

Data Structures and Algorithms · Computer Science 2018-04-23 Barbara Geissmann , Stefano Leucci , Chih-Hung Liu , Paolo Penna

Significant pattern mining is a fundamental task in mining transactional data, requiring to identify patterns significantly associated with the value of a given feature, the target. In several applications, such as biomedicine, basket…

Machine Learning · Computer Science 2024-06-18 Leonardo Pellegrina , Fabio Vandin