Pair Data Division Algorithm For Handling Data Classification

2019

Closed access Metadata (CSL-JSON)
DOI 10.1109/snams.2019.8931871
Data confidence 85 high
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Data heterogeneity creates the complexity for understanding the different domains. Most of domains require sophisticated algorithm to understand the complexity. To handle the data heterogeneity problem, several methods have been proposed (e.g., Support Vector Machine (SVM), Decision Tree, Random Forest, Liner regression etc.). However, these existing methods suffer due to accuracy, outlying. In this paper, we introduce Pair Data Division (PDD) with support of SMV for handling the data heterogeneity. PDD divides the data into the pairs then further pairs are processed using SVM. The PDD algorithm is implanted by using Python and PyCharm is used as Interface Development Environment (IDE). Furthermore, training datasets will be given to PDD for testing purpose. Based on the testing results, we confirm that our proposed algorithm provides better accuracy as compared to known algorithms: Random Forest and Linear regression when handling the data heterogeneity.