24 citations · 39 across the 13 of their papers we have counts for
9 papers · 1 filter
VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality
Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya
Approximate subgraph matching, which is an important primitive for many applications like question answering, community detection, and motif discovery, often involves large labeled…
Computing and Maintaining Provenance of Query Result Probabilities in Uncertain Knowledge Graphs
Garima Gaur, Abhishek Dang, Arnab Bhattacharya +1
Knowledge graphs (KG) that model the relationships between entities as labeled edges (or facts) in a graph are mostly constructed using a suite of automated extractors, thereby inh…
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces
Akhil Arora, Sakshi Sinha, Piyush Kumar +1
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necess…
K-Dominant Skyline Join Queries: Extending the Join Paradigm to K-Dominant Skylines
Anuradha Awasthi, Arnab Bhattacharya, Sanchit Gupta +1
Skyline queries enable multi-criteria optimization by filtering objects that are worse in all the attributes of interest than another object. To handle the large answer set of skyl…
Minimally Infrequent Itemset Mining using Pattern-Growth Paradigm and Residual Trees
Ashish Gupta, Akshay Mittal, Arnab Bhattacharya
Itemset mining has been an active area of research due to its successful application in various data mining scenarios including finding association rules. Though most of the past w…
INSTRUCT: Space-Efficient Structure for Indexing and Complete Query Management of String Databases
Sourav Dutta, Arnab Bhattacharya
The tremendous expanse of search engines, dictionary and thesaurus storage, and other text mining applications, combined with the popularity of readily available scanning devices a…