Thabtah, Fadi Abdeljaber, Hadi, Wa’el, Abu-Mansour, Hussein and McCluskey, T.L. (2010) A new rule pruning text categorisation method. In: 2010 7th International Multi-Conference on Systems, Signals and Devices. IEEE, London, UK, pp. 1-6. ISBN 9781424475322
|PDF - Published Version |
Download (302kB) | Preview
Associative classification integrates association rule and classification in data mining to build classifiers that are highly accurate than that of traditional classification approaches such as greedy and decision tree. However, the size of the classifiers produced by associative classification algorithms is usually large and contains insignificant rules. This may degrade the classification accuracy and increases the classification time, thus, pruning becomes an important task. In this paper, we investigate the problem of rule pruning in text categorisation and propose a new rule pruning techniques called High Precedence. Experimental results show that HP derives higher quality and more scalable classifiers than those produced by current pruning methods (lazy and database coverage). In addition, the number of rules generated by the developed pruning procedure is often less than that of lazy pruning.
|Item Type:||Book Chapter|
|Subjects:||Q Science > Q Science (General)|
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
|Schools:||School of Computing and Engineering|
School of Computing and Engineering > Pedagogical Research Group
School of Computing and Engineering > Informatics Research Group
School of Computing and Engineering > Informatics Research Group > Knowledge Engineering and Intelligent Interfaces
|Depositing User:||Sara Taylor|
|Date Deposited:||30 Nov 2010 10:31|
|Last Modified:||16 Dec 2010 12:43|
Downloader CountriesMore statistics for this item...
Item control for Repository Staff only: