Prithviraj Sen
Prithviraj Sen has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Lise Getoor
University of Maryland College Park 20742 MD USA
4 shared publications - Amol Deshpande
University of Maryland
3 shared publications - Galileo Namata
University of Maryland
1 shared publication - Mustafa Bilgic
Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA
1 shared publication
Latest Publications
- Open Access
Bisimulation-based Approximate Lifted Inference
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.
Open AccessBisimulation-based Approximate Lifted Inference
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.
- Open Access
- 1 September 2010
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 3 (1-2) , 1068-1079
Read-once functions and query evaluation in probabilistic databases
- 1 September 2010
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 3 (1-2) , 1068-1079
Open AccessRead-once functions and query evaluation in probabilistic databases
- 7 March 2008
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 17 (2) , 136-163
Cost-sensitive learning with conditional Markov networks
- 7 March 2008
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 17 (2) , 136-163
Cost-sensitive learning with conditional Markov networks
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 596-605
Representing and Querying Correlated Tuples in Probabilistic Databases
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 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 596-605
Representing and Querying Correlated Tuples in Probabilistic Databases
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.