Evidence map›Paper›PMID 30816195›Full record

ArticleScientific reports2019

Tight clustering for large datasets with an application to gene expression data.

Bikram Karmakar, Sarmistha Das, Sohom Bhattacharya, Rohan Sarkar, Indranil Mukhopadhyay

Abstract read
In one paragraph

Article in Scientific reports, 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. Review
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

5 authors.

Bikram KarmakarDepartment of Statistics, University of Pennsylvania, Philadelphia, PA, USA.
Sarmistha DasHuman Genetics Unit, Indian Statistical Institute, Kolkata, India.
Sohom BhattacharyaHuman Genetics Unit, Indian Statistical Institute, Kolkata, India.
Rohan SarkarHuman Genetics Unit, Indian Statistical Institute, Kolkata, India.
Indranil MukhopadhyayHuman Genetics Unit, Indian Statistical Institute, Kolkata, India. indranil@isical.ac.in.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

This article proposes a practical and scalable version of the tight clustering algorithm. The tight clustering algorithm provides tight and stable relevant clusters as output while leaving a set of points as noise or scattered points, that would not go into any cluster. However, the computational limitation to achieve this precise target of tight clusters prohibits it from being used for large microarray gene expression data or any other large data set, which are common nowadays. We propose a pragmatic and scalable version of the tight clustering method that is applicable to data sets of very large size and deduce the properties of the proposed algorithm. We validate our algorithm with extensive simulation study and multiple real data analyses including analysis of real data on gene expression.

Indexed as

AlgorithmsBig DataDatasets as TopicGene Expression ProfilingCluster AnalysisComputational BiologyOligonucleotide Array Sequence Analysis

Identifiers

PMID30816195
PMCPMC6395712

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.