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:

Time Complexity of Decision Trees
Mikhail Moshkov
Lecture notes in computer science (2005), pp. 244-459
Closed Access | Times Cited: 93

Showing 26-50 of 93 citing articles:

Selected Data Mining Tools for Data Analysis in Distributed Environment
Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh
Entropy (2022) Vol. 24, Iss. 10, pp. 1401-1401
Open Access | Times Cited: 6
Optimization of Decision Trees with Hypotheses for Knowledge Representation
Mohammad Azad, Igor Chikalov, Shahid Hussain, et al.
Electronics (2021) Vol. 10, Iss. 13, pp. 1580-1580
Open Access | Times Cited: 8
Representation of Knowledge by Decision Trees for Decision Tables with Multiple Decisions
Mohammad Azad, Igor Chikalov, Mikhail Moshkov
Procedia Computer Science (2020) Vol. 176, pp. 653-659
Open Access | Times Cited: 7
Machine Learning in Physical Verification, Mask Synthesis, and Physical Design
Yibo Lin, David Z. Pan
Springer eBooks (2019), pp. 95-115
Closed Access | Times Cited: 6
Decision Rules Derived from Optimal Decision Trees with Hypotheses
Mohammad Azad, Igor Chikalov, Shahid Hussain, et al.
Entropy (2021) Vol. 23, Iss. 12, pp. 1641-1641
Open Access | Times Cited: 6
Learning Decision Rules from Sets of Decision Trees
Mikhail Moshkov, Beata Zielosko, Evans Teiko Tetteh, et al.
Proceedings of the International Conference on Information Systems Development (2022)
Open Access | Times Cited: 4
Safeguarding against Cyber Threats: Machine Learning-Based Approaches for Real-Time Fraud Detection and Prevention
Vikas R. Shetty, R. Pooja, Rashmi Laxmikant Malghan
(2023), pp. 111-111
Open Access | Times Cited: 2
Diagnosis of constant faults in iteration-free circuits over monotone basis
Saad Alrawaf, Igor Chikalov, Shahid Hussain, et al.
Discrete Applied Mathematics (2013) Vol. 166, pp. 287-291
Open Access | Times Cited: 5
Comparison of Greedy Algorithms for Decision Tree Optimization
Abdulaziz Alkhalid, Igor Chikalov, Mikhail Moshkov
Intelligent systems reference library (2012), pp. 21-40
Closed Access | Times Cited: 4
Decision trees for knowledge representation
Mohammad Azad, Igor Chikalov, Mikhail Moshkov
(2019)
Closed Access | Times Cited: 4
Diagnosis of constant faults in read-once contact networks over finite bases
Monther Busbait, Igor Chikalov, Shahid Hussain, et al.
Discrete Applied Mathematics (2014) Vol. 184, pp. 76-88
Open Access | Times Cited: 3
Total Path Length and Number of Terminal Nodes for Decision Trees
Shahid Hussain
Procedia Computer Science (2014) Vol. 35, pp. 514-521
Open Access | Times Cited: 3
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees. Global Approach
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov
Studies in big data (2024), pp. 61-87
Closed Access
Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov
Studies in big data (2024), pp. 161-183
Closed Access
Complexity of Deterministic and Nondeterministic Decision Trees for Decision Tables with Many-Valued Decisions from Closed Classes
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov
Studies in big data (2024), pp. 133-159
Closed Access
Introduction
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov
Studies in big data (2024), pp. 1-22
Closed Access
Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables with 0-1-Decisions from Closed Classes
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov
Studies in big data (2024), pp. 185-209
Closed Access
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov
Studies in big data (2024), pp. 109-132
Closed Access
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees. Local Approach
Kerven Durdymyradov, Mikhail Moshkov, Azimkhon Ostonov
Studies in big data (2024), pp. 89-105
Closed Access
On the depth of decision trees over infinite 1-homogeneous binary information systems
Mikhail Moshkov
Array (2021) Vol. 10, pp. 100060-100060
Open Access | Times Cited: 4
Experimental Study of Totally Optimal Decision Trees
Abdulla Aldilaijan, Mohammad Azad, Mikhail Moshkov
Fundamenta Informaticae (2019) Vol. 165, Iss. 3-4, pp. 245-261
Closed Access | Times Cited: 3
Diagnosis of three types of constant faults in read-once contact networks over finite bases
Monther Busbait, Mikhail Moshkov
Theoretical Computer Science (2016) Vol. 630, pp. 26-42
Open Access | Times Cited: 2
On Complexity of Deterministic and Nondeterministic Decision Trees Fordecision Tables from Closed Classes
Azimkhon Ostonov, Mikhail Moshkov
(2023)
Closed Access | Times Cited: 1
Time and Space Complexity of Deterministic and Nondeterministic Decision Trees: Local Approach
Kerven Durdymyradov, Mikhail Moshkov
2021 IEEE International Conference on Big Data (Big Data) (2023), pp. 6040-6045
Closed Access | Times Cited: 1
Knowledge Representation Using Decision Trees Constructed Based on Binary Splits
Mohammad Azad
KSII Transactions on Internet and Information Systems (2020) Vol. 14, Iss. 10
Open Access | Times Cited: 3

Scroll to top