Presenting a diversity of recommendations

Details Presenting a diversity of recommendations Presenting a diversity of recommendations

2008-02-19

2011-11-22

Gaffin, Jeffrey A (Department: 2129)

Data processing: artificial intelligence

Knowledge processing system

Knowledge representation and reasoning technique

Reexamination Certificate

active

08065254

ABSTRACT:
Methods, systems and apparatus, including computer program products, for providing a diversity of recommendations. According to one method, results are identified so as to increase the likelihood that at least one result will be of interest to a user. Following the identification of a first result, second and later results are identified based on an assumption that the previously identified results are not of interest to the user. The identification of diverse results can be based on formulas that approximate the probability or provide a likelihood score of a user selecting a given result, where a measured similarity between a given object and previously identified results tends to decrease the calculated probability approximation or likelihood score for that object.

REFERENCES:
patent: 6006218 (1999-12-01), Breese et al.
patent: 6078740 (2000-06-01), DeTreville
patent: 6519591 (2003-02-01), Cereghini et al.
patent: 6556960 (2003-04-01), Bishop et al.
patent: 6687696 (2004-02-01), Hofmann et al.
patent: 6728695 (2004-04-01), Pathria et al.
patent: 6981040 (2005-12-01), Konig et al.
patent: 7113185 (2006-09-01), Jojic et al.
patent: 7328216 (2008-02-01), Hofmann et al.
patent: 7389201 (2008-06-01), Chickering et al.
patent: 7685276 (2010-03-01), Konig et al.
patent: 2004/0172267 (2004-09-01), Patel et al.
patent: 2007/0038659 (2007-02-01), Datar et al.
Heckerman,D. et al. “Dependency Networks for Collaborative Filtering and Data Visualization”. Journal of Machine Learning Research, 1:49-75, 2000.
Chang, et al., “Bigtable: A Distributed Storage System for Structured Data,” 2006, Usenix Association, 14 pages.
Hofmann, “Latent Semantic Models for Collaborative Filtering,” Jan. 2004, ACM, 27 pages.
Dean, et al., “MapReduce: Simplified Data Processing on Large Clusters,” 2004, OSDI, 13 pages.
Das et al., “Google News Personalization: Scalable Online Collaborative Filtering,” WWW2007, May 8-12, 2007, Banff, Canada, 10 pages.
Adomavicius, G., and Tuzhilin, A. ‘Toward the Next Generation of Recommender Systems: A survey of the State-of-the-Art and Possible Extensions.’ IEEE Transactions on Knowledge and Data Engineering, vol. 17, N.6, Jun. 2005.
Blei, D.; Ng, A.; and Jordan, M. ‘Latent Dirichlet Allocation.’ In Journal of Machine Learning Research, 2003.
Breese, J.; Heckermann, D.; and Kadie, C. ‘Empirical Analysis of Predictive Algorithms for Collaborative Filtering.’ Proc. Of the 14th Conf. on Uncertainty in Artificial Intelligence, Jul. 1998.
Broder, A. ‘On the resemblance and containment of documents.’ Compression and Complexity of Sequences (Sequences '97), 1998 pp. 21-29.
Buhler, J. ‘Efficient large-scale sequence comparison by locality-sensitive hashing.’ Bioinformatics, vol. 17, pp. 419-428, 2001.
Charikar, M. Similarity Estimation Techniques from Rounding Algorithms. Proc. Of the 34th Annual ACM Symposium on Theory of Computing, STOC (2002).
Cohen, et al. ‘Finding Interesting Associations without Support Pruning.’ Proc. Of the 16th Intl. Conf. on Data Engineering, (ICDE 2000).
Datar, et al. ‘Locality-Sensitive Hashing Scheme Based on P-Stable Distributions.’ Proc. Of the 20th ACM Annual Symposium on Computational Geometry (SOCG 2004).
Gionis, A., et al. ‘Similarity Search in High Dimensions via Hashing.’ Proc. Of the 25th Intl. Conf. on Very Large Data Bases, VLDB (1999).
Indyk, P. ‘A Small Approximately Min-Wise Independent Family of Hash Functions.’ Proc. 10th Symposium on Discrete Algorithms, SODA (1999).
Indyk, P, and Motwani, R. Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Proc of the 30th Annual ACM Symposium on Theory on Computing, 1998, pp. 604-613.
Marlin, B., and Zemel, R. ‘The Multiple Multiplicative Factor Model for Collaborative Filtering.’ ACM Intl. Conf. Proceeding Series, vol. 69, 2004.
Resnick, et al. ‘GroupLens: an Open architecture for Collaborative Filtering of Netnews.’ Proc. Of Computer Supported Cooperative Work Conf., 1994.
Sarwar, et al. ‘Application of Dimensionality Reduction in Recommender Systems—A Case Study.’ Proc. Of the ACM WebKDD Workshop, 2000.
Sarwar, et al. ‘Item-Based Collaborative Filtering Recommendation Algorithms.’ Proc. Of the 10th Intl. WWW Conf., (WWW) 2001.
Shani, et al. ‘An MDP-Based Recommender System.’ Proc. Of the 18th Conf. Uncertainty in Artificial Intelligence, Aug. 2002.
Cohen, E. ‘Size-Estimation Framework with Applications to Transitive Closure and Reachability.’ Journal of Computer and System Sceinces 55 (1997): 441-453.
Motwani, R. and Raghavan, P., Randomized Algorithms. Cambridge University Press, 1985.
Yu, et al. ‘Instance Selection Techniques for Memory-Based Collaborative Filtering.’ Proc. Of the Second Siam Intl. Conf. on Data Mining, (SDM) 2002.

Affiliated with

Also associated with

Rating

Presenting a diversity of recommendations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Presenting a diversity of recommendations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Presenting a diversity of recommendations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4291269