no code implementations • 13 Oct 2022 • Aleksey Buzmakov, Tatiana Makhalova, Sergei O. Kuznetsov, Amedeo Napoli
In this paper, we revisit pattern mining and study the distribution underlying a binary dataset thanks to the closure structure which is based on passkeys, i. e., minimum generators in equivalence classes robust to noise.
no code implementations • 6 Oct 2020 • Tatiana Makhalova, Aleksey Buzmakov, Sergei O. Kuznetsov, Amedeo Napoli
The closure structure allows one to understand the topology of the dataset in the whole and the inherent complexity of the data.
no code implementations • 3 Dec 2019 • Aleksey Buzmakov, Daria Semenova, Maria Temirkaeva
Today, treatment effect estimation at the individual level is a vital problem in many areas of science and business.
no code implementations • 27 Feb 2019 • Aleksey Buzmakov
In many practical tasks it is needed to estimate an effect of treatment on individual level.
no code implementations • 28 Mar 2017 • Aleksey Buzmakov, Sergei O. Kuznetsov, Amedeo Napoli
One of the first constraints proposed in pattern mining is support (frequency) of a pattern in a dataset.
no code implementations • 2 Jun 2015 • Aleksey Buzmakov, Sergei O. Kuznetsov, Amedeo Napoli
In this paper we consider stability and $\Delta$-measure, which are nonmonotonic constraints, and apply them to interval tuple datasets.
no code implementations • 9 Apr 2015 • Aleksey Buzmakov, Elias Egho, Nicolas Jay, Sergei O. Kuznetsov, Amedeo Napoli, Chedy Raïssi
Pattern structures are used for mining complex data (such as sequences or graphs) and are based on a subsumption operation, which in our case is defined with respect to the partial order on sequences.