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 1-25 of 93 citing articles:

Rudiments of rough sets
Zdzisław Pawlak, Andrzej Skowron
Information Sciences (2006) Vol. 177, Iss. 1, pp. 3-27
Closed Access | Times Cited: 2027
Machine learning in absorption-based post-combustion carbon capture systems: A state-of-the-art review
Milad Hosseinpour, Mohammad Javad Shojaei, Mohsen Salimi, et al.
Fuel (2023) Vol. 353, pp. 129265-129265
Open Access | Times Cited: 27
Bounds on depth of decision trees derived from decision rule systems with discrete attributes
Kerven Durdymyradov, Mikhail Moshkov
Annals of Mathematics and Artificial Intelligence (2024) Vol. 92, Iss. 3, pp. 703-732
Closed Access | Times Cited: 5
Comparative Analysis of Deterministic and Nondeterministic Decision Trees for Decision Tables from Closed Classes
Azimkhon Ostonov, Mikhail Moshkov
Entropy (2024) Vol. 26, Iss. 6, pp. 519-519
Open Access | Times Cited: 3
On the relation between rough set reducts and typical testors
Manuel S. Lazo-Cortés, José Fco. Martínez-Trinidad, Jesús Ariel Carrasco-Ochoa, et al.
Information Sciences (2014) Vol. 294, pp. 152-163
Closed Access | Times Cited: 30
Closed Classes of Boolean Functions
Mikhail Moshkov
Intelligent systems reference library (2020), pp. 93-103
Closed Access | Times Cited: 18
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses
Mohammad Azad, Igor Chikalov, Shahid Hussain, et al.
Entropy (2021) Vol. 23, Iss. 7, pp. 808-808
Open Access | Times Cited: 16
Optimization and analysis of decision trees and rules: dynamic programming approach
Abdulaziz Alkhalid, Talha Amin, Igor Chikalov, et al.
International Journal of General Systems (2013) Vol. 42, Iss. 6, pp. 614-634
Closed Access | Times Cited: 22
On Complexity of Deterministic and Nondeterministic Decision Trees for Conventional Decision Tables from Closed Classes
Azimkhon Ostonov, Mikhail Moshkov
Entropy (2023) Vol. 25, Iss. 10, pp. 1411-1411
Open Access | Times Cited: 5
Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes
Azimkhon Ostonov, Mikhail Moshkov
(2023)
Closed Access | Times Cited: 5
Bi-criteria optimization of decision trees with applications to data analysis
Igor Chikalov, Shahid Hussain, Mikhail Moshkov
European Journal of Operational Research (2017) Vol. 266, Iss. 2, pp. 689-701
Closed Access | Times Cited: 18
On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems
В. А. Бондаренко, Andrei V. Nikolaev
International Journal of Mathematics and Mathematical Sciences (2016) Vol. 2016, pp. 1-6
Open Access | Times Cited: 16
Extensions of Dynamic Programming as a New Tool for Decision Tree Optimization
Abdulaziz Alkhalid, Igor Chikalov, Shahid Hussain, et al.
Smart innovation, systems and technologies (2012), pp. 11-29
Closed Access | Times Cited: 16
Totally optimal decision trees for Boolean functions
Igor Chikalov, Shahid Hussain, Mikhail Moshkov
Discrete Applied Mathematics (2016) Vol. 215, pp. 1-13
Open Access | Times Cited: 14
Experience classification for transfer learning in traffic signal control
Mojtaba Norouzi, Monireh Abdoos, Ana L. C. Bazzan
The Journal of Supercomputing (2020) Vol. 77, Iss. 1, pp. 780-795
Closed Access | Times Cited: 14
Simulating Functioning of Decision Trees for Tasks on Decision Rule Systems
Kerven Durdymyradov, Mikhail Moshkov
Lecture notes in computer science (2024), pp. 188-200
Closed Access | Times Cited: 1
Modeling the Functioning of Decision Trees Based on Decision Rule Systems by Greedy Algorithm
Kerven Durdymyradov, Mikhail Moshkov
Lecture notes in computer science (2024), pp. 153-162
Closed Access | Times Cited: 1
Average Time Complexity of Decision Trees
Igor Chikalov
Intelligent systems reference library (2011)
Closed Access | Times Cited: 15
Combinatorial and geometric properties of the Max-Cut and Min-Cut problems
В. А. Бондаренко, Andrei V. Nikolaev
Doklady Mathematics (2013) Vol. 88, Iss. 2, pp. 516-517
Closed Access | Times Cited: 14
Decision Trees for Binary Subword-Closed Languages
Mikhail Moshkov
Entropy (2023) Vol. 25, Iss. 2, pp. 349-349
Open Access | Times Cited: 4
Decision Trees and Flow Graphs
Zdzisław Pawlak
Lecture notes in computer science (2006), pp. 1-11
Closed Access | Times Cited: 19
Relationships Among Various Parameters for Decision Tree Optimization
Shahid Hussain
Studies in computational intelligence (2013), pp. 393-410
Closed Access | Times Cited: 12
Decision trees with minimum average depth for sorting eight elements
Hassan AbouEisha, Igor Chikalov, Mikhail Moshkov
Discrete Applied Mathematics (2015) Vol. 204, pp. 203-207
Closed Access | Times Cited: 10
A Bi-criteria Optimization Model for Adjusting the Decision Tree Parameters
Mohammad Azad, Mikhail Moshkov
Kuwait Journal of Science (2021)
Open Access | Times Cited: 10
On the Depth of Decision Trees with Hypotheses
Mikhail Moshkov
Entropy (2022) Vol. 24, Iss. 1, pp. 116-116
Open Access | Times Cited: 7
Page 1 - Next Page

Scroll to top