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:

Towards more efficient local search algorithms for constrained clustering
Jian Gao, Xiaoxia Tao, Shaowei Cai
Information Sciences (2022) Vol. 621, pp. 287-307
Closed Access | Times Cited: 14

Showing 14 citing articles:

A Comprehensive Review of Bio-Inspired Optimization Algorithms Including Applications in Microelectronics and Nanophotonics
Zoran Jakšić, Swagata Devi, Olga Jakšić, et al.
Biomimetics (2023) Vol. 8, Iss. 3, pp. 278-278
Open Access | Times Cited: 38
Quantum and AI-based uncertainties for impact-relation map of multidimensional NFT investment decisions
Hasan Dınçer, Serhat Yüksel, Jaehyung An, et al.
Finance research letters (2024) Vol. 66, pp. 105723-105723
Closed Access | Times Cited: 5
Semi-supervised constrained clustering: an in-depth overview, ranked taxonomy and future research directions
Germán González-Almagro, Daniel Peralta, Eli De Poorter, et al.
Artificial Intelligence Review (2025) Vol. 58, Iss. 5
Open Access
Consumer segmentation with large language models
Yinan Li, Ying Liu, Muran Yu
Journal of Retailing and Consumer Services (2024) Vol. 82, pp. 104078-104078
Closed Access | Times Cited: 3
Synergy between AI and Optical Metasurfaces: A Critical Overview of Recent Advances
Zoran Jakšić
Photonics (2024) Vol. 11, Iss. 5, pp. 442-442
Open Access | Times Cited: 2
Scalable Semi-Supervised Clustering Via Structural Entropy With Different Constraints
Guangjie Zeng, Hao Peng, Angsheng Li, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 37, Iss. 1, pp. 478-492
Closed Access | Times Cited: 2
A Novel Hybrid High-Dimensional PSO Clustering Algorithm Based on the Cloud Model and Entropy
Ren-Long Zhang, Xiaohong Liu
Applied Sciences (2023) Vol. 13, Iss. 3, pp. 1246-1246
Open Access | Times Cited: 4
Semi-supervised clustering with two types of background knowledge: Fusing pairwise constraints and monotonicity constraints
Germán González-Almagro, Pablo Sánchez-Bermejo, Juan Luis Suárez, et al.
Information Fusion (2023) Vol. 102, pp. 102064-102064
Open Access | Times Cited: 3
Semi-supervised classification with pairwise constraints: A case study on animal identification from video
Ludmila I. Kuncheva, José Luis Garrido‐Labrador, Ismael Ramos‐Pérez, et al.
Information Fusion (2023) Vol. 104, pp. 102188-102188
Open Access | Times Cited: 3
A local search algorithm with movement gap and adaptive configuration checking for the maximum weighted s-plex problem
Ruizhi Li, Ruiqi Xu, Fangzhou Wang, et al.
Engineering Applications of Artificial Intelligence (2024) Vol. 133, pp. 108079-108079
Closed Access
Unsupervised Deep Clustering With Hard Balanced Constraint: Application in Disciplinary-Focused Student Section Formation
Siripinyo Chantamunee, Pornpon Thamrongrat, Putthiporn Thanathamathee, et al.
IEEE Access (2024) Vol. 12, pp. 98239-98253
Open Access
Efficient Model for Waste Load and RouteOptimization
Achmad Nopransyah, Tri Basuki Kurniawan, Misinem Misinem, et al.
Journal of Data Sciences (2024) Vol. 2024, Iss. 1
Open Access
Semi-supervised K-Means Clustering via DC Programming Approach
Tatiana V. Gruzdeva, Anton V. Ushakov
Lecture notes in computer science (2023), pp. 54-67
Closed Access
Improving two-mode algorithm via probabilistic selection for solving satisfiability problem
Huimin Fu, Shaowei Cai, Guanfeng Wu, et al.
Information Sciences (2023) Vol. 653, pp. 119751-119751
Closed Access
Page 1

Scroll to top