Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2001-11-13
2004-10-05
Amsbury, Wayne (Department: 2171)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
06801917
ABSTRACT:
FIELD OF THE INVENTION
The present invention relates to methods and apparatus for recommending items of interest, such as television programming, and more particularly, to techniques for recommending programs and other items of interest before the user's purchase or viewing history is available.
BACKGROUND OF THE INVENTION
As the number of channels available to television viewers has increased, along with the diversity of the programming content available on such channels, it has become increasingly challenging for television viewers to identify television programs of interest. Electronic program guides (EPGs) identify available television programs, for example, by title, time, date and channel, and facilitate the identification of programs of interest by permitting the available television programs to be searched or sorted in accordance with personalized preferences.
A number of recommendation tools have been proposed or suggested for recommending television programming and other items of interest. Television program recommendation tools, for example, apply viewer preferences to an EPG to obtain a set of recommended programs that may be of interest to a particular viewer. Generally, television program recommendation tools obtain the viewer preferences using implicit or explicit techniques, or using some combination of the foregoing. Implicit television program recommendation tools generate television program recommendations based on information derived from the viewing history of the viewer, in a non-obtrusive manner. Explicit television program recommendation tools, on the other hand, explicitly question viewers about their preferences for program attributes, such as title, genre, actors, channel and date/time, to derive viewer profiles and generate recommendations.
While currently available recommendation tools assist users in identifying items of interest, they suffer from a number of limitations, which, if overcome, could greatly improve the convenience and performance of such recommendation tools. For example, to be comprehensive, explicit recommendation tools are very tedious to initialize, requiring each new user to respond to a very detailed survey specifying their preferences at a coarse level of granularity. While implicit television program recommendation tools derive a profile unobtrusively by observing viewing behaviors, they require a long time to become accurate. In addition, such implicit television program recommendation tools require at least a minimal amount of viewing history to begin making any recommendations. Thus, such implicit television program recommendation tools are unable to make any recommendations when the recommendation tool is first obtained.
A need therefore exists for a method and apparatus that can recommend items, such as television programs, unobtrusively before a sufficient personalized viewing history is available. In addition, a need exists for a method and apparatus for generating program recommendations for a given user based on the viewing habits of third parties.
SUMMARY OF THE INVENTION
Generally, a method and apparatus are disclosed for recommending items of interest to a user, such as television program recommendations. According to one aspect of the invention, recommendations are generated before a viewing history or purchase history of the user is available, such as when a user first obtains the recommender. Initially, a viewing history or purchase history from one or more third parties is employed to recommend items of interest to a particular user.
The third party viewing or purchase history is processed to generate stereotype profiles that reflect the typical patterns of items selected by representative viewers. Each stereotype profile is a cluster of items (data points) that are similar to one another in some way. A user selects stereotype(s) of interest to initialize his or her profile with the items that are closest to his or her own interests.
A clustering routine partitions the third party viewing or purchase history (the data set) into clusters, such that points (e.g., television programs) in one cluster are closer to the mean of that cluster than any other cluster. A mean computation routine is also disclosed to compute the symbolic mean of a cluster. A given data point, such as a television program, is assigned to a cluster based on the distance between the data point to each cluster using the mean of each cluster.
The programs or other items in the third party viewing or purchase history are partitioned into k clusters of similar items using a k-means clustering algorithm. According to one aspect of the invention, the disclosed clustering routine employs a dynamic value of k. The value of k is incremented until (i) further incrementing of k does not yield any improvement in the classification accuracy, (ii) a predefined performance threshold is reached, or (iii) an empty cluster is detected. The performance of the clustering technique may be improved by representing a cluster with multiple means (or multiple feature values for each possible feature). When the mean is comprised of multiple programs, the mean is more likely to be representative of the entire cluster, and additional variability is introduced into the clustering process.
A more complete understanding of the present invention, as well as further features and advantages of the present invention, will be obtained by reference to the following detailed description and drawings.
REFERENCES:
patent: 5544256 (1996-08-01), Brecher et al.
patent: 5758257 (1998-05-01), Herz et al.
patent: 5940825 (1999-08-01), Castelli et al.
patent: 6029195 (2000-02-01), Herz
patent: 6088722 (2000-07-01), Herz et al.
Cost et al., “A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features,”.
Kittler et al., “Combining Classifiers,” Inter'l Conf. on Pattern Recognition, vol. II Track B, 897-901, (1996).
Stanfill et al., “Toward Memory-Based Reasoning,” Communications of the ACM, vol. 29, 1213-1228, (1986).
Gath et al: “Unsupervised optimal fuzzy clustering” IEEE Transactions On Pattern Analysis And Machine Intelligence, Jul. 1989, pp. 773-781.
Cost et al: “A Weighted Nearest Neighbor Algorithm for Learning With Symbolic Features” Machine Learning, vol. 10, 1993, pp. 57-58.
Gutta Srinivas
Kurapati Kaushal
Amsbury Wayne
Halajian Dicran
Koninklijke Philips Electronics , N.V.
Nguyen Cindy
LandOfFree
Method and apparatus for partitioning a plurality of items... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for partitioning a plurality of items..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for partitioning a plurality of items... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3331065