pknnCMA-methods: Probabilistic nearest neighbours

In CMA: Synthesis of microarray-based classification

Description

Nearest neighbour variant that replaces the simple voting scheme by a weighted one (based on euclidean distances). This is also used to compute class probabilities.

Methods

X = "matrix", y = "numeric", f = "missing"

signature 1

X = "matrix", y = "factor", f = "missing"

signature 2

X = "data.frame", y = "missing", f = "formula"

signature 3

X = "ExpressionSet", y = "character", f = "missing"

signature 4

For further argument and output information, consult pknnCMA.

CMA documentation built on Nov. 8, 2020, 5:02 p.m.