Canonical queries as a query answering device (Information Science)

Issued as Annual reports [nos. 1-2], and Final report, Project no. G-36-60

Information Theoretic Graph Kernels

This thesis addresses the problems that arise in state-of-the-art structural learning methods for (hyper)graph classification or clustering, particularly focusing on developing novel information theoretic kernels for graphs. To this end, we commence in Chapter 3 by defining a family of Jensen-Shannon diffusion kernels, i.e., the information theoretic kernels, for (un)attributed graphs. We show that our kernels overcome the shortcomings of inefficiency (for the unattributed diffusion kernel) and discarding un-isomorphic substructures (for the attributed diffusion kernel) that arise in the R-convolution kernels. In Chapter 4, we present a novel framework of computing depth-based complexity traces rooted at the centroid vertices for graphs, which can be efficiently computed for graphs with large sizes. We show that our methods can characterize a graph in a higher dimensional complexity feature space than state-of-the-art complexity measures. In Chapter 5, we develop a novel unattributed graph kernel by matching the depth-based substructures in graphs, based on the contribution in Chapter 4. Unlike most existing graph kernels in the literature which merely enumerate similar substructure pairs of limited sizes, our method incorporates explicit local substructure correspondence into the process of kernelization. The new kernel thus overcomes the shortcoming of neglecting structural correspondence that arises in most state-of-the-art graph kernels. The novel methods developed in Chapters 3, 4, and 5 are only restricted to graphs. However, real-world data usually tends to be represented by higher order relationships (i.e., hypergraphs). To overcome the shortcoming, in Chapter 6 we present a new hypergraph kernel using substructure isomorphism tests. We show that our kernel limits tottering that arises in the existing walk and subtree based (hyper)graph kernels. In Chapter 7, we summarize the contributions of this thesis. Furthermore, we analyze the proposed methods. Finally, we give some suggestions for the future work

Undergraduate catalog 2004-06, original

The Undergraduate Catalog for the University of Missouri Columbia has been organized to enhance readability. The initial sections are related to University-wide programs, policies and procedures. The second section provides the listing of academic offerings, organized by the academic units (also may be called colleges or schools) that offer the courses and/or the degrees (major, minor or certificate) that students seek to earn. In addition to the Table of Contents, the Faculty listing and Index at the back of the catalog are invaluable for locating a person or topic quickly. An electronic version is also on the MU web site. Graduate and professional programs (Law, Medicine and Veterinary Medicine) have separate catalogs. -- Page 11.Origina

The semantic database model as a basis for an automated database design tool

Bibliography: p.257-80.The automatic database design system is a design aid for network database creation. It obtains a requirements specification from a user and generates a prototype database. This database is compatible with the Data Definition Language of DMS 1100, the database system on the Univac 1108 at the University of Cape Town. The user interface has been constructed in such a way that a computer-naive user can submit a description of his organisation to the system. Thus it constitutes a powerful database design tool, which should greatly alleviate the designer's tasks of communicating with users, and of creating an initial database definition. The requirements are formulated using the semantic database model, and semantic information in this model is incorporated into the database as integrity constraints. A relation scheme is also generated from the specification. As a result of this research, insight has been gained into the advantages and shortcomings of the semantic database model, and some principles for 'good' data models and database design methodologies have emerged

Undergraduate catalog 2008-10, revised

The Undergraduate Catalog for the University of Missouri Columbia has been organized to enhance readability. The initial sections are related to University-wide programs, policies and procedures. The second section provides the listing of academic offerings, organized by the academic units (also may be called colleges or schools) that offer the courses and/or the degrees (major, minor or certificate) that students seek to earn. In addition to the Table of Contents, the Faculty listing and Index at the back of the catalog are invaluable for locating a person or topic quickly. An electronic version is also on the MU web site. Graduate and professional programs (Law, Medicine and Veterinary Medicine) have separate catalogs. -- Page 11.Revised May 2009."Version B.