Home › Entities › academia › Self-paced Learning for K-means Clustering Algorithm

Self-paced Learning for K-means Clustering Algorithm

Research article (Pattern Recognition Letters, 2018) · cited 54× · AI/ML
CreativeWork academia

Facts

4 properties
Instance of
scholarly article[2]
Publication date
August 23, 2018as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
Pattern Recognition Lettersas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
Self-paced Learning for K-means Clustering Algorithmas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W2888022229as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.1016/J.PATREC.2018.08.028as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded

Report an error or request removal Lineage (PROV-JSON)

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
🔗 Connections
Authored by 3
Cong Lei, Guoqiu Wen, Jiangzhang Gan
← Author of 3
Cong Lei, Guoqiu Wen, Jiangzhang Gan
Press Enter · cited answer in seconds

Summary

Self-paced Learning for K-means Clustering Algorithm is a scholarly article[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Self-paced Learning for K-means Clustering Algorithm. Retrieved October 18, 2026, from https://4ort.xyz/entity/self-paced-learning-for-k-means-clustering-algorithm
MLA “Self-paced Learning for K-means Clustering Algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Oct. 2026, https://4ort.xyz/entity/self-paced-learning-for-k-means-clustering-algorithm.
BibTeX @misc{4ortxyz_self-paced-learning-for-k-means-clustering-algorithm_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Self-paced Learning for K-means Clustering Algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/self-paced-learning-for-k-means-clustering-algorithm}, note = {Accessed: 2026-10-18}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Self-paced Learning for K-means Clustering Algorithm — https://4ort.xyz/entity/self-paced-learning-for-k-means-clustering-algorithm (retrieved 2026-10-18)

Canonical URL: https://4ort.xyz/entity/self-paced-learning-for-k-means-clustering-algorithm · Last refreshed: