Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Data mining (5)
- Ontology (4)
- Semantic Analytics (3)
- Artificial intelligence (2)
- Benchmark Ontology (2)
-
- Classification (2)
- Clustering (2)
- Evaluation Ontology (2)
- Information Theory (2)
- Multivariate analysis discrete multivariate modeling (2)
- Probabilistic graphical modeling (2)
- Reconstructability Analysis (2)
- Test-Bed (2)
- Web Services Discovery (2)
- AI (1)
- Access control (1)
- Adaptive Resonance Theory (ART) (1)
- Assessment (1)
- Association rule mining (1)
- Astronomical databases (1)
- Biomedical text (1)
- Brain-computer interface (1)
- Case decisions (1)
- Catalogs (1)
- Client-server architecture (1)
- Clip-based similarity (1)
- Complex object formats (1)
- Constrained frequent episode (1)
- Constraint learning (1)
- Content-based Image Retrieval (1)
Articles 61 - 74 of 74
Full-Text Articles in Physical Sciences and Mathematics
On The Decidability Of The Termination Problem Of Active Database Systems, James Bailey, Guozhu Dong, K. Rammamohanarao
On The Decidability Of The Termination Problem Of Active Database Systems, James Bailey, Guozhu Dong, K. Rammamohanarao
Kno.e.sis Publications
Active database systems enhance the functionality of traditional databases through the use of active rules or ‘triggers’. One of the principal analysis questions for such systems is that of termination—is it possible for the rules to recursively activate one another indefinitely, given an initial triggering event. In this paper, we study the decidability of the termination problem, our aim being to delimit the boundary between the decidable and the undecidable. We present results for two broad types of variations, variations in rule syntax and variations in meta level features. Within each of these, we identify members close to the …
Semantic Integration Of Glycomics Data And Information, William S. York, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller, Christopher Thomas, Karthik Gomadam, X. Yi, Meenakshi Nagarajan
Semantic Integration Of Glycomics Data And Information, William S. York, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller, Christopher Thomas, Karthik Gomadam, X. Yi, Meenakshi Nagarajan
Kno.e.sis Publications
No abstract provided.
Discovering And Ranking Semantic Associations Over A Large Rdf Metabase, Christian Halaschek-Wiener, Boanerges Aleman-Meza, I. Budak Arpinar, Amit P. Sheth
Discovering And Ranking Semantic Associations Over A Large Rdf Metabase, Christian Halaschek-Wiener, Boanerges Aleman-Meza, I. Budak Arpinar, Amit P. Sheth
Kno.e.sis Publications
Information retrieval over semantic metadata has recently received a great amount of interest in both industry and academia. In particular, discovering complex and meaningful relationships among this data is becoming an active research topic. Just as ranking of documents is a critical component of today's search engines, the ranking of relationships will be essential in tomorrow's semantic analytics engines. Building upon our recent work on specifying these semantic relationships, which we refer to as Semantic Associations, we demonstrate a system where these associations are discovered among a large semantic metabase represented in RDF. Additionally we employ ranking techniques to provide …
Exploiting Syntactic, Semantic And Lexical Regularities In Language Modeling Via Directed Markov Random Fields, Shaojun Wang, Shaomin Wang, Russell Greiner, Dale Schuurmans, Li Cheng
Exploiting Syntactic, Semantic And Lexical Regularities In Language Modeling Via Directed Markov Random Fields, Shaojun Wang, Shaomin Wang, Russell Greiner, Dale Schuurmans, Li Cheng
Kno.e.sis Publications
No abstract provided.
Directed Extended Dependency Analysis For Data Mining, Thaddeus T. Shannon, Martin Zwick
Directed Extended Dependency Analysis For Data Mining, Thaddeus T. Shannon, Martin Zwick
Systems Science Faculty Publications and Presentations
Extended dependency analysis (EDA) is a heuristic search technique for finding significant relationships between nominal variables in large data sets. The directed version of EDA searches for maximally predictive sets of independent variables with respect to a target dependent variable. The original implementation of EDA was an extension of reconstructability analysis. Our new implementation adds a variety of statistical significance tests at each decision point that allow the user to tailor the algorithm to a particular objective. It also utilizes data structures appropriate for the sparse data sets customary in contemporary data mining problems. Two examples that illustrate different approaches …
Java-Based Digital Library Portal For Geography Education, Zehua Liu, Hai Yuan, Ee Peng Lim, Ming Yin, Dion Hoe-Lian Goh, Yin-Leng Theng, Wee-Keong Ng
Java-Based Digital Library Portal For Geography Education, Zehua Liu, Hai Yuan, Ee Peng Lim, Ming Yin, Dion Hoe-Lian Goh, Yin-Leng Theng, Wee-Keong Ng
Research Collection School Of Computing and Information Systems
G-Portal is a Java-based digital library system for managing the metadata of geography related resources on the Web. In addition to providing a flexible repository subsystem to accommodate metadata of different formats using XML and XML Schemas, G-Portal organizes metadata into projects and layers, and supports an integrated and synchronized classification and map-based interfaces over the stored metadata. G-Portal also includes a classification subsystem that creates category structures and classifies metadata resources into categories based on user-specified classification schemas. Furthermore, G-Portal users can annotate resources and make their annotations available to others. In this paper, we describe the design and …
Semantic Visualization: Interfaces For Exploring And Exploiting Ontology, Knowledgebase, Heterogeneous Content And Complex Relationships, Amit P. Sheth, David Avant
Semantic Visualization: Interfaces For Exploring And Exploiting Ontology, Knowledgebase, Heterogeneous Content And Complex Relationships, Amit P. Sheth, David Avant
Kno.e.sis Publications
Technology platforms and products for ontology-driven process of semantic applications that serve both Enterprise wide and pan-Web needs are both available and being deployed. Similar to the development of enterprise software applications, the creation of an ontology driven semantic application can be described as a set of distinct phases that compose a lifecycle. From conception to deployment, these phases involve human interaction with a broad variety of information, identified as heterogeneous data, metadata, knowledge and ontology. Based on experience spanning academic research at the LSDIS lab through deployed commercial semantic applications based on Semagix Freedom, this paper provides examples of …
Early Work In Database Research On Schema Mapping/Merging/Transformation, Semantic Heterogeneity, And Use Of Ontology And Description Logics For Schematic And Semantic Integration, Amit P. Sheth
Kno.e.sis Publications
No abstract provided.
Using Symbolic Knowledge In The Umls To Disambiguate Words In Small Datasets With A Naive Bayes Classifier, Gondy Leroy, Thomas C. Rindflesch
Using Symbolic Knowledge In The Umls To Disambiguate Words In Small Datasets With A Naive Bayes Classifier, Gondy Leroy, Thomas C. Rindflesch
CGU Faculty Publications and Research
Current approaches to word sense disambiguation use and combine various machine-learning techniques. Most refer to characteristics of the ambiguous word and surrounding words and are based on hundreds of examples. Unfortunately, developing large training sets is time-consuming. We investigate the use of symbolic knowledge to augment machine-learning techniques for small datasets. UMLS semantic types assigned to concepts found in the sentence and relationships between these semantic types form the knowledge base. A naïve Bayes classifier was trained for 15 words with 100 examples for each. The most frequent sense of a word served as the baseline. The effect of increasingly …
Capturing The Dialectic Between Principles And Cases, Kevin D. Ashley
Capturing The Dialectic Between Principles And Cases, Kevin D. Ashley
Articles
Theorists in ethics and law posit a dialectical relationship between principles and cases; abstract principles both inform and are informed by the decisions of specific cases. Until recently, however, it has not been possible to investigate or confirm this relationship empirically. This work involves a systematic study of a set of ethics cases written by a professional association's board of ethical review. Like judges, the board explains its decisions in opinions. It applies normative standards, namely principles from a code of ethics, and cites past cases. We hypothesized that the board's explanations of its decisions elaborated upon the meaning and …
Staging Transformations For Multimodal Web Interaction Management, Michael Narayan, Christopher Williams, Saverio Perugini, Naren Ramakrishnan
Staging Transformations For Multimodal Web Interaction Management, Michael Narayan, Christopher Williams, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
Multimodal interfaces are becoming increasingly ubiquitous with the advent of mobile devices, accessibility considerations, and novel software technologies that combine diverse interaction media. In addition to improving access and delivery capabilities, such interfaces enable flexible and personalized dialogs with websites, much like a conversation between humans. In this paper, we present a software framework for multimodal web interaction management that supports mixed-initiative dialogs between users and websites. A mixed-initiative dialog is one where the user and the website take turns changing the flow of interaction. The framework supports the functional specification and realization of such dialogs using staging transformations – …
Program Transformations For Information Personalization, Saverio Perugini
Program Transformations For Information Personalization, Saverio Perugini
Computer Science Faculty Publications
Personalization constitutes the mechanisms and technologies necessary to customize information access to the end-user. It can be defined as the automatic adjustment of information content, structure, and presentation. The central thesis of this dissertation is that modeling interaction explicitly in a representation, and studying how partial information can be harnessed in it by program transformations to direct the flow of the interaction, can provide insight into, reveal opportunities for, and define a model for personalized interaction. To evaluate this thesis, a formal modeling methodology is developed for personalizing interactions with information systems, especially hierarchical hypermedia, based on program transformations. The …
An Overview Of Reconstructability Analysis, Martin Zwick
An Overview Of Reconstructability Analysis, Martin Zwick
Systems Science Faculty Publications and Presentations
This paper is an overview of reconstructability analysis (RA), a discrete multivariate modeling methodology developed in the systems literature; an earlier version of this tutorial is Zwick (2001). RA was derived from Ashby (1964), and was developed by Broekstra, Cavallo, Cellier Conant, Jones, Klir, Krippendorff, and others (Klir, 1986, 1996). RA resembles and partially overlaps log‐line (LL) statistical methods used in the social sciences (Bishop et al., 1978; Knoke and Burke, 1980). RA also resembles and overlaps methods used in logic design and machine learning (LDL) in electrical and computer engineering (e.g. Perkowski et al., 1997). Applications of RA, like …
Reconstructability Analysis With Fourier Transforms, Martin Zwick
Reconstructability Analysis With Fourier Transforms, Martin Zwick
Systems Science Faculty Publications and Presentations
Fourier methods used in two‐ and three‐dimensional image reconstruction can be used also in reconstructability analysis (RA). These methods maximize a variance‐type measure instead of information‐theoretic uncertainty, but the two measures are roughly collinear and the Fourier approach yields results close to that of standard RA. The Fourier method, however, does not require iterative calculations for models with loops. Moreover, the error in Fourier RA models can be assessed without actually generating the full probability distributions of the models; calculations scale with the size of the data rather than the state space. State‐based modeling using the Fourier approach is also …