一般關聯式分類法(Associative Classification, AC)在規則排序(Ranking)[1][2]上，作法是先依照信賴值由高至低排序，接著依支援值由高至低排序，再依規則由短至長排序，短規則因為通用性較高，通常為了讓更多文件可以分類，因此短規則在排序上優於長規則。 本論文核心即在針對規則排列問題，除了採用Lazy法[3]所提出的排序法則為一般排序原則外，再加上本論文提出之類別優先度來探討其對分類效能的影響。再結合TFIDF[4]及貝氏分類器[5]先做第一次分類，計算其準確率及F1值，利用這些數據設定單一門檻值、為了避免不同類別間的落差，針對各類別設定多重門檻值，並利用靜態不變及動態修正門檻值兩種方式來引用規則並執行分類。 General relational classification (Associative Classification, AC) in the rules of order (Ranking) [1] [2], the approach is to rely on the value of pupils in accordance with the order, and then sorted according to support the value of pupils, according to the rules Sorting by short to long and short rules because of the higher common, usually in order to allow more files can be categorized, so in short order on the rules of the rules is better than long. In this paper, that is the core of the problem in order for the rules, in addition to the use of Lazy method [3] by the law of the sort order for the general principles, together with the categories proposed in this paper to discuss the priority of its impact on the classification performance. Combined with the TFIDF [4] and Bayesian classifier [5] first classified the first time to calculate their accuracy rate and the F1 value, use the data to set a single threshold value, in order to avoid differences between different categories for each of the categories to set multiple threshold value, and use the same static and dynamic threshold amended to refer to two ways and the implementation of classification rules.
