Skip to content
#

data-cleansing

Here are 5 public repositories matching this topic...

kDMI employs two levels of horizontal partitioning (based on a decision tree and k-NN algorithm) of a data set, in order to find the records that are very similar to the one with missing value/s. Additionally, it uses a novel approach to automatically find the value of k for each record.

  • Updated Mar 25, 2023
  • Java

Improve this page

Add a description, image, and links to the data-cleansing topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the data-cleansing topic, visit your repo's landing page and select "manage topics."

Learn more