Lise Getoor

Lise Getoor

Auto-generated profile, based on publicly available information

Lise Getoor

UC Santa Cruz UC Santa Cruz UC Santa Cruz

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 May 2014 in Machine Learning
Verified
Journal Article
Open access
PDF file
AKAngelika Kimmig
Angelika Kimmig
LMLilyana Mihalkova
Lilyana Mihalkova
LGLise Getoor
Lise Getoor
Lifted graphical models provide a language for expressing dependencies between different types of entities, their attributes, and their diverse relations, as well as techniques for probabilistic reasoning in such multi-relational domains. In this survey, we review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We discuss inference algorithms, including lifted inference algorithms, that efficiently compute the answers to probabilistic queries over such models. We also review work in learning lifted graphical models from data. There is a growing need for statistical relational models (whether they go by that name or another), as we are inundated with data which is a mix of structured and unstructured, with entities and relations extracted in a noisy manner from text, and with the need to reason effectively with this data. We hope that this synthesis of ideas from many different research groups will provide an accessible starting point for new researchers in this expanding field.

30 June 2015
Verified
Conference Paper
Closed access
TRTheodoros Rekatsinas
Theodoros Rekatsinas
SGSaurav Ghosh
Saurav Ghosh
SMSumiko R. Mekaru
Sumiko R. Mekaru
ENElaine O. Nsoesie
Elaine O. Nsoesie
JBJohn S. Brownstein
John S. Brownstein
NRNaren Ramakrishnan
Naren Ramakrishnan
Rapidly increasing volumes of news feeds from diverse data sources, such as online newspapers, Twitter and online blogs are proving to be extremely valuable resources in helping anticipate, detect, and forecast outbreaks of rare diseases. This paper presents SourceSeer, a novel algorithmic framework that combines spatio-temporal topic models with sourcebased anomaly detection techniques to effectively forecast the emergence and progression of infectious rare diseases. SourceSeer is capable of discovering the location focus of each source allowing sources to be used as experts with varying degrees of authoritativeness. To fuse the individual source predictions into a final outbreak prediction we employ a multiplicative weights algorithm taking into account the accuracy of each source. We evaluate the performance of SourceSeer using incidence data for hantavirus syndromes in multiple countries of Latin America provided by HealthMap over a timespan of fifteen months. We demonstrate that SourceSeer makes predictions of increased accuracy compared to several baselines and is capable of forecasting disease outbreaks in a timely manner even when no outbreaks were previously reported.

12 July 2017 in Machine Learning
Verified
Journal Article
Closed access
PDF file
GFGolnoosh Farnadi
Golnoosh Farnadi
SBStephen H. Bach
Stephen H. Bach
MMMarie-Francine Moens
Marie-Francine Moens
LGLise Getoor
Lise Getoor
MCMartine De Cock
Martine De Cock

15 September 2018 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
PKPigi Kouki
Pigi Kouki
JPJay Pujara
Jay Pujara
CMChristopher Marcum
Christopher Marcum
LKLaura M. Koehly
Laura M. Koehly
LGLise Getoor
Lise Getoor

17 August 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
AKAngelika Kimmig
Angelika Kimmig
AMAlexander Memory
Alexander Memory
RMRenee J. Miller
Renee J. Miller
LGLise Getoor
Lise Getoor
We propose a probabilistic approach to the problem of schema mapping. Our approach is declarative, scalable, and extensible. It builds upon recent results in both schema mapping and probabilistic reasoning and contributes novel techniques in both fields. We introduce the problem of schema mapping selection, that is, choosing the best mapping from a space of potential mappings, given both metadata constraints and a data example. As selection has to reason holistically about the inputs and the dependencies between the chosen mappings, we define a new schema mapping optimization problem which captures interactions between mappings as well as inconsistencies and incompleteness in the input. We then introduce Collective Mapping Discovery (CMD), our solution to this problem using state-of-the-art probabilistic reasoning techniques. Our evaluation on a wide range of integration scenarios, including several real-world domains, demonstrates that CMD effectively combines data and metadata information to infer highly accurate mappings even with significant levels of noise.

27 December 2018 in IEEE Transactions on Learning Technologies
Verified
Journal Article
Closed access
ARArti Ramesh
Arti Ramesh
DGDan Goldwasser
Dan Goldwasser
BHBert Huang
Bert Huang
HDHal Daume
Hal Daume
LGLise Getoor
Lise Getoor
Maintaining and cultivating student engagement is critical for learning. Understanding factors affecting student engagement can help in designing better courses and improving student retention. The large number of participants in massive open online courses (MOOCs) and data collected from their interactions on the MOOC open up avenues for studying student engagement at scale. In this work, we develop an interpretable statistical relational learning model for understanding student engagement in online courses using a complex combination of behavioral, linguistic, structural, and temporal cues. We show how to abstract student engagement types of active, passive, and disengagement as meaningful latent variables using logical rules in our model connecting student behavioral signals with student success in MOOCs. We demonstrate that the latent formulation for engagement helps in predicting two measures of student success: performance, their final grade in the course, and survival, their continued presence in the course till the end, across seven MOOCs. Further, in order to initiate better instructor interventions, we need to be able to predict student success early in the course. We demonstrate that we can predict student success early in the course reliably using the latent model. We also demonstrate the utility of our models in predicting student success in new courses, by training our models on one course and testing on another course. We show that the latent abstractions are helpful in predicting student success and engagement reliably in new MOOCs that haven't yet gathered student interaction data. We then perform a closer quantitative analysis of different features derived from student interactions on the MOOC and identify student activities that are good indicators of student success at different points in the course. Through a qualitative analysis of the latent engagement variable values, we demonstrate their utility in understanding students' engagement levels at various points in the course and movement of students across different types of engagement.