Research Article
Label Propagation Clustering Algorithm Based on Adaptive Angle
1: //All points in the sample set are traversed to | //dynamically determine their receiving range | 2: for from to the maximum number of dataset do | 3: Compute sList | 4: | 5: | 6: | 7: for; ; | 8: a1.append(Vector[i] VecList[j]) | 9: | 10: end for | 11: for each do | 12: ifthen | 13: Range[i].append(u) | 14: else | 15: | 16: and exit this cycle | 17: end if | 18: end for | 19: for from to the remaining points do | 20: | 21: if and not in the side of boundary then | 22: Range[i].append(n) | 23: else if and not in the side of boundary then | 24: Break | 25: else | 26: Continue | 27: end if | 28: end for | 29: end for |
|