English
Related papers

Related papers: Nearest-Neighbor and Contact Distance Distribution…

200 papers

Spectral clustering is one of the most prominent clustering approaches. The distance-based similarity is the most widely used method for spectral clustering. However, people have already noticed that this is not suitable for multi-scale…

Machine Learning · Computer Science 2020-09-11 Hengrui Wang , Yubo Zhang , Mingzhi Chen , Tong Yang

Subspace clustering refers to the problem of clustering high-dimensional data points into a union of low-dimensional linear subspaces, where the number of subspaces, their dimensions and orientations are all unknown. In this paper, we…

Machine Learning · Statistics 2014-03-17 Reinhard Heckel , Eirikur Agustsson , Helmut Bölcskei

An unbinned statistical test on cluster-like deviations from Poisson processes for point process data is introduced, presented in the context of time variability analysis of astrophysical sources in count rate experiments. The measure of…

Astrophysics · Physics 2007-05-23 Juergen Prahl

We study two generalizations of classic clustering problems called dynamic ordered $k$-median and dynamic $k$-supplier, where the points that need clustering evolve over time, and we are allowed to move the cluster centers between…

Data Structures and Algorithms · Computer Science 2022-07-26 Shichuan Deng , Jian Li , Yuval Rabani

Correlation clustering is a central problem in unsupervised learning, with applications spanning community detection, duplicate detection, automated labelling and many more. In the correlation clustering problem one receives as input a set…

We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…

Probability · Mathematics 2026-03-10 Partha S. Dey , S. Rasoul Etesami , Aditya S. Gopalan

Poisson-like behavior for event count data is ubiquitous in nature. At the same time, differencing of such counts arises in the course of data processing in a variety of areas of application. As a result, the Skellam distribution -- defined…

Probability · Mathematics 2018-04-04 H. L. Gan , Eric D. Kolaczyk

We establish sample-path large deviation principles for the centered cumulative functional of marked Poisson cluster processes in the Skorokhod space equipped with the M1 topology, under joint regular variation assumptions on the marks and…

Probability · Mathematics 2025-07-22 Fabien Baeriswyl , Olivier Wintenberger

In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the…

Networking and Internet Architecture · Computer Science 2016-01-25 Sudheer Poojary , Vinod Sharma

We study the cluster size distribution of particles for a two-species exclusion process which involves totally asymmetric transport process of two oppositely directed species with stochastic directional switching of the species on a 1D…

Statistical Mechanics · Physics 2022-09-13 Jim Chacko , Sudipto Muhuri , Goutam Tripathy

A Poisson or a binomial process on an abstract state space and a symmetric function $f$ acting on $k$-tuples of its points are considered. They induce a point process on the target space of $f$. The main result is a functional limit theorem…

Probability · Mathematics 2016-06-07 Laurent Decreusefond , Matthias Schulte , Christoph Thäle

Clustering is a technique for the analysis of datasets obtained by empirical studies in several disciplines with a major application for biomedical research. Essentially, clustering algorithms are executed by machines aiming at finding…

Quantitative Methods · Quantitative Biology 2024-09-30 Diego Ulisse Pizzagalli , Santiago Fernandez Gonzalez , Rolf Krause

The arrival of molecules in molecular communication via diffusion (MCvD) is a counting process, exhibiting by its nature binomial distribution. Even if the binomial process describes well the arrival of molecules, when considering…

Emerging Technologies · Computer Science 2014-10-29 H. Birkan Yilmaz , Chan-Byoung Chae , Burcu Tepekule , Ali E. Pusane

Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited…

Machine Learning · Computer Science 2017-02-09 Quang N. Tran , Ba-Ngu Vo , Dinh Phung , Ba-Tuong Vo

We study the influence of clustering, more specifically triangles, on cascading failures in interdependent networks or systems, in which we model the dependence between comprising systems using a dependence graph. First, we propose a new…

Physics and Society · Physics 2018-02-13 Richard J. La

This paper addresses a detection problem where several spatially distributed sensors independently observe a time-inhomogeneous stochastic process. The task is to decide between two hypotheses regarding the statistics of the observed…

Probability · Mathematics 2012-10-05 Chetan D. Pahlajani , Ioannis Poulakakis , Herbert G. Tanner

In this paper, we propose a Contact Diffusion Model (CDM), a novel learning-based approach for multi-contact point localization. We consider a robot equipped with joint torque sensors and a force/torque sensor at the base. By leveraging a…

Robotics · Computer Science 2025-09-08 Seo Wook Han , Min Jun Kim

In this paper, two parametric probability distributions capable to describe the statistics of X-ray photon detection by a CCD are presented. They are formulated from simple models that account for the pile-up phenomenon, in which two or…

Instrumentation and Methods for Astrophysics · Physics 2013-10-30 Diego J. R. Sevilla

One of the methodologies that carry out the division of the electrical grid into zones is based on the aggregation of nodes characterized by similar Power Transfer Distribution Factors (PTDFs). Here, we point out that satisfactory…

Computational Engineering, Finance, and Science · Computer Science 2014-08-07 Michal Klos , Karol Wawrzyniak , Marcin Jakubek , Grzegorz Orynczak

Let $P$ be a set of $n$ points in $\mathbb{R}^d$. In the projective clustering problem, given $k, q$ and norm $\rho \in [1,\infty]$, we have to compute a set $\mathcal{F}$ of $k$ $q$-dimensional flats such that $(\sum_{p\in P}d(p,…

Computational Geometry · Computer Science 2015-06-03 Michael Kerber , Sharath Raghvendra