KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Search Results

Now showing 1 - 5 of 5
  • Some of the metrics are blocked by your 
    Item type:Item,
    A Knowledge Integrated Case-Based Classifier
    (2019-06-01)
    Muangprathub, Jirapond
    ;
    Kajornkasirat, Siriwan
    ;
    Wanichsombat, Apirat
    ;
    Boonjing, Veera
    ;
    Saelee, Jarunee
    This paper proposes a case-based classifier using a new approach that integrates rule-based and case-based reasoning approaches for enhanced accuracy. The rule-based reasoning component uses rules generated from a concept lattice of training data, binarized using fuzzy sets. These binarized data are stored as cases in the case-based classification component. The case-based component complements the rule-based component to enhance classification accuracy. Moreover, we designed the case-based component with an embedded similarity measure that uses a vector model for concept approximations. Thus, this design makes it possible to generate high quality rules and classify unseen new cases. In addition, the ability to build a knowledge base in lattice form is important for discovering hierarchical patterns, incrementing or updating the existing knowledge base, and inducing rules with our rule learning algorithm. The novel methodology was implemented and evaluated with benchmark datasets from the UCI repository and historic rubber prices in Thailand, demonstrating improvements in accuracy of classification calls. The results from the fact their several hierarchical datasets are very promising, with improved classification performance over prior reported methods.
  • Some of the metrics are blocked by your 
    Item type:Item,
    A new case-based classification using incremental concept lattice knowledge
    (2013-01-01)
    Muangprathub, Jirapond
    ;
    Boonjing, Veera
    ;
    Pattaraintakorn, Puntip
    This paper proposes a new case-based classification system with an incremental knowledge base. The new system employs a concept lattice with formal concept analysis as a knowledge structure. The paper also proposes a new efficient algorithm for knowledge construction as well as an effective retrieval method for formal concepts. The proposed retrieval method uses a concept similarity measure based on an appearance frequency of formal concepts. In addition, we provide a mathematical proof that the similarity measure satisfies a formal similarity metric definition. Experiment results on standard datasets show that our classifier with the proposed similarity measure gives accuracy better than with other existing similarity measures. © 2012 Elsevier B.V.
  • Some of the metrics are blocked by your 
    Item type:Item,
    A new similarity measure in formal concept analysis for case-based reasoning
    (2012-01-01)
    Tadrat, Jirapond
    ;
    Boonjing, Veera
    ;
    Pattaraintakorn, Puntip
    In this work, we aim at developing a better knowledge base by using formal concept analysis (FCA) and propose its new similarity measure based on vector model for case-based reasoning (CBR). The features of our proposed approaches are illustrated using a part of CBR system for both classification and problem-solving. Concept lattice knowledge base provides more accuracy classification for hierarchical data structure when comparing with non-hierarchical data structure. Dependency induced from our concept lattice knowledge base can help to suggest informative solutions for problem-solving CBR. In addition, our similarity measure improves the accuracy of classification CBR significantly when we perform experiments on the UCI data sets with cross validation. © 2011 Elsevier Ltd. All rights reserved.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Towards a validtime case-based reasoning system
    (2008-12-01)
    Tanawong, Tawin
    ;
    Chittayasothorn, Suphamit
    This paper presents a validtime temporal case-based reasoning system. The system supports the use of validtime on cases. This enables users to consult the case-based system and obtain solutions which are the most up to dated as well as old-time classical ones. Also, the users may ask for solutions which were appropriate during a period of time in the past. The classification of temporal case-based reasoning is discussed. There exists temporal case-based systems based on transaction time but no systems, to our knowledge, are based on the valid time. We then propose the extension of a case-based system using the valid time. The classification of consultation problems into current, sequence and non-sequence problems is discussed. The architecture of the validtime case-based reasoning system is also proposed.
  • Some of the metrics are blocked by your 
    Item type:Item,
    An ontology-based case matching technique
    (2007-12-01)
    Tanawong, Tawin
    ;
    Chittayasothorn, Suphamit
    Case-based reasoning is an artificial intelligence technique that refers to past experiences (cases) to help making decisions or taking actions. An important part of case based reasoning is case matching. Previous cases which are similar to a current given case are matched and retrieved. This paper presents a case matching technique that transforms input surface structure sentences into deep-structure sentences which can be represented by fact types of a conceptual schema model. Each entity type that is involved in a fact type is further described by ontology. The matching result of the proposed technique is compared with those of other classical technique. Better similarity of the case matching is found.