Biorithm
1.1
|
This class is a subclass of MyOneVersusAllGainAlgo class which implements the GeneMANIA algorithm (Mostafavi, et al, 2008). This algorithm is a ---------- algorithm where the discriminant values of the negative and positive examples are allowed to change throught the running of the algorithm. This version does NOT allow negative examples and the hypothetical bias value is computed as k = n+/n where n+ is the number of positive examples and n is the total number of nodes. More...
#include <gain-algorithm.h>
This class is a subclass of MyOneVersusAllGainAlgo class which implements the GeneMANIA algorithm (Mostafavi, et al, 2008). This algorithm is a ---------- algorithm where the discriminant values of the negative and positive examples are allowed to change throught the running of the algorithm. This version does NOT allow negative examples and the hypothetical bias value is computed as k = n+/n where n+ is the number of positive examples and n is the total number of nodes.
Citation: Mostagavi, S, Ray, D, Warde-Farley, D, Grouios, C, & Morris, Q. (2008). GeneMANIA: a real-time multiple association network integration algorithm for predicting gene function. Genome Biology, 9(S4). Link to Paper: http://www.ncbi.nlm.nih.gov/pubmed/18613948 Full Text: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2447538/?tool=pubmed