Evidence map›Paper›PMID 30101356›Full record

ArticleBioinformatics (Oxford, England)2019

Clustering of temporal gene expression data with mixtures of mixed effects models with a penalized likelihood.

Darlene Lu, Yorghos Tripodis, Louis C Gerstenfeld, Serkalem Demissie

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Darlene LuBiostatistics, Boston University, Boston, MA, USA.
Yorghos TripodisBiostatistics, Boston University, Boston, MA, USA.
Louis C GerstenfeldOrthopaedic Surgery, Boston University, Boston, MA, USA.
Serkalem DemissieBiostatistics, Boston University, Boston, MA, USA.

Funding

Project-005UL1TR001430 · NCATS · BOSTON UNIVERSITY MEDICAL CAMPUS · PI BAIR-MERRITT, MEGAN H, CENTER, DAVID M. · 2015 to 2024
$52.3M
A Systems Genetics Approach to Fracture HealingR01AR059741 · NIAMS · BOSTON UNIVERSITY MEDICAL CAMPUS · PI GERSTENFELD, LOUIS CHARLES · 2012 to 2016
$1.8M
NCATS NIH HHS UL1 TR001430NIAMS NIH HHS R01 AR059741
6 · The paper itself

Abstract

motivationClustering algorithms like K-Means and standard Gaussian mixture models (GMM) fail to account for the structure of variability of replicated data or repeated measures over time. Additionally, a priori cluster number assumptions add an additional complexity to the process. Current methods to optimize cluster labels and number can be inaccurate or computationally intensive for temporal gene expression data with this additional variability.

resultsAn extension to a model-based clustering algorithm is proposed using mixtures of mixed effects polynomial regression models and the EM algorithm with an entropy penalized log-likelihood function (EPEM). The EPEM is used to cluster temporal gene expression data with this additional variability. The addition of random effects in our model decreased the misclassification error when compared to mixtures of fixed effects models or other methods such as K-Means and GMM. Applying our method to microarray data from a fracture healing study revealed distinct temporal patterns of gene expression. AVAILABILITY AND IMPLEMENTATION: https://github.com/darlenelu72/EPEM-GMM. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

AlgorithmsCluster AnalysisGene Expression ProfilingLikelihood FunctionsModels, StatisticalNormal Distribution

Identifiers

PMID30101356
PMCPMC6394398

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.