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

Databases and Information Systems Commons™

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

2005

Discipline
Institution
Keyword
Publication
Publication Type

Articles 181 - 196 of 196

Full-Text Articles in Databases and Information Systems

Recommender Systems Research, Saverio Perugini Jan 2005

Recommender Systems Research, Saverio Perugini

Computer Science Faculty Publications

We outline the history of recommender systems from their roots in information retrieval and filtering to their role in today’s Internet economy. Recommender systems attempt to reduce information overload and retain customers by selecting a subset of items from a universal set based on user preferences. Research in recommender systems lies at the intersection of several areas of computer science, such as artificial intelligence and human-computer interaction, and has progressed to an important research area of its own. It is important to note that recommendations are not delivered within a vacuum, but rather cast within an informal community of users …

Go to article

The Good, Bad And The Indifferent: Explorations In Recommender System Health, Benjamin J. Keller, Sun-Mi Kim, N. Srinivas Vemuri, Naren Ramakrishnan, Saverio Perugini Jan 2005

The Good, Bad And The Indifferent: Explorations In Recommender System Health, Benjamin J. Keller, Sun-Mi Kim, N. Srinivas Vemuri, Naren Ramakrishnan, Saverio Perugini

Computer Science Faculty Publications

Our work is based on the premise that analysis of the connections exploited by a recommender algorithm can provide insight into the algorithm that could be useful to predict its performance in a fielded system. We use the jumping connections model defined by Mirza et al. [6], which describes the recommendation process in terms of graphs. Here we discuss our work that has come out of trying to understand algorithm behavior in terms of these graphs. We start by describing a natural extension of the jumping connections model of Mirza et al., and then discuss observations that have come from …

Go to article

A Uniform Approach To Logic Programming Semantics, Pascal Hitzler, Matthias Wendt Jan 2005

A Uniform Approach To Logic Programming Semantics, Pascal Hitzler, Matthias Wendt

Computer Science and Engineering Faculty Publications

Part of the theory of programming and nonymonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more successful and acknowledged than others. The rationales behind those various semantics have been manifold, depending on one's point of view, which may be that of a programmer or inspired by commonsense reasoning, and consequently the constructions which lead to these semantics are technically very diverse, and the exact relationships between them have not yet been fully understood. In this paper, we present a conceptually new method, …

Go to article

Dlp - An Introduction, Denny Vrandecic, Pascal Hitzler, Rudi Studer Jan 2005

Dlp - An Introduction, Denny Vrandecic, Pascal Hitzler, Rudi Studer

Computer Science and Engineering Faculty Publications

DLP - Description Logic Programs - is the name for the common language that is able to integrate knowledge bases described in Description Logic with Logic Programs. In this introduction, we offer a very short overview of DLP, the motivation for it, the benefits it offers and how to use it.

Go to article

Glyde - An Expressive Xml Standard For The Representation Of Glycan, Satya S. Sahoo, Christopher Thomas, Amit P. Sheth, Cory Andrew Henson, William S. York Jan 2005

Glyde - An Expressive Xml Standard For The Representation Of Glycan, Satya S. Sahoo, Christopher Thomas, Amit P. Sheth, Cory Andrew Henson, William S. York

Kno.e.sis Publications

The amount of glycomics data being generated is rapidly increasing as a result of improvements in analytical and computational methods. Correlation and analysis of this large, distributed data set requires an extensible and flexible representational standard that is also ‘understood’ by a wide range of software applications. An XML-based data representation standard that faithfully captures essential structural details of a glycan moiety along with additional information (such as data provenance) to aid the interpretation and usage of glycan data, will facilitate the exchange of glycomics data across the scientific community. To meet this need, we introduce GLYcan Data Exchange (GLYDE) …

Go to article

Semantic Web & Semantic Web Services: Applications In Healthcare And Scientific Research, Amit P. Sheth Jan 2005

Semantic Web & Semantic Web Services: Applications In Healthcare And Scientific Research, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Discovering Informative Subgraphs In Rdf Graphs, William H. Milnor, Cartic Ramakrishnan, Matthew Perry, Amit P. Sheth, John A. Miller, Krzysztof Kochut Jan 2005

Discovering Informative Subgraphs In Rdf Graphs, William H. Milnor, Cartic Ramakrishnan, Matthew Perry, Amit P. Sheth, John A. Miller, Krzysztof Kochut

Kno.e.sis Publications

Discovering patterns in graphs has long been an area of interest. In most contemporary approaches to such pattern discovery either quantitative anomalies or frequency of substructure is used to measure the interestingness of a pattern. In this paper we address the issue of discovering informative sub-graphs within RDF graphs. We motivate our work with an example related to Semantic Search. A user might pose a question of the form: ' What are the most relevant ways in which entity X is related to entity Y?' the response to which is a subgraph connecting X to Y. Relevance of the …

Go to article

Adaptive Decision Support For Academic Course Scheduling Using Intelligent Software Agents, Prithviraj Dasgupta, Deepak Khazanchi Jan 2005

Adaptive Decision Support For Academic Course Scheduling Using Intelligent Software Agents, Prithviraj Dasgupta, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

Academic course scheduling is a complex operation that requires the interaction between different users including instructors and course schedulers to satisfy conflicting constraints in an optimal manner. Traditionally, this problem has been addressed as a constraint satisfaction problem where the constraints are stationary over time. In this paper, we address academic course scheduling as a dynamic decision support problem using an agent-enabled adaptive decision support system. In this paper, we describe the Intelligent Agent Enabled Decision Support (IAEDS) system, which employs software agents to assist humans in making strategic decisions under dynamic and uncertain conditions. The IAEDS system has a …

Go to article

Social Indicators In Cleveland's Ward 17, Mark Salling, Sharon Bliss, Joseph Ahern Jan 2005

Social Indicators In Cleveland's Ward 17, Mark Salling, Sharon Bliss, Joseph Ahern

All Maxine Goodman Levin School of Urban Affairs Publications

No abstract provided.

Go to article

Towards Persistent Resource Identification With The Uniform Resource Name, Luke Brown Jan 2005

Towards Persistent Resource Identification With The Uniform Resource Name, Luke Brown

Theses : Honours

The exponential growth of the Internet, and the subsequent reliance on the resources it connects, has exposed a clear need for an Internet identifier which remains accessible over time. Such identifiers have been dubbed persistent identifiers owing to the promise of reliability they imply. Persistent naming systems exist at present, however it is the resolution of these systems into what Kunze, (2003) calls "persistent actionable identifiers" which is the focus of this work. Actionable identifiers can be thought of as identifiers which are accessible in a simple fashion such as through a web browser or through a specific application. This …

Go to article

Exploring Bit-Difference For Approximate Knn Search In High-Dimensional Databases, Bin Cui, Heng Tao Shen, Jialie Shen, Kian-Lee Tan Jan 2005

Exploring Bit-Difference For Approximate Knn Search In High-Dimensional Databases, Bin Cui, Heng Tao Shen, Jialie Shen, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

In this paper, we develop a novel index structure to support effcient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., Euclidean distance) between two points contributes a dominant portion of the overall query response time for memory processing. To reduce the distance computation, we first propose a structure (BID) using BIt-Difference to answer approximate KNN query. The BID employs one bit to represent each feature vector of point and the number of bit-difference is used to prune the further points. To facilitate real dataset which is typically skewed, we enhance …

Go to article

Linear Correlation Discovery In Databases: A Data Mining Approach, Cecil Chua, Roger Hsiang-Li Chiang, Ee Peng Lim Jan 2005

Linear Correlation Discovery In Databases: A Data Mining Approach, Cecil Chua, Roger Hsiang-Li Chiang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Very little research in knowledge discovery has studied how to incorporate statistical methods to automate linear correlation discovery (LCD). We present an automatic LCD methodology that adopts statistical measurement functions to discover correlations from databases’ attributes. Our methodology automatically pairs attribute groups having potential linear correlations, measures the linear correlation of each pair of attribute groups, and confirms the discovered correlation. The methodology is evaluated in two sets of experiments. The results demonstrate the methodology’s ability to facilitate linear correlation discovery for databases with a large amount of data.

Go to article

Applying Scenario-Based Design And Claim Analysis To The Design Of A Digital Library Of Geography Examination Resources, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim, Zehua Liu, Ming Yin, Natalie Lee-San Pang, Patricia Bao-Bao Wong Jan 2005

Applying Scenario-Based Design And Claim Analysis To The Design Of A Digital Library Of Geography Examination Resources, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim, Zehua Liu, Ming Yin, Natalie Lee-San Pang, Patricia Bao-Bao Wong

Research Collection School Of Computing and Information Systems

This paper describes the application of Carroll’s scenario-based design and claims analysis as a means of refinement to the initial design of a digital library of geographical resources (GeogDL) to prepare Singapore students to take a national examination in geography. GeogDL is built on top of G-Portal, a digital library providing services over geospatial and georeferenced Web content. Beyond improving the initial design of GeogDL, a main contribution of the paper is making explicit the use of Carroll’s strong theory-based but undercapitalized scenario-based design and claims analysis that inspired recommendations for the refinement of GeogDL. The paper concludes with an …

Go to article

Ontology-Assisted Mining Of Rdf Documents, Tao Jiang, Ah-Hwee Tan Jan 2005

Ontology-Assisted Mining Of Rdf Documents, Tao Jiang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Resource description framework (RDF) is becoming a popular encoding language for describing and interchanging metadata of web resources. In this paper, we propose an Apriori-based algorithm for mining association rules (AR) from RDF documents. We treat relations (RDF statements) as items in traditional AR mining to mine associations among relations. The algorithm further makes use of a domain ontology to provide generalization of relations. To obtain compact rule sets, we present a generalized pruning method for removing uninteresting rules. We illustrate a potential usage of AR mining on RDF documents for detecting patterns of terrorist activities. Experiments conducted based on …

Go to article

Introduction: Data Communication And Topology Algorithms For Sensor Networks, Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic Jan 2005

Introduction: Data Communication And Topology Algorithms For Sensor Networks, Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic

Computer Science Faculty Publications

(First paragraph) We are very proud and honored to have been entrusted to be Guest Editors for this special issue. Papers were sought to comprehensively cover the algorithmic issues in the “hot” area of sensor networking. The concentration was on network layer problems, which can be divided into two groups: data communication problems and topology control problems. We wish to briefly introduce the five papers appearing in this special issue. They cover specific problems such as time division for reduced collision, fault tolerant clustering, self-stabilizing graph optimization algorithms, key pre-distribution for secure communication, and distributed storage based on spanning trees …

Go to article

Systems Analysis And Design: Should We Be Researching What We Teach?, A. Bajaj, D. Batra, A. Hevner, J. Parsons, Keng Siau Jan 2005

Systems Analysis And Design: Should We Be Researching What We Teach?, A. Bajaj, D. Batra, A. Hevner, J. Parsons, Keng Siau

Research Collection School Of Computing and Information Systems

A guiding premise of academic scholarship is that knowledge gained from first-hand research experience is disseminated to students via the classroom. However, that valuable connection is lost when professors are not researching what they teach. In this paper, we explore issues of mismatch between teaching and research in the Information Systems (IS) discipline. Specifically, while systems analysis and design (SA&D) is an integral topic in IS curricula, this topic is the research specialty of few IS professors. This situation is reflected by the low number of research publications in this area; particularly in the leading mainstream IS journals. We characterize …

Go to article

First Prev