C++ program to perform Data cleaning operation with Binning Method

-

Simple C++ program to perform Data cleaning operation on data set which include treatment of missing value, smoothing of noisy data by binning method.

 

Code:


#include<iostream>

#include<algorithm>

#include<math.h>



using namespace std;



int main()

{

int num,i, j, d, e, in, k, sum, b1, b2;

int n, r, r1, r2;

cout << "Enter the total number of data: " << endl;

cin >> num;

int a[num];

cout << "Enter the values: " << endl;

for(i=0; i<num; i++)

{

cin >> a[i];

}

sort(a, a+num);

while(true)

{

cout << "Enter your choice: " << endl;

cout << "1. Equal-Depth Binning" << endl;

cout << "2. Equal-Width Binning" << endl;

cout << "3. Exit" << endl;

cin >> in;

if(in==1)

{

cout << "Enter the depth of bin: " << endl;

cin >> d;

cout << endl;

e = num / d;

int b[e][d], avg[e], mean[e][d];

k = 0;

//bin generate

for(i=0; i<e; i++)

{

cout << "BIN " << (i+1) << ": ";

for(j=0; j<d; j++)

{

b[i][j] = a[j+k];

cout << b[i][j] << " ";

}

k = k + 3;

cout << endl;

}

//find average

for(i=0; i<e; i++)

{

sum=0;

for(j=0; j<d; j++)

{

sum = sum + b[i][j];

}

avg[i] = sum / d;

}

//give mean value to bin

for(i=0; i<e; i++)

{

for(j=0; j<d; j++)

{

mean[i][j] = avg[i];

}

}

cout << "After smoothing of bin using mean method: " << endl;

for(i=0; i<e; i++)

{

cout << "BIN " << (i+1) << ": ";

for(j=0; j<d; j++)

{

cout << mean[i][j] << " ";

}

cout << endl;

}





cout << "After smoothing of bin using boundary method: " << endl;

for(i=0; i<e; i++)

{

b1 = b[i][0];

b2 = b[i][d-1];

for(j=0; j<d; j++)

{

if(abs(b[i][j] - b1) < abs(b[i][j] - b2))

{

b[i][j] = b1;

}

else if(abs(b[i][j] - b1) > abs(b[i][j] - b2))

{

b[i][j] = b2;

}

else

{

b[i][j] = b1;

}

}

}

for(i=0; i<e; i++)

{

cout << "BIN " << (i+1) << ": ";

for(j=0; j<d; j++)

{

cout << b[i][j] << " ";

}

cout << endl;

}

}

else if(in == 2)

{

// cout << "Sorted Array: " << endl;

for(i=0; i<n; i++)

{

cout << a[i] ;

}

cout << endl;

cout << "Enter the number of bins: " << endl;

cin >> n;

int w[n][num], bw[n][num], count1[n], z, n1;

r = (a[n-1] - a[0]) / n;

r1 = a[0];

r2 = r1 + r;

for(i=0; i<n; i++)

{

z = 0;

cout << "BIN " << (i+1) << ": ";

for(j=0; j<num; j++)

{



if((r1 <= a[j]) && (a[j] <= r2))

{

w[i][j] = a[j];

z = z + 1;

cout << w[i][j] << " ";

count1[i] = z;

}

else

{

w[i][j] = 0;

}

}

r1 = r1 + r + 1;

r2 = r2 + r;

cout << endl;

}



}

else if(in == 3)

{

exit(0);

}

}

return 0; }

Comments

Post a Comment

Popular posts from this blog

C program to evaluate Prefix Expression using Stack data structure

-
Simple C program to evaluate Prefix Expression using Stack data structure Code: #include<stdio.h> #include<conio.h> #include<string.h> int steck[10]; int top=-1; void push(int value) { steck[top++]=value; } int pop() { return(steck[top--]); } int ope(char c) { if(c=='+'||c=='-'||c=='*'||c=='/') return 1; else return 0; } void main() { char prefix[10]; int len,val,i,opr1,opr2,res; clrscr(); printf("Enter the prefix Expression: "); scanf("%s",prefix); len=strlen(prefix); for(i=len-1;i>=0;i--) { switch(ope(prefix[i])) { case 0: val=prefix[i]; push(val); break; case 1: opr1=pop(); opr2=pop(); switch(prefix[i]) { case '+': res=opr1+opr2; break; case '-': res=opr1-opr2; break; case '*': res=opr1*opr2; break; case '/': res=opr1/opr2; break; } push(res); } } printf("Result is %d",steck[top]); getch(); }
Read more

Java Program to Implement sorting algorithm using TCP on Server application

-
Simple Java program to Implement sorting algorithm using TCP on Server application Input: Give input on client side and client should receive sorted output from server and display sorted list on input(client) side. Note: You can implement any sorting algorithm by changing the sorting algorithm code on server side Code: Server: package aj.pkg7; import java.io.*; import java.net.*; import java.util.*; class Server { public static void main(String args[]) throws Exception { ServerSocket ss=new ServerSocket(1111); Socket s=ss.accept(); DataInputStream din=new DataInputStream(s.getInputStream()); DataOutputStream dout=new DataOutputStream(s.getOutputStream()); int r,i=0; int n=din.readInt(); int a[]=new int[n]; System.out.println("data:"); int count=0; for(i=0;i<n;i++) { a[i]=din.readInt(); } int number = a.length; for (int i1 = 0; i1 < number-1; i1++) for (int j1 = 0; j1 < number-i1-1; j1++) if (a[j1] > a[j1+1]) { int temp = a[j1]; a[j1] = a[j1+1]; a[j1+1] = temp; } ...
Read more

C++ program to perform data transformation Min-max and Z score Normalization

-
Simple C++ program to perform data transformation using min-max normalization, z-score normalization and decimal scaling operation. Code: #include<iostream> #include<math.h> using namespace std; int main() { int n; double sum=0; cout<<"Enter The Number of values:"; cin>>n; int a[n],r1,r2; for(int i=0;i<n;i++) { cin>>a[i]; } cout<<"Enter starting and ending range for normalization:"; cin>>r1>>r2; double max = a[0]; int min = a[0]; for (int i = 0; i <n; i++) { if (a[i] > max) { max = a[i]; } else if (a[i] < min) { min = a[i]; } } float v[n];double temp; for(int i=0;i<n;i++) { temp=double(double(double(a[i]-min)*(r2-r1))/(max-min))+ r1; v[i]=temp; } cout<<"normalization by Min-max"<<endl; cout<<"Values a...
Read more