{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T00:28:14Z","timestamp":1777854494756,"version":"3.51.4"},"reference-count":34,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2014,10,3]],"date-time":"2014-10-03T00:00:00Z","timestamp":1412294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Science"],"published-print":{"date-parts":[[2015,2]]},"abstract":"<jats:p>Readability and accuracy are two important features of any good classifier. For reasons such as acceptable accuracy, rapid training and high interpretability, associative classifiers have recently been used in many categorization tasks. Although features could be very useful in text classification, both training time and the number of produced rules will increase significantly owing to the high dimensionality of text documents. In this paper an association classification algorithm for text classification is proposed that includes a feature selection phase to select important features and a clustering phase based on class labels to tackle this shortcoming. The experimental results from applying the proposed algorithm in comparison with the results of selected well-known classification algorithms show that our approach outperforms others both in efficiency and in performance.<\/jats:p>","DOI":"10.1177\/0165551514550143","type":"journal-article","created":{"date-parts":[[2014,10,4]],"date-time":"2014-10-04T00:53:13Z","timestamp":1412383993000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":20,"title":["A novel feature selection method for text classification using association rules and clustering"],"prefix":"10.1177","volume":"41","author":[{"given":"Navid","family":"Sheydaei","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Isfahan University of Technology, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamad","family":"Saraee","sequence":"additional","affiliation":[{"name":"School of Computing, Science and Engineering, University of Salford-Manchester, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azar","family":"Shahgholian","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Isfahan University of Technology, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2014,10,3]]},"reference":[{"key":"bibr1-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30221-6_20"},{"key":"bibr2-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1561\/1500000011"},{"key":"bibr3-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345593"},{"key":"bibr4-0165551514550143","first-page":"9","volume-title":"11th European conference on machine learning","author":"Androutsopoulos I","year":"2000"},{"key":"bibr5-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"bibr6-0165551514550143","first-page":"369","volume-title":"ICDM\u20190I","author":"Li W","year":"2001"},{"key":"bibr7-0165551514550143","first-page":"80","volume-title":"KDD\u201998","author":"Lie B","year":"1998"},{"key":"bibr8-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1109\/ICSC.2008.70"},{"key":"bibr9-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.40"},{"issue":"2","key":"bibr10-0165551514550143","volume":"36","author":"Tang ZH","year":"2007","journal-title":"IAENG International Journal of Applied Mathematics"},{"key":"bibr11-0165551514550143","first-page":"487","volume-title":"Proceedings of the 20th international conference on very large data bases","author":"Agrawal R","year":"1994"},{"key":"bibr12-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"bibr13-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183881"},{"key":"bibr14-0165551514550143","first-page":"205","volume":"5","author":"Wang J","year":"2005","journal-title":"Proceedings of SDM"},{"key":"bibr15-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2005.1387030"},{"key":"bibr16-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"bibr17-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56602-3_124"},{"key":"bibr18-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2012.09.003"},{"key":"bibr19-0165551514550143","unstructured":"Blake CL, Merz CJ UCI Repository of machine learning databases, UCI Repository of Machine Learning Databases, 1998. Available from: http:\/\/archive.ics.uci.edu\/ml\/"},{"key":"bibr20-0165551514550143","unstructured":"Hammoud S. Doctorial Thesis, Brunel University, May2011."},{"key":"bibr21-0165551514550143","first-page":"487","volume-title":"Proceedings of the 20th international conference on very large data bases","volume":"1215","author":"Agrawal R","year":"1994"},{"key":"bibr22-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"bibr23-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1145\/354756.354768"},{"key":"bibr24-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1109\/69.649314"},{"key":"bibr25-0165551514550143","first-page":"80","author":"Liu B","year":"1998","journal-title":"Knowledge Discovery and Data Mining"},{"key":"bibr26-0165551514550143","unstructured":"Thanh Nhan LT. An Apriori-based frequent item sets mining using bit streams. Department of Computer Science, Yunghee University, Korea, 2010, pp. 446\u2013701."},{"key":"bibr27-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39666-6_5"},{"key":"bibr28-0165551514550143","unstructured":"Mehr News Agency, http:\/\/www.mehrnews.com (accessed March 2012)."},{"key":"bibr29-0165551514550143","unstructured":"Isna News Agency, http:\/\/www.isna.ir (accessed March 2012)."},{"key":"bibr30-0165551514550143","unstructured":"Fars News Agency, http:\/\/www.farsnews.com (accessed March 2012)."},{"key":"bibr31-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014073"},{"key":"bibr32-0165551514550143","author":"Sheydaei N","year":"2013","journal-title":"ICEE"},{"key":"bibr33-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1145\/1361684.1361686"},{"key":"bibr34-0165551514550143","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-69319-4_7"}],"container-title":["Journal of Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551514550143","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0165551514550143","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551514550143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T23:09:00Z","timestamp":1777504140000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0165551514550143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["10.1177\/0165551514550143"],"URL":"https:\/\/doi.org\/10.1177\/0165551514550143","relation":{},"ISSN":["0165-5515","1741-6485"],"issn-type":[{"value":"0165-5515","type":"print"},{"value":"1741-6485","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,3]]}}}