Table 2 The algorithm of O-HARP. L1-L10 are line numbers.
From: Genome classification by gene distribution: An overlapping subspace clustering approach
Algorithm O-HARP (N is the number of dimensions in the dataset, t and f are the merge score and filtering thresholds) | |
|---|---|
L1 | Â Â Â For d : = N to 1 do { |
L2 | Â Â Â Â Â Â BuildScoreCache(d, t) |
L3 | Â Â Â Â Â Â While cache is not empty { |
L4 | Â Â Â Â Â Â Â Â Â FindBestMatch() |
L5 | Â Â Â Â Â Â Â Â Â PerformMatch() |
L6 | Â Â Â Â Â Â Â Â Â UpdateParentChildRelationship() |
L7 | Â Â Â Â Â Â Â Â Â UpdateScoreCache() |
L8 | Â Â Â Â Â Â } |
L9 | Â Â Â } |
L10 | Â Â Â FilterOutInsignificantClusters(f) |