A genetic-fuzzy mining approach for items with multiple minimum supports
學年 97
學期 2
出版（發表）日期 2009-03-01
作品名稱 A genetic-fuzzy mining approach for items with multiple minimum supports
作品名稱（其他語言）
著者 Chen, Chun-hao; Hong, Tzung-pei; Tseng, Vincent S.; Lee, Chang-shing
單位 淡江大學資訊工程學系
出版者 Springer Berlin
著錄名稱、卷期、頁數 Soft Computing 13(5), pp.521-533
摘要 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.
關鍵字 Data mining; Genetic-fuzzy algorithm; k-means; Clustering; Multiple minimum supports; Requirement satisfaction
語言 en
ISSN 1432-7643 1433-7479
期刊性質 國外
收錄於 SCI
產學合作
通訊作者
審稿制度
國別 DEU
公開徵稿
出版型式 電子版 紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/75769 )

機構典藏連結