Usage-based adaptable taxonomy

A computer-implemented system for adaptably maintaining a taxonomy defined by a plurality of nodes arranged hierarchically, comprising:

• a processor;
• and
• a data storage unit coupled to said processor, said data storage unit operable to store said taxonomy, said processor in association with said data storage unit operable to:
• determine a threshold access value for each node of said plurality of nodes;
• determine a level of access value for each node of said plurality of nodes;
• compare 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, merge said first node with a related node arranged laterally to said first node in said hierarchical arrangement;
• and
• compare 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, promote 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, demote said first node to a lower level in said hierarchical arrangement than said second node.

A system for adaptably maintaining a taxonomy defined by a plurality of nodes arranged hierarchically, comprising:

• means for determining a threshold access value for each node of said plurality of nodes;
• means for determining a level of access value for each node of said plurality of nodes;
• means for 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 node arranged laterally to said first node in said hierarchical arrangement;
• and
• means for 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.