Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

Updated: May 31, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.4K

Greedy Algorithm for Deriving Decision Rules from Decision Tree Ensembles.

Evans Teiko Tetteh1, Beata Zielosko1

  • 1Institute of Computer Science, University of Silesia in Katowice, Bȩdzińska 39, 41-200 Sosnowiec, Poland.

Entropy (Basel, Switzerland)
|January 24, 2025
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

Decision Making: P-value Method01:09

Decision Making: P-value Method

5.3K
The process of hypothesis testing based on the P-value method includes calculating the P- value using the sample data and interpreting it.
First, a specific claim about the population parameter is proposed. The claim is based on the research question and is stated in a simple form. Further, an opposing statement to the claim  is also stated. These statements can act as null and alternative hypotheses:  a null hypothesis would be a neutral statement while the alternative hypothesis can...
5.3K
Decision Making: Traditional Method01:14

Decision Making: Traditional Method

4.0K
The process of hypothesis testing based on the traditional method includes calculating the critical value, testing the value of the test statistic using the sample data, and interpreting these values.
First, a specific claim about the population parameter is decided based on the research question and is stated in a simple form. Further, an opposing statement to this claim is also stated. These statements can act as null and alternative hypotheses, out of which a null hypothesis would be a...
4.0K
Decision Making01:20

Decision Making

85
Decision-making is a fundamental cognitive process that involves evaluating alternatives and selecting among them. This process can range from simple choices, such as deciding what to wear, to complex decisions, like choosing a major in college or a career path. The complexity of the decision often dictates the approach we use, which can be broadly categorized into two types: automatic and controlled decision-making.
Automatic decision-making is fast, intuitive, and relies on gut feelings...
85
Survival Tree01:19

Survival Tree

57
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
57
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.0K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.0K
Heuristics01:21

Heuristics

70
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
70

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Exploiting Data Distribution: A Multi-Ranking Approach.

Entropy (Basel, Switzerland)·2025
Same author

Importance of Characteristic Features and Their Form for Data Exploration.

Entropy (Basel, Switzerland)·2024
Same author

Selected Data Mining Tools for Data Analysis in Distributed Environment.

Entropy (Basel, Switzerland)·2023
Same author

Improved EAV-Based Algorithm for Decision Rules Construction.

Entropy (Basel, Switzerland)·2023
Same author

Decision Rules Derived from Optimal Decision Trees with Hypotheses.

Entropy (Basel, Switzerland)·2021
Same author

Decision Rules Construction: Algorithm Based on EAV Model.

Entropy (Basel, Switzerland)·2020

This study presents a greedy algorithm for extracting decision rules from decision tree ensembles, improving model interpretability and accuracy in distributed data settings. The method enhances knowledge discovery by generating shorter, more accurate rules.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Machine Learning

Background:

  • Decision rules offer transparency for knowledge extraction and decision-making.
  • Traditional algorithms like CART and ID3 build decision trees from data.

Purpose of the Study:

  • To introduce a greedy algorithm for deriving decision rules from decision tree ensembles.
  • To enhance interpretability and generalization in distributed data environments.

Main Methods:

  • Inducing decision trees using CART and ID3 on bootstrapped datasets representing distributed data.
  • Applying a greedy algorithm to derive decision rules consistent across multiple decision trees.

Main Results:

  • Increasing the value of parameter α (0≤α<1) results in shorter decision rules.
Keywords:
decision rulesdecision treesensemblegreedy algorithmlength

More Related Videos

Operant Protocols for Assessing the Cost-benefit Analysis During Reinforced Decision Making by Rodents
07:05

Operant Protocols for Assessing the Cost-benefit Analysis During Reinforced Decision Making by Rodents

Published on: September 10, 2018

5.9K
A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
12:18

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

Published on: January 11, 2020

7.4K

Related Experiment Videos

Last Updated: May 31, 2025

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.4K
Operant Protocols for Assessing the Cost-benefit Analysis During Reinforced Decision Making by Rodents
07:05

Operant Protocols for Assessing the Cost-benefit Analysis During Reinforced Decision Making by Rodents

Published on: September 10, 2018

5.9K
A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
12:18

A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

Published on: January 11, 2020

7.4K
  • The proposed method improves the classification accuracy of rule-based models.

    • Conclusions:

    • The greedy algorithm effectively extracts interpretable and accurate decision rules from ensembles.
    • This approach is beneficial for knowledge representation and discovery in distributed environments.