Text Categorization With Ila

dc.authorid Tolun, Mehmet Resit/0000-0002-8478-7220
dc.authorid Sever, Hayri/0000-0002-8261-0675
dc.authorwosid Görür, Abdül Kadir/AAY-1590-2021
dc.authorwosid Tolun, Mehmet/AAX-2456-2021
dc.authorwosid Tolun, Mehmet Resit/KCJ-5958-2024
dc.contributor.author Sever, H
dc.contributor.author Gorur, A
dc.contributor.author Tolun, MR
dc.date.accessioned 2024-10-06T10:57:31Z
dc.date.available 2024-10-06T10:57:31Z
dc.date.issued 2003
dc.department Atılım University en_US
dc.department-temp Baskent Univ, Dept Comp Engn, TR-06530 Ankara, Turkey; Eastern Mediterranean Univ, Dept Comp Engn, Famagusta, Turkey; Atilim Univ, Dept Comp Engn, TR-06836 Ankara, Turkey en_US
dc.description Tolun, Mehmet Resit/0000-0002-8478-7220; Sever, Hayri/0000-0002-8261-0675 en_US
dc.description.abstract The sudden expansion of the web and the use of the internet has caused some research fields to regain (or even increase) its old popularity. Of them, text categorization aims at developing a classification system for assigning a number of predefined topic codes to the documents based on the knowledge accumulated in the training process. We propose a framework based on an automatic inductive classifier, called ILA, for text categorization, though this attempt is not a novel approach to the information retrieval community. Our motivation are two folds. One is that there is still much to do for efficient and effective classifiers. The second is of ILA's (Inductive Learning Algorithm) well-known ability in capturing by canonical rules the distinctive features of text categories. Our results with respect to the Reuters 21578 corpus indicate (1) the reduction of features by information gain measurement down to 20 is essentially as good as the case where one would have more features; (2) recall/precision breakeven points of our algorithm without tuning over top 10 categories are comparable to other text categorization methods, namely similarity based matching, naive Bayes, Bayes nets, decision trees, linear support vector machines, steepest descent algorithm. en_US
dc.description.woscitationindex Conference Proceedings Citation Index - Science - Science Citation Index Expanded
dc.identifier.citationcount 2
dc.identifier.endpage 307 en_US
dc.identifier.isbn 3540204091
dc.identifier.issn 0302-9743
dc.identifier.scopusquality Q3
dc.identifier.startpage 300 en_US
dc.identifier.uri https://hdl.handle.net/20.500.14411/8728
dc.identifier.volume 2869 en_US
dc.identifier.wos WOS:000188096800038
dc.language.iso en en_US
dc.publisher Springer-verlag Berlin en_US
dc.relation.ispartof 18th International Symposium on Computer and Information Sciences (ISCIS 2003) -- NOV 03-05, 2003 -- ANTALYA, TURKEY en_US
dc.relation.ispartofseries LECTURE NOTES IN COMPUTER SCIENCE
dc.relation.publicationcategory Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.subject text categorization en_US
dc.subject inductive learning en_US
dc.subject feature selection en_US
dc.title Text Categorization With Ila en_US
dc.type Conference Object en_US
dc.wos.citedbyCount 2
dspace.entity.type Publication

Files

Collections