16 citations · 69 across the 38 of their papers we have counts for
39 papers
Clustering with Uniformity- and Neighbor-Based Random Geometric Graphs
Rui Shi, Elvan Ceyhan, Nedret Billor
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, suc…
Outlyingness Scores with Cluster Catch Digraphs
Rui Shi, Elvan Ceyhan, Nedret Billor
This paper introduces two novel, outlyingness scores (OSs) based on Cluster Catch Digraphs (CCDs): Outbound Outlyingness Score (OOS) and Inbound Outlyingness Score (IOS). These sco…
Modeling Home Range and Intra-Specific Spatial Interaction in Wild Animal Populations
Fekadu L. Bayisa, Christopher L. Seals, Hannah J. Leeper +2
Interactions among individuals from the same-species of wild animals are an important component of population dynamics. An interaction can be either static (based on overlap of spa…
Outlier Detection with Cluster Catch Digraphs
Rui Shi, Nedret Billor, Elvan Ceyhan
This paper introduces a novel family of outlier detection algorithms based on Cluster Catch Digraphs (CCDs), specifically tailored to address the challenges of high dimensionality…
Parameter Free Clustering with Cluster Catch Digraphs (Technical Report)
Artür Manukyan, Elvan Ceyhan
We propose clustering algorithms based on a recently developed geometric digraph family called cluster catch digraphs (CCDs). These digraphs are used to devise clustering methods t…
Classification of Imbalanced Data with a Geometric Digraph Family
Artür Manukyan, Elvan Ceyhan
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 solut…