-
Notifications
You must be signed in to change notification settings - Fork 1
/
binning.cpp
100 lines (81 loc) · 1.64 KB
/
binning.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include<bits/stdc++.h>
using namespace std;
int main()
{
vector<int>v;
int n,i,j,no_of_bins,bin_size;
cout<<"enter size(no. of elements):"<<endl;
cin>>n;
cout<<"enter "<<n<<" elements:";
for(i=0;i<n;i++)
{
int x;
cin>>x;
v.push_back(x);
}
cout<<"no of bins:";
cin>>no_of_bins;
sort(v.begin(),v.end());
bin_size=(n/no_of_bins);
if(n%2!=0)
bin_size+=1;
vector<int>bins[no_of_bins];
int bno=0;
for(i=0;i<n;i++)
{
bins[bno].push_back(v[i]);
if(((i+1)%bin_size)==0)
bno++;
}
cout<<"Equi-width Binning:"<<endl;
for(i=0;i<no_of_bins;i++)
{
cout<<"bin_no -"<<i+1<<" : ";
for(j=0;j<bins[i].size();j++)
{
cout<<bins[i][j]<<" ";
}
cout<<endl;
}
cout<<"-----------------------------------------------------------------"<<endl;
cout<<"Bin Mean:"<<endl;
double mean=0;
for(i=0;i<no_of_bins;i++)
{
cout<<"bin_no -"<<i+1<<" : ";
mean=0;
for(j=0;j<bins[i].size();j++)
{
mean+=bins[i][j];
}
mean/=bins[i].size();
for(j=0;j<bins[i].size();j++)
{
cout<<mean<<" ";
}
cout<<endl;
}
cout<<"--------------------------------------------------------------------"<<endl;
cout<<"Bin Boundaries :"<<endl;
mean=0;
for(i=0;i<no_of_bins;i++)
{
cout<<"bin_no -"<<i+1<<" : ";
int var_min=bins[i][0],var_max=bins[i][bins[i].size()-1];
for(j=0;j<bins[i].size();j++)
{
if(j!=0&&j!=bins[i].size()-1)
{
if(abs(bins[i][j]-var_min)<=abs(bins[i][j]-var_max))
cout<<var_min<<" ";
else
cout<<var_max<<" ";
}
else
cout<<bins[i][j]<<" ";
}
cout<<endl;
}
cout<<"----------------------------------------------------------------------"<<endl;
return 0;
}