中文
相关论文

相关论文: Domination Number of an Interval Catch Digraph Fam…

200 篇论文

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…

组合数学 · 数学 2010-03-30 Elvan Ceyhan

We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points…

统计理论 · 数学 2009-09-17 Elvan Ceyhan

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…

组合数学 · 数学 2008-02-06 E. Ceyhan , C. E. Priebe

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…

统计方法学 · 统计学 2008-02-06 E. Ceyhan , C. E. Priebe

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…

组合数学 · 数学 2015-03-17 Elvan Ceyhan

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…

概率论 · 数学 2008-10-13 Elvan Ceyhan

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…

组合数学 · 数学 2010-10-22 Elvan Ceyhan

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…

统计方法学 · 统计学 2008-02-06 E. Ceyhan , C. E. Priebe , D. J. Marchette

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…

机器学习 · 计算机科学 2017-05-23 Artür Manukyan , Elvan Ceyhan

The concept of domination in graphs plays a central role in understanding structural properties and applications in network theory. In this study, we focus on the paired disjunctive domination number in the context of middle graphs, a…

离散数学 · 计算机科学 2025-12-19 Hande Tuncel Golpek , Zeliha Kartal Yildiz , Aysun Aytac

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.…

统计方法学 · 统计学 2008-02-06 E. Ceyhan , C. E. Priebe , J. C. Wierman

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…

概率论 · 数学 2014-05-29 Elvan Ceyhan

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.…

统计理论 · 数学 2009-07-01 Elvan Ceyhan , Carey E. Priebe , John C. Wierman

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…

机器学习 · 统计学 2019-04-10 Artür Manukyan , Elvan Ceyhan

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.…

统计理论 · 数学 2009-07-01 Elvan Ceyhan

This paper introduces a novel test for conditional stochastic dominance (CSD) at specific values of the conditioning covariates, referred to as target points. The test is relevant for analyzing income inequality, evaluating treatment…

计量经济学 · 经济学 2025-11-20 Federico A. Bugni , Ivan A. Canay , Deborah Kim

ICD coding is a process of assigning the International Classification of Disease diagnosis codes to clinical/medical notes documented by health professionals (e.g. clinicians). This process requires significant human resources, and thus is…

计算与语言 · 计算机科学 2020-07-14 Thanh Vu , Dat Quoc Nguyen , Anthony Nguyen

In this paper, we obtain the exact values of several domination parameters for the direct product of a complete graph with a path or a cycle. Specifically, we determine the domination number, independent domination number,…

组合数学 · 数学 2025-06-16 Deepak M. Bakal , S. A. Mane

International Classification of Diseases(ICD) is an authoritative health care classification system of different diseases and conditions for clinical and management purposes. Considering the complicated and dedicated process to assign…

计算与语言 · 计算机科学 2022-01-13 Haoran Shi , Pengtao Xie , Zhiting Hu , Ming Zhang , Eric P. Xing

This paper continues the results of "Domination Cover Pebbling: Graph Families." An almost sharp bound for the domination cover pebbling (DCP) number for graphs G with specified diameter has been computed. For graphs of diameter two, a…

组合数学 · 数学 2007-05-23 Nathaniel G. Watson , Carl R. Yerger
‹ 上一页 1 2 3 10 下一页 ›