public static String getClassificationNaive(Vector<NearestNeighbour> nn)
    {
	// The nearest neighbour will be first in the list.

	int posCount = 0;
	int negCount = 0;
	int unknownCount = 0;

	for(int i =0; i < nn.size();i++)
	{
	    String classification = nn.get(i).getNeighbourClassificationBTR();
	    if(classification.equals(Constants.PULSAR))
		posCount++;
	    else if(classification.equals(Constants.RFI))
		negCount++;
	    else
		unknownCount++;

	    System.out.println("neighbour: "+ i + " class:"+ classification);
	} 

	System.out.println("+: "+ posCount + " -:"+ negCount + " unknown:"+unknownCount);

	// Whichever is greater decides the classification label
	// in the case of a tie, randomly choose.
	if(negCount > posCount) 
	{
	    System.out.println("Assigning -" +Constants.RFI + "- classification");
	    return Constants.RFI;
	}
	else if(posCount > negCount  ) 
	{
	    System.out.println("Assigning -" +Constants.PULSAR + "- classification");
	    return Constants.PULSAR;
	}
	else if(posCount == negCount)
	    return nn.get(0).getNeighbourClassificationBTR();
	else // label unknown
	    return Constants.UNKNOWN;
    }