Skip to main content

Data Cleaning Process

Data cleaning attempt to fill in missing values, smooth out noise while identifying outliers, and correct inconsistencies in the data.

Data cleaning is performed as an iterative two-step process consisting of discrepancy detection and data transformation.

The missing values of the attribute can be addressed by

  • Ignoring the value
  • filling the value manually
  • Using global constant to fill the value
  • Using a measure of central tendency (mean or median) of value
  • Using attribute mean or median belonging to same class
  • Using the most probable value

Noise is a random error or variance in a measured variable. The noisy data can be smoothened using following techniques.

Binning methods smooth a sorted data value by consulting the nearby values around it.

smoothing by bin means - each value in a bin is replaced by the mean value of the bin.

smoothing by bin medians - each bin value is replaced by the bin median

smoothing by bin boundaries - the minimum and maximum values in a given bin are identified as the bin boundaries.

Data smoothing can also be done by regression, a technique that conforms data values to a function.

Outliers may be detected by clustering. The values that fall outside of the set of clusters may be considered outliers.

The first step in data cleaning as a process is discrepancy detection.

A unique rule says that each value of the given attribute must be different from all other values for that attribute.

A consecutive rule says that there can be no missing values between the lowest and highest values for the attribute, and that all values must also be unique.

A null rule specifies the use of blanks, question marks, special characters, or other strings that may indicate the null condition and how such values should be handled.

Data scrubbing tools use simple domain knowledge to detect errors and make corrections in the data.

Data auditing tools find discrepancies by analyzing the data to discover rules and relationships, and detecting data that violate such conditions.

Data migration tools allow simple transformations to be specified such as to replace the string “gender” by “sex.”

ETL (extraction/transformation/loading) tools allow users to specify transforms through a graphical user interface (GUI).

Potter’s Wheel, is a publicly available data cleaning tool that integrates discrepancy detection and transformation.

Popular posts from this blog

Gaussian Elimination - Row reduction Algorithm

 Gaussian elimination is a method for solving matrix equations of the form, Ax=b.  This method is also known as the row reduction algorithm. Back  Substitution Solving the last equation for the variable and then work backward into the first equation to solve it.  The fundamental idea is to add multiples of one equation to the others in order to eliminate a variable and to continue this process until only one variable is left. Pivot row The row that is used to perform elimination of a variable from other rows is called the pivot row. Example: Solving a linear equation The augmented matrix for the above equation shall be The equation shall be solved using back substitution. The eliminating the first variable (x1) in the first row (Pivot row) by carrying out the row operation. As the second row become zero, the row will be shifted to bottom by carrying out partial pivoting. Now, the second variable (x2)  shall be eliminated by carrying out the row operation again. ...

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807

Minor, Cofactor, Determinant, Adjoint & Inverse of a Matrix

Consider a matrix Minor of a Matrix I n the above matrix A, the minor of first element a 11  shall be Cofactor The Cofactor C ij  of an element a ij shall be When the sum of row number and column number is even, then Cofactor shall be positive, and for odd, Cofactor shall be negative. The determinant of an n x n matrix can be defined as the sum of multiplication of the first row element and their respective cofactors. Example, For a 2 x 2 matrix Cofactor C 11 = m 11 = | a 22 | = a 22  = 2 Determinant The determinant of A is  |A| = (3 x 2) - (1 x 1) = 5 Adjoint or Adjucate The Adjoint matrix of A , adjA is the transpose of its cofactor matrix. Inverse Matrix A matrix should be square matrix to have an inverse matrix and also its determinant should not be zero. The multiplication of matrix and its inverse shall be Identity matrix. The square matrix has no inverse is called Singular. Inv A = adjA / |A|           [ adjoint A / determ...