On the public citation graph

Using the Minimum Description Length Principle to Infer Reduced Ordered Decision Graphs

https://doi.org/10.1007/bf00115299
0 signed · 60 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.1007/3-540-52148-8_30openalex-snapshot
Verification of synchronous sequential machines based on symbolic execution
inferredcites →https://doi.org/10.1007/3-540-57568-5_270openalex-snapshot
The complexity of the optimal variable ordering problems of shared binary decision diagrams
inferredcites →https://doi.org/10.1007/978-1-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_5openalex-snapshot
Dynamic Variable Ordering for Ordered Binary Decision Diagrams
inferredcites →https://doi.org/10.1007/978-1-4757-3860-5openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/978-3-030-11298-1openalex-snapshot
An Introduction to Kolmogorov Complexity and Its Applications
inferredcites →https://doi.org/10.1007/bf00115895openalex-snapshot
Boolean feature discovery in empirical learning
inferredcites →https://doi.org/10.1007/bf00116251openalex-snapshot
Induction of Decision Trees
inferredcites →https://doi.org/10.1007/bfb0017563openalex-snapshot
Modified Branching Programs and Their Computational Power
inferredcites →https://doi.org/10.1016/0005-1098(78)90005-5openalex-snapshot
Modeling by shortest data description
inferredcites →https://doi.org/10.1016/0020-0190(87)90114-1openalex-snapshot
Occam's Razor
inferredcites →https://doi.org/10.1016/0890-5401(89)90010-2openalex-snapshot
Inferring decision trees using the minimum description lenght principle
inferredcites →https://doi.org/10.1016/b978-1-55860-200-7.50048-9openalex-snapshot
Fringe-Like Feature Construction: A Comparative Study and a Unifying Scheme
inferredcites →https://doi.org/10.1016/b978-1-55860-335-6.50039-8openalex-snapshot
A Conservation Law for Generalization Performance
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50032-3openalex-snapshot
Supervised and Unsupervised Discretization of Continuous Features
inferredcites →https://doi.org/10.1023/a:1022611825350openalex-snapshot
Boolean Feature Discovery in Empirical Learning
inferredcites →https://doi.org/10.1023/a:1022646101185openalex-snapshot
Coding Decision Trees
inferredcites →https://doi.org/10.1080/03081077808960690openalex-snapshot
ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
inferredcites →https://doi.org/10.1093/oso/9780198555520.003.0001openalex-snapshot
Statistical Inference
inferredcites →https://doi.org/10.1109/12.53586openalex-snapshot
Finding the optimal variable ordering for binary decision diagrams
inferredcites →https://doi.org/10.1109/5.52213openalex-snapshot
Multilevel logic synthesis
inferredcites →https://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1109/ee.1938.6431064openalex-snapshot
A symbolic analysis of relay and switching circuits
inferredcites →https://doi.org/10.1109/iccad.1991.185307openalex-snapshot
Minimization of binary decision diagrams based on exchanges of variables
inferredcites →https://doi.org/10.1109/t-aiee.1938.5057767openalex-snapshot
A symbolic analysis of relay and switching circuits
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/12130.12158openalex-snapshot
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/196244.196360openalex-snapshot
Heuristic minimization of BDDs using don't cares
inferredcites →https://doi.org/10.1201/9781003456285openalex-snapshot
Statistical Inference
inferredcites →https://doi.org/10.1214/aos/1176350051openalex-snapshot
Stochastic Complexity and Modeling
inferredcites →https://doi.org/10.21236/ada285582openalex-snapshot
Machine Learning: A Comparative Study of Pattern Theory and C4.5
inferredcites →https://doi.org/10.2307/2288003openalex-snapshot
Classification and Regression Trees.
inferredcites →https://doi.org/10.2307/2530946openalex-snapshot
Classification and Regression Trees.
inferredcites →https://doi.org/10.5555/259794.259802openalex-snapshot
Dynamic variable ordering for ordered binary decision diagrams

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-0-387-35311-1_26openalex-snapshot
An implicit formulation for exact BDD minimization of incompletely specified functions
inferred← citeshttps://doi.org/10.1007/978-3-030-12146-4_10openalex-snapshot
An Efficient Private Evaluation of a Decision Graph
inferred← citeshttps://doi.org/10.1007/978-3-031-91816-2_5openalex-snapshot
Decision Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-00960-5_2openalex-snapshot
Techniques of Decision Tree Induction
inferred← citeshttps://doi.org/10.1007/978-3-540-24581-0_23openalex-snapshot
MML Inference of Decision Graphs with Multi-way Joins and Dynamic Attributes
inferred← citeshttps://doi.org/10.1007/978-3-642-21738-8_40openalex-snapshot
Top-Down Induction of Reduced Ordered Decision Diagrams from Neural Networks
inferred← citeshttps://doi.org/10.1007/bf01237940openalex-snapshot
A beam search algorithm for PFSA inference
inferred← citeshttps://doi.org/10.1016/j.eswa.2004.02.001openalex-snapshot
Decision diagrams in machine learning: an empirical study on real-life credit-risk data
inferred← citeshttps://doi.org/10.1109/hicss.1993.270674openalex-snapshot
A decision graph explanation of protein secondary structure prediction
inferred← citeshttps://doi.org/10.1109/itw.2007.4313129openalex-snapshot
Efficient Coding of Labelled Graphs
inferred← citeshttps://doi.org/10.1109/tcad.2023.3258747openalex-snapshot
Circuit Learning: From Decision Trees to Decision Graphs
inferred← citeshttps://doi.org/10.1109/tcad.2024.3387876openalex-snapshot
Optimizing Binary Decision Diagrams for Interpretable Machine Learning Classification
inferred← citeshttps://doi.org/10.1109/tevc.2002.800882openalex-snapshot
NOW G-Net: learning classification programs on networks of workstations
inferred← citeshttps://doi.org/10.1109/tnn.2011.2106163openalex-snapshot
Extracting Rules From Neural Networks as Decision Diagrams
inferred← citeshttps://doi.org/10.1109/wacv56688.2023.00384openalex-snapshot
SONGs: Self-Organizing Neural Graphs
inferred← citeshttps://doi.org/10.1111/1467-8640.00218openalex-snapshot
Inductive Inference by Using Information Compression
inferred← citeshttps://doi.org/10.1609/aaai.v37i6.25920openalex-snapshot
Optimal Decision Diagrams for Classification
inferred← citeshttps://doi.org/10.17638/03186718openalex-snapshot
On the use of multi-objective evolutionary algorithms for classification rule induction
inferred← citeshttps://doi.org/10.17771/pucrio.acad.64308openalex-snapshot
DECISION DIAGRAMS FOR CLASSIFICATION: NEW CONSTRUCTIVE APPROACHES
inferred← citeshttps://doi.org/10.18297/etd/248openalex-snapshot
Learning understandable classifier models.
inferred← citeshttps://doi.org/10.24963/kr.2021/34openalex-snapshot
On Efficiently Explaining Graph-Based Classifiers
inferred← citeshttps://doi.org/10.48550/arxiv.2107.13214openalex-snapshot
SONG: Self-Organizing Neural Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0302015openalex-snapshot
Unsupervised Learning in a Framework of Information Compression by Multiple Alignment, Unification and Search
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0311045openalex-snapshot
Unsupervised Grammar Induction in a Framework of Information Compression by Multiple Alignment, Unification and Search
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0401009openalex-snapshot
Unifying Computing and Cognition: The SP Theory and its Applications
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.