Ganguly, D. (2018). A Fast Partitional Clustering Algorithm based on Nearest Neighbours Heuristics. Pattern recognition letters, 112, 198-204. https://doi.org/10.1016/j.patrec.2018.07.017
Citace podle Chicago (17th ed.)Ganguly, Debasis. "A Fast Partitional Clustering Algorithm Based on Nearest Neighbours Heuristics." Pattern Recognition Letters 112 (2018): 198-204. https://doi.org/10.1016/j.patrec.2018.07.017.
Citace podle MLA (9th ed.)Ganguly, Debasis. "A Fast Partitional Clustering Algorithm Based on Nearest Neighbours Heuristics." Pattern Recognition Letters, vol. 112, 2018, pp. 198-204, https://doi.org/10.1016/j.patrec.2018.07.017.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..