Prithviraj Sen

Prithviraj Sen

Auto-generated profile, based on publicly available information

Prithviraj Sen

University of Maryland

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 April 2007
Verified
Conference Paper
Closed access
PSPrithviraj Sen
Prithviraj Sen
ADAmol Deshpande
Amol Deshpande
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of probabilistic databases is hampered by two limitations: (1) current probabilistic databases make simplistic assumptions about the data (e.g., complete independence among tuples) that make it difficult to use them in applications that naturally produce correlated data, and (2) most probabilistic databases can only answer a restricted subset of the queries that can be expressed using traditional query languages. We address both these limitations by proposing a framework that can represent not only probabilistic tuples, but also correlations that may be present among them. Our proposed framework naturally lends itself to the possible world semantics thus preserving the precise query semantics extant in current probabilistic databases. We develop an efficient strategy for query evaluation over such probabilistic databases by casting the query processing problem as an inference problem in an appropriately constructed probabilistic graphical model. We present several optimizations specific to probabilistic databases that enable efficient query evaluation. We validate our approach by presenting an experimental evaluation that illustrates the effectiveness of our techniques at answering various queries using real and synthetic datasets.

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

1 January 2014
Verified
Book Chapter
Closed access
PDF file
GNGalileo Namata
Galileo Namata
PSPrithviraj Sen
Prithviraj Sen
MBMustafa Bilgic
Mustafa Bilgic
LGLise Getoor
Lise Getoor

7 March 2008 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
PSPrithviraj Sen
Prithviraj Sen
LGLise Getoor
Lise Getoor

9 May 2012 in arXiv
Verified
Preprint
Open access
PDF file
PSPrithviraj Sen
Prithviraj Sen
ADAmol Deshpande
Amol Deshpande
LGLise Getoor
Lise Getoor
There has been a great deal of recent interest in methods for performing lifted inference; however, most of this work assumes that the first-order model is given as input to the system. Here, we describe lifted inference algorithms that determine symmetries and automatically lift the probabilistic model to speedup inference. In particular, we describe approximate lifted inference techniques that allow the user to trade off inference accuracy for computational efficiency by using a handful of tunable parameters, while keeping the error bounded. Our algorithms are closely related to the graph-theoretic concept of bisimulation. We report experiments on both synthetic and real data to show that in the presence of symmetries, run-times for inference can be improved significantly, with approximate lifted inference providing orders of magnitude speedup over ground inference.