相关论文: Spatial Clustering Tests Based on Domination Numbe…

We consider two parametrized random digraph families, namely, proportional-edge and central similarity proximity catch digraphs (PCDs) and compare the performance of these two PCD families in testing spatial point patterns. These PCD…

We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test…

We derive the asymptotic distribution of the domination number of a new family of random digraph called proximity catch digraph (PCD), which has application to statistical testing of spatial point patterns and to pattern recognition. The…

We study a new kind of proximity graphs called proportional-edge proximity catch digraphs (PCDs)in a randomized setting. PCDs are a special kind of random catch digraphs that have been developed recently and have applications in statistical…

Priebe et al. (2001) introduced the class cover catch digraphs and computed the distribution of the domination number of such digraphs for one dimensional data. In higher dimensions these calculations are extremely difficult due to the…

We consider a special type of interval catch digraph (ICD) family for one-dimensional data in a randomized setting and propose its use for testing uniformity. These ICDs are defined with an expansion and a centrality parameter, hence we…

We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digraphs (PCDs). A related geometric digraph family, class cover…

For two or more classes of points in $\R^d$ with $d \ge 1$, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect to the points from the other class. The CCCDs were…

Spatial interaction between two or more classes or species has important implications in various fields and causes multivariate patterns such as segregation or association. Segregation occurs when members of a class or species are more…

We propose a graph-based clustering method based on Cluster Catch Digraphs (CCDs) that extends their applicability to moderate-dimensional data settings. Existing CCD variants, such as RK-CCDs, rely on spatial randomness tests based on…

The use of data-random graphs in statistical testing of spatial patterns is introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the points from various classes.…

Proximity catch digraphs (PCDs) are based on proximity maps which yield proximity regions and are special types of proximity graphs. PCDs are based on the relative allocation of points from two or more classes in a region of interest and…

The spatial interaction between two or more classes (or species) has important consequences in many fields and might cause multivariate clustering patterns such as segregation or association. The spatial pattern of segregation occurs when…

The vertex-random graphs called proximity catch digraphs (PCDs) have been introduced recently and have applications in pattern recognition and spatial pattern analysis. A PCD is a random directed graph (i.e., digraph) which is constructed…

We consider the distribution of a graph invariant of central similarity proximity catch digraphs (PCDs) based on one dimensional data. The central similarity PCDs are also a special type of parameterized random digraph family defined with…

Statistical pattern classification methods based on data-random graphs were introduced recently. In this approach, a random directed graph is constructed from the data using the relative positions of the data points from various classes.…

Stochastic Dominance (SD) theory provides a rigorous framework for selecting superior assets tailored to the asset allocation needs of investors with varying risk preferences (i.e., risk-averse, risk-seeking, and risk-neutral). However,…

We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…

We use a geometric digraph family called class cover catch digraphs (CCCDs) to tackle the class imbalance problem in statistical classification. CCCDs provide graph theoretic solutions to the class cover problem and have been employed in…

Proximity maps and regions are defined based on the relative allocation of points from two or more classes in an area of interest and are used to construct random graphs called proximity catch digraphs (PCDs) which have applications in…