A Novel Method to Solve Real Time Security Issues in Software Industry Using Advanced Cryptographic Techniques

Algorithm 1

Partitioning step.

	Input: privacy datasets
	Output: unequally clustered datasets
	Step 1. Pheromone matrix initialization, where the matrix elements are set with small values.
	Step 2. Ants initialization(a)  Start initial process of iteration(b)  Reset the memory, cluster center matrix, and weight matrix
	Step 3. Random selection of data object (other than memory list)
	Step 4. Cluster selection using the process of exploitation and exploration(a)  Exploitation using the greedy algorithm(b)  Exploration allots probabilities of nodes and chooses the higher probability ant in stochastic manner(c)  This is regarded as the cluster center, which is used for forming the cluster
	Step 5. Update the ants(a)  Update the memory, cluster center matrix, and weight matrix(b)  If the memory list is not full, go back to Step 3(c)  Else continue with the process(d)  End
	Step 6. Find the fitness
	Step 7. Update the value of pheromone
	Step 8. Check end condition(a)  If total iterations > maximum iterations(i)   End the process(b)  Else go to Step 6(c)  End