IDEAS home Printed from https://ideas.repec.org/a/jcs/journl/v3y2019i3p1-16.html
   My bibliography  Save this article

Data Mining with R: An Applied Study

Author

Listed:
  • Burcu Durmus

    (Mugla Sitki Kocman University)

  • Öznur İşçi Güneri

    (Mugla Sitki Kocman University)

Abstract

Purpose – The aim of this study is to analyze different classification algorithms with R programming and to determine the accuracy rates. It also encourages the use of the R program by giving readers the opportunity to experiment. Method – For the purposes mentioned above, different data sets were obtained from the UC Irvine Machine Learning Repository (2019), which was suitable for classification. After preparing data set and R program for data mining, performance evaluation was made with classification algorithms (J48, Random Forest, Naïve Bayes). The 'accuracy' criterion was taken into consideration when interpreting the results. Results – At the end of the study, the accuracy rates were determined for three data sets. Looking at the "wine" data, the performance of all three algorithms is quite successful. The results of the other two data sets (lenses and liver) are parallel. Only the ‘liver’ dataset gave a slightly lower accuracy than expected with the Naïve Bayes algorithm (0.55). Conclusion – In this study, performance comparison of algorithms has been made within the scope of data mining with R program. The accuracy rate was taken as a criterion. All codes are given with their outputs in order to be an example especially for young researchers or students. It is thought that this study can be a source for other researchers, will encourage the use of R and the researchers or students will try new papers by trying the codes. Recommendations – In subsequent studies, a similar study can be done by developing the given codes. Or how to make classification analysis in R with different algorithms can be examined.

Suggested Citation

  • Burcu Durmus & Öznur İşçi Güneri, 2019. "Data Mining with R: An Applied Study," International Journal of Computing Sciences Research, Step Academic, vol. 3(3), pages 1-16, December.
  • Handle: RePEc:jcs:journl:v:3:y:2019:i:3:p:1-16
    DOI: 10.25147/ijcsr.2017.001.1.34
    as

    Download full text from publisher

    File URL: https://www.stepacademic.net/ijcsr/article/view/110/56
    Download Restriction: no

    File URL: https://libkey.io/10.25147/ijcsr.2017.001.1.34?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    data mining; R program; J48; random forest; Naïve Bayes;
    All these keywords.

    JEL classification:

    • J48 - Labor and Demographic Economics - - Particular Labor Markets - - - Particular Labor Markets; Public Policy

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jcs:journl:v:3:y:2019:i:3:p:1-16. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Liam Demafelix (email available below). General contact details of provider: https://www.stepacademic.net .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.