Lise Getoor

Lise Getoor

Auto-generated profile, based on publicly available information

Lise Getoor

University of Maryland College Park 20742 MD USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
20 August 2008 in Machine Learning
Verified
Journal Article
Closed access
PDF file
TDThomas G. Dietterich
Thomas G. Dietterich
PDPedro Domingos
Pedro Domingos
LGLise Getoor
Lise Getoor
SMStephen Muggleton
Stephen Muggleton
PTPrasad Tadepalli
Prasad Tadepalli

17 March 2011
Verified
Book Chapter
Closed access
PDF file
EZElena Zheleva
Elena Zheleva
LGLise Getoor
Lise Getoor

1 March 2004 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
LGLise Getoor
Lise Getoor
JRJeanne T Rhee
Jeanne T Rhee
DKDaphne Koller
Daphne Koller
PSPeter Small
Peter Small

1 October 2006
Verified
Conference Paper
Closed access
MBMustafa Bilgic
Mustafa Bilgic
LLLouis Licamele
Louis Licamele
LGLise Getoor
Lise Getoor
BSBen Shneiderman
Ben Shneiderman
Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that the data is accurate. A common data quality problem is that the data may inadvertently contain several distinct references to the same underlying entity; the process of reconciling these references is called entity-resolution. D-Dupe is an interactive tool that combines data mining algorithms for entity resolution with a task-specific network visualization. Users cope with complexity of cleaning large networks by focusing on a small subnetwork containing a potential duplicate pair. The subnetwork highlights relationships in the social network, making the common relationships easy to visually identify. D-Dupe users resolve ambiguities either by merging nodes or by marking them distinct. The entity resolution process is iterative: as pairs of nodes are resolved, additional duplicates may be revealed; therefore, resolution decisions are often chained together. We give examples of how users can flexibly apply sequences of actions to produce a high quality entity resolution result. We illustrate and evaluate the benefits of D-Dupe on three bibliographic collections. Two of the datasets had already been cleaned, and therefore should not have contained duplicates; despite this fact, many duplicates were rapidly identified using D-Dupe's unique combination of entity resolution algorithms within a task-specific visual interface

1 September 2010 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
PSPrithviraj Sen
Prithviraj Sen
ADAmol Deshpande
Amol Deshpande
LGLise Getoor
Lise Getoor

27 January 2006 in Machine Learning
Verified
Journal Article
Open access
PDF file
LGLise Getoor
Lise Getoor
JGJohn Grant
John Grant
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into a logic programming framework. We show how to represent varying degrees of complexity in the semantics including attribute uncertainty, structural uncertainty and identity uncertainty. Our approach is similar in spirit to the work in Bayesian Logic Programs (BLPs), and Logical Bayesian Networks (LBNs). However, surprisingly, there are still some important differences in the resulting formalism; for example, we introduce a general notion of aggregates based on the PRM approaches. One of our contributions is that we show how to support richer forms of structural uncertainty in a probabilistic logical language than have been previously described. Our goal in this work is to present a unifying framework that supports all of the types of relational uncertainty yet is based on logic programming formalisms. We also believe that it facilitates understanding the relationship between the frame-based approaches and alternate logic programming approaches, and allows greater transfer of ideas between them.