Performance Comparison between Two Interpretations of Missing Data using Matrix-Characterized Approximations

DOI®: doi.org/10.21276/ijre.2019.6.2.3

CITATION: Min, M., & Soe, T. (2019). Performance Comparison between Two Interpretations of Missing Data using Matrix-Characterized Approximations. International Journal Of Research And Engineering, 6(2), 589-595. doi:10.21276/ijre.2019.6.2.3

Author(s): 1Myat Myat Min, 2Thin Thin Soe

Affiliation(s)1Faculty of Computer Science, University of Computer Studies, Mandalay, Myanmar,2Web Mining Lab, University of Computer Studies, Mandalay, Myanmar

Abstract: Nowadays, the veracity related with data quality such as incomplete, inconsistent, vague or noisy data creates a major challenge to data mining and data analysis. Rough set theory presents a special tool for handling the incomplete and imprecise data in information systems. In this paper, rough set based matrix-represented approximations are presented to compute lower and upper approximations. The induced approximations are conducted as inputs for data analysis method, LERS (Learning from Examples based on Rough Set) used with LEM2 (Learning from Examples Module, Version2) rule induction algorithm. Analyzes are performed on missing datasets with “do not care” conditions and missing datasets with lost values. In addition, experiments on missing datasets with different missing percent by using different thresholds are also provided. The experimental results show that the system outperforms when missing data are characterized as “do not care” conditions than represented as lost values.  

Full Article – PDF

Public Knowledge Project [ INDEXED LINK at index.pkp.sfu.ca ]


Academia.edu [ INDEXED LINK at www.academia.edu ]


Zenodo Research Platform [ INDEXED LINK at zenodo.org ]


Indexed by other automated sites of Open Journal System under Public Knowledge Project http://pkp.sfu.ca/ojs

  • 1.4K
    Shares

http-www-ijre-org