This work is done as part of a master's thesis project. The increase in the volume of data has given rise to various issues related to the collection, storage, analysis and exploitation of these data in order to create an added value. In this master, we are interested in the search of frequent closed patterns in the tr…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “closed frequent patterns”
Mining Rank Datacs.LG
The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little attention in data mining so far. In this paper, we therefore addresses the problem…
Designs a classifier for malware detection using MDL principle.
problem Static malware detection in PE files.
method Clustering, closed frequent pattern mining, MDL principle for compression.
result Our classifier performs close to deep neural networks.
Proposes SCR-Apriori for efficient mining of SCR-patterns.
problem Mining high-quality `Set of Contrasting Rules'-pattern (SCR-pattern) efficiently.
method Integrates SCR-pattern structure into Apriori algorithm to prune search space.
result Significantly reduces computational cost compared to state-of-the-art.
SGE learns symbolic node representations from relational data.
problem Mining insights from complex, real-world systems.
method SGE uses frequent pattern mining on a node's neighborhood to learn symbolic node representations.
result SGE outperforms shallow node embedding methods on a venue classification task.
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 proced…
MCRapper efficiently computes patterns in data using Monte-Carlo Rademacher Averages.
problem Finding statistically significant patterns in data with limited samples.
method Monte-Carlo Empirical Rademacher Averages (MCERA) for poset families.
result MCRapper provides upper bounds to the discrepancy of functions, enabling efficient pattern mining.
Random Intersection Chainsstat.ML
Random Intersection Chains selects important interactions from categorical features.
problem Heavy computational burden in considering all interactions for categorical features.
method Randomly generates chains of intersections, estimates and selects frequent patterns.
result Selected patterns are the most frequent in the data set.
Flexible log file parsing using HMM adapts to evolving content.
problem Dynamic log file processing with evolving content.
method Modeling frequent patterns into HMM for flexible log file parsing.
result High accuracy (over 99%) in parsing different system log files.
Mining frequent sequential patterns consists in extracting recurrent behaviors, modeled as patterns, in a big sequence dataset. Such patterns inform about which events are frequently observed in sequences, i.e. what does really happen. Sometimes, knowing that some specific event does not happen is more informative than…
FIBS extracts relevant features from IBTSs for classification.
problem Classifying interval-based temporal sequences (IBTSs) using common algorithms is challenging.
method FIBS extracts features from IBTSs based on relative frequency and temporal relations, incorporating a filter-based selection strategy to avoid irrelevant features.
result FIBS effectively represents IBTSs for classification algorithms, providing similar or better accuracy compared to state-of-the-art competitors.
Discriminative pattern mining is an essential task of data mining. This task aims to discover patterns which occur more frequently in a class than other classes in a class-labeled dataset. This type of patterns is valuable in various domains such as bioinformatics, data classification. In this paper, we propose a novel…
Generative Adversarial Networks are a new family of generative models, frequently used for generating photorealistic images. The theory promises for the GAN to eventually reach an equilibrium where generator produces pictures indistinguishable for the training set. In practice, however, a range of problems frequently p…
This paper introduces the combinatorial Boolean model (CBM), which is defined as the class of linear combinations of conjunctions of Boolean attributes. This paper addresses the issue of learning CBM from labeled data. CBM is of high knowledge interpretability but naïve learning of it requires exponentially large compu…
Benford's law states that in data sets from different phenomena leading digits tend to be distributed logarithmically such that the numbers beginning with smaller digits occur more often than those with larger ones. Particularly, the law is known to hold for different types of financial data. The Illicit Financial Flow…
Study reveals centralization in Bitcoin transactions involving retail users.
problem Centralization and bias in Bitcoin transaction data.
method Heuristic classification of Bitcoin users, weekly activity pattern analysis.
result Most real transactions involve Frequent Receivers, centralizing the ecosystem.
This article presents the use of Answer Set Programming (ASP) to mine sequential patterns. ASP is a high-level declarative logic programming paradigm for high level encoding combinatorial and optimization problem solving as well as knowledge representation and reasoning. Thus, ASP is a good candidate for implementing p…
This paper presents a framework for exact discovery of the top-k sequential patterns under Leverage. It combines (1) a novel definition of the expected support for a sequential pattern - a concept on which most interestingness measures directly rely - with (2) SkOPUS: a new branch-and-bound algorithm for the exact disc…
Randomization helps verify if data mining results are due to inherent patterns.
problem Verify if data mining results are due to inherent patterns or coincidental findings.
method Metropolis sampling based on local swaps to randomize data while preserving discovered patterns.
result Randomized data often reveals that clustering results imply frequent pattern discovery.
Paper detects common subtrees with identical labels in trees.
problem Finding common subtrees with identical label distribution in tree data.
method Developed an algorithm for tree isomorphism and a new compression scheme for trees.
result The method efficiently finds and compresses common subtrees with identical labels.
Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations wh…
Method finds motifs in knowledge graphs, revealing their structure.
problem Identifying meaningful subunits in knowledge graphs.
method Inspired by simple graphs, the approach uses compression techniques to find motifs.
result Motifs found reflect the basic structure of the graph.
This paper presents a case study of a recommender system that can be used to save energy in smart homes without lowering the comfort of the inhabitants. We present an algorithm that uses consumer behavior data only and uses machine learning to suggest actions for inhabitants to reduce the energy consumption of their ho…
CICLAD efficiently mines frequent closed itemsets from data streams with minimal memory usage.
problem Mining frequent closed itemsets from data streams is resource-intensive.
method CICLAD is an intersection-based sliding-window FCI miner that optimizes memory usage while maintaining performance.
result CICLAD achieves significantly lower memory footprint compared to existing methods.
Study circle patterns on tori, linking symplectic forms and homeomorphisms.
problem Understanding circle patterns on tori and their symplectic properties.
method Investigates the space of circle patterns on closed tori with complex projective structures, embedding it into Teichmüller spaces and analyzing symplectic forms.
result Non-degeneracy of the pulled-back Weil-Petersson symplectic form and homeomorphism between circle patterns and Teichmüller spaces.
FinCast is a foundation model for financial time-series forecasting that outperforms existing methods.
problem Challenges in financial time-series forecasting due to temporal non-stationarity, multi-domain diversity, and varying temporal resolutions.
method FinCast is a foundation model specifically designed for financial time-series forecasting, trained on large-scale financial datasets.
result FinCast exhibits robust zero-shot performance, effectively capturing diverse patterns without domain-specific fine-tuning.
Imputation-Powered Inferencestat.ME
Imputation-Powered Inference improves subpopulation efficiency in missing data settings.
problem Complex missing data patterns challenge standard inference methods.
method Imputation-Powered Inference (IPI) combines blackbox imputation with bias correction.
result IPI provides valid and efficient M-estimation under MCAR blockwise missingness.
Graph conformal prediction predicts future power outages with high confidence.
problem Accurately predicting future power outages to enable rapid recovery.
method Developed a graph conformal prediction method for quarter-hourly outage data.
result Graph conformal prediction method delivers accurate prediction regions for future outage numbers.
Machine learning identifies Shakespeare and Fletcher's contributions to Henry VIII.
problem Determining the relative contributions of Shakespeare and Fletcher in Henry VIII.
method Combined analysis of vocabulary and versification with machine learning techniques.
result Supports canonical division and new modifications of Henry VIII's authorship.
A new method for clustering incomplete data.
problem Handling missing data in clustering.
method Bayes alignment for imputation and leachable component clustering.
result The proposed method outperforms state-of-the-art algorithms.
Competency questions help experts select best clustering for energy data.
problem Ad hoc and subjective selection of clustering structures by domain experts.
method Formalize expert knowledge and requirements with competency questions.
result Competency questions improve reproducibility and evaluation of clustering applications.
Poor economies not only produce less; they typically produce things that involve fewer inputs and fewer intermediate steps. Yet the supply chains of poor countries face more frequent disruptions---delivery failures, faulty parts, delays, power outages, theft, government failures---that systematically thwart the product…
Scales gradual pattern discovery from imprecise data.
problem Managing large collections of gradual patterns from imprecise data.
method Introduces gradualness thresholds and considers attribute value distribution.
result Eliminates noise patterns, showing a smaller set of meaningful patterns.
This paper discusses how usage patterns and preferences of inhabitants can be learned efficiently to allow smart homes to autonomously achieve energy savings. We propose a frequent sequential pattern mining algorithm suitable for real-life smart home event data. The performance of the proposed algorithm is compared to …
dCMF models evolving patterns in multiway data with temporal dynamics.
problem Capturing evolving patterns in multiway datasets with temporal dependencies.
method Time-aware coupled factorization model constrained by LDS structure.
result dCMF outperforms alternatives in capturing complex dynamics.
A model predicts influential nodes in complex networks by considering indirect interactions.
problem Identifying influential nodes in complex networks using indirect interactions.
method Proposes MOGen, a multi-order generative model that considers all indirect influences up to a maximum distance.
result MOGen consistently outperforms network models and path-based approaches in predicting influential nodes.
Symplectic forms match on circle pattern space.
problem Matching symplectic forms on circle pattern space.
method Pullback of symplectic forms to circle pattern space.
result Symplectic forms on circle pattern space coincide.
Efficiently factorizes coupled matrix tensor data for better accuracy and speed.
problem Poor computation efficiency in existing N-CMTF algorithms.
method Column-wise element selection to prevent frequent gradient updates.
result More accurate and computationally efficient factorization.
Detects outliers in continuous-time event sequences, including unexpected absences and occurrences.
problem Identifying unexpected events in event sequences that may indicate abnormal situations.
method Developed methods based on Bayesian decision theory and hypothesis testing for context-aware outlier detection.
result Effective methods for detecting outliers in both synthetic and real-world data.
The paper identifies patterns in language model weights used for memorizing paragraphs.
problem Locating the specific mechanisms and weights used by language models to memorize paragraphs.
method Examined gradients and attention patterns in language models to identify memorized paragraphs.
result Gradients of memorized paragraphs have a distinguishable spatial pattern, and localized attention heads are involved in paragraph memorization.
WTM reduces clause usage and computation time for pattern recognition.
problem High computation time and memory usage in Tsetlin Machine.
method Weighting clauses and using binomial sampling to reduce complexity.
result WTM achieves similar accuracy with fewer clauses and faster training.
Recently, hybrid metaheuristics have become a trend in operations research. A successful example combines the Greedy Randomized Adaptive Search Procedures (GRASP) and data mining techniques, where frequent patterns found in high-quality solutions can lead to an efficient exploration of the search space, along with a si…
NFTs with diverse rare attributes sell at higher prices.
problem Understanding how rarity affects NFT market dynamics.
method Analyzed 3.7M NFT transactions across 410 collections.
result Rarer NFTs sell for higher prices and are less risky.
Bayesian approach to portfolio selection reduces pessimism in frequent trading.
problem Tackling the challenge of estimating drift in Merton's portfolio selection model.
method Bayesian distributionally robust control with nonlinear Wasserstein projections.
result Reduced pessimism and improved performance in frequent rebalancing compared to existing methods.
Commercial activity trackers are set to become an essential tool in health research, due to increasing availability in the general population. The corresponding vast amounts of mostly unlabeled data pose a challenge to statistical modeling approaches. To investigate the feasibility of deep learning approaches for unsup…
Perron's method and spherical ideal circle patterns with prescribed total geodesic curvaturesmath.GT
Paper proves existence and uniqueness of circle patterns on surfaces with assigned geodesic curvatures.
problem Existence and uniqueness of circle patterns on surfaces with prescribed geodesic curvatures.
method Applied Perron's method and Thurston's algorithm to prove existence and convergence.
result Existence and uniqueness of circle patterns on surfaces with prescribed geodesic curvatures.
Proves existence of circle patterns on surfaces with cusps.
problem Existence of circle patterns with prescribed angles on surfaces with cusps.
method Introduced combinatorial Ricci and Calabi flows to prove longtime existence and convergence.
result Existence of generalized circle patterns with prescribed angles on surfaces with cusps.
The study connects triangulated surfaces to complex projective structures and circle patterns.
problem Understanding circle patterns on complex projective tori.
method Using discrete holomorphic quadratic differentials, the approach involves cross ratio systems and Delaunay angles.
result For any triangulated torus, the projection map is a covering map with at most one branch point.