A Novel Method to Solve Real Time Security Issues in Software Industry Using Advanced Cryptographic Techniques
Algorithm 3
The pseudocode of ECC-ACO with classifier.
Input: privacy datasets
Output: classified sensitive samples
Step 1. Sort private dataset using sensitive attributes
Step 2. Split the sorted datasets into subgroups
Step 3. If there exist identical attributes(a) Cluster using ACO
Step 4. Else(a) Go to Step 1
Step 5. End
Step 6. Repeat over other clusters(a) If the size of cluster size = Dmin(b) Distribute the data sample among the clusters(c) Create single cluster element(d) Add nearest neighbor in the cluster(e) Eliminate unwanted instances(f) End
Step 7. In case two, the value of S is greater than K(a) Distribute the instances to all clusters, equally(b) Add the record from Dmin to single element cluster(c) Follow Step 6(c)(d) Split Dmin values from each cluster(e) Follow Step 8(f) Compete the KN values and add the neighboring values to each cluster similar to case one(g) Replace QID values with center values in each cluster to anonymize the data clusters.(h) Repeat the process
Step 8. Calculate the centroid
Step 9. Use Euclidean distance to calculate nearest instances along the centroid in clusters
Step 10. Classify the similar instances using classifiers
