• Home
  • Kavitha Srinivas
Kavitha Srinivas

Kavitha Srinivas
RivetLabs

About

65
Publications
6,467
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
2,226
Citations
Citations since 2017
2 Research Items
492 Citations
2017201820192020202120222023020406080
2017201820192020202120222023020406080
2017201820192020202120222023020406080
2017201820192020202120222023020406080

Publications

Publications (65)
Article
Traditional automated theorem provers have relied on manually tuned heuristics to guide how they perform proof search. Recently, however, there has been a surge of interest in the design of learning mechanisms that can be integrated into theorem provers to improve their performance automatically. In this work, we describe TRAIL (Trial Reasoner for...
Article
Full-text available
Automated theorem provers have traditionally relied on manually tuned heuristics to guide how they perform proof search. Deep reinforcement learning has been proposed as a way to obviate the need for such heuristics, however, its deployment in automated theorem proving remains a challenge. In this paper we introduce TRAIL, a system that applies dee...
Conference Paper
Linked Data on the web consists of over 1000 datasets from a variety of domains. They are queried with the SPARQL query language. There exist many implementations of SPARQL, and this rich ecosystem has demanded a precise specification and compliance tests. However, the SPARQL specification has grown in complexity, and it is increasingly difficult f...
Conference Paper
SPARQL has many nice features for accessing data integrated across different data sources, which is an important step in any data analysis task. We report on the use of SPARQL for two real data analytic use cases from the healthcare and life sciences domains, which exposed certain weaknesses in the current specification of SPARQL, specifically when...
Conference Paper
We show that existing mature, relational optimizers can be exploited with a novel schema to give better performance for property graph storage and retrieval than popular noSQL graph stores. The schema combines relational storage for adjacency information with JSON storage for vertex and edge attributes. We demonstrate that this particular schema de...
Patent
A computer-implemented method, system, and article of manufacture for querying and integrating structured and unstructured data. The method includes: receiving entity information that is extracted from a first set of unstructured data using an open domain information extraction system, wherein the entity in-formation comprises relationship informat...
Patent
Full-text available
Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword sear...
Article
Full-text available
While much work has focused on efficient processing of Big Data, little work considers how to understand them. In this paper, we describe Helix, a system for guided exploration of Big Data. Helix provides a unified view of sources, ranging from spreadsheets and XML files with no schema, all the way to RDF graphs and relational data with well-define...
Patent
Full-text available
Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of...
Article
Full-text available
While much work has focused on efficient processing of Big Data, little work considers how to understand them. In this paper, we describe Helix, a system for guided exploration of Big Data. Helix provides a unified view of sources, ranging from spreadsheets and XML files with no schema, all the way to RDF graphs and relational data with well-define...
Conference Paper
In graph databases, a given graph query can be executed in a large variety of semantically equivalent ways. Each such execution plan produces the same results, but at different computation costs. The query planning problem consists of finding, for a given query, an execution plan with the minimum cost. The traditional greedy or heuristic cost-based...
Patent
Full-text available
Techniques for facilitating learning of one or more ontological rules of a resource description framework database are provided. The techniques include obtaining ontology vocabulary from a resource description framework database, generating a rule hypothesis by incrementally building upon a previously learnt rule from the database by adding one or...
Article
Although RDF graph data often come with an associated schema, recent studies have proven that real RDF data rarely conform to their perceived schemas. Since a number of data management decisions, including storage layouts, indexing, and efficient query processing, use schemas to guide the decision making, it is imperative to have an accurate descri...
Conference Paper
With many disparate information systems distributed among social and medical care facilities, achieving an integrated social and medical view of people is a huge challenge. We propose a system based on semantic integration that addresses this challenge. It achieves light-weight data integration and navigation via a three-layer architecture: a virtu...
Conference Paper
Full-text available
Efficient storage and querying of RDF data is of increasing importance, due to the increased popularity and widespread acceptance of RDF on the web and in the enterprise. In this paper, we describe a novel storage and query mechanism for RDF which works on top of existing relational representations. Reliance on relational representations of RDF mea...
Patent
Full-text available
A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will b...
Patent
Full-text available
Computer-implemented methods for mapping an element of a source information model to an element of a target information model, forming a cluster of elements for mapping across information models, and evaluating a mapping of elements across information models, and a system and computer program product thereof. The method of mapping an element of a s...
Patent
Methods, apparatus and systems, including computer program products, for reducing an error rate when mapping entities between a first ontology and a second ontology. One or more of a general language dictionary and an industry-specific dictionary are provided. Natural language processing of the first ontology is performed to identify one or more ca...
Conference Paper
Full-text available
In this paper, we describe a mechanism for ontology alignment using instance based matching of types (or classes). Instance-based matching is known to be a useful technique for matching ontologies that have different names and different structures. A key problem in instance matching of types, however, is scaling the matching algorithm to (a) handle...
Conference Paper
Full-text available
The size, heterogeneity and dynamicity of data within an enterprise makes indexing, integration and analysis of the data increasingly difficult tasks. On the other hand, there has been a massive increase in the amount of high-quality open data available on the Web that could provide invaluable insights to data analysts and business intelligence spe...
Conference Paper
The widespread adoption of the Resource Description Framework (RDF) for the representation of both open web and enterprise data is the driving force behind the increasing research interest in RDF data management. As RDF data management systems proliferate, so are benchmarks to test the scalability and performance of these systems under data and wor...
Conference Paper
Ontology alignment is an important problem for the linked data web, as more and more ontologies and ontology instances get published for specific domains such as government and healthcare. A number of (semi-)automated alignment systems have been proposed in recent years. Most combine a set of similarity functions on lexical, semantic and structural...
Conference Paper
A key problem in ontology alignment is that different ontological features (e.g., lexical, structural or semantic) vary widely in their importance for different ontology comparisons. In this paper, we present a set of principled techniques that exploit user feedback to customize the alignment process for a given pair of ontologies. Specifically, we...
Article
In this paper, we describe scalable highly expressive reasoner (SHER), a breakthrough technology that provides semantic querying of large relational datasets using OWL ontologies. SHER relies on a unique algorithm based on ontology summarization and combines a traditional in-memory description logic reasoner with a database backed RDF Store to scal...
Conference Paper
Full-text available
A common vocabulary is vital to smooth business operation, yet codifying and maintaining an enterprise vocabulary is an arduous, manual task. We describe a process to automatically extract a domain specific vocabulary (terms and types) from unstructured data in the enterprise guided by term definitions in Linked Open Data (LOD). We validate our tec...
Conference Paper
I will provide an overview of many of the use cases that we looked at to apply OWL ABox reasoning in the real world. The fields we covered included (a) healthcare, and life sciences where the plethora of ontologies might be seen as providing a strong use case for OWL reasoning, (b) information retrieval over unstructured text, (c) master data manag...
Conference Paper
A recent approach to the problem of ontology matching has been to convert the problem of ontology matching to information retrieval. We explore the utility of this approach in matching model elements of real UML, ER, EMF and XML-Schema models, where the semantics of the models are less precisely defined. We validate this approach with domain expert...
Article
Full-text available
As applications based on semantic web technologies enter the mainstream, there is a need to provide highly efficient ontology reason-ing over large Aboxes. However, achieving sufficient scalability is still a challenge, especially for expressive ontologies. In this paper, we present a hybrid approach which combines a fast, incomplete reasoning algo...
Conference Paper
Grounded conjunctive query answering over OWL-DL ontologies is intractable in the worst case, but we present novel techniques which allow for efficient querying of large expressive knowledge bases in secondary storage. In particular, we show that we can effectively answer grounded conjunctive queries without building a full completion forest for a...
Conference Paper
Full-text available
Within the health care and life sciences (HCLS) domain, a plethora of phenomena exists that range across the whole “vertical scale” of biomedicine. To accurately research and describe those phenomena, a tremendous amount of highly heterogeneous data have been produced and collected with various research methodologies encompassing the genetic, mole...
Article
Reasoning with large amounts of data together with ontological knowledge is becoming a pertinent issue. In this chapter, we will give an overviewof well-known ontology repositories, including native stores and database based stores, and highlight strengths and limitations of each store. We take Minerva as an example to analyze ontology storage in d...
Conference Paper
Full-text available
Reasoning over large ontologies can be done more effectively if they can be decomposed into smaller parts which can be reasoned on independently. This requires identifying parts of the ontology relevant to the problem at hand. We present a novel algorithm, based on resolution calculus, for decomposing an OWL ontology into smaller, more manage- able...
Conference Paper
Master data refers to core business entities a company uses repeatedly across many business processes and systems (such as lists or hierarchies of customers, suppliers, accounts, products, or organizational units). Product information is the most important kind of master data and product information management (PIM) is becoming critical for modern...
Conference Paper
Full-text available
The approach of using ontology reasoning to cleanse the out- put of information extraction tools was first articulated in SemantiClean. A limiting factor in applying this approach has been that ontology rea- soning to find inconsistencies does not scale to the size of data produced by information extraction tools. In this paper, we describe techniq...
Conference Paper
Full-text available
This paper describes a large case study that explores the ap- plicability of ontology reasoning to problems in the medical domain. We investigate whether it is possible to use such reasoning to automate com- mon clinical tasks that are currently labor intensive and error prone, and focus our case study on improving cohort selection for clinical tri...
Conference Paper
Full-text available
Query processing of OWL-DL ontologies is intractable in the worst case, but we present a novel technique that in practice allows for efficient querying of ontologies with large Aboxes in secondary storage. We focus on the processing of instance retrieval queries, i.e., queries that retrieve individuals in the Abox which are instances of a given con...
Conference Paper
Reasoning on OWL ontologies is known to be intractable in the worst-case, which is a serious problem because in practice, most OWL ontologies have large Aboxes, i.e., numerous assertions about individuals and their relations. We propose a technique that uses a summary of the ontology (summary Abox) to reduce reasoning to a small subset of the origi...
Conference Paper
Full-text available
In this paper, we describe our experiences with Semantic Web applications from the domain of life sciences, text mining and software engineering. In these domains, the state-of-the-art is limited to the use of simple taxonomies. This is partly because a sufficient set of use cases has not yet been developed to demonstrate the value of using more ex...
Conference Paper
In the era of distributed development, it is common for large applications to be assembled from multiple component layers that are developed by different development teams. Layered applications have deep call paths and numerous invocations (average call stack depth of up to 75, and upto 35 million invocations in the applications we studied) making...
Article
In this paper, we present an approach to automatically detect high impact coding errors in large Java applications which use frameworks. These high impact errors cause serious performance degradation and outages in real world production environments, are very time-consuming to detect, and potentially cost businesses thousands of dollars. Based on 3...
Conference Paper
In this paper, we present an approach to automatically detect high impact coding errors in large Java applications which use frameworks. These high impact errors cause serious performance degradation and outages in real world production environments, are very time-consuming to detect, and potentially cost businesses thousands of dollars. Based on 3...
Conference Paper
Frameworks are widely used to facilitate software reuse and accelerate development time. However, there are currently no systematic mechanisms to enforce the explicit and implicit rules of these frameworks. This paper focuses on a class of framework rules that place restrictions on the properties of data structures in framework applications. We pre...
Article
View combination refers to a process that allows generalization to novel views of an object by the combination of object views represented in memory. The present experiments examined whether the perceived similarity between views or the temporal separation of views poses constraints on the view combination process. The results indicated that, altho...
Article
Four experiments examined whether or not exposure to two views (A and B) of a novel object improves generalization to a third view (C) through view combination on tasks that required symmetry or recognition memory decisions. The results of Experiment 1 indicated that exposure to either View A or View B alone produced little or no generalization to...
Article
Full-text available
The claim that priming on implicit memory tasks such as word-fragment completion is sensitive to context effects was tested by using homographs (e.g., board) to manipulate context. On the basis of previous findings, it was assumed that presentation of only the perceptual cue at test ( oa d) should activate the dominant meaning, thereby creating t...
Article
Full-text available
Visual identification of 3-D objects depends on representations that are invariant across changes in size and left-right orientation. We examined whether this finding reflects the unique demands of processing 3-D objects, or whether it generalizes to 2-D patterns and to the tactile modality. Our findings suggest that object representation for ident...
Article
Full-text available
Explicit memory tests such as recognition typically access semantic, modality-independent representations, while perceptual implicit memory tests typically access presemantic, modality-specific representations. By demonstrating comparable cross- and within-modal priming using vision and haptics with verbal materials (Easton, Srinivas, & Greene, 199...
Article
Full-text available
We conducted three experiments to examine whether the anterior portion of the inferior temporal (IT) lobe is involved in the processing of visual objects in humans. In monkeys, damage to this region results in severe deficits in perception and in memory for visual objects. Our study was designed to examine both these processes in a patient (DM) wit...
Article
Recent research with visual objects has delineated important representational differences between memory measures that tap identification (implicit tests) and measures that require episodic recognition (explicit tests). We investigated whether these differences reflect a fundamental architecture for the representation of object information in memor...
Article
Full-text available
Previous assessments of verbal cross-modal priming have typically been conducted with the visual and auditory modalities. Within-modal priming is always found to be substantially larger than cross-modal priming, a finding that could reflect modality modularity, or alternatively, differences between the coding of visual and auditory verbal informati...
Article
The present study examined the effect of changing the contrast polarity and illumination of objects on explicit (episodic recognition) and implicit (fragment naming or object-nonobject decision) memory tasks. Changes in contrast polarity of line drawings of objects did not affect priming on fragment naming or on object-nonobject decision tasks but...
Article
Prior research has suggested that priming on perceptual implicit tests is insensitive to changes in stimulus size and reflection. The present experiments were performed to investigate whether size and reflection effects can be obtained in priming under conditions that encourage the processing of this information at study and at test, as predicted b...
Article
The effects of rotating familiar and novel objects in depth between study and test were explored on short-term recognition, long-term recognition, and priming tasks. Short-term recognition memory was not affected by rotation in depth when the study and test views shared the same visible parts. However, long-term recognition was sensitive to rotatio...
Article
Five experiments were conducted to examine whether varying certain perceptual attributes of study and test items influences priming on pictorial tasks. Priming was found to be specific to the form of studied items; substantial priming occurred from studying pictures, whereas little or no priming occurred from studying the pictures' names (read or g...
Chapter
Full-text available
implicit and explicit measures of memory / implicit memory and memory systems / transfer-appropriate processing / specificity of priming on verbal perceptual tests / specificity of perceptual priming in nonverbal tests / exceptions to specificity of priming / generality of priming: size, reflection, location (PsycINFO Database Record (c) 2012 APA,...
Article
Full-text available
The present research examined the role of phonological and orthographic properties of cues in mediating the retrieval of words from the mental lexicon. The task required subjects to resolve fragmented words when provided with semantically related cues (e.g., spiteful:---DIC----). Phonological properties of the letter cues were manipulated such that...
Article
In three experiments we investigated the nature of two implicit memory tests, free associating to category names and solving anagrams, by manipulating several variables during study. Additional implicit and explicit tests were included for comparison (word fragment completion and free recall). Primed category association responded like free recall...
Article
We have examined four criteria commonly used to distinguish separate memory systems: functional dissociation, independent neural systems, stochastic independence, and functional incompatibility. Current evidence fails to jointly satisfy these criteria in establishing independent systems, at least by our assessment. However, the proposed criteria ar...
Article
Full-text available
M. H. Erdelyi et al (see record 1989-38884-001) present evidence that variations in recall criteria can affect the number of items correctly recalled. In this comment, we (a) describe some procedural differences between their work and the earlier experiments of H. L. Roediger and D. G. Payne (see record 1986-13690-001), (b) note that their large...

Network

Cited By