Evidence map›Paper›PMID 33664558›Full record

ArticleIEEE transactions on signal processing : a publication of the IEEE Signal Processing Society2019

Clustering of Data with Missing Entries using Non-convex Fusion Penalties.

Sunrita Poddar, Mathews Jacob

Abstract read
In one paragraph

Article in IEEE transactions on signal processing : a publication of the IEEE Signal Processing Society, 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

2 authors.

Sunrita PoddarDepartment of Electrical and Computer Engineering, University of Iowa, Iowa City, IA, 52246.
Mathews JacobDepartment of Electrical and Computer Engineering, University of Iowa, Iowa City, IA, 52246.

Funding

Novel Computational Framework for Free-Breathing & Ungated Dynamic MRIR01EB019961 · NIBIB · UNIVERSITY OF VIRGINIA · PI Mathews Jacob · 2016 to 2026
$4.0M
NIBIB NIH HHS R01 EB019961
6 · The paper itself

Abstract

The presence of missing entries in data often creates challenges for pattern recognition algorithms. Traditional algorithms for clustering data assume that all the feature values are known for every data point. We propose a method to cluster data in the presence of missing information. Unlike conventional clustering techniques where every feature is known for each point, our algorithm can handle cases where a few feature values are unknown for every point. For this more challenging problem, we provide theoretical guarantees for clustering using a

Identifiers

PMID33664558
PMCPMC7929088

What OpenQuestion holds

Textmetadata
LicenceTDM
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.