forked from ParkerICI/vite
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathget_distances_from_landmarks.Rd
31 lines (27 loc) · 1.46 KB
/
get_distances_from_landmarks.Rd
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/scaffold.R
\name{get_distances_from_landmarks}
\alias{get_distances_from_landmarks}
\title{Calculate (and filter) disatances between cluster and landmark ondes}
\usage{
get_distances_from_landmarks(m, tab, col.names, q.thresh, min.similarity = 0.5)
}
\arguments{
\item{m}{A \code{data.frame} containing expression values for the cluster nodes}
\item{tab}{A \code{data.frame} containing expression values for the landmark nodes}
\item{col.names}{A vector of column names to be used for the computation}
\item{q.thresh}{The quantile probability to be used for filtering edges. The algorithm
will calculate a weight threshold based on this quantile of the weight distribution}
\item{min.similarity}{The minimum similarity value to be used for thresholding edges. Irrespective of
the results of the quantile computation, the actual threshold used will never be less than this value}
}
\value{
Returns a matrix with each row corresponding to a cluster node, and each column
corresponding to the similarity between the cluster node and the respective landmark node. This matrix
can be directly used as an adjacency matrix for graph construction
}
\description{
This function calculates the cosine similarity between the cluster and landmark nodes, and then filters
out the resulting matrix to include only the top-scoring edges. The result of this function can be used
as an adjacency matrix for graph construction
}