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:

Scalable Feature Selection via Distributed Diversity Maximization
Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab Mirrokni, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2017) Vol. 31, Iss. 1
Open Access | Times Cited: 38

Showing 1-25 of 38 citing articles:

Feature Selection: A Data Perspective
Jundong Li, Kewei Cheng, Suhang Wang, et al.
arXiv (Cornell University) (2017) Vol. 50, Iss. 6, pp. 94
Open Access | Times Cited: 857
Feature Selection: A Data Perspective
Jundong Li, Kewei Cheng, Suhang Wang, et al.
arXiv (Cornell University) (2016)
Open Access | Times Cited: 720
Ensembles for feature selection: A review and future trends
Verónica Bolón‐Canedo, Amparo Alonso‐Betanzos
Information Fusion (2018) Vol. 52, pp. 1-12
Open Access | Times Cited: 454
Ensemble Pruning Based on Objection Maximization With a General Distributed Framework
Yijun Bian, Yijun Wang, Yaqiang Yao, et al.
IEEE Transactions on Neural Networks and Learning Systems (2019) Vol. 31, Iss. 9, pp. 3766-3774
Open Access | Times Cited: 43
Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
Allan Borodin, Aadhar Jain, Hyun Chul Lee, et al.
ACM Transactions on Algorithms (2017) Vol. 13, Iss. 3, pp. 1-25
Open Access | Times Cited: 34
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, et al.
Society for Industrial and Applied Mathematics eBooks (2019), pp. 1616-1635
Open Access | Times Cited: 34
Subarchitecture Ensemble Pruning in Neural Architecture Search
Yijun Bian, Qingquan Song, Mengnan Du, et al.
IEEE Transactions on Neural Networks and Learning Systems (2021) Vol. 33, Iss. 12, pp. 7928-7936
Open Access | Times Cited: 17
Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
Chao Qian, Dan-Xuan Liu, Zhi‐Hua Zhou
Artificial Intelligence (2022) Vol. 309, pp. 103737-103737
Open Access | Times Cited: 11
Streaming Algorithms for Diversity Maximization with Fairness Constraints
Yanhao Wang, Francesco Fabbri, Michael Mathioudakis
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 41-53
Open Access | Times Cited: 9
Fair Max–Min Diversity Maximization in Streaming and Sliding-Window Models
Yanhao Wang, Francesco� Fabbri, Michael Mathioudakis, et al.
Entropy (2023) Vol. 25, Iss. 7, pp. 1066-1066
Open Access | Times Cited: 5
A comprehensive ensemble pruning framework based on dual-objective maximization trade-off
Anitha Gopalakrishnan, J. Manickam
Knowledge and Information Systems (2024) Vol. 66, Iss. 9, pp. 5335-5353
Closed Access | Times Cited: 1
Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms
Yanhao Wang, Michael Mathioudakis, Jia Li, et al.
Society for Industrial and Applied Mathematics eBooks (2023), pp. 91-99
Open Access | Times Cited: 4
Diversity Maximization in the Presence of Outliers
Daichi Amagata
Proceedings of the AAAI Conference on Artificial Intelligence (2023) Vol. 37, Iss. 10, pp. 12338-12345
Open Access | Times Cited: 4
Almost Optimal Massively Parallel Algorithms for k-Center Clustering and Diversity Maximization
Alireza Haqi, Hamid Zarrabi-Zadeh
(2023), pp. 239-247
Closed Access | Times Cited: 3
Insights into distributed feature ranking
Verónica Bolón‐Canedo, Konstantinos Sechidis, Noelia Sánchez‐Maroño, et al.
Information Sciences (2018) Vol. 496, pp. 378-398
Open Access | Times Cited: 9
Beyond Submodular Maximization via One-Sided Smoothness
Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd
Society for Industrial and Applied Mathematics eBooks (2021), pp. 1006-1025
Open Access | Times Cited: 7
Metric Sublinear Algorithms via Linear Sampling
Hossein Esfandiari, Michael Mitzenmacher
(2018)
Open Access | Times Cited: 6
Long-range Sequence Modeling with Predictable Sparse Attention
Yimeng Zhuang, Jing Zhang, Mei Tu
Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) (2022), pp. 234-243
Open Access | Times Cited: 4
A Novel Co2-Eor Potential Evaluation Method Based on Bo-Lightgbm Algorithms Using Hybrid Feature Mining
bin shen, Shenglai Yang, Hao Chen, et al.
SSRN Electronic Journal (2022)
Closed Access | Times Cited: 3
A Parameterized Family of Meta-Submodular Functions
Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd
Society for Industrial and Applied Mathematics eBooks (2024), pp. 1278-1306
Open Access
Cost-Efficient Feature Selection for Horizontal Federated Learning
Sourasekhar Banerjee, Devvjiit Bhuyan, Erik Elmroth, et al.
(2024)
Open Access
Max-Min Diversification with Asymmetric Distances
Iiro Kumpulainen, Florian Adriaens, Nikolaj Tatti
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2024), pp. 1440-1450
Open Access
Improving ventilation classification in under-actuated zones: a k-nearest neighbor and data preprocessing approach
Yaddarabullah Yaddarabullah, Aedah Abd Rahman, Amna Saad
Indonesian Journal of Electrical Engineering and Computer Science (2024) Vol. 34, Iss. 1, pp. 233-233
Open Access
Online learning under one sided $$\sigma $$-smooth function
Hongxiang Zhang, Dachuan Xu, Ling Gai, et al.
Journal of Combinatorial Optimization (2024) Vol. 47, Iss. 5
Closed Access
Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement)
Alessandro Epasto, Vahab Mirrokni, Morteza Zadimoghaddam
(2019), pp. 41-42
Closed Access | Times Cited: 3
Page 1 - Next Page

Scroll to top