4 research outputs found

    Reducing the Memory Size of a Fuzzy Case-Based Reasoning System Applying Rough Set Techniques

    Get PDF
    Early work on case-based reasoning (CBR) reported in the literature shows the importance of soft computing techniques applied to different stages of the classical four-step CBR life cycle. This correspondence proposes a reduction technique based on rough sets theory capable of minimizing the case memory by analyzing the contribution of each case feature. Inspired by the application of the minimum description length principle, the method uses the granularity of the original data to compute the relevance of each attribute. The rough feature weighting and selection method is applied as a preprocessing step prior to the generation of a fuzzy rule system, which is employed in the revision phase of the proposed CBR system. Experiments using real oceanographic data show that the rough sets reduction method maintains the accuracy of the employed fuzzy rules, while reducing the computational effort needed in its generation and increasing the explanatory strength of the fuzzy rules

    Contributions to Time-bounded Problem Solving Using Knowledge-based Techniques

    Get PDF
    Time-bounded computations represent major challenge for knowledge-based techniques. Being primarily non-algorithmic in nature, such techniques suffer from obvious open-endedness in the sense that demands on time and other resources for a particular task cannot be predicted in advance. Consequently, efficiency of traditional knowledge-based techniques in solving time-bounded problems is not at all guaranteed. Artificial Intelligence researchers working in real-time problem solving have generally tried to avoid this difficulty by improving the speed of computation (through code optimisation or dedicated hardware) or using heuristics. However, most of these shortcuts are likely to be inappropriate or unsuitable in complicated real-time applications. Consequently, there is a need of more systematic and/or general measures. We propose a two-fold improvement over traditional knowledge-based techniques for tackling this problem. Firstly, that a cache-based architecture should be used in choosing the best alternative approach (when there are two or more) compatible to the time constraints. This cache differs from traditional caches, used in other branches of computer science, in the sense that it can hold not just "ready to use" values but also knowledge suggesting which AI technique will be most suitable to meet a temporal demand in a given context. The second improvement is in processing the cached knowledge itself. We propose a technique which can be called "knowledge interpolation" and which can be applied to different forms of knowledge (such as symbolic values, rules, cases) when the keys used for cache access do not make exact matches with the labels for any cell of the cache. The research reported in this thesis comprises development of cache-based architecture and interpolation techniques, studies of their requisites and representational issues and their complementary roles in achieving time-bounded performance. Ground operations control of an airport and allocating resources for short-wave radio communications are two domains in which our proposed methods are studied

    WIN : a case-based design approach to the structural design of the wind systems of buildings

    Get PDF
    This thesis concerns the application of Case-Based Design (CBD) to the domain of the structural design of buildings. The aim of this thesis is to design and develop WIN, a prototype Case-Based Design Aid System (CBDAS) that has the ability to retrieve the most relevant case for a new design problem with a minimum of information. This thesis discusses background knowledge about structural design. It addresses the fact that structural design is a complex problem solving process. There is no one perfect method for performing structural design, and a good design is the result of recursively selecting methods based on a number of criteria. In design practice, human designers may start the process by remembering previous designs that are similar to a new design problem, and then select the most relevant case as the basis for the new design process. This thesis argues that using a Case-Based Design Aid System (CBDAS) for the structural design of buildings can improve the efficiency and the quality of the resulting designs because this approach utilises the advantages of combining computer memory with the human designer’s cross—domain, dynamic—reasoning ability. On the other hand, this approach can reduce the time and cost involved in the development of a CBDAS. Therefore, using a CBDAS in design practices becomes a foreseeable reality. Since structural design is a complex problem solving process, the information used to describe an existing design case is enormous. It is important to determine what the contents of existing design cases should be. This thesis claims that only the necessary information should be included as the contents of existing design cases. In order to have a better understanding of the contents of existing design cases, it is possible to split existing design cases into their situations, solutions and the knowledge used to generate the solutions. In the implementation of WIN, this thesis uses a multimedia case representation that combines text descriptions, attribute—value .pairs, Function—Behaviour—Structure (FBS) models, and graphical representations. Thus, human designers can have a better understanding of the existing design cases by reviewing their text descriptions, drawings and diagrams; the computer can use the attribute-values pairs to autonomously reason about the similarities between a new design problem and existing cases. In order to achieve an efficient case representation, it is necessary to divide a complex design case into a set of less complex subcases. An existing design case in WIN is decomposed into a root case and its subcases. The root case and its subcases are arranged in a case hierarchy. The root case represents the general information about the existing design, and the subcases represent the detailed information about the aggregations of physical components and the structural components of the existing design. After discussing the key issues related to applying CBDAS technology to the structural design of buildings, this thesis presents the case retrieval strategy used in WIN: model-based, human-controlled, progressive and iterative index elaboration. The major reasons supporting the case retrieval strategy in WIN are summarised below: - predefined models represent sets of generalised heterogeneous grouping of elements derived from similar design cases that provide the basis for the start and continuation of a design, these predefined models can be used to partition the case library; - design cases are organised in different partitions in the case library, finding the relevant cases for a new design problem can be achieved by finding a predefined model related to the new design problem, which leads to retrieving the relevant cases; - the contents of an existing design case are represented in its root case and sub— cases, finding the contents of an existing case means exploring the contents of the existing case along its case hierarchy, this exploration is a incremental process; - in each level of index exploration, it is essential to use different selection conditions for different situations, the approach of using iterative index refinement provides the opportunity for human designers to select different combinations of indices to evaluate the existing design cases; - with the human designers’ interaction, the retrieval of cases is more dynamic and efficient, on the other hand, the time and the cost involved in the implementation of a CBDAS is reduced. Finally, this thesis presents the implementation of WIN. This system contains a case library, a model library, a retriever, a selector, and a user interface. WIN is developed on SUN SPARC-stations. The existing cases and the predefined models are written in Framekit, the user interface, the retriever, and the selector are written in Common Lisp. The performance of WIN is demonstrated using an example problem. The approach of using CBDASs to find the most relevant case for a new design problem is shown to be considerably easier and more efficient than using a conventional case library. The issues discussed in this thesis are likely to be the basis of future development of CBD systems
    corecore