Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach

博士 === 國立中央大學 === 資訊管理研究所 === 99 === Discovering hidden or unknown knowledge is the major theme of most data mining studies. In this dissertation, we propose a new approach to discover conjecturable rules, which categorize observations of a data set into classes of similar attribute values instead o...

Full description

Bibliographic Details
Main Authors: Wu-hsien Hsu, 許武先
Other Authors: Yen-liang Chen
Format: Others
Language:en_US
Published: 2011
Online Access:http://ndltd.ncl.edu.tw/handle/65946782992000654374
id ndltd-TW-099NCU05396026
record_format oai_dc
spelling ndltd-TW-099NCU053960262017-07-13T04:20:26Z http://ndltd.ncl.edu.tw/handle/65946782992000654374 Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach 結合分類分群技術建立推測法則之研究 Wu-hsien Hsu 許武先 博士 國立中央大學 資訊管理研究所 99 Discovering hidden or unknown knowledge is the major theme of most data mining studies. In this dissertation, we propose a new approach to discover conjecturable rules, which categorize observations of a data set into classes of similar attribute values instead of classes of crisp labels. The proposed approach is developed based on the two most developed data mining techniques: Classification and Clustering. Classification is the problem of identifying the sub-population to which new observations belong. The result is decided according to a set of rules which discovered from a training set of data of observations whose sub-population is known. The technique is known as supervised learning, i.e. pre-defined labels are necessary for the process. The result is a set of rules which are able to predict which label a new observation is belonged to. However, when there is no label existed in the dataset, this technique fails to apply. On the other hand, Clustering is the process of grouping a set of objects into classes of similar objects. No pre-defined label is necessary for the process. It is known as unsupervised learning. Yet no any rule is preserved after the process for future prediction. The object of this dissertation is to discover conjecturable rules from those datasets which do not have any predefined class label. Furthermore, the technique extends our two previous studies with fuzzy concept and outliers handling. Thus recessive conjecturable rules can be discovered as well as the accuracy is improved. The proposed technique covers the convenience of unsupervised learning as well as the ability of prediction of decision trees. The experiment results show that our proposed approach is capable to discover conjecturable rules as well as recessive rules. Sensitivity analysis is also given for practitioners’ reference. Yen-liang Chen 陳彥良 2011 學位論文 ; thesis 112 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 博士 === 國立中央大學 === 資訊管理研究所 === 99 === Discovering hidden or unknown knowledge is the major theme of most data mining studies. In this dissertation, we propose a new approach to discover conjecturable rules, which categorize observations of a data set into classes of similar attribute values instead of classes of crisp labels. The proposed approach is developed based on the two most developed data mining techniques: Classification and Clustering. Classification is the problem of identifying the sub-population to which new observations belong. The result is decided according to a set of rules which discovered from a training set of data of observations whose sub-population is known. The technique is known as supervised learning, i.e. pre-defined labels are necessary for the process. The result is a set of rules which are able to predict which label a new observation is belonged to. However, when there is no label existed in the dataset, this technique fails to apply. On the other hand, Clustering is the process of grouping a set of objects into classes of similar objects. No pre-defined label is necessary for the process. It is known as unsupervised learning. Yet no any rule is preserved after the process for future prediction. The object of this dissertation is to discover conjecturable rules from those datasets which do not have any predefined class label. Furthermore, the technique extends our two previous studies with fuzzy concept and outliers handling. Thus recessive conjecturable rules can be discovered as well as the accuracy is improved. The proposed technique covers the convenience of unsupervised learning as well as the ability of prediction of decision trees. The experiment results show that our proposed approach is capable to discover conjecturable rules as well as recessive rules. Sensitivity analysis is also given for practitioners’ reference.
author2 Yen-liang Chen
author_facet Yen-liang Chen
Wu-hsien Hsu
許武先
author Wu-hsien Hsu
許武先
spellingShingle Wu-hsien Hsu
許武先
Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach
author_sort Wu-hsien Hsu
title Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach
title_short Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach
title_full Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach
title_fullStr Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach
title_full_unstemmed Conjecturable Rules Discovery by Clustering-Classification Hybrid Approach
title_sort conjecturable rules discovery by clustering-classification hybrid approach
publishDate 2011
url http://ndltd.ncl.edu.tw/handle/65946782992000654374
work_keys_str_mv AT wuhsienhsu conjecturablerulesdiscoverybyclusteringclassificationhybridapproach
AT xǔwǔxiān conjecturablerulesdiscoverybyclusteringclassificationhybridapproach
AT wuhsienhsu jiéhéfēnlèifēnqúnjìshùjiànlìtuīcèfǎzézhīyánjiū
AT xǔwǔxiān jiéhéfēnlèifēnqúnjìshùjiànlìtuīcèfǎzézhīyánjiū
_version_ 1718495392678543360