Source author record

Ricardo Fraiman

Ricardo Fraiman appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

12works
6topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

12 published item(s)

preprint2026arXiv

Imbalanced Classification under Capacity Constraints

In many classification settings, the class of primary interest is underrepresented, leading to imbalanced data problems that arise in applications such as rare disease detection and fraud identification. In these contexts, identifying a potential positive instance typically triggers costly follow-up actions, such as medical imaging or detailed transaction inspection, which are subject to limited operational capacity. Motivated by this setting, we consider classification problems where data may arrive sequentially and decisions must be made under constraints on the number of instances that can be selected for further analysis. We propose a classification framework that explicitly controls the rate of positive predictions, enforcing a user-defined bound on the proportion of observations classified as belonging to the minority class while maximizing detection performance. The approach can be implemented using standard learning methods and naturally extends to online settings, where decisions are taken in real time. We show that incorporating capacity constraints leads to substantial improvements over classical approaches, including resampling techniques such as SMOTE, which do not directly control the selection rate.

preprint2022arXiv

Application of the Cramér-Wold theorem to testing for invariance under group actions

We address the problem of testing for the invariance of a probability measure under the action of a group of linear transformations. We propose a procedure based on consideration of one-dimensional projections, justified using a variant of the Cramér-Wold theorem. Our test procedure is powerful, computationally efficient, and dimension-independent, extending even to the case of infinite-dimensional spaces (multivariate functional data). It includes, as special cases, tests for exchangeability and sign-invariant exchangeability. We compare our procedure with some previous proposals in these cases, in a small simulation study. The paper concludes with two real-data examples.

preprint2022arXiv

Estimation of surface area

We study the problem of estimating the surface area of the boundary $\partial S$ of a sufficiently smooth set $S\subset\mathbb{R}^d$ when the available information is only a finite subset $\X\subset S$. We propose two estimators. The first makes use of the Devroye--Wise support estimator and is based on Crofton's formula, which, roughly speaking, states that the $(d-1)$-dimensional surface area of a smooth enough set is the mean number of intersections of randomly chosen lines. For that purpose, we propose an estimator of the number of intersections of such lines with support based on the Devroye--Wise support estimators. The second surface area estimator makes use of the $α$-convex hull of $\X$, which is denoted by $C_α(\X)$. More precisely, it is the $(d-1)$-dimensional surface area of $C_α(\X)$, as denoted by $|C_α(\X)|_{d-1}$, which is proven to converge to the $(d-1)$-dimensional surface area of $\partial S$. Moreover, $|C_α(\X)|_{d-1}$ can be computed using Crofton's formula. Our results depend on the Hausdorff distance between $S$ and $\X$ for the Devroye--Wise estimator, and the Hausdorff distance between $\partial S$ and $\partial C_α(\X)$ for the second estimator.

preprint2016arXiv

A Generalization of the maximal-spacings in several dimensions and a convexity test

The notion of maximal-spacing in several dimensions was introduced and studied by Deheuvels (1983) for data uniformly distributed on the unit cube. Later on, Janson (1987) extended the results to data uniformly distributed on any bounded set, and obtained a very fine result, namely, he derived the asymptotic distribution of different maximal-spacings notions. These results have been very useful in many statistical applications. We extend Janson's results to the case where the data are generated from a Hölder continuous density that is bounded from below and whose support is bounded. As an application, we develop a convexity test for the support of a distribution.

preprint2015arXiv

A nonlinear aggregation type classifier

We introduce a nonlinear aggregation type classifier for functional data defined on a separable and complete metric space. The new rule is built up from a collection of $M$ arbitrary training classifiers. If the classifiers are consistent, then so is the aggregation rule. Moreover, asymptotically the aggregation rule behaves as well as the best of the $M$ classifiers. The results of a small simulation are reported both, for high dimensional and functional data, and a real data example is analyzed.

preprint2015arXiv

On visual distances for spectrum-type functional data

A functional distance ${\mathbb H}$, based on the Hausdorff metric between the function hypographs, is proposed for the space ${\mathcal E}$ of non-negative real upper semicontinuous functions on a compact interval. The main goal of the paper is to show that the space $({\mathcal E},{\mathbb H})$ is particularly suitable in some statistical problems with functional data which involve functions with very wiggly graphs and narrow, sharp peaks. A typical example is given by spectrograms, either obtained by magnetic resonance or by mass spectrometry. On the theoretical side, we show that $({\mathcal E},{\mathbb H})$ is a complete, separable locally compact space and that the ${\mathbb H}$-convergence of a sequence of functions implies the convergence of the respective maximum values of these functions. The probabilistic and statistical implications of these results are discussed in particular, regarding the consistency of $k$-NN classifiers for supervised classification problems with functional data in ${\mathbb H}$. On the practical side, we provide the results of a small simulation study and check also the performance of our method in two real data problems of supervised classification involving mass spectra.

preprint2015arXiv

Set estimation from reflected Brownian motion

We study the problem of estimating a compact set $S\subset \mathbb{R}^d$ from a trajectory of a reflected Brownian motion in $S$ with reflections on the boundary of $S$. We establish consistency and rates of convergence for various estimators of $S$ and its boundary. This problem has relevant applications in ecology in estimating the home range of an animal based on tracking data. There are a variety of studies on the habitat of animals that employ the notion of home range. This paper offers theoretical foundations for a new methodology that, under fairly unrestrictive shape assumptions, allows one to find flexible regions close to reality. The theoretical findings are illustrated on simulated and real data examples.

preprint2014arXiv

A geometrically motivated parametric model in manifold estimation,

The general aim of manifold estimation is reconstructing, by statistical methods, an $m$-dimensional compact manifold $S$ on ${\mathbb R}^d$ (with $m\leq d$) or estimating some relevant quantities related to the geometric properties of $S$. We will assume that the sample data are given by the distances to the $(d-1)$-dimensional manifold $S$ from points randomly chosen on a band surrounding $S$, with $d=2$ and $d=3$. The point in this paper is to show that, if $S$ belongs to a wide class of compact sets (which we call \it sets with polynomial volume\rm), the proposed statistical model leads to a relatively simple parametric formulation. In this setup, standard methodologies (method of moments, maximum likelihood) can be used to estimate some interesting geometric parameters, including curvatures and Euler characteristic. We will particularly focus on the estimation of the $(d-1)$-dimensional boundary measure (in Minkowski's sense) of $S$. It turns out, however, that the estimation problem is not straightforward since the standard estimators show a remarkably pathological behavior: while they are consistent and asymptotically normal, their expectations are infinite. The theoretical and practical consequences of this fact are discussed in some detail.

preprint2014arXiv

An optimal aggregation type classifier

We introduce a nonlinear aggregation type classifier for functional data defined on a separable and complete metric space. The new rule is built up from a collection of $M$ arbitrary training classifiers. If the classifiers are consistent, then so is the aggregation rule. Moreover, asymptotically the aggregation rule behaves as well as the best of the $M$ classifiers. The results of a small si\-mu\-lation are reported both, for high dimensional and functional data.

preprint2014arXiv

On Poincaré cone property

A domain $S\subset{\mathbb{R}}^d$ is said to fulfill the Poincaré cone property if any point in the boundary of $S$ is the vertex of a (finite) cone which does not otherwise intersects the closure $\bar{S}$. For more than a century, this condition has played a relevant role in the theory of partial differential equations, as a shape assumption aimed to ensure the existence of a solution for the classical Dirichlet problem on $S$. In a completely different setting, this paper is devoted to analyze some statistical applications of the Poincaré cone property (when defined in a slightly stronger version). First, we show that this condition can be seen as a sort of generalized convexity: while it is considerably less restrictive than convexity, it still retains some ``convex flavour.'' In particular, when imposed to a probability support $S$, this property allows the estimation of $S$ from a random sample of points, using the ``hull principle'' much in the same way as a convex support is estimated using the convex hull of the sample points. The statistical properties of such hull estimator (consistency, convergence rates, boundary estimation) are considered in detail. Second, it is shown that the class of sets fulfilling the Poincaré property is a $P$-Glivenko-Cantelli class for any absolutely continuous distribution $P$ on $\mathbb{R}^d$. This has some independent interest in the theory of empirical processes, since it extends the classical analogous result, established for convex sets, to a much larger class. Third, an algorithm to approximate the cone-convex hull of a finite sample of points is proposed and some practical illustrations are given.

preprint2011arXiv

Clustering using Unsupervised Binary Trees: CUBT

We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce the heterogeneity of the data within the new subsamples. During the second stage (pruning), consideration is given to whether adjacent nodes can be aggregated. Finally, during the third stage (joining), similar clusters are joined together, even if they do not share the same parent originally. Consistency results are obtained, and the procedure is used on simulated and real data sets.

preprint2011arXiv

On statistical properties of sets fulfilling rolling-type conditions

Motivated by set estimation problems, we consider three closely related shape conditions for compact sets: positive reach, r-convexity and rolling condition. First, the relations between these shape conditions are analyzed. Second, we obtain for the estimation of sets fulfilling a rolling condition a result of "full consistency" (i.e., consistency with respect to the Hausdorff metric for the target set and for its boundary). Third, the class of uniformly bounded compact sets whose reach is not smaller than a given constant r is shown to be a P-uniformity class (in Billingsley and Topsoe's (1967) sense) and, in particular, a Glivenko-Cantelli class. Fourth, under broad conditions, the r-convex hull of the sample is proved to be a fully consistent estimator of an r-convex support in the two-dimensional case. Moreover, its boundary length is shown to converge (a.s.) to that of the underlying support. Fifth, the above results are applied to get new consistency statements for level set estimators based on the excess mass methodology (Polonik, 1995).