Date of Award

2000

Degree Type

Thesis

Degree Name

M.Sc.

Department

Computer Science

First Advisor

Park, Young G.,

Keywords

Computer Science.

Rights

CC BY-NC-ND 4.0

Abstract

Having identified software components which are potentially reusable and described in such a way that anyone wish to reuse them would be able to do so, the problem arises as to how to organize the total collection of all such components and related descriptions. A good system classification not only provides the basis for cataloging the components, but also provides a means for finding a particular candidate held in the reuse library. This thesis describes a methodology of classifying, structuring and retrieving object-oriented classes based on a method for data analysis called Formal Concept Analysis (FCA). In this methodology, a class is classified and retrieved using the type information plus variable access behavior of methods (in short, composite type) available in the class, and a class library is then viewed as a many-valued context. This many-valued context is transformed into a one-valued context, incorporating behavior of methods into the context via conceptual scaling, and Ganter's concept-generation algorithm is applied to this context, which leads to a lattice structure of all concepts. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2000 .S54. Source: Masters Abstracts International, Volume: 39-02, page: 0532. Adviser: Young G. Park. Thesis (M.Sc.)--University of Windsor (Canada), 2000.

Share

COinS