1 citations · 1 across the 4 of their papers we have counts for
4 papers
Relative Density of the Random -Factor Proximity Catch Digraph for Testing Spatial Patterns of Segregation and Association
E. Ceyhan, C. E. Priebe, J. C. Wierman
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 re…
On the Distribution of the Domination Number of a New Family of Parametrized Random Digraphs
E. Ceyhan, C. E. Priebe
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…
A New Family of Random Graphs for Testing Spatial Segregation
E. Ceyhan, C. E. Priebe, D. J. Marchette
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 statisti…
Photometric Redshift Estimation on SDSS Data Using Random Forests
Samuel Carliles, Tamás Budavári, Sebastien Heinis +2
Given multiband photometric data from the SDSS DR6, we estimate galaxy redshifts. We employ a Random Forest trained on color features and spectroscopic redshifts from 80,000 random…