K-Mean & Nearest Neighbour Programs

Kmean & Nearest Neighbour Prog in java

1. Kmean:

#include<iostream.h>
#include<conio.h>
#include<math.h>
void main()
{
 clrscr();
 int m1,m2,i,j,n,x,y,sum1,sum2,k;
 int d[100],k1[50],k2[50];
 cout<<"Enter the no. of items in cluster:";
 cin>>n;
 cout<<"Enter the items of the cluster:";
 for(i=0;i<n;i++)
 cin>>d[i];
 for(i=0;i<n;i++)
 {
  k1[i]=k2[i]=0;
 }
 m1=d[0];
 m2=d[1];
 k=1;
 while(1)
 {
 x=0;
 y=0;
 for(i=0;i<n;i++)
 {
  if(abs(m1-d[i]) <= abs(m2-d[i]))
  {
   k1[x++]=d[i];
  }
  else
  k2[y++]=d[i];
 }
 cout<<"\n\n\n** Iteration:"<<k<<" **\n"<<endl;
 cout<<"cluster1={";
 for(i=0;i<x;i++)
 {
 cout<<k1[i]<<",";
 }
 cout<<"}"<<endl;
 cout<<"cluster2={";
 for(i=0;i<y;i++)
 {
 cout<<k2[i]<<",";
 }
 cout<<"}"<<endl;
 sum1=sum2=0;
 for(i=0;i<x;i++)
 sum1=sum1+k1[i];
 sum1=sum1/x;
 for(i=0;i<y;i++)
 sum2=sum2+k2[i];
 sum2=sum2/y;
 if(sum1==m1 && sum2==m2)
 break;
 else
 {
  m1=sum1;
  m2=sum2;
 }
 k++;
 }
 getch();
}

2. Nearest Neighbour:

#include<iostream.h>
#include<conio.h>
void main()
{
 clrscr();
 int m,i,j,n,t,p,l,iflag,jflag;
 int a[10][10];
 char k[10],k1[10],k2[10];
 cout<<"Enter the no. of tuples:";
 cin>>n;
 cout<<"Enter the name of the nodes:";
 for(i=0;i<n;i++)
 {
  cin>>k[i];
 }
 cout<<"Enter the adjacent matrix:\n\n";
 cout<<" ";
 for(i=0;i<n;i++)
 cout<<" "<<k[i];
 cout<<endl;
 for(i=0;i<n;i++)
 {
  cout<<endl<<k[i]<<" ";
  for(j=0;j<n;j++)
  cin>>a[i][j];
 }
 cout<<endl;
 t=1;
 while(1)
 {
 cout<<"** Threshold="<<t<<" **\n\n";
 m=0;
 iflag=1;
 jflag=1;
 for(i=0;i<n;i++)
 for(j=0;j<n;j++)
 {
  if(a[i][j]<=t && a[i][j]>0 && i<j)
  {
   cout<<k[i]<<" is connected to "<<k[j]<<" having distance of "<<a[i][j]<<endl;
   for(l=0;l<m;l++)
   {
    if(k[i]==k1[l])
    {
    iflag=0;
    break;
    }
    else
    {
    iflag=1;
    }
   }
   for(l=0;l<m;l++)
   {
    if(k[j]==k1[l])
    {
    jflag=0;
    break;
    }
    else
    {
    jflag=1;
    }
   }
   if(iflag==1)
   k1[m++]=k[i];
   if(jflag==1)
   k1[m++]=k[j];
  }
 }
 p=0;
 for(i=0;i<n;i++)
 {
  if(k[i]!=k1[i])
  {
   k2[p++]=k[i];
  }
 }
 cout<<"k1={";
 for(i=0;i<m;i++)
 cout<<k1[i]<<",";
 cout<<"}\n";
 cout<<"k2={";
 for(i=0;i<p;i++)
 cout<<k2[i]<<",";
 cout<<"}\n";
 if(m==n)
 break;
 t++;
 cout<<"\n\n";
}
 getch();
}