Text Categorization With Ila
dc.authorscopusid | 55902090100 | |
dc.authorscopusid | 7006606908 | |
dc.authorscopusid | 6603446979 | |
dc.contributor.author | Sever,H. | |
dc.contributor.author | Gorur,A. | |
dc.contributor.author | Tolun,M.R. | |
dc.date.accessioned | 2024-07-05T15:41:55Z | |
dc.date.available | 2024-07-05T15:41:55Z | |
dc.date.issued | 2003 | |
dc.department | Atılım University | en_US |
dc.department-temp | Sever H., Department of Computer Engineering, Baskent University, 06530 Baglica, Ankara, Turkey; Gorur A., Department of Computer Engineering, Eastern Mediterranean University, Famagusta, T.R.N.C. (via Mersin 10), Turkey; Tolun M.R., Department of Computer Engineering, Atilim University, 06836 Incek, Ankara, Turkey | 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. © Springer-Verlag Berlin Heidelberg 2003. | en_US |
dc.identifier.citationcount | 5 | |
dc.identifier.doi | 10.1007/978-3-540-39737-3_38 | |
dc.identifier.endpage | 307 | en_US |
dc.identifier.isbn | 3540204091 | |
dc.identifier.isbn | 978-354039737-3 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.scopus | 2-s2.0-0142152951 | |
dc.identifier.scopusquality | Q3 | |
dc.identifier.startpage | 300 | en_US |
dc.identifier.uri | https://doi.org/10.1007/978-3-540-39737-3_38 | |
dc.identifier.volume | 2869 | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer Verlag | en_US |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.scopus.citedbyCount | 5 | |
dc.subject | Feature Selection | en_US |
dc.subject | Inductive Learning | en_US |
dc.subject | Text Categorization | en_US |
dc.title | Text Categorization With Ila | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |