On the public citation graph
Boolean regression
0 signed · 22 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/978-3-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1007/978-3-642-97225-6openalex-snapshot
The Statistical Analysis of Categorical Data
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1007/bf02283750openalex-snapshot
Cause-effect relationships and partially defined Boolean functions
inferredcites →https://doi.org/10.1016/0377-2217(85)90321-2openalex-snapshot
Classification and regression trees
inferredcites →https://doi.org/10.1080/00401706.1990.10484739openalex-snapshot
Bayesian Statistics: Principles, Models, and Applications
inferredcites →https://doi.org/10.1137/s0895480191199385openalex-snapshot
Predicting Cause-Effect Relationships from Incomplete Discrete Observations
inferredcites →https://doi.org/10.1287/mnsc.22.11.1268openalex-snapshot
Maximal Closure of a Graph and Applications to Combinatorial Problems
inferredcites →https://doi.org/10.2307/1391600openalex-snapshot
The Analysis of Cross-Classified Data Having Ordered Categories
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_4openalex-snapshot
Discovering Rules That Govern Monotone Phenomena
inferred← citeshttps://doi.org/10.1007/978-3-540-72458-2_14openalex-snapshot
Optimized Generalized Decision in Dominance-Based Rough Set Approach
inferred← citeshttps://doi.org/10.1007/s11336-002-0978-8openalex-snapshot
Probabilistic Subset Conjunction
inferred← citeshttps://doi.org/10.1016/j.dam.2004.10.010openalex-snapshot
Subset-conjunctive rules for breast cancer diagnosis
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.12.181openalex-snapshot
Learning to Win in Evolutionary Two-person Boolean Game with Fixed Strategy Updating Rule**This work was partially supported by the National Natural Science Foundation in China (NSFC) under Grant 61473038.
inferred← citeshttps://doi.org/10.1016/j.ins.2008.06.013openalex-snapshot
Stochastic dominance-based rough set model for ordinal classification
inferred← citeshttps://doi.org/10.1073/pnas.1410404111openalex-snapshot
On inference of causality for discrete state models in a multiscale context
inferred← citeshttps://doi.org/10.1142/s0218127407018166openalex-snapshot
IDENTIFICATION OF BINARY CELLULAR AUTOMATA FROM SPATIO-TEMPORAL BINARY PATTERNS USING A FOURIER REPRESENTATION
inferred← citeshttps://doi.org/10.1509/jmkr.2005.42.4.483openalex-snapshot
Probabilistic Subset-Conjunctive Models for Heterogeneous Consumers
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.