TY - JOUR AU - Ranola, John Michael AU - Langfelder, Peter AU - Lange, Kenneth AU - Horvath, Steve PY - 2013 DA - 2013/03/14 TI - Cluster and propensity based approximation of a network JO - BMC Systems Biology SP - 21 VL - 7 IS - 1 AB - The models in this article generalize current models for both correlation networks and multigraph networks. Correlation networks are widely applied in genomics research. In contrast to general networks, it is straightforward to test the statistical significance of an edge in a correlation network. It is also easy to decompose the underlying correlation matrix and generate informative network statistics such as the module eigenvector. However, correlation networks only capture the connections between numeric variables. An open question is whether one can find suitable decompositions of the similarity measures employed in constructing general networks. Multigraph networks are attractive because they support likelihood based inference. Unfortunately, it is unclear how to adjust current statistical methods to detect the clusters inherent in many data sets. SN - 1752-0509 UR - https://doi.org/10.1186/1752-0509-7-21 DO - 10.1186/1752-0509-7-21 ID - Ranola2013 ER -