Idea for navigating tags

Related Articles:
Tag, path and weighted tag

As mentioned in previous article, there are pros and cons for either the path or tag approaches in classifying information.

A problem with tags is that a single tag may associated with a lot of information that may or may not related to the specific interest of a particular search incidence. For example, a 'statistics' tag may associated with education, mathematics, physics, program ... etc. A single search of statistics becomes useless.

A possible approach is to make the search a tree/branch-liked search: Once a tag-of-interest is identified, the search program will create a list of data items that are tagged with the searching tag. The program will, then, collect all tags from these data items and try to present choices for the next tag selection and so on. By implement it right, tags can be considered a dynamic tree/path structure.

Tag, path and weighted tag

Tags have been slowly replacing the path/folder we used to use to organize articles/emails ... etc.

Tags, in mathematic terms, can be considered based on set theory. An information item can be considered an element while tags establish sub-sets. You can, therefore, find information items that belong to the intersection of the 'tea' subset and the 'green' subset and, hopefully, some of them are about 'green tea'.

The paths/folders are more like ordered tuples. It can be thought of as giving weights to the leading/parent folders. For example, a path of Education/computer could describing an item for educational community but contains information about computer usages. On the other hand, Computer/Education could be describing an item that are mainly for IT audiences but is related to education.

In terms of classifying an information item, the path/folder approach can give additional info about and item than tags, assuming using the same keywords. On the flip side, of cause, the classifying with paths are more involved. The other problem with paths is that, even though it provide weights, the weights are either 1 or 0 for parent and child folder.

The other issue to consider is the use of phrases in addition to words for tagging. There are times that tag with words is not the same as tag with a phrase. This applies to the paths too!

A possible alternative to tag and path is the weighted tag/phrase. In addition to plan tags/phases we can give them weights. The searching mechanism can now using both tag and weights to provide better results. In addition to that, the weight to a phrase can be distributed to words in the phrase in calculating the searching weights.