Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Urszula Chajewska

dblp:27/2640 · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
3since 2021 · last 2024
0009-0005-0077-4190ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 9 · 4 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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 · 63% Trustworthy machine learning · 32% Reinforcement learning · 3%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.812024
Methods for recovering conditional independence graphs (Abstract Reprint) · IJCAI 2024
Data mining › probabilistic graphical models
structure learning
0.812024
Methods for recovering conditional independence graphs (Abstract Reprint) · IJCAI 2024
Machine learning › Trustworthy machine learning
interpretability
0.412019
Axiomatic Interpretability for Multiclass Additive Models · KDD 2019
Machine learning › Reinforcement learning › imitation learning
inverse reinforcement learning
0.012001
Learning an Agent's Utility Function by Observing Behavior · ICML 2001
Knowledge, reasoning and agents › Multi-agent systems › multi-agent learning
utility learning
0.012001
Learning an Agent's Utility Function by Observing Behavior · ICML 2001

Methods — techniques the papers use, named apart from their topics

conditional independence testing · 1.5gradient boosted trees · 0.4additive post-processing · 0.4
YearPublicationVenuePosition
2024 Methods for recovering conditional independence graphs (Abstract Reprint)
Harsh Shrivastava 0001, Urszula Chajewska
IJCAI2
2024 Methods for Recovering Conditional Independence Graphs: A Survey
abstract
Conditional Independence (CI) graphs are a type of Probabilistic Graphical Models that are primarily used to gain insights about feature relationships. Each edge represents the partial correlation between the connected features which gives information about their direct dependence. In this survey, we list different methods and study the advances in techniques developed to recover CI graphs. We cover traditional optimization methods as well as recently developed deep learning architectures along with their recommended implementations. To facilitate wider adoption, we include preliminaries that consolidate associated operations, for example techniques to obtain covariance matrix for mixed datatypes.
Harsh Shrivastava 0001, Urszula Chajewska
J. Artif. Intell. Res.2
2023 Neural Graphical Models
Harsh Shrivastava 0001, Urszula Chajewska
ECSQARU2
2019 Axiomatic Interpretability for Multiclass Additive Models
abstract
Generalized additive models (GAMs) are favored in many regression and binary classification problems because they are able to fit complex, nonlinear functions while still remaining interpretable. In the first part of this paper, we generalize a state-of-the-art GAM learning algorithm based on boosted trees to the multiclass setting, showing that this multiclass algorithm outperforms existing GAM learning algorithms and sometimes matches the performance of full complexity models such as gradient boosted trees. In the second part, we turn our attention to the interpretability of GAMs in the multiclass setting. Surprisingly, the natural interpretability of GAMs breaks down when there are more than two classes. Naive interpretation of multiclass GAMs can lead to false conclusions. Inspired by binary GAMs, we identify two axioms that any additive model must satisfy in order to not be visually misleading. We then develop a technique called Additive Post-Processing for Interpretability (API) that provably transforms a pretrained additive model to satisfy the interpretability axioms without sacrificing accuracy. The technique works not just on models trained with our learning algorithm, but on any multiclass additive model, including multiclass linear and logistic regression. We demonstrate the effectiveness of API on a 12-class infant mortality dataset.
Xuezhou Zhang, Sarah Tan, Paul Koch, Yin Lou, Urszula Chajewska, Rich Caruana
KDD5
2008 Case Report: Identifying Smokers with a Medical Extraction System
abstract
The Clinical Language Understanding group at Nuance Communications has developed a medical information extraction system that combines a rule-based extraction engine with machine learning algorithms to identify and categorize references to patient smoking in clinical reports. The extraction engine identifies smoking references; documents that contain no smoking references are classified as UNKNOWN. For the remaining documents, the extraction engine uses linguistic analysis to associate features such as status and time to smoking mentions. Machine learning is used to classify the documents based on these features. This approach shows overall accuracy in the 90s on all data sets used. Classification using engine-generated and word-based features outperforms classification using only word-based features for all data sets, although the difference gets smaller as the data set size increases. These techniques could be applied to identify other risk factors, such as drug and alcohol use, or a family history of a disease.
Cheryl Clark, Kathleen Good, Lesley Jezierny, Melissa Macpherson, Urszula Chajewska
J. Am. Medical Informatics Assoc.6
2001 Learning an Agent's Utility Function by Observing Behavior
Urszula Chajewska, Daphne Koller, Dirk Ormoneit
ICML1
2001 Aggregating Learned Probabilistic Beliefs
Pedrito Maynard-Reid II, Urszula Chajewska
UAI2
2000 Utilities as Random Variables: Density Estimation and Structure Discovery
Urszula Chajewska, Daphne Koller
UAI1
1998 Utility Elicitation as a Classification Problem
Urszula Chajewska, Lise Getoor, Joseph Norman, Yuval Shahar
UAI1
1997 Defining Explanation in Probabilistic Systems
Urszula Chajewska, Joseph Y. Halpern
UAI1