On the public citation graph

Confidence Decision Trees via Online and Active Learning for Streaming Data

0 signed · 50 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.10019openalex-snapshot
Convergence properties of functional estimates for discrete distributions
inferredcites →https://doi.org/10.1006/jcss.1997.1543openalex-snapshot
On the Boosting Ability of Top–Down Decision Tree Learning Algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-540-28645-5_29openalex-snapshot
Learning with Drift Detection
inferredcites →https://doi.org/10.1007/978-3-540-76928-6_11openalex-snapshot
New Options for Hoeffding Trees
inferredcites →https://doi.org/10.1007/978-3-642-25856-5_15openalex-snapshot
Mining Uncertain Data Streams Using Clustering Feature Decision Trees
inferredcites →https://doi.org/10.1007/978-3-642-41398-8_26openalex-snapshot
Correcting the Usage of the Hoeffding Inequality in Stream Mining
inferredcites →https://doi.org/10.1007/bf00116900openalex-snapshot
Learning in the Presence of Concept Drift and Hidden Contexts
inferredcites →https://doi.org/10.1007/bf02883985openalex-snapshot
Some inequalities relating to the partial sum of binomial probabilities
inferredcites →https://doi.org/10.1007/s10618-010-0201-yopenalex-snapshot
Learning model trees from evolving data streams
inferredcites →https://doi.org/10.1016/b978-1-55860-307-3.50034-4openalex-snapshot
Decision Theoretic Subsampling for Induction on Large Databases
inferredcites →https://doi.org/10.1016/j.patrec.2009.07.017openalex-snapshot
Ambiguous decision trees for mining concept-drifting data streams
inferredcites →https://doi.org/10.1016/s0304-3975(02)00181-0openalex-snapshot
Top-down decision tree learning as information based boosting
inferredcites →https://doi.org/10.1017/cbo9781107359949.008openalex-snapshot
On the method of bounded differences
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1093/acprof:oso/9780199535255.001.0001openalex-snapshot
Concentration Inequalities
inferredcites →https://doi.org/10.1109/ijcnn.2013.6706907openalex-snapshot
Incremental decision tree based on order statistics
inferredcites →https://doi.org/10.1109/ijcnn.2014.6889806openalex-snapshot
A novel application of Hoeffding's inequality to decision trees construction for data streams
inferredcites →https://doi.org/10.1109/tkde.2012.66openalex-snapshot
Decision Trees for Mining Data Streams Based on the McDiarmid's Bound
inferredcites →https://doi.org/10.1109/tnnls.2012.2236570openalex-snapshot
Active Learning With Drifting Streaming Data
inferredcites →https://doi.org/10.1109/tnnls.2014.2333557openalex-snapshot
A New Method for Data Stream Mining Based on the Misclassification Error
inferredcites →https://doi.org/10.1145/1557019.1557041openalex-snapshot
New ensemble methods for evolving data streams
inferredcites →https://doi.org/10.1145/2245276.2245431openalex-snapshot
Very Fast Decision Rules for multi-class problems
inferredcites →https://doi.org/10.1145/2351316.2351322openalex-snapshot
Incrementally optimized decision tree for noisy big data
inferredcites →https://doi.org/10.1145/237814.237994openalex-snapshot
On the boosting ability of top-down decision tree learning algorithms
inferredcites →https://doi.org/10.1145/347090.347107openalex-snapshot
Mining high-speed data streams
inferredcites →https://doi.org/10.1145/502512.502529openalex-snapshot
Mining time-changing data streams
inferredcites →https://doi.org/10.1145/956750.956813openalex-snapshot
Accurate decision trees for mining high-speed data streams
inferredcites →https://doi.org/10.1145/956750.956821openalex-snapshot
Efficient decision tree construction on streaming data
inferredcites →https://doi.org/10.1145/956804.956813openalex-snapshot
Accurate decision trees for mining high-speed data streams
inferredcites →https://doi.org/10.1145/956804.956821openalex-snapshot
Efficient decision tree construction on streaming data
inferredcites →https://doi.org/10.1162/089976603321780272openalex-snapshot
Estimation of Entropy and Mutual Information
inferredcites →https://doi.org/10.5555/1248547.1248591openalex-snapshot
Worst-Case Analysis of Selective Sampling for Linear Classification

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-030-13962-9_1openalex-snapshot
Introduction and Overview of the Main Results of the Book
inferred← citeshttps://doi.org/10.1007/978-3-030-13962-9_11openalex-snapshot
Probabilistic Neural Networks for the Streaming Data Classification
inferred← citeshttps://doi.org/10.1007/978-3-030-13962-9_15openalex-snapshot
Final Remarks and Challenging Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-13962-9_2openalex-snapshot
Basic Concepts of Data Stream Mining
inferred← citeshttps://doi.org/10.1007/978-3-030-13962-9_4openalex-snapshot
Splitting Criteria Based on the McDiarmid’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-030-13962-9_5openalex-snapshot
Misclassification Error Impurity Measure
inferred← citeshttps://doi.org/10.1007/978-3-030-13962-9_6openalex-snapshot
Splitting Criteria with the Bias Term
inferred← citeshttps://doi.org/10.1007/978-3-030-61380-8_25openalex-snapshot
Active Learning Embedded in Incremental Decision Trees
inferred← citeshttps://doi.org/10.1007/978-3-032-13026-6_16openalex-snapshot
Analysis of Breast Cancer Detection with Gradient Boosted Tree Using Rapid Miner
inferred← citeshttps://doi.org/10.1016/j.asoc.2024.111702openalex-snapshot
Probabilistic neural networks for incremental learning over time-varying streaming data with application to air pollution monitoring
inferred← citeshttps://doi.org/10.1016/j.ins.2026.123949openalex-snapshot
Towards faster and deeper hoeffding trees: Fractional bounds and correlation-preserving multi-index statistics
inferred← citeshttps://doi.org/10.1080/09540091.2021.1936455openalex-snapshot
Applications of federated learning in smart cities: recent advances, taxonomy, and open challenges
inferred← citeshttps://doi.org/10.1109/ssci.2017.8285362openalex-snapshot
On ensemble components selection in data streams scenario with reoccurring concept-drift
inferred← citeshttps://doi.org/10.2174/0126662558286756231206062720openalex-snapshot
An IoMT-based Federated Learning Survey in Smart Transportation
inferred← citeshttps://doi.org/10.48550/arxiv.2001.07504openalex-snapshot
Combining Federated and Active Learning for Communication-efficient Distributed Failure Prediction in Aeronautics
inferred← citeshttps://doi.org/10.54097/14pf6057openalex-snapshot
A concept drift-oriented active learning method
inferred← citeshttps://doi.org/10.70675/367b38e4z9c5fz43e6z8ae5z93b131dc156copenalex-snapshot
Real-time anomaly detection with in-flight data : streaming anomaly detection with heterogeneous communicating agents
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.