graph.kd: Find weights based on kernel density on the graph.

In qsz13/LAS-release: Find LA-scouting genes

Description

There are three common ways to invoke graph.kd:

• graph.kd(relate_matrix, graph, smoothing.normalize=c('one'))

• graph.kd(relate_matrix, graph, smoothing.normalize=c('squareM'))

• graph.kd(relate_matrix, graph, smoothing.normalize=c('none'))

The first method is used when the total weight of all genes z is set to 'one'. In this way, those genes surrounded by more genes z will not take advantages over those surrounded by fewer genes. In contrast, the second method takes the number of genes around into consideration, the result of the first method will multiply the square of the number of genes around. The third method does not normalize the data. Thus genes with more neighbors are more likely to receive higher weights.

Usage

graph.kd(relate.matrix, network.graph, smoothing.normalize = c("one",
  "squareM", "none"))

Arguments

relate.matrix	The matrix returned by lascouting.
network.graph	The igraph object representing the gene network.
smoothing.normalize	Different ways to normalize the result.

Value

A matrix representing the weights calculated using kernel density for each gene. Each row is an ego gene, columns are the weights of potential scouting genes for the gene.

qsz13/LAS-release documentation built on May 26, 2019, 12:35 p.m.