Home ›
Entities
› academia
› Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data
Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data
Research article (Evolving Systems, 2022) · cited 15× · AI/ML
Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data
Summary
Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data is a scholarly article[1].
Key Facts
Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
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.
APA4ort.xyz Knowledge Graph. (2026). Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data. Retrieved May 24, 2026, from https://4ort.xyz/entity/min-max-kurtosis-distance-based-improved-initial-centroid-selection-approach-of-k-means-clustering-for-big-data-mining-o
MLA“Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/min-max-kurtosis-distance-based-improved-initial-centroid-selection-approach-of-k-means-clustering-for-big-data-mining-o.
BibTeX@misc{4ortxyz_min-max-kurtosis-distance-based-improved-initial-centroid-selection-approach-of-k-means-clustering-for-big-data-mining-o_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data}}, year = {2026}, url = {https://4ort.xyz/entity/min-max-kurtosis-distance-based-improved-initial-centroid-selection-approach-of-k-means-clustering-for-big-data-mining-o}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Min max kurtosis distance based improved initial centroid selection approach of K-means clustering for big data mining on gene expression data — https://4ort.xyz/entity/min-max-kurtosis-distance-based-improved-initial-centroid-selection-approach-of-k-means-clustering-for-big-data-mining-o (retrieved 2026-05-24)
