Skip to main content
English
Català
Čeština
Deutsch
Español
Français
Gàidhlig
Italiano
Latviešu
Magyar
Nederlands
Polski
Português
Português do Brasil
Srpski (lat)
Suomi
Svenska
Türkçe
Tiếng Việt
Қазақ
বাংলা
हिंदी
Ελληνικά
Српски
Yкраї́нська
Log In
Email address
Password
Log in
Have you forgotten your password?
Communities & Collections
All Contents
Statistics
English
Català
Čeština
Deutsch
Español
Français
Gàidhlig
Italiano
Latviešu
Magyar
Nederlands
Polski
Português
Português do Brasil
Srpski (lat)
Suomi
Svenska
Türkçe
Tiếng Việt
Қазақ
বাংলা
हिंदी
Ελληνικά
Српски
Yкраї́нська
Log In
Email address
Password
Log in
Have you forgotten your password?
Home
Araştırma Çıktıları | Web Of Science
Web of Science Koleksiyonu
English
English
No Thumbnail Available
Date
Authors
Onan, A
Korukoglu, S
Journal Title
Journal ISSN
Volume Title
Publisher
2194-5357
Abstract
SPRINGER-VERLAG BERLIN
Description
Keywords
Sentiment analysis is the process of extracting subjective information in source materials. Sentiment analysis is a subfield of web and text mining. One major problem encountered in these areas is overwhelming amount of data available. Hence, instance selection and feature selection become two essential tasks for achieving scalability in machine learning based sentiment classification. Instance selection is a data reduction technique which aims to eliminate redundant, noisy data from the training dataset so that training time can be reduced, scalability and generalization ability can be enhanced. This paper examines the predictive performance of fifteen benchmark instance selection methods for text classification domain. The instance selection methods are evaluated by decision tree classifier (C4.5 algorithm) and radial basis function networks in terms of classification accuracy and data reduction rates. The experimental results indicate that the highest classification accuracies on C4.5 algorithm are generally obtained by model class selection method, while the highest classification accuracies on radial basis function networks are obtained by nearest centroid neighbor edition.
Citation
URI
http://akademikarsiv.cbu.edu.tr:4000/handle/123456789/7119
Collections
Web of Science Koleksiyonu
Full item page