paper-with-me

홈 › Papers

Fast and Memory-Efficient Significant Pattern Mining via Permutation Testing

2015-02-15 · Felipe Llinares López, Mahito Sugiyama, Laetitia Papaxanthos, Karsten M. Borgwardt

We present a novel algorithm, Westfall-Young light, for detecting patterns, such as itemsets and subgraphs, which are statistically significantly enriched in one of two classes. Our method corrects rigorously for multiple hypothesis testing and correlations between patterns through the Westfall-Young permutation procedure, which empirically estimates the null distribution of pattern frequencies in each class via permutations. In our experiments, Westfall-Young light dramatically outperforms the current state-of-the-art approach in terms of both runtime and memory efficiency on popular real-world benchmark datasets for pattern mining. The key to this efficiency is that unlike all existing methods, our algorithm neither needs to solve the underlying frequent itemset mining problem anew for each permutation nor needs to store the occurrence list of all frequent patterns. Westfall-Young light opens the door to significant pattern mining on large datasets that previously led to prohibitive runtime or memory costs.

📄 PDF Abstract BibTeX arXiv:1502.04315

Code (0)

등록된 구현이 없습니다.

Tasks

Two-sample testing

Similar Papers 제목 키워드 기반

Extended Vertical Lists for Temporal Pattern Mining from Multivariate Time Series

2018-04-26 · Anton Kocheturov, Petar Momcilovic, Azra Bihorac, Panos M. Pardalos

Temporal Pattern Mining (TPM) is the problem of mining predictive complex temporal patterns from multivariate time series in a supervised setting. We develop a new method called the Fast Temporal Pattern Mining with Exte…

Time SeriesTime Series Analysis

Permutation Search Methods are Efficient, Yet Faster Search is Possible

2015-06-10 · Bilegsaikhan Naidan, Leonid Boytsov, Eric Nyberg

We survey permutation-based methods for approximate k-nearest neighbor search. In these methods, every data point is represented by a ranked list of pivots sorted by the distance to this point. Such ranked lists are call…

Retrieval

Fast, Accurate and Memory-Efficient Partial Permutation Synchronization

2022-03-30 · CVPR 2022 1 · Shaohan Li, Yunpeng Shi, Gilad Lerman

Previous partial permutation synchronization (PPS) algorithms, which are commonly used for multi-object matching, often involve computation-intensive and memory-demanding matrix operations. These operations become intrac…

TaSPM: Targeted Sequential Pattern Mining

2022-02-26 · Gengsen Huang, Wensheng Gan, Philip S. Yu

Sequential pattern mining (SPM) is an important technique of pattern mining, which has many applications in reality. Although many efficient sequential pattern mining algorithms have been proposed, there are few studies …

Sequential Pattern Mining

HUSP-SP: Faster Utility Mining on Sequence Data

2022-12-29 · Chunkai Zhang, Yuting Yang, Zilin Du, Wensheng Gan 외

High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM pro…

Sequential Pattern Mining