Open Access System for Information Sharing

Login Library

 

Article
Cited 10 time in webofscience Cited 13 time in scopus
Metadata Downloads
Full metadata record
Files in This Item:
There are no files associated with this item.
DC FieldValueLanguage
dc.contributor.authorYoon, Y-
dc.contributor.authorLee, GG-
dc.date.accessioned2016-04-01T01:47:08Z-
dc.date.available2016-04-01T01:47:08Z-
dc.date.created2009-08-21-
dc.date.issued2007-03-
dc.identifier.issn0306-4573-
dc.identifier.other2006-OAK-0000006410-
dc.identifier.urihttps://oasis.postech.ac.kr/handle/2014.oak/23697-
dc.description.abstractIn practical text classification tasks, the ability to interpret the classification result is as important as the ability to classify exactly. Associative classifiers have many favorable characteristics such as rapid training, good classification accuracy, and excellent interpretation. However, associative classifiers also have some obstacles to overcome when they are applied in the area of text classification. The target text collection generally has a very high dimension, thus the training process might take a very long time. We propose a feature selection based on the mutual information between the word and class variables to reduce the space dimension of the associative classifiers. In addition, the training process of the associative classifier produces a huge amount of classification rules, which makes the prediction with a new document ineffective. We resolve this by introducing a new efficient method for storing and pruning classification rules. This method can also be used when predicting a test document. Experimental results using the 20-newsgroups dataset show many benefits of the associative classification in both training and predicting when applied to a real world problem. (c) 2006 Elsevier Ltd. All rights reserved.-
dc.description.statementofresponsibilityX-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.relation.isPartOfINFORMATION PROCESSING & MANAGEMENT (postech rank 1)-
dc.subjecttext classification-
dc.subjectassociative classifier-
dc.subjectfeature selection-
dc.subjectrule pruning-
dc.subjectsubset expansion-
dc.titleEfficient implementation of associative classifiers for document classification-
dc.typeArticle-
dc.contributor.college컴퓨터공학과-
dc.identifier.doi10.1016/j.ipm.2006.07.012-
dc.author.googleYoon, Y-
dc.author.googleLee, GG-
dc.relation.volume43-
dc.relation.issue2-
dc.relation.startpage393-
dc.relation.lastpage405-
dc.contributor.id10103841-
dc.relation.journalINFORMATION PROCESSING & MANAGEMENT (postech rank 1)-
dc.relation.indexSCI급, SCOPUS 등재논문-
dc.relation.sciSCIE-
dc.collections.nameConference Papers-
dc.type.rimsART-
dc.identifier.bibliographicCitationINFORMATION PROCESSING & MANAGEMENT (postech rank 1), v.43, no.2, pp.393 - 405-
dc.identifier.wosid000242422100009-
dc.date.tcdate2019-01-01-
dc.citation.endPage405-
dc.citation.number2-
dc.citation.startPage393-
dc.citation.titleINFORMATION PROCESSING & MANAGEMENT (postech rank 1)-
dc.citation.volume43-
dc.contributor.affiliatedAuthorLee, GG-
dc.identifier.scopusid2-s2.0-33750478328-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.wostc8-
dc.type.docTypeArticle; Proceedings Paper-
dc.subject.keywordAuthortext classification-
dc.subject.keywordAuthorassociative classifier-
dc.subject.keywordAuthorfeature selection-
dc.subject.keywordAuthorrule pruning-
dc.subject.keywordAuthorsubset expansion-
dc.relation.journalWebOfScienceCategoryComputer Science, Information Systems-
dc.relation.journalWebOfScienceCategoryInformation Science & Library Science-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.relation.journalResearchAreaComputer Science-
dc.relation.journalResearchAreaInformation Science & Library Science-

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Views & Downloads

Browse