English  |  正體中文  |  简体中文  |  Items with full text/Total items : 58041/91608 (63%)
Visitors : 13725387      Online Users : 49
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/75769


    Title: A genetic-fuzzy mining approach for items with multiple minimum supports
    Authors: Chen, Chun-hao;Hong, Tzung-pei;Tseng, Vincent S.;Lee, Chang-shing
    Contributors: 淡江大學資訊工程學系
    Keywords: Data mining;Genetic-fuzzy algorithm;k-means;Clustering;Multiple minimum supports;Requirement satisfaction
    Date: 2009-03
    Issue Date: 2012-04-13 18:04:54 (UTC+8)
    Publisher: Springer Berlin
    Abstract: Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Mining association rules from transaction data is most commonly seen among the mining techniques. Most of the previous mining approaches set a single minimum support threshold for all the items and identify the relationships among transactions using binary values. In the past, we proposed a genetic-fuzzy data-mining algorithm for extracting both association rules and membership functions from quantitative transactions under a single minimum support. In real applications, different items may have different criteria to judge their importance. In this paper, we thus propose an algorithm which combines clustering, fuzzy and genetic concepts for extracting reasonable multiple minimum support values, membership functions and fuzzy association rules from quantitative transactions. It first uses the k-means clustering approach to gather similar items into groups. All items in the same cluster are considered to have similar characteristics and are assigned similar values for initializing a better population. Each chromosome is then evaluated by the criteria of requirement satisfaction and suitability of membership functions to estimate its fitness value. Experimental results also show the effectiveness and the efficiency of the proposed approach.
    Relation: Soft Computing 13(5), pp.521-533
    DOI: 10.1007/s00500-008-0366-0
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML170View/Open

    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