分類問題一直是機器學習領域中的主要問題。近年來，由於關連式規則挖掘技術的興起，使得越來越多的研究以關連式規則挖掘的技術來解決分類問題。在本篇論文中，我們研究及探討幾個關連式分類問題的方法，並且提出一個新的分類方法，此方法稱為ACC（意即「應用卡方獨立性檢定於關連式分類問題」）。ACC利用關連式規則挖掘技術找出所有頻繁且有趣的項目集，利用這些項目集建立屬性與屬性之間的關係。除此之外，ACC利用卡方獨立性檢定來檢測屬性與類別之間的關係，以保留與類別相關的頻繁集來做預測。我們使用UCI機器學習資料庫中的13個資料庫進行實驗，將我們的方法（ACC）與NB及LB兩種高效率及高正確性的方法做比較。實驗結果顯示，我們的方法在大多數的資料庫上優於NB及LB，亦是一種高效率及高正確性的分類方法。 For many years, classification s one of the key problems in machine learning research. Since association rule mining is an important and highly active data mining research, there are more and more classification methods based on association rule mining techniques. In this thesis, we study several association based classification methods and provide the comparison of these classifiers. We present a new method, called ACC (i.e. Association based Classification using Chi-square Independence test), to solve the problems of classification. ACC finds frequent and interesting itemsets, which describe the relations between attributes. Moreover, it applies chi-square independence test to remain class-related itemsets for predicting new data objects. Besides, ACC provides an approach that considers the probability of missing value occurrence to solve the problem of missing value. Our method is experimented on 13 datasets from UCI machine learning database repository. We compare ACC with NB and LB, the state-of-the-art classifiers and the experimental results show that our method is a highly effective, accurate classifier.
