Present a relevant list of tags

Use cases

Implementations

Most frequent tags

  1. Take the list of currently displayed packages
  2. Take the list of their tags
  3. Display only those tags that appear most frequently.

Example implementation: Adept 2.0 smart search.

Tags most relevant to a full-text search

  1. Take the entire list of packages
  2. Rank their tags by frequency
  3. Take the list of packages resulting from a keyword search or some other kind of search
  4. Rank their tags by frequency
  5. For each tag, compute how many places it advanced in the ranking after the search
  6. Display only those tags that advanced the most

This is a very accurate way to find, given a package search, the tags that lead in the same direction of the search.

It can also be used to convert a keyword search to a tag search.

Example implementation: debtags smart search, from still unreleased debtags (http://svn.debian.org/wsvn/debtags/debtags/1.6.0)

Most discriminant tags

Given a list of packages find a list of tags each of which, if selected, would lead to a list of packages which is half as long as the previous one.

This method presents the user with a list of tags each of which embeds a relevant step forward in the selection.

Example implementation: none known.

DebTags/PresentRelevantTags (last edited 2006-06-30 12:38:44 by EnricoZini)