English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49432/84393 (59%)
Visitors : 7453376      Online Users : 93
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/106218

    Title: Finding Active Membership Functions for Genetic-Fuzzy Mining
    Authors: Chen, C. H.;Hong, T. P.;Lee, Yeong-Chyi;Tseng, Vincent S.
    Keywords: Data mining;fuzzy sets;fuzzy association rules;genetic algorithms;membership functions
    Date: 2015-12-01
    Issue Date: 2016-04-22 13:42:09 (UTC+8)
    Abstract: Since transactions may contain quantitative values, many approaches have been proposed to derive membership functions for mining fuzzy association rules using genetic algorithms (GAs), a process known as genetic-fuzzy data mining. However, existing approaches assume that the number of linguistic terms is predefined. Thus, this study proposes a genetic-fuzzy mining approach for extracting an appropriate number of linguistic terms and their membership functions used in fuzzy data mining for the given items. The proposed algorithm adjusts membership functions using GAs and then uses them to fuzzify the quantitative transactions. Each individual in the population represents a possible set of membership functions for the items and is divided into two parts, control genes (CGs) and parametric genes (PGs). CGs are encoded into binary strings and used to determine whether membership functions are active. Each set of membership functions for an item is encoded as PGs with real-number schema. In addition, seven fitness functions are proposed, each of which is used to evaluate the goodness of the obtained membership functions and used as the evolutionary criteria in GA. After the GA process terminates, a better set of association rules with a suitable set of membership functions is obtained. Experiments are made to show the effectiveness of the proposed approach.
    Relation: International Journal of Information Technology & Decision Making 14(6)
    DOI: 10.1142/S0219622015500297
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback