Science and Technology Studies Commons^™

Connectionist Model Generation: A First-Order Approach, Sebastian Bader, Pascal Hitzler, Steffen Holldobler

Computer Science and Engineering Faculty Publications

Knowledge-based artificial neural networks have been applied quite successfully to propositional knowledge representation and reasoning tasks. However, as soon as these tasks are extended to structured objects and structure-sensitive processes as expressed e.g., by means of first-order predicate logic, it is not obvious at all what neural-symbolic systems would look like such that they are truly connectionist, are able to learn, and allow for a declarative reading and logical reasoning at the same time. The core method aims at such an integration. It is a method for connectionist model generation using recurrent networks with feed-forward core. We show in this …

Mediatability: Estimating The Degree Of Human Involvement In Xml Schema Mediation, Karthik Gomadam, Ajith Harshana Ranabahu, Lakshmish Ramaswamy, Amit P. Sheth, Kunal Verma

Kno.e.sis Publications

Mediation and integration of data are significant challenges because the number of services on the Web, and heterogeneities in their data representation, continue to increase rapidly. To address these challenges we introduce a new measure, mediatability, which is a quantifiable and computable metric for the degree of human involvement in XML schema mediation. We present an efficient algorithm to compute mediatability and an experimental study to analyze how semantic annotations affect the ease of mediating between two schemas. We validate our approach by comparing mediatability scores generated by our system with user-perceived difficulty. We also evaluate the scalability of our …

An Xml-Based Approach To Handling Tables In Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

We explore application of XML technology for handling tables in legacy semi-structured documents. Specifically, we analyze annotating heterogeneous documents containing tables to obtain a formalized XML Master document that improves traceability (hence easing verification and update) and enables manipulation using XSLT stylesheets. This approach is useful when table instances far outnumber distinct table types because the effort required to annotate a table instance is relatively less compared to formalizing table processing that respects table’s semantics. This work is also relevant for authoring new documents with tables that should be accessible to both humans and machines.

Applications Of Voting Theory To Information Mashups, Alfredo Alba, Varun Bhagwan, Julia Grace, Daniel Gruhl, Kevin Haas, Meenakshi Nagarajan, Jan Pieper, Christine Robson, Nachiketa Sahoo

Kno.e.sis Publications

Blogs, discussion forums and social networking sites are an excellent source for people's opinions on a wide range of topics. We examine the application of voting theory to "information mashups" - the combining and summarizing of data from the multitude of often-conflicting sources. This paper presents an information mashup in the music domain: a Top 10 artist chart based on user comments and listening behavior from several Web communities. We consider different voting systems as algorithms to combine opinions from multiple sources and evaluate their effectiveness using social welfare functions. Different voting schemes are found to work better in some …

Dependence Of Binary Associations On Co-Occurrence Granularity In News Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik

Kno.e.sis Publications

We describe and formalize an approach to correlate binary associations (such as between entities and events, between persons and events, etc.) implied by News documents on the co-occurrence granularity (such as document-level, paragraph-level, sentence-level, etc.) of the corresponding text phrases in the documents. Specifically, we present both qualitative and quantitative characterization of searching News documents: former in terms of the nature of the content and the queries, and latter in terms of a metric obtained by adapting the notions of precision and recall. Specifically, the approach tries to reduce the manual effort required to analyze the News documents to compare …

Semantic Web: Promising Technologies, Current Applications & Future Directions, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Description Logic Rules, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ – the basis for the ongoing standardisation of OWL 2 – can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ …

Boosting With Incomplete Information, Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao

Kno.e.sis Publications

In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we present a boosting approach that integrates features with incomplete information and those with complete information to form a strong classifier. By introducing hidden variables to model missing information, we form loss functions that combine fully labeled data with partially labeled data to effectively learn normalized and unnormalized models. The primal problems of the proposed optimization problems with these loss functions are provided to show their close relationship and the motivations behind them. …

A Framework For Trust And Distrust Networks, Krishnaprasad Thirunarayan

Kno.e.sis Publications

In this age of internet and electronic commerce it is becoming increasingly important to have and to manipulate information about the trustworthiness of the content or service providers in order to make informed decisions. This paper explores realistic models of trust and distrust based on partially ordered discrete values and proposes a framework, which is sensitive to local, relative ordering of values rather than their magnitudes. The framework distinguishes between direct and inferred trust, preferring direct information over possibly conflicting inferred information. It also represents ambiguity or inconsistency explicitly. The framework is capable of handling general trust and belief networks …

A Forgetting-Based Approach For Reasoning With Inconsistent Distributed Ontologies, Guilin Qi, Yimin Wang, Peter Haase, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In the context of multiple distributed ontologies, we are often confronted with the problem of dealing with inconsistency. In this paper, we propose an approach for reasoning with inconsistent distributed ontologies based on concept forgetting. We firstly define concept forgetting in description logics. We then adapt the notions of recoveries and preferred recoveries in propositional logic to description logics. Two consequence relations are then defined based on the preferred recoveries.

Graph Summaries For Subgraph Frequency Estimation, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman

Kno.e.sis Publications

A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the frequency of substructures within a query graph. In this work, we present and evaluate two techniques for estimating the frequency of subgraphs from a summary of the data graph. In the first technique, we assume that edge occurrences on edge sequences are position independent and summarize only the most informative dependencies. In the second technique, we prune small subgraphs using a valuation scheme that blends information about their importance and estimation power. In both …

Defeasible Inference With Circumscriptive Owl Ontologies, Stephan Grimm, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The Web Ontology Language (OWL) adheres to the openworld assumption and can thus not be used for forms of nonmonotonic reasoning or defeasible inference, an acknowledged desirable feature in open Semantic Web environments. We investigate the use of the formalism of circumscriptive description logics (DLs) to realise defeasible inference within the OWL framework. By example, we demonstrate how reasoning with (restricted) circumscribed OWL ontologies facilitates various forms of defeasible inference, also in comparison to alternative approaches. Moreover, we sketch an extension to DL tableaux for handling the circumscriptive case and report on a preliminary implementation.

Empowering Translational Research Using Semantic Web Technologies, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Sa-Rest: Using Semantics To Empower Restful Services And Smashups With Better Interoperability And Mediation, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Dynamic And Agile Soa Using Sawsdl, Karthik Gomadam, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

A Framework To Support Spatial, Temporal And Thematic Analytics Over Semantic Web Data, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

Spatial and temporal data are critical components in many applications. This is especially true in analytical applications ranging from scientific discovery to national security and criminal investigation. The analytical process often requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. In this paper, we describe a framework built around the RDF data model for analysis of thematic, spatial and temporal relationships between …

Ws3: International Workshop On Context-Enabled Source And Service Selection, Integration And Adaptation, Quan Z. Sheng, Ullas Nambiar, Amit P. Sheth, Biplav Srivastava, Zakaria Maamr, Said Elnaffar

Kno.e.sis Publications

This write-up provides a summary of the International Workshop on Context enabled Source and Service Selection, Integration and Adaptation (CSSSIA 2008), organized in conjunction with WWW2008, at Beijing, China on April 22nd 2008. We outline the motivation for organizing the work-shop, briefly describe the organizational details and program of the workshop, and summarize each of the papers accepted by the workshop. More information about the workshop can be found at http://www.cs.adelaide.edu.au/∼csssia08/.

Rdb2rdf: Incorporating Domain Semantics In Structured Data, Satya S. Sahoo

Kno.e.sis Publications

No abstract provided.

Reminiscences: Impact Of Textiles And Apparel Technology On Our Lives, Ann Beth Presley, Martha C. Jenkins

Applied Human Sciences

Women's perceptions of technological changes in textiles and apparel and how the changes have affected daily life were examined using the transmissive reminiscence technique. Technological advances do contribute to use of less time and effort and offer a greater variety of products, but the products often have a shorter life expectancy or are kept in inventory for a shorter time because it is more expedient to replace rather than repair or recycle textile and clothing items. Care must be taken to cultivate cohesive relationships within the family and teach values that were once inherent in textiles/ apparel tasks. Otherwise advances …

Artist Ranking Through Analysis Of On-Line Community Comments, Julia Grace, Daniel Gruhl, Kevin Haas, Meenakshi Nagarajan, Christine Robson, Nachiketa Sahoo

Kno.e.sis Publications

We describe an approach to measure the popularity of music tracks, albums and artists by analyzing the comments of music listeners in social networking online communities such as MySpace. This measure of popularity appears to be more accurate than the traditional measure based on album sales figures, as demonstrated by our focus group study. We faced many challenges in our attempt to generate a popularity ranking from the user comments on social networking sites, e.g., broken English sentences, comment spam, etc. We discuss the steps we took to overcome these challenges and describe an end to end system for generating …

Traveling The Semantic Web Through Space, Time, And Theme, Amit P. Sheth, Matthew Perry

Kno.e.sis Publications

In this installment of Semantics and Services, we further develop the idea of spatial, temporal, and thematic (STT) processing of semantic Web data and describe the Web infrastructure needed to support it. Starting from Ramesh Jain's vision of the EventWeb as a view of what's possible with a Web that better accommodates all three dimensions of event-related information (thematic, spatial, and temporal), we outline the architecture needed to support it and current research that aims to realize it.

Semantic Sensor Web, Amit P. Sheth, Cory Andrew Henson

Kno.e.sis Publications

No abstract provided.

Approximate Owl Instance Retrieval With Screech, Pascal Hitzler, Markus Krotzsch, Sebastian Rudolph, Tuvshintur Tserendorj

Computer Science and Engineering Faculty Publications

With the increasing interest in expressive ontologies for the Semantic Web, it is critical to develop scalable and efficient ontology reasoning techniques that can properly cope with very high data volumes. For certain application domains, approximate reasoning solutions, which trade soundness or completeness for increased reasoning speed, will help to deal with the high computational complexities which state of the art ontology reasoning tools have to face. In this paper, we present a comprehensive overview of the SCREECH approach to approximate instance retrieval with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes …

Semantics And Services Enabled Problem Solving Environment For Trypanosoma Cruzi, Amit P. Sheth, Rick L. Tarleton, Mark Musen, Satya S. Sahoo, Prashant Doshi, Natasha Noy

Kno.e.sis Publications

No abstract provided.

Semantic Sensor Web, Cory Andrew Henson

Kno.e.sis Publications

No abstract provided.

Ontology Driven Semantic Provenance For Heterogeneous Bionomics Experimental Data, Satya S. Sahoo, Michael L. Raymer, Cory Andrew Henson, Amit P. Sheth, William S. York

Kno.e.sis Publications

Scientific experimental data generated by all the bionomic technologies is characterized by heterogeneity in its representation formats, constituents, and generation processes and, therefore, also in its usage. Using the proteomics domain we demonstrate the important role of provenance information o manage, interpret and analyze experimental data. We present a novel approach that employs an ontology as a knowledge model to automatically create semantic provenance information for high-throughput mass spectrometry (MS) data in the glycoproteomics domain. The Semantic Provenance Annotation of Data in protEomics (SPADE) implementation is based on the ProPreO ontology, a large-process ontology ( ~500 classes, 40 named relationships …

Cheap Boolean Role Constructors For Description Logics, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We investigate the possibility of incorporating Boolean role constructors on simple roles into some of today's most popular description logics, focussing on cases where those extensions do not increase complexity of reasoning. We show that the expressive DLs SHOIQ and SROIQ, serving as the logical underpinning of OWL and the forthcoming OWL 2, can accommodate arbitrary Boolean expressions. The prominent OWL-fragment SHIQ can be safely extended by safe role expressions, and the tractable fragments EL++ and DLP retain tractability if extended by conjunction on roles, where in the case of DLP the restriction on role simplicity can even be discarded.

Mobile Semantic Computing, Karthik Gomadam, Anupam Joshi, Amit P. Sheth

Kno.e.sis Publications

We propose to organize a special session on research in the intersection of mobile computing, the Semantic Web and Web services.

This session will examine how the research in these areas can serve as a foundation for new architectural and communication paradigms that can enhance service creation, distribution, discovery, integration and utilization in distributed and ubiquitous environments. Some of the initial areas that our early research have highlighted are :

1. Semantic annotation of data in bandwidth constrained environments such as mobile networks to promote efficient bandwidth utilization
2. Possibilities of using microformats such as RDFa and opportunities that can be explored …

Services Mashups: The New Generation Of Web Applications, Djamal Benslimane, Schahram Dustdar, Amit P. Sheth

Kno.e.sis Publications

Web services are becoming a major technology for deploying automated interactions between distributed and heterogeneous applications, and for connecting business processes. Service mashups indicate a way to create new Web applications by combining existing Web resources utilizing data and Web APIs. They facilitate the design and development of novel and modern Web applications based on easy-to-accomplish end-user service compositions.

Semantic Sensor Web, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.