On the public citation graph
Entropy-Based Greedy Algorithm for Decision Trees Using Hypotheses
0 signed · 32 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11427834_12openalex-snapshot
Time Complexity of Decision Trees
inferredcites →https://doi.org/10.1007/978-3-030-12854-8openalex-snapshot
Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions
inferredcites →https://doi.org/10.1007/978-3-030-87334-9_11openalex-snapshot
Minimizing Depth of Decision Trees with Hypotheses
inferredcites →https://doi.org/10.1007/978-3-319-91839-6openalex-snapshot
Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining
inferredcites →https://doi.org/10.1109/tsmcc.2004.843247openalex-snapshot
Top-Down Induction of Decision Trees Classifiers—A Survey
inferredcites →https://doi.org/10.1142/9789812771728openalex-snapshot
Data Mining with Decision Trees - Theory and Applications
inferredcites →https://doi.org/10.1609/aaai.v33i01.33011624openalex-snapshot
Learning Optimal Classification Trees Using a Binary Linear Program Formulation
inferredcites →https://doi.org/10.1609/aaai.v34i04.5711openalex-snapshot
Learning Optimal Decision Trees Using Caching Branch-and-Bound Search
inferredcites →https://doi.org/10.24963/ijcai.2018/189openalex-snapshot
Learning Optimal Decision Trees with SAT
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-08585-7_5openalex-snapshot
Greedy Algorithms for Construction of Decision Trees with Hypotheses
inferred← citeshttps://doi.org/10.1016/j.energy.2023.128286openalex-snapshot
Research on fault diagnosis of supercharged boiler with limited data based on few-shot learning
inferred← citeshttps://doi.org/10.1016/j.ijepes.2026.111705openalex-snapshot
Quantifying stator winding fault severity in induction motors: A machine learning approach with spectral feature extraction
inferred← citeshttps://doi.org/10.1080/08839514.2022.2071406openalex-snapshot
Enhanced Model for Predicting Student Dropouts in Developing Countries Using Automated Machine Learning Approach: A Case of Tanzanian’s Secondary Schools
inferred← citeshttps://doi.org/10.1080/08839514.2022.2145632openalex-snapshot
Comparative Study of AutoML Approach, Conventional Ensemble Learning Method, and KNearest Oracle-AutoML Model for Predicting Student Dropouts in Sub-Saharan African Countries
inferred← citeshttps://doi.org/10.1108/rjta-12-2025-0278openalex-snapshot
A decision support framework for garment fit prediction: standardizing fabric mechanical properties in 3D virtual prototyping
inferred← citeshttps://doi.org/10.18494/sam4836openalex-snapshot
Analysis of Campus Catering Data Based on Machine Learning
inferred← citeshttps://doi.org/10.3389/fphy.2023.1179868openalex-snapshot
RETRACTED: Cost-sensitive classification algorithm combining the Bayesian algorithm and quantum decision tree
inferred← citeshttps://doi.org/10.3390/e23121641openalex-snapshot
Decision Rules Derived from Optimal Decision Trees with Hypotheses
inferred← citeshttps://doi.org/10.3390/e24010116openalex-snapshot
On the Depth of Decision Trees with Hypotheses
inferred← citeshttps://doi.org/10.3390/e24050617openalex-snapshot
Random RotBoost: An Ensemble Classification Method Based on Rotation Forest and AdaBoost in Random Subsets and Its Application to Clinical Decision Support
inferred← citeshttps://doi.org/10.3390/e25040547openalex-snapshot
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
inferred← citeshttps://doi.org/10.3390/en15249456openalex-snapshot
Towards Sustainable Transport: Techno-Economic Analysis of Investing in Hydrogen Buses in Public Transport in the Selected City of Poland
inferred← citeshttps://doi.org/10.3390/math12040570openalex-snapshot
Variable Selection in Data Analysis: A Synthetic Data Toolkit
inferred← citeshttps://doi.org/10.3390/math9212650openalex-snapshot
Novel Static Multi-Layer Forest Approach and Its Applications
inferred← citeshttps://doi.org/10.48129/kjs.10725openalex-snapshot
A Bi-criteria Optimization Model for Adjusting the Decision Tree Parameters
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.