16 citations · 17 across the 3 of their papers we have counts for
3 papers
stat.ML2019
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…
stat.ML2019★ 16 cited
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…
cs.LG2017★ 1 cited
Classification Using Proximity Catch Digraphs (Technical Report)
Artür Manukyan, Elvan Ceyhan
We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digrap…