Patent ID: 7162480

Claim:
A computer implemented method for adaptably maintaining a taxonomy defined by a plurality of nodes arranged hierarchically, the method comprising the steps of: determining a threshold access value for each node of said plurality of nodes; determining a level of access value for each node of said plurality of nodes; comparing said level of access value for a first node of said plurality of nodes with said threshold access value for said first node of said plurality of nodes, and if said level of access value for said first node is less than said threshold access value for said first node, merging said first node with a related non-parent node arranged laterally to said first node in said hierarchical arrangement; and comparing said level of access value for said first node of said plurality of nodes with said threshold access value for a second node of said plurality of nodes, and if said level of access value for said first node is greater than said threshold access value for said second node, promoting said first node to a higher level in said hierarchical arrangement than said second node, and if said level of access value for said first node is less than said threshold access value for said second node, demoting said first node to a lower level in said hierarchical arrangement than said second node.