Demo Data from EDBT 2026 / reviewers in the wild / expert
Mark W. Craven
dblp:212/7808
· DBLP profile ↗
13ranked-venue papers
8as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 6 first-authorApplied, interdisciplinary, general and emerging computing · 5 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
4 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
4 papers |
Trustworthy machine learning · 44% Knowledge representation and reasoning · 22% Representation and self-supervised learning · 22% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › genome annotation
operon prediction |
0.1 | 2 | 2003 | A Bayesian Network Approach to Operon Prediction · Bioinform. 2003 A Probabilistic Learning Approach to Whole-Genome Operon Prediction · ISMB 2000 |
Bioinformatics and computational biology
gene expression analysis |
0.0 | 1 | 2000 | Using Multiple Levels of Learning and Diverse Evidence to Uncover Coordinately Controlled Genes · ICML 2000 |
Bioinformatics and computational biology
genome annotation |
0.0 | 1 | 2000 | A Probabilistic Learning Approach to Whole-Genome Operon Prediction · ISMB 2000 |
Machine learning › Trustworthy machine learning
interpretability |
0.0 | 2 | 1994 | Using Sampling and Queries to Extract Rules from Trained Neural Networks · ICML 1994 Learning Symbolic Rules Using Artificial Neural Networks · ICML 1993 |
Machine learning › Trustworthy machine learning › interpretability › logic-based explanation › rule-based explanation › rule extraction
rule extraction from neural networks |
0.0 | 2 | 1994 | Using Sampling and Queries to Extract Rules from Trained Neural Networks · ICML 1994 Learning Symbolic Rules Using Artificial Neural Networks · ICML 1993 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › rule learning
symbolic rule learning |
0.0 | 2 | 1994 | Using Sampling and Queries to Extract Rules from Trained Neural Networks · ICML 1994 Learning Symbolic Rules Using Artificial Neural Networks · ICML 1993 |
Machine learning › Representation and self-supervised learning › automated feature generation
constructive induction |
0.0 | 1 | 1991 | Constructive Induction in Knowledge-Based Neural Networks · ML 1991 |
Machine learning › Deep learning architectures and training › hybrid neural network
knowledge-based neural networks |
0.0 | 1 | 1991 | Constructive Induction in Knowledge-Based Neural Networks · ML 1991 |
Methods — techniques the papers use, named apart from their topics
bayesian network · 0.0probabilistic learning · 0.0multiple levels of learning · 0.0diverse evidence · 0.0constructive induction · 0.0decision tree extraction · 0.0sampling · 0.0queries · 0.0neural network rule extraction · 0.0symbolic rule extraction · 0.0artificial neural network · 0.0knowledge-based neural networks · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Computational Phenotyping on Diverse Data Sources
Jimeng Sun 0001, Bradley A. Malin, Abel N. Kho, Mark W. Craven, Joydeep Ghosh |
AMIA | 4 |
| 2016 | Modeling the Temporal Evolution of Postoperative Complications
Shara I. Feld, Alexander G. Cobian, Sarah E. Tevis, Gregory D. Kennedy, Mark W. Craven |
AMIA | 5 |
| 2012 | Learning to Predict Post-Hospitalization VTE Risk from EHR Data
Emily Kawaler, Alexander G. Cobian, Peggy L. Peissig, Deanna S. Cross, Steven Yale, Mark W. Craven |
AMIA | 6 |
| 2003 | A Bayesian Network Approach to Operon PredictionabstractMOTIVATION: In order to understand transcription regulation in a given prokaryotic genome, it is critical to identify operons, the fundamental units of transcription, in such species. While there are a growing number of organisms whose sequence and gene coordinates are known, by and large their operons are not known. RESULTS: We present a probabilistic approach to predicting operons using Bayesian networks. Our approach exploits diverse evidence sources such as sequence and expression data. We evaluate our approach on the Escherichia coli K-12 genome where our results indicate we are able to identify over 78% of its operons at a 10% false positive rate. Also, empirical evaluation using a reduced set of data sources suggests that our approach may have significant value for organisms that do not have as rich of evidence sources as E.coli. AVAILABILITY: Our E.coli K-12 operon predictions are available at http://www.biostat.wisc.edu/gene-regulation. Joseph Bockhorst, Mark W. Craven, David Page, Jude W. Shavlik, Jeremy D. Glasner |
Bioinform. | 2 |
| 2000 | Using Multiple Levels of Learning and Diverse Evidence to Uncover Coordinately Controlled Genes
Mark W. Craven, David Page, Jude W. Shavlik, Joseph Bockhorst, Jeremy D. Glasner |
ICML | 1 |
| 2000 | A Probabilistic Learning Approach to Whole-Genome Operon Prediction
Mark W. Craven, David Page, Jude W. Shavlik, Joseph Bockhorst, Jeremy D. Glasner |
ISMB | 1 |
| 1997 | Using neural networks for data mining
Mark W. Craven, Jude W. Shavlik |
Future Gener. Comput. Syst. | 1 |
| 1997 | Understanding Time-Series Networks: A Case Study in Rule ExtractionabstractA significant limitation of neural networks is that the representations they learn are usually incomprehensible to humans. We have developed an algorithm, called TREPAN, for extracting comprehensible, symbolic representations from trained neural networks. Given a trained network, TREPAN produces a decision tree that approximates the concept represented by the network. In this article, we discuss the application of TREPAN to a neural network trained on a noisy time series task: predicting the Dollar-Mark exchange rate. We present experiments that show that TREPAN is able to extract a decision tree from this network that equals the network in terms of predictive accuracy, yet provides a comprehensible concept representation. Moreover, our experiments indicate that decision trees induced directly from the training data using conventional algorithms do not match the accuracy nor the comprehensibility of the tree extracted by TREPAN. Mark W. Craven, Jude W. Shavlik |
Int. J. Neural Syst. | 1 |
| 1995 | Extracting Tree-Structured Representations of Trained Networks
Mark W. Craven, Jude W. Shavlik |
NIPS | 1 |
| 1994 | Using Sampling and Queries to Extract Rules from Trained Neural Networks
Mark W. Craven, Jude W. Shavlik |
ICML | 1 |
| 1993 | Learning Symbolic Rules Using Artificial Neural Networks
Mark W. Craven, Jude W. Shavlik |
ICML | 1 |
| 1993 | Learning to Represent Codons: A Challenge Problem for Constructive Induction
Mark W. Craven, Jude W. Shavlik |
IJCAI | 1 |
| 1991 | Constructive Induction in Knowledge-Based Neural Networks
Geoffrey G. Towell, Mark W. Craven, Jude W. Shavlik |
ML | 2 |