INTERACTIVE CONTENT SEARCH USING COMPARISONS
In interactive content search through comparisons, a search for a target object in a database is performed by finding the object most similar to the target from a small list of objects. A new object list is then presented based on the earlier selections. This process is repeated until the target is included in the list presented, at which point the search terminates. A solution to the interactive content search problem is provided under the scenario of heterogeneous demand, where target objects are selected from a non-uniform probability distribution. It has been assumed that objects are embedded in a doubling metric space which is fully observable to the search algorithm. Based on these assumptions, an efficient comparison-based search method is provided whose cost in terms of the number of queries can be bounded by the doubling constant of the embedding c, and the entropy of demand distribution, H. More precisely, the present principles show that the average search costs scales C F =O(c 5 H), which improves upon the previously best known bound and is order optimal for constant c.
1 . A method for searching content within a data base, comprising the steps of:
constructing a net having a size that contains a target;
choosing a plurality of exemplars;
comparing each exemplar with every other exemplar;
determining the exemplar closest to the target;
reducing the size of the net to a smaller size that contains the target;
repeating said choosing, comparing, determining, and reducing steps until the size of the net is small enough to locate the target.
2 . The method of claim 1 , wherein said repeating step is performed for at least two iterations.
3 . The method of claim 1 , wherein said repeating step is performed until the size of the last net is within a threshold value.
4 . The method of claim 1 , wherein said repeating step is performed for a predetermined number of iterations.
5 . The method of claim 1 , wherein the target is located by an alternative search method after the net becomes small enough.
6 . A computer for searching content within a data base, comprising:
circuitry to construct a net having a size that contains a target;
circuitry to choose a plurality of exemplars;
comparator circuitry that operates on the exemplars;
a determining circuit that finds the exemplar closest to the target;
circuitry to reduce the size of the net to a smaller size that contains the target; and
control circuitry to cause said circuitry to construct, said circuitry to choose, said comparator, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the net is small enough to locate the target.
7 . The apparatus of claim 6 , wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation for at least two iterations.
8 . The apparatus of claim 6 , wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the last net is within a threshold value.
9 . The apparatus of claim 6 , wherein said control circuitry causes said circuitry to construct, said circuitry to choose, said comparator circuitry, said determining circuit, and said circuitry to reduce to repeat their operation until the size of the last net is within a threshold value.
10 . The apparatus of claim 6 , wherein said control circuitry causes the target to be located by an alternative search method after the net becomes small enough.