arXiv research

CICLAD efficiently mines frequent closed itemsets from data streams with minimal memory usage.

A new method for selecting high quality itemsets from a large collection.

We consider the problem of defining the significance of an itemset. We say that the itemset is significant if we are surprised by its frequency when compared to the frequencies of its sub-itemsets. In other words, we estimate the frequency of the itemset from the frequencies of its sub-itemsets and compute the deviatio…

Mining itemsets that are the most interesting under a statistical model of the underlying data is a commonly used and well-studied technique for exploratory data analysis, with the most recent interestingness models exhibiting state of the art performance. Continuing this highly promising line of work, we propose the f…

Frequent Itemsets (FIs) mining is a fundamental primitive in data mining. It requires to identify all itemsets appearing in at least a fraction $θ$ of a transactional dataset $\mathcal{D}$. Often though, the ultimate goal of mining $\mathcal{D}$ is not an analysis of the dataset \emph{per se}, but the understanding of …

The problem of finding itemsets that are statistically significantly enriched in a class of transactions is complicated by the need to correct for multiple hypothesis testing. Pruning untestable hypotheses was recently proposed as a strategy for this task of significant itemset mining. It was shown to lead to greater s…

Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the discovered patterns can be easily explained by background knowledge. The simplest approach to screen uninteresting patterns is to compare the ob…

We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, feature values and their importance are treated as transactions and util…

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…

In binary-transaction data-mining, traditional frequent itemset mining often produces results which are not straightforward to interpret. To overcome this problem, probability models are often used to produce more compact and conclusive results, albeit with some loss of accuracy. Bayesian statistics have been widely us…

The problem of multiple hypothesis testing arises when there are more than one hypothesis to be tested simultaneously for statistical significance. This is a very common situation in many data mining applications. For instance, assessing simultaneously the significance of all frequent itemsets of a single dataset entai…

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…

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…

In this article, we focus on distributed Apriori-based frequent itemsets mining. We present a new distributed approach which takes into account inherent characteristics of this algorithm. We study the distribution aspect of this algorithm and give a comparison of the proposed approach with a classical Apriori-like dist…

Method detects interactions for better CTR prediction.

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…

This paper creates a tagging system for paintings using historical descriptions.

Significant pattern mining, the problem of finding itemsets that are significantly enriched in one class of objects, is statistically challenging, as the large space of candidate patterns leads to an enormous multiple testing problem. Recently, the concept of testability was proposed as one approach to correct for mult…

In this paper, we propose an efficient algorithm for mining novel `Set of Contrasting Rules'-pattern (SCR-pattern), which consists of several association rules. This pattern is of high interest due to the guaranteed quality of the rules forming it and its ability to discover useful knowledge. However, SCR-pattern has n…

OMBA learns product and user representations for better online market basket analysis.

IGML learns discriminative metrics for graph classification.

FSR efficiently discovers significant patterns with few resampled datasets.

Scales gradual pattern discovery from imprecise data.

We prove the existence of Alexandrov embedded closed magnetic geodesics on closed hyperbolic surfaces. Closed magnetic geodesics correspond to closed curves with prescribed geodesic curvature.

This paper classifies instantons with closed reductions and provides examples of non-closed reductions.

No closed timelike geodesics in Kerr spacetimes, proving absence of closed causal geodesics.

The paper characterizes simple closed curves on surfaces using profinite rigidity.

Topological complexity for closed 1-forms

Study on $G_2$-structures with negative Ricci curvature on closed and noncompact manifolds.

Study shows compact Lorentz manifolds can't have closed geodesics.

Proves stability of geodesic flows on closed surfaces.

The study classifies spaces with specific conformal vector fields.

Historical returns depend on historical closing prices and distributions. We describe how to compute adjusted closing prices from closing price/distribution data with an emphasis on spreadsheet implementation. Then the growth of a security from one date to another (1 + total return) is just the ratio of the correspondi…

This paper adresses the following problem: Given a closed orientable three-manifold M, are there at most finitely many closed orientable three-manifolds 1-dominated by M? We solve this question for the class of closed orientable graph manifolds. More presisely the main result of this paper asserts that any closed orien…

If all prime closed geodesics on $(S^n,F)$ with an irreversible Finsler metric $F$ are irrationally elliptic, there exist either exactly $2\left[\frac{n+1}{2}\right]$ or infinitely many distinct closed geodesics. As an application, we show the existence of three distinct closed geodesics on bumpy Finsler $(S^3,F)$ if a…

Kerr spacetimes without closed null geodesics for non-zero rotation.

The study reveals conditions for infinite closed geodesics on specific surfaces.

A classical theorem due to Wadsley implies that, on a connected contact manifold all of whose Reeb orbits are closed, there is a common period for the Reeb orbits. In this paper we show that, for any Reeb flow on a closed connected 3-manifold, the following conditions are actually equivalent: (1) every Reeb orbit is cl…

In this note we establish estimates for the harmonic map heat flow from $S^1$ into a closed manifold, and use it to construct sweepouts with the following good property: each curve in the tightened sweepout, whose energy is close to the maximal energy of curves in the sweepout, is itself close to a closed geodesic.

The paper studies the shortest closed multi-geodesics on hyperbolic surfaces as their genus grows.

This article deals with a continuous closed 1-form defined on a CW-complex. In particular, we show Lusternik-Schnirelmann type theory on continuous closed 1-forms which is related to gradient-like flows. M.Farber defined a continuous closed 1-form and a category with a respect to a cohomology class and constructed a Lu…

Proves a quantitative closing lemma for negatively curved manifolds.

Characterizes covers using simple closed curves on surfaces.

The study finds the number of closed geodesics on a specific type of manifold.

Smart Close-out Netting aims to automate close-out netting processes.

We produce infinitely many examples of Anosov flows in closed 3-manifolds where the set of periodic orbits is partitioned into two infinite subsets. In one subset every closed orbit is freely homotopic to infinitely other closed orbits of the flow. In the other subset every closed orbit is freely homotopic to only one …

We show that, on a complete and possibly non-compact Riemannian manifold of dimension at least 2 without close conjugate points at infinity, the existence of a closed geodesic with local homology in maximal degree and maximal index growth under iteration forces the existence of infinitely many closed geodesics. For clo…

In the recent paper \cite{LoD1}, we classified closed geodesics on Finsler manifolds into rational and irrational two families, and gave a complete understanding on the index growth properties of iterates of rational closed geodesics. This study yields that a rational closed geodesic can not be the only closed geodesic…