OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

Data Mining Algorithm

Browse Source
This commit is contained in:
Harshil Darji 2016-07-29 11:29:07 +05:30
parent e65a50c983
commit 0b680519f1
1 changed files with 103 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

103
Binning.c Normal file
View File

@ -0,0 +1,103 @@
#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
int a[100],**b,i,j,r,c,n,temp,k=0,sum,avg[10],l,h;
clrscr();
printf("How many data? ");
scanf("%d",&n);
for(i=0;i<n;i++)
{
a[i]= rand()%(100);
}
printf("\nGenerated Random Numbers:");
for(i=0;i<n;i++)
{
printf(" %d",a[i]);
}
printf("\n\nSorted Data:");
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(i=0;i<n;i++)
{
printf(" %d",a[i]);
}
printf("\n\nHow many bins? ");
scanf("%d",&r);
c=n/r;
for(i=0;i<r;i++)
{
b[i]=(int*)malloc(c*sizeof(int));
for(j=0;j<c;j++)
{
b[i][j]=a[k];
k++;
}
}
printf("\nData Before Smoothing: \n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
printf("%d\t",b[i][j]);
}
printf("\n");
}
for(i=0;i<r;i++)
{
sum=0;
for(j=0;j<c;j++)
{
sum=sum+b[i][j];
}
avg[i]=sum/c;
}
printf("\nBinning By Means: \n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
printf("%d\t",avg[i]);
}
printf("\n");
}
for(i=0;i<r;i++)
{
l=b[i][0];
h=b[i][c-1];
for(j=0;j<c;j++)
{
if((b[i][j]-l) < (h-b[i][j]))
{
b[i][j]=l;
}
else
{
b[i][j]=h;
}
}
}
printf("\nBinning by Boundries: \n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
printf("%d\t",b[i][j]);
}
printf("\n");
}
getch();
}