Evidence map›Paper›PMID 37021920›Full record

ArticleIEEE transactions on pattern analysis and machine intelligence2023

Transforming Complex Problems Into K-Means Solutions.

Hongfu Liu, Junxiang Chen, Jennifer Dy, Yun Fu

Abstract read
In one paragraph

Article in IEEE transactions on pattern analysis and machine intelligence, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.

0numbers the graph read from it
0cells of the map it votes in
12citing 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

12 citing papers in PubMed.

  1. Label-free optical biomarker for prostate cancer diagnosis.Molecular medicine (Cambridge, Mass.) · 2026
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Observational
  8. Article
  9. Article
  10. Article
  11. Article
  12. Observational
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.

Hongfu Liu
Junxiang Chen
Jennifer Dy
Yun Fu

Funding

Genetic Epidemiology of COPDU01HL089856 · NHLBI · BRIGHAM AND WOMEN'S HOSPITAL · PI SILVERMAN, EDWIN K · 2007 to 2021
$20.7M
NHLBI NIH HHS U01 HL089856
6 · The paper itself

Abstract

K-means is a fundamental clustering algorithm widely used in both academic and industrial applications. Its popularity can be attributed to its simplicity and efficiency. Studies show the equivalence of K-means to principal component analysis, non-negative matrix factorization, and spectral clustering. However, these studies focus on standard K-means with squared euclidean distance. In this review paper, we unify the available approaches in generalizing K-means to solve challenging and complex problems. We show that these generalizations can be seen from four aspects: data representation, distance measure, label assignment, and centroid updating. As concrete applications of transforming problems into modified K-means formulation, we review the following applications: iterative subspace projection and clustering, consensus clustering, constrained clustering, domain adaptation, and outlier detection.

Identifiers

PMID37021920
PMCPMC10332815

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.