cccd: Class Cover Catch Digraph

Description

Constructs a class cover catch digraph from points or interpoint distance matrices.

Usage

cccd(x = NULL, y = NULL, dxx = NULL, dyx = NULL, p = 2, d = 2)
cccd.rw(x=NULL,y=NULL,dxx=NULL,dyx=NULL,p=2,d=2,m=1)
cccd.classifier(x,y)
cccd.classify(data, C)
cccd.classifier.rw(x,y,m=1,d=2)
cccd.multiclass.classifier(data, classes)
cccd.multiclass.classify(data,C)

Arguments

x,y

the target class and non-target class points. Either x,y or dxx,dyx must be provided.

dxx,dyx

interpoint distances (x against x and y against x). If these are not provided they are computed using x and y.

p in the $L_p$ distance, if dxx or dyx are missing.

dimension of the data.

slope of the null hypothesis curve

data

data to be classified

classes

class labels of the data

cccd object

Value

an object of class igraph. In addition, it contains the attributes:
Ra vector of radii.
Ythe y vectors.
layoutthe x vectors.

Details

The class cover catch digraph is a graph with vertices defined by the points of x and edges defined according to the balls $B(x,d(x,Y))$. There is an edge between vertices $x_1,x_2$ if $x_2\in B(x_1,d(x_1,Y))$.

References

D.J. Marchette, "Class Cover Catch Digraphs", Wiley Interdisciplinary Reviews: Computational Statistics, 2, 171-177, 2010.

D.J. Marchette, Random Graphs for Statistical Pattern Recognition, John Wiley & Sons, 2004.

C.E. Priebe, D.J. Marchette, J. DeVinney and D. Socolinsky, "Classification Using Class Cover Catch Digraphs", Journal of Classification, 20, 3-23, 2003.