Reference health

A Modified Id3 Decision Tree Algorithm Based on Cumulative Residual Entropy

https://doi.org/10.2139/ssrn.4682847
CiteStamped reference-health badge
11/11 checkable references clean · checked 2026-08-28

Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.

16 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.

The 11 checked references that resolve
resolves10.1017/S0269888910000378
Data mining: past, present and future
resolves10.1016/j.jspi.2009.05.038
On cumulative entropies
resolves10.1080/01621459.1958.10501452
Nonparametric Estimation from Incomplete Observations
resolves10.1016/j.jspi.2009.07.015
Some new results on the cumulative residual entropy
resolves10.1007/BF00116251
Induction of decision trees
resolves10.1613/jair.279
Improved Use of Continuous Attributes in C4.5
resolves10.1109/TIT.2004.828057
Cumulative Residual Entropy: A New Measure of Information
resolves10.1007/s10959-005-7541-3
More on a New Concept of Entropy and Information
resolves10.1142/9097
Data Mining with Decision Trees
resolves10.5120/14249-2444
Classification Through Machine Learning Technique: C4. 5 Algorithm based on Various Entropies
resolves10.1016/j.knosys.2016.12.021
A less-greedy two-term Tsallis Entropy Information Metric approach for decision tree classification
The 16 references without a DOI — listed, not checked
no DOI — not checkedThe quadratic entropy approach to implement the Id3 decision tree algorithm
no DOI — not checkedInter-node Hellinger distance based decision tree
no DOI — not checkedStudent-mat [Data set]
no DOI — not checkedOn the discrete cumulative residual entropy
no DOI — not checkedref5
no DOI — not checkedIntroducing a new method for the branching point in decision tree production
no DOI — not checkedref8
no DOI — not checkedExploiting the cost (in) sensitivity of decision tree splitting criteria
no DOI — not checkedref11
no DOI — not checkedref12
no DOI — not checkedref13
no DOI — not checkedCredit scoring processes from a knowledge Management perspective
no DOI — not checkedComparison of Shannon, Renyi, and Tsallis entropy used in decision trees
no DOI — not checkedEGIA: A new node splitting method for decision tree generation: Special application in software fault prediction
no DOI — not checkedref25
no DOI — not checkedUnifying attribute splitting criteria of decision trees by Tsallis entropy
What this badge says. CiteStamped means the CHECKABLE references of this work were clean at the dated check: each resolved to a known work in a public registry, and none carried a retraction notice at that time. It says nothing about the quality, findings, or importance of the work itself, and nothing about references deposited without a DOI.

checked 2026-08-28 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record

Embed this badge

Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.

<a href="https://citestamp.com/citestamped/10.2139/ssrn.4682847"><img src="https://citestamp.com/citestamped/10.2139/ssrn.4682847/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[![CiteStamped reference-health badge](https://citestamp.com/citestamped/10.2139/ssrn.4682847/badge.svg)](https://citestamp.com/citestamped/10.2139/ssrn.4682847)