{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:47:52Z","timestamp":1754156872217,"version":"3.41.2"},"reference-count":31,"publisher":"Emerald","issue":"5","license":[{"start":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T00:00:00Z","timestamp":1593734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2020,7,3]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>Text mining has been used for various knowledge discovery based applications, and thus, a lot of research has been contributed towards it. Latest trending research in the text mining is adopting the incremental learning data, as it is economical while dealing with large volume of information.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>The primary intention of this research is to design and develop a technique for incremental text categorization using optimized Support Vector Neural Network (SVNN). The proposed technique involves four major steps, such as pre-processing, feature selection, classification and feature extraction. Initially, the data is pre-processed based on stop word removal and stemming. Then, the feature extraction is done by extracting semantic word-based features and Term Frequency and Inverse Document Frequency (TF-IDF). From the extracted features, the important features are selected using Bhattacharya distance measure and the features are subjected as the input to the proposed classifier. The proposed classifier performs incremental learning using SVNN, wherein the weights are bounded in a limit using rough set theory. Moreover, for the optimal selection of weights in SVNN, Moth Search (MS) algorithm is used. Thus, the proposed classifier, named Rough set MS-SVNN, performs the text categorization for the incremental data, given as the input.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>For the experimentation, the 20 News group dataset, and the Reuters dataset are used. Simulation results indicate that the proposed Rough set based MS-SVNN has achieved 0.7743, 0.7774 and 0.7745 for the precision, recall and<jats:italic>F<\/jats:italic>-measure, respectively.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>In this paper, an online incremental learner is developed for the text categorization. The text categorization is done by developing the Rough set MS-SVNN classifier, which classifies the incoming texts based on the boundary condition evaluated by the Rough set theory, and the optimal weights from the MS. The proposed online text categorization scheme has the basic steps, like pre-processing, feature extraction, feature selection and classification. The pre-processing is carried out to identify the unique words from the dataset, and the features like semantic word-based features and TF-IDF are obtained from the keyword set. Feature selection is done by setting a minimum Bhattacharya distance measure, and the selected features are provided to the proposed Rough set MS-SVNN for the classification.<\/jats:p><\/jats:sec>","DOI":"10.1108\/dta-03-2020-0071","type":"journal-article","created":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T10:34:30Z","timestamp":1593686070000},"page":"585-601","source":"Crossref","is-referenced-by-count":2,"title":["Incremental learning for text categorization using rough set boundary based optimized Support Vector Neural Network"],"prefix":"10.1108","volume":"54","author":[{"given":"N.","family":"Venkata Sailaja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Padmasree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Mangathayaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2020110202064974600_ref001","doi-asserted-by":"crossref","first-page":"115134","DOI":"10.1109\/ACCESS.2019.2935416","article-title":"Using the Tsetlin machine to learn human-interpretable rules for high-accuracy text categorization with medical applications","volume":"7","year":"2019","journal-title":"IEEE Access"},{"key":"key2020110202064974600_ref002","first-page":"47","article-title":"Italian text categorization with lemmatization and Support vector machines","volume":"151","year":"2019","journal-title":"Neural Approaches to Dynamics of Signal Exchanges"},{"issue":"1","key":"key2020110202064974600_ref003","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.aej.2016.12.013","article-title":"Multi kernel and dynamic fractional lion optimization algorithm for data clustering","volume":"57","year":"2018","journal-title":"Alexandria Engineering Journal"},{"first-page":"12","article-title":"Incremental learning for text document classification","year":"2007","key":"key2020110202064974600_ref004"},{"first-page":"51","volume-title":"Application of TF-IDF Feature for Categorizing Documents of Online Bangla Web Text Corpus","year":"1999","key":"key2020110202064974600_ref005"},{"issue":"1","key":"key2020110202064974600_ref006","first-page":"16","article-title":"Using WordNet for text categorization","volume":"5","year":"2008","journal-title":"International Arab Journal of Information Technology"},{"first-page":"1793","article-title":"A knowledge-based approach to supervised incremental learning","year":"1994","key":"key2020110202064974600_ref007"},{"key":"key2020110202064974600_ref008","doi-asserted-by":"crossref","first-page":"10967","DOI":"10.1016\/j.eswa.2012.03.027","article-title":"Automated text classification using a dynamic artificial neural network model","volume":"39","year":"2012","journal-title":"Expert Systems with Applications"},{"key":"key2020110202064974600_ref009","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.chb.2014.10.062","article-title":"Selection criteria for text mining approaches","volume":"51","year":"2015","journal-title":"Computers in Human Behavior"},{"issue":"1","key":"key2020110202064974600_ref010","doi-asserted-by":"crossref","first-page":"85","DOI":"10.26692\/Surj\/2018.01.0014","article-title":"Online text categorization system using support vector machine","volume":"50","year":"2018","journal-title":"Sindh University Research Journal-SURJ (Science Series)"},{"issue":"2","key":"key2020110202064974600_ref011","doi-asserted-by":"crossref","first-page":"85","DOI":"10.5121\/ijaia.2012.3208","article-title":"Text classification and classifiers: a survey","volume":"3","year":"2012","journal-title":"International Journal of Artificial Intelligence and Applications (IJAIA)"},{"year":"1996","key":"key2020110202064974600_ref012","article-title":"Challenges in machine learning for text classification"},{"issue":"15","key":"key2020110202064974600_ref013","first-page":"15","article-title":"A new Centroid-Based Classification model for text categorization","volume":"136","year":"2017","journal-title":"Knowledge-Based Systems"},{"key":"key2020110202064974600_ref014","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.neucom.2013.08.005","article-title":"Eigenvalue decay: a new method for neural network regularization","volume":"124","year":"2014","journal-title":"Neurocomputing"},{"issue":"10","key":"key2020110202064974600_ref015","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1109\/TITS.2017.2656387","article-title":"Delivering real-time information services on public transit: a framework","volume":"18","year":"2017","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"2","key":"key2020110202064974600_ref016","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/ima.22087","article-title":"Threshold prediction for segmenting tumour from brain MRI scans","volume":"24","year":"2014","journal-title":"International Journal of Imaging Systems and Technology"},{"key":"key2020110202064974600_ref017","unstructured":"20 Newsgroup dataset, available at: http:\/\/qwone.com\/\u223cjason\/20Newsgroups\/ (accessed October 2018)."},{"issue":"7","key":"key2020110202064974600_ref018","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1080\/019697298125470","article-title":"Rough set theory and its applications to data analysis","volume":"29","year":"1998","journal-title":"Cybernetics and Systems"},{"key":"key2020110202064974600_ref019","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1016\/j.asoc.2018.07.016","article-title":"LFNN: lion fuzzy neural network-based evolutionary model for text classification using context and sense based features","volume":"71","year":"2018","journal-title":"Applied Soft Computing"},{"key":"key2020110202064974600_ref020","unstructured":"Reuter dataset, available at: https:\/\/archive.ics.uci.edu\/ml\/machine-learning-databases\/reuters21578-mld\/ (accessed October 2018)."},{"issue":"2","key":"key2020110202064974600_ref021","first-page":"213","article-title":"An automated Arabic text categorization based on the frequency ratio accumulation","volume":"11","year":"2014","journal-title":"The International Arab Journal of Information Technology"},{"key":"key2020110202064974600_ref022","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.eswa.2017.04.055","article-title":"Towards filtering undesired short text messages using an online learning approach with semantic indexing","volume":"83","year":"2017","journal-title":"Expert Systems with Applications"},{"key":"key2020110202064974600_ref023","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-642-10677-4_28","article-title":"Hierarchical text classification incremental learning","volume":"5863","year":"2009","journal-title":"Neural Information Processing, Computer Science"},{"issue":"16","key":"key2020110202064974600_ref024","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1016\/j.patrec.2012.06.012","article-title":"A high performance centroid-based classification approach for language identification","volume":"33","year":"2012","journal-title":"Pattern Recognition Letters"},{"key":"key2020110202064974600_ref025","first-page":"65","article-title":"Text Mining: the state of the art and the challenges\u201d","volume-title":"Proceedings of the PAKDD Workshop on Knowledge Discovery from Advanced Databases","year":"1999"},{"issue":"9","key":"key2020110202064974600_ref026","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1109\/TKDE.2016.2563436","article-title":"Toward optimal feature selection in naive bayes for text categorization","volume":"28","year":"2016","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"key2020110202064974600_ref027","first-page":"35","article-title":"Fractional rider and multi-kernel-based spherical SVM for low resolution face recognition","volume":"2","year":"2019","journal-title":"Multimedia Research (MR)"},{"issue":"2","key":"key2020110202064974600_ref028","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s12293-016-0212-3","article-title":"Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems","volume":"10","year":"2018","journal-title":"Memetic Computing"},{"key":"key2020110202064974600_ref029","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.iheduc.2018.04.002","article-title":"Detecting leadership in peer-moderated online collaborative learning through text mining and social network analysis","volume":"38","year":"2018","journal-title":"The Internet and Higher Education"},{"issue":"9","key":"key2020110202064974600_ref030","first-page":"17","article-title":"SR-K-Means clustering algorithm for semantic information retrieval","volume":"1","year":"2014","journal-title":"International Journal of Inventions in Computer Science and Engineering"},{"first-page":"2201","article-title":"How to find valuable references? Application of text mining in abstract clustering\u201d","year":"2017","key":"key2020110202064974600_ref031"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-03-2020-0071\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-03-2020-0071\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:15:02Z","timestamp":1753398902000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/54\/5\/585-601\/38891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,3]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,7,3]]}},"alternative-id":["10.1108\/DTA-03-2020-0071"],"URL":"https:\/\/doi.org\/10.1108\/dta-03-2020-0071","relation":{},"ISSN":["2514-9288"],"issn-type":[{"type":"print","value":"2514-9288"}],"subject":[],"published":{"date-parts":[[2020,7,3]]}}}