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:

Improved PSO-based feature construction algorithm using Feature Selection Methods
Afsaneh Mahanipour, Hossein Nezamabadi‐pour
(2017), pp. 1-5
Closed Access | Times Cited: 15

Showing 15 citing articles:

A novel chaotic salp swarm algorithm for global optimization and feature selection
Gehad Ismail Sayed, Ghada Khoriba, Mohamed H. Haggag
Applied Intelligence (2018) Vol. 48, Iss. 10, pp. 3462-3481
Closed Access | Times Cited: 389

Automatic design of machine learning via evolutionary computation: A survey
Nan Li, Lianbo Ma, Tiejun Xing, et al.
Applied Soft Computing (2023) Vol. 143, pp. 110412-110412
Closed Access | Times Cited: 27

Machine Learning Methods for Quality Prediction in Production
Sidharth Sankhye, Guiping Hu
Logistics (2020) Vol. 4, Iss. 4, pp. 35-35
Open Access | Times Cited: 24

GSP: an automatic programming technique with gravitational search algorithm
Afsaneh Mahanipour, Hossein Nezamabadi‐pour
Applied Intelligence (2018) Vol. 49, Iss. 4, pp. 1502-1516
Closed Access | Times Cited: 17

A multiple feature construction method based on gravitational search algorithm
Afsaneh Mahanipour, Hossein Nezamabadi‐pour
Expert Systems with Applications (2019) Vol. 127, pp. 199-209
Closed Access | Times Cited: 15

Loan Default Prediction Model Improvement through Comprehensive Preprocessing and Features Selection
Ahmad Al–Qerem, Ghazi Al‐Naymat, Mays Alhasan
2022 International Arab Conference on Information Technology (ACIT) (2019), pp. 235-240
Closed Access | Times Cited: 14

Using fuzzy-rough set feature selection for feature construction based on genetic programming
Afsaneh Mahanipour, Hossein Nezamabadi‐pour, Bahareh Nikpour
(2018), pp. 1-6
Closed Access | Times Cited: 12

Recent Developments on Evolutionary Computation Techniques to Feature Construction
Idheba Mohamad Ali O. Swesi, Azuraliza Abu Bakar
Studies in computational intelligence (2019), pp. 109-122
Open Access | Times Cited: 7

FEATURE CLUSTERING FOR PSO-BASED FEATURE CONSTRUCTION ON HIGH-DIMENSIONAL DATA
Idheba Mohamad Ali O. Swesi, Azuraliza Abu Bakar
Journal of Information and Communication Technology (2019) Vol. 18
Open Access | Times Cited: 7

Default Prediction Model: The Significant Role of Data Engineering in the Quality of Outcomes
Ahmad Al–Qerem, Ghazi Al‐Naymat, Mays Alhasan, et al.
The International Arab Journal of Information Technology (2020) Vol. 17, Iss. 4A, pp. 635-644
Open Access | Times Cited: 4

Prediction of quality in production using optimized Hyper-parameter tuning based deep learning model
G. Rajendra Kannammal, P. Sivamalar, P. Santhi, et al.
Materials Today Proceedings (2022) Vol. 69, pp. 703-709
Closed Access | Times Cited: 3

RAPID PSO BASED FEATURES SELECTION FOR CLASSIFICATION
Surendra Kumar
International Journal of Advanced Research in Computer Science (2017) Vol. 8, Iss. 9, pp. 682-690
Open Access | Times Cited: 3

Feature Selection using Grey Wolf Optimization Algorithm on Light Gradient Boosting Machine
Felix Indra Kurniadi, Ajeng Wulandari, Samsul Arifin
(2023), pp. 795-799
Closed Access | Times Cited: 1

Reactive search-MST optimized clustering-based feature selection
A. Kaleemullah, A. Suresh
International Journal of Financial Engineering (2022) Vol. 09, Iss. 03
Closed Access | Times Cited: 2

Multiple Kernel Based Remote Sensing Vegetation Classifier with Levy Optimized Subspace
V. Priya, D. Ramyachitra
Wireless Personal Communications (2019) Vol. 111, Iss. 1, pp. 357-374
Closed Access

Page 1

Scroll to top