Demo Data from EDBT 2026 / reviewers in the wild / expert
Karl Schultz
dblp:71/284
· DBLP profile ↗
7ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 2 first-authorDatabases, data management, data science and information retrieval · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2Applied, interdisciplinary, general and emerging computing · 2
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.
| Artificial intelligence
3 papers |
Probabilistic and Bayesian machine learning · 84% Question answering and dialogue systems · 16% | |
| Databases, data mining, and information retrieval
1 paper |
Data integration and cleaning · 100% | |
| Human-computer interaction and pervasive computing
2 papers |
Learning and educational technologies · 100% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
factor graphs |
0.1 | 1 | 2009 | FACTORIE: Probabilistic Programming via Imperatively Defined Factor Graphs · NIPS 2009 |
Machine learning › Probabilistic and Bayesian machine learning
probabilistic programming |
0.1 | 1 | 2009 | FACTORIE: Probabilistic Programming via Imperatively Defined Factor Graphs · NIPS 2009 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
relational model |
0.1 | 1 | 2009 | FACTORIE: Probabilistic Programming via Imperatively Defined Factor Graphs · NIPS 2009 |
Data integration and cleaning
entity resolution |
0.1 | 1 | 2008 | A unified approach for schema matching, coreference and canonicalization · KDD 2008 |
Natural language and speech › Question answering and dialogue systems
spoken dialogue systems |
0.1 | 2 | 2004 | Interactive Spoken Simulation Control and Conversational Tutoring · IJCAI 2003 SCoT: A Spoken Conversational Tutor · AAAI 2004 |
Learning and educational technologies › intelligent tutoring systems
conversational tutoring |
0.0 | 1 | 2003 | Interactive Spoken Simulation Control and Conversational Tutoring · IJCAI 2003 |
Learning and educational technologies
intelligent tutoring systems |
0.0 | 1 | 2003 | Interactive Spoken Simulation Control and Conversational Tutoring · IJCAI 2003 |
Data integration and cleaning
schema matching |
0.0 | 1 | 2008 | A unified approach for schema matching, coreference and canonicalization · KDD 2008 |
Methods — techniques the papers use, named apart from their topics
discriminative training · 0.2markov logic networks · 0.1speech simulation control · 0.1joint inference · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | FACTORIE: Probabilistic Programming via Imperatively Defined Factor GraphsabstractDiscriminatively trained undirected graphical models have had wide empirical success, and there has been increasing interest in toolkits that ease their application to complex relational data. The power in relational models is in their repeated structure and tied parameters; at issue is how to define these structures in a powerful and flexible way. Rather than using a declarative language, such as SQL or first-order logic, we advocate using an imperative language to express various aspects of model structure, inference, and learning. By combining the traditional, declarative, statistical semantics of factor graphs with imperative definitions of their construction and operation, we allow the user to mix declarative and procedural domain knowledge, and also gain significant efficiencies. We have implemented such imperatively defined factor graphs in a system we call Factorie, a software library for an object-oriented, strongly-typed, functional language. In experimental comparisons to Markov Logic Networks on joint segmentation and coreference, we find our approach to be 3-15 times faster while reducing error by 20-25%-achieving a new state of the art. Andrew McCallum, Karl Schultz, Sameer Singh 0001 |
NIPS | 2 |
| 2009 | Bi-directional Joint Inference for Entity Resolution and Segmentation Using Imperatively-Defined Factor Graphs
Sameer Singh 0001, Karl Schultz, Andrew McCallum |
ECML/PKDD (2) | 2 |
| 2008 | A unified approach for schema matching, coreference and canonicalizationabstractThe automatic consolidation of database records from many heterogeneous sources into a single repository requires solving several information integration tasks. Although tasks such as coreference, schema matching, and canonicalization are closely related, they are most commonly studied in isolation. Systems that do tackle multiple integration problems traditionally solve each independently, allowing errors to propagate from one task to another. In this paper, we describe a discriminatively-trained model that reasons about schema matching, coreference, and canonicalization jointly. We evaluate our model on a real-world data set of people and demonstrate that simultaneously solving these tasks reduces errors over a cascaded or isolated approach. Our experiments show that a joint model is able to improve substantially over systems that either solve each task in isolation or with the conventional cascade. We demonstrate nearly a 50% error reduction for coreference and a 40% error reduction for schema matching. Michael L. Wick, Khashayar Rohanimanesh, Karl Schultz, Andrew McCallum |
KDD | 3 |
| 2004 | SCoT: A Spoken Conversational Tutor
Karl Schultz, Brady Clark, Heather Pon-Barry, Elizabeth Owen Bratt, Stanley Peters |
AAAI | 1 |
| 2004 | Contextualizing Learning in a Reflective Conversational TutorabstractContextualizing learning in an intelligent tutoring system is difficult for many reasons. Goals such as presenting material in an understandable manner, minimizing confusion and frustration, and helping the student reason about their actions all need to be balanced. Previous research has shown reflective discussions (with human tutors) occurring after problem-solving to be effective in helping students reason about their own actions (S. Katz et. al, 2003). However, leading a reflective discussion makes it difficult to present information in an understandable manner, and without contextualization, it is easy to create student confusion and frustration. This raises the question: how can intelligent tutoring systems effectively contextualize learning in a reflective discussion? In this paper, we describe the tutorial architecture of SCoT, a spoken conversational tutor that uses flexible, adaptive planning and multi-modal task modeling to support the contextualization of learning in reflective dialogues. Heather Pon-Barry, Brady Clark, Karl Schultz, Elizabeth Owen Bratt, Stanley Peters |
ICALT | 3 |
| 2004 | Advantages of Spoken Language Interaction in Dialogue-Based Intelligent Tutoring Systems
Heather Pon-Barry, Brady Clark, Karl Schultz, Elizabeth Owen Bratt, Stanley Peters |
Intelligent Tutoring Systems | 3 |
| 2003 | Interactive Spoken Simulation Control and Conversational Tutoring
Karl Schultz, Brady Clark, Elizabeth Owen Bratt, Stanley Peters, Heather Pon-Barry, Pucktada Treeratpituk, Zack Thomsen-Gray |
IJCAI | 1 |