Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

VIASCKDE Index: A Novel Internal Cluster Validity Index for Arbitrary-Shaped Clusters Based on the Kernel Density Estimation
Ali Şenol
Computational Intelligence and Neuroscience (2022) Vol. 2022, pp. 1-20
Open Access | Times Cited: 12

Showing 12 citing articles:

Determining the optimal number of clusters by Enhanced Gap Statistic in K-mean algorithm
Iliyas Karim Khan, Hanita Daud, Nooraini Binti Zainuddin, et al.
Egyptian Informatics Journal (2024) Vol. 27, pp. 100504-100504
Open Access | Times Cited: 5
From A-to-Z Review of Clustering Validation Indices
Bryar A. Hassan, Noor Bahjat Tayfor, Alla Ahmad Hassan, et al.
Neurocomputing (2024) Vol. 601, pp. 128198-128198
Closed Access | Times Cited: 5
A new hybrid feature reduction method by using MCMSTClustering algorithm with various feature projection methods: a case study on sleep disorder diagnosis
Ali Şenol, Tarık Talan, Cemal Aktürk
Signal Image and Video Processing (2024) Vol. 18, Iss. 5, pp. 4589-4603
Closed Access | Times Cited: 3
MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters
Ali Şenol
Neural Computing and Applications (2023) Vol. 35, Iss. 18, pp. 13239-13259
Closed Access | Times Cited: 7
ImpKmeans: An Improved Version of the K-Means Algorithm, by Determining Optimum Initial Centroids, based on Multivariate Kernel Density Estimation and Kd-Tree
Ali Şenol
Acta Polytechnica Hungarica (2023) Vol. 21, Iss. 2, pp. 111-131
Open Access | Times Cited: 6
A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering
Alokananda Dey, Siddhartha Bhattacharyya, Sandip Dey, et al.
Mathematics (2023) Vol. 11, Iss. 9, pp. 2018-2018
Open Access | Times Cited: 5
Clustering with Neural Network and Index
Gangli Liu
(2022)
Open Access | Times Cited: 3
SD-CSMOTE: Over-sampling method based on SNN-DPC and improved SMOTE
He Ma, Xu Zhang, Mei Song, et al.
Neurocomputing (2024), pp. 129233-129233
Closed Access
The Skyline Operator to Find the Needle in the Haystack for Automated Clustering
Georg Stefan Schlake, Christian Beecks
2021 IEEE International Conference on Big Data (Big Data) (2024), pp. 6117-6122
Closed Access
Automated Exploratory Clustering
Georg Stefan Schlake, Max Pernklau, Christian Beecks
2021 IEEE International Conference on Big Data (Big Data) (2024), pp. 5711-5720
Closed Access
Min-Max-Jump distance and its applications
Gangli Liu
(2023)
Open Access | Times Cited: 1
New classes of density estimates of low bias
Christopher S. Withers, Saralees Nadarajah
Journal of Computational and Applied Mathematics (2023) Vol. 429, pp. 115232-115232
Closed Access
Page 1

Scroll to top