Description Usage Arguments Details Value Author(s) References See Also Examples
Use the EM algorithm (Dempster et al., 1977) to cluster segmentation scores into various groups.
1 |
Object |
An object of class clusteringCNVs. |
... |
Further arguments. |
Users can set limits of segmentation scores: values being smaller than the left limit will be assigned to the smallest group and values being larger than righ limit will be assigned to the largest group.
allGroups |
Samples and their corresponding groups |
means |
Means of groups. |
sigma |
Variances of groups. |
p |
Proportions of groups in all data set. |
loglk |
Value of loglikehood function. |
Hoang Tan Nguyen, Tony R Merriman and MA Black. hoangtannguyenvn@gmail.com
Dempster, A. P., Laird, N. M., Rubin, D. B., 1977. Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 1-38.
1 2 3 4 5 6 7 | data("fcgr3bMXL")
#resultSegment <- segmentSamples(Object = objectCNVrd2, stdCntMatrix = readCountMatrix)
objectCluster <- new("clusteringCNVs",
x = resultSegment$segmentationScores[, 1], k = 4, EV = TRUE)
#searchGroupCNVs(Object = objectCluster)
copynumberGroups <- groupCNVs(Object = objectCluster)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.