Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems Commons™

Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1111 - 1140 of 1505

Full-Text Articles in Databases and Information Systems

The State Of Public Access To Federal Government Databases Detailed In Recommended New Book, Jennifer L. Behrens Jan 2008

The State Of Public Access To Federal Government Databases Detailed In Recommended New Book, Jennifer L. Behrens

Faculty Scholarship

No abstract provided.

Go to article

Document Selection For Extracting Entity And Relationship Instances Of Terrorist Events, Zhen Sun, Ee Peng Lim, Kuiyu Chang, Maggy Anastasia Suryanto, Rohan Kumar Gunaratna Jan 2008

Document Selection For Extracting Entity And Relationship Instances Of Terrorist Events, Zhen Sun, Ee Peng Lim, Kuiyu Chang, Maggy Anastasia Suryanto, Rohan Kumar Gunaratna

Research Collection School Of Computing and Information Systems

In this chapter, we study the problem of selecting documents so as to extract terrorist event information from a collection of documents. We represent an event by its entity and relation instances. Very often, these entity and relation instances have to be extracted from multiple documents. We therefore define an information extraction (IE) task as selecting documents and extracting from which entity and relation instances relevant to a user-specified event (aka domain specific event entity and relation extraction). We adopt domain specific IE patterns to extract potentially relevant entity and relation instances from documents, and develop a number of document …

Go to article

A General Boosting Method And Its Application To Learning Ranking Functions For Web Search, Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier Chapelle, Keke Chen, Gordon Sun Dec 2007

A General Boosting Method And Its Application To Learning Ranking Functions For Web Search, Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier Chapelle, Keke Chen, Gordon Sun

Kno.e.sis Publications

We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach is based on optimization of quadratic upper bounds of the loss functions which allows us to present a rigorous convergence analysis of the algorithm. More importantly, this general framework enables us to use a standard regression base learner such as decision trees for fitting any loss function. We illustrate an application of the proposed method in learning ranking functions for Web search by combining both preference data and labeled data for training. We present experimental …

Go to article

Video On The Semantic Sensor Web, Cory Andrew Henson, Amit P. Sheth, Prateek Jain, Josh Pschorr, Terry Rapoch Dec 2007

Video On The Semantic Sensor Web, Cory Andrew Henson, Amit P. Sheth, Prateek Jain, Josh Pschorr, Terry Rapoch

Kno.e.sis Publications

Millions of sensors around the globe currently collect avalanches of data about our world. The rapid development and deployment of sensor technology is intensifying the existing problem of too much data and not enough knowledge. With a view to alleviating this glut, we propose that sensor data, especially video sensor data, can be annotated with semantic metadata to provide contextual information about videos on the Web. In particular, we present an approach to annotating video sensor data with spatial, temporal, and thematic semantic metadata. This technique builds on current standardization efforts within the W3C and Open Geospatial Consortium (OGC) and …

Go to article

Towards Tractable Local Closed World Reasoning For The Semantic Web, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler Dec 2007

Towards Tractable Local Closed World Reasoning For The Semantic Web, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and closed world reasoning for the Semantic Web. We present an extension based on a new three-valued framework including an alternating fixpoint, the well-founded MKNF model. This approach, the well-founded MKNF semantics, derives its name from the very close relation to the corresponding semantics known from logic programming. We show that the well-founded MKNF model is the least model among all (three-valued) MKNF models, thus soundly approximating also the two-valued MKNF models from …

Go to article

Semantic Web For Health Care And Biomedical Informatics, Amit P. Sheth Dec 2007

Semantic Web For Health Care And Biomedical Informatics, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Leveraging Semantic Web Techniques To Gain Situational Awareness, Amit P. Sheth Nov 2007

Leveraging Semantic Web Techniques To Gain Situational Awareness, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

The Librarian As Hacker, Getting More From Google, R Philip Reynolds Nov 2007

The Librarian As Hacker, Getting More From Google, R Philip Reynolds

Librarian and Staff Publications

This paper will cover four areas. First it will discuss the research habits of search engine users and some of the problems with these habits. Then it will discuss librarians' use of search engines. Here we encounter the real question: Do we do much better? Can we use a search engines to their full potential? When needed, can we hack an engine to make it perform beyond its intended function? Can we use a clever workaround to solve a problem? Or are we on a level playing field with our patrons once we get outside traditional database searching? Google currently …

Go to article

Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler Nov 2007

Conjunctive Queries For A Tractable Fragment Of Owl 1.1, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries-namely conjunctive ones-can be used in conjunction with OWL such that one of the major design criteria of the latter-namely decidability-can be retained. More precisely, we show that querying the tractable fragment EL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted EL++ is undecidable.

Go to article

Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth Nov 2007

Can Semantic Web Techniques Empower Comprehension And Projection In Cyber Situational Awareness?, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth Nov 2007

Semantic Convergence Of Wikipedia Articles, Christopher J. Thomas, Amit P. Sheth

Kno.e.sis Publications

Social networking, distributed problem solving and human computation have gained high visibility. Wikipedia is a well established service that incorporates aspects of these three fields of research. For this reason it is a good object of study for determining quality of solutions in a social setting that is open, completely distributed, bottom up and not peer reviewed by certified experts. In particular, this paper aims at identifying semantic convergence of Wikipedia articles; the notion that the content of an article stays stable regardless of continuing edits. This could lead to an automatic recommendation of good article tags but also add …

Go to article

Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain Nov 2007

Supporting Complex Thematic, Spatial And Temporal Queries Over Semantic Web Data, Matthew Perry, Amit P. Sheth, Farshad Hakimpour, Prateek Jain

Kno.e.sis Publications

Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, the analytical process 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 metadata model for analysis of thematic, spatial and temporal relationships between named entities. We …

Go to article

A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer Oct 2007

A Multi-Objective Genetic Algorithm That Employs A Hybrid Approach For Isolating Codon Usage Bias Indicative Of Translational Efficiency, Douglas W. Raiford, Dan E. Krane, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Isolation of translational efficiency bias can have important applications in gene expression prediction and heterologous protein production. In some genomes the presence of a high GC(AT)-content bias can confound the isolation of translational efficiency bias. In other organisms translational efficiency bias is weak making it difficult to isolate. Described here is a multi-objective genetic algorithm that improves the isolation of translational efficiency bias in Streptomyces coelicolor A3(2) and Pseudomonas aeruginosa PAO1, two organisms shown to have high GC-content and weak translational efficiency bias.

Go to article

Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai Oct 2007

Swashup: Situational Web Applications Mashups, E. Michael Maximilien, Ajith Harshana Ranabahu, Stefan Tai

Kno.e.sis Publications

Distributed programming has shifted from private networks to the Internet using heterogeneous Web APIs. This enables the creation of situational applications of composed services exposing user interfaces, i.e., mashups. However, this programmable Web lacks unified models that can facilitate mashup creation, reuse, and deployments. This poster demonstrates a platform to facilitate Web 2.0 mashups.

Go to article

A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer Oct 2007

A Proposed Statistical Protocol For The Analysis Of Metabolic Toxicological Data Derived From Nmr Spectroscopy, Benjamin J. Kelly, Paul E. Anderson, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Nuclear magnetic resonance (NMR) spectroscopy is a non-invasive method of acquiring a metabolic profile from biofluids. This metabolic information may provide keys to the early detection of exposure to a toxin. A typical NMR toxicology data set has low sample size and high dimensionality. Thus, traditional pattern recognition techniques are not always feasible. In this paper, we evaluate several common alternatives for isolating these biomarkers. The fold test, unpaired t-test, and paired t-test were performed on an NMR-derived toxicological data set and results were compared. The paired t-test method was preferred, due to its ability to attribute statistical significance, to …

Go to article

Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth Sep 2007

Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart Sep 2007

Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart

Computer Science and Engineering Faculty Publications

The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowledge representation for the Semantic Web, two different paradigms - namely Description Logics (DLs) and Logic Programming - are the two most successful approaches. A study of their exact relationships is thus paramount. An intersection of OWL with (function-free non-disjunctive) Datalog, called DLP (for Description Logic Programs), has been described in [1,2]. We provide normal forms for DLP in Description Logic syntax and in Datalog syntax, thus providing a bridge for the researcher and user who is familiar with …

Go to article

Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler Sep 2007

Comparing Disjunctive Well-Founded Semantics, Matthias Knorr, Pascal Hitzler

Computer Science and Engineering Faculty Publications

While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. In order to aid the quest for suitable disjunctive well-founded semantics, we present a systematic approach to a comparison based on level mappings, a recently introduced framework for characterizing logic programming semantics, which was quite successfully used for comparing the major semantics …

Go to article

Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler Sep 2007

Any-World Access To Owl From Prolog, Tobias Matzner, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The W3C standard OWL provides a decidable language for representing ontologies. While its use is rapidly spreading, efforts are being made by researchers worldwide to augment OWL with additional expressive features or by interlacing it with other forms of knowledge representation, in order to make it applicable for even further purposes. In this paper, we integrate OWL with one of the most successful and most widely used forms of knowledge representation, namely Prolog, and present a hybrid approach which layers Prolog on top of OWL in such a way that the open-world semantics of OWL becomes directly accessible within the …

Go to article

The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu Sep 2007

The Programmable Web: Agile, Social, And Grassroots Computing, E. Michael Maximilien, Ajith Harshana Ranabahu

Kno.e.sis Publications

Web services, the semantic Web, and Web 2.0 are three somewhat separate movements trying to make the Web a programmable substrate. While each has achieved some level of success on their own right, it is becoming apparent that the grassroots approach of the Web 2.0 is gaining greater success than the other two. In this paper we analyze each movement, briefly describing its main traits, and outlining its primary assumptions. We then frame the common problem of achieving a programmable Web within the context of distributed computing and software engineering and then attempt to show why Web 2.0 is closest …

Go to article

Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth Sep 2007

Sa-Rest And (S)Mashups: Adding Semantics To Restful Services, Jonathan Lathem, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

The evolution of the Web 2.0 phenomenon has led to the increased adoption of the RESTful services paradigm. RESTful services often take the form of RSS/Atom feeds and AJAX based light weight services. The XML based messaging paradigm of RESTful services has made it possible to compose various services together. Such compositions of RESTful services is widely referred to as Mashups. In this paper, we outline the limitations in current approaches to creating mashups. We address these limitations by proposing a framework called as SA-REST. SA-REST adds semantics to RESTful services. Our proposed framework builds upon the original ideas in …

Go to article

Sensor Data Management, Cory Andrew Henson Aug 2007

Sensor Data Management, Cory Andrew Henson

Kno.e.sis Publications

No abstract provided.

Go to article

Research On Multi-Agent-Based Shipping Information System, Kai Wang Aug 2007

Research On Multi-Agent-Based Shipping Information System, Kai Wang

World Maritime University Dissertations

No abstract provided.

Go to article

Csi Revisited: The Science Of Forensic Dna Analysis, Michael L. Raymer Aug 2007

Csi Revisited: The Science Of Forensic Dna Analysis, Michael L. Raymer

Kno.e.sis Publications

No abstract provided.

Go to article

Trailblazing, Complex Hypothesis Evaluation, Abductive Reasoning And Semantic Web - Exploring Possible Synergy, Amit P. Sheth Aug 2007

Trailblazing, Complex Hypothesis Evaluation, Abductive Reasoning And Semantic Web - Exploring Possible Synergy, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Relationship Web: Spinning The Semantic Web From Trailblazing To Complex Hypothesis Evaluation, Amit P. Sheth Aug 2007

Relationship Web: Spinning The Semantic Web From Trailblazing To Complex Hypothesis Evaluation, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu Aug 2007

Space Adaptation: Privacy-Preserving Multiparty Collaborative Mining With Geometric Perturbation, Keke Chen, Ling Liu

Kno.e.sis Publications

The service-oriented infrastructure has become popular for collaboratively mining data distributed over organizations [3], where the participants are the data providers who submit their perturbed datasets to the designated data mining service provider (the data miner) for mining commonly interested models.

Go to article

Mapping Better Business Strategies With Gis, Tin Seong Kam Aug 2007

Mapping Better Business Strategies With Gis, Tin Seong Kam

Research Collection School Of Computing and Information Systems

The value of location as a business measure is fast becoming an important consideration for organisations. GIS (Geographical Information Systems), with its capability to manage, display, analyse business information spatially, is emerging as a powerful location intelligence tool. In the US, Starbucks, Blockbuster, Hyundai, and thousands of other businesses use census data and GIS software to help them understand what types of people buy their products and services, and how to better market to these consumers. For example, McDonald’s in Japan uses a GIS system to overlay demographic information on maps to help identify promising new store sites. Singapore Management …

Go to article

Semantic Web: Promising Technologies And Current Applications In Health Care & Life Sciences, Amit P. Sheth Jul 2007

Semantic Web: Promising Technologies And Current Applications In Health Care & Life Sciences, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Efficient Computation Of Iceberg Cubes By Bounding Aggregate Functions, Xiuzhen Zhang, Pauline Lienhua Chou, Guozhu Dong Jul 2007

Efficient Computation Of Iceberg Cubes By Bounding Aggregate Functions, Xiuzhen Zhang, Pauline Lienhua Chou, Guozhu Dong

Kno.e.sis Publications

The iceberg cubing problem is to compute the multidimensional group-by partitions that satisfy given aggregation constraints. Pruning unproductive computation for iceberg cubing when nonantimonotone constraints are present is a great challenge because the aggregate functions do not increase or decrease monotonically along the subset relationship between partitions. In this paper, we propose a novel bound prune cubing (BP-Cubing) approach for iceberg cubing with nonantimonotone aggregation constraints. Given a cube over n dimensions, an aggregate for any group-by partition can be computed from aggregates for the most specific n--dimensional partitions (MSPs). The largest and smallest aggregate values computed this way become …

Go to article

First Prev Next Last