Research Article
A Novel Method to Solve Real Time Security Issues in Software Industry Using Advanced Cryptographic Techniques
| Input: unequal clusters from the ACO algorithm | | Output: k-anonymity table | | Step 1. For each cluster(a) Find the size of cluster | | Step 2. If the size of cluster is lesser than maximum value of size of a cluster(a) Merge the clusters | | Step 3. Else | | Step 4. Divide the groups into subgroups, s.t. each groups will have at least k-tuples | | Step 5. End |
|