| Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of Recommendation Algorithms for E-Commerce. In: ACM Conference on Electronic Commerce (2000), (158-167) |
....content based approaches which rely on content similarity in item to item comparisons is that it can capture pragmatic relationships among items based on how their intended use or based on similar tastes of the users. The CF based techniques, however, su#er from some well known limitations [16]. For the most part these limitations are related to the scalability and e#ciency of the kNN approach which requires real time computation in both the neighborhood formation and the recommendation phases. Web usage mining [17] techniques, that rely on o#ine pattern discovery from users Web ....
B. Sarwar, G. Karypis, J.A. Konstan, and J. Riedl. Analysis of recommendation algorithms for ecommerce. In ACM'00 Conference on Electronic Commerce, pages 158--167, 2000.
....the student s answer 57 of the time. As a baseline, note that guessing randomly has accuracy of just 20 . 2.2 Student diversity One of the challenges to collaborative ltering is that pro le matrix is often very sparse. For example, in the MovieLens CF system, 94 of the entries are empty [7]. In contrast, only 19 of our matrix is empty. It might be argued, therefore, that we can successfully predict student answers just because our task is much easier than in most collaborative ltering settings. To address the possibility, our second experiment measured the inherent diculty of our ....
Badrul Sarwar, George Karypis, Joseph Konstan and John Riedl. Analysis of recommendation algorithms for e-commerce. ACM Conference on Electronic Commerce, p.158-167, 2000.
....user for objects (e.g. movies or products) with those of similar users (nearest neighbors) in order to 2 produce recommendations on other objects not yet rated by the user. There are, however, some well known limitations to this type of approach. For instance, as noted in recent studies [OH99, SKKR00], it becomes hard to scale collaborative filtering techniques to a large number of items (e.g. pages or products) while maintaining reasonable prediction performance and accuracy. Part of this is due to the increasing sparsity in the ratings data as the number of items increase, as well as due ....
B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Analysis of recommendation algorithms for e-commerce. In Proceedings of the ACM Conference on ECommerce (EC00), Minneapolis, October 2000.
....neighborhood is then used to recommend items not already accessed or purchased by the active user. Thus, there are two primary phases in collaborative filtering: the neighborhood formation phase and the recommendation phase. The CF based techniques suffer from some well known limitations [ 13 ] For the most part these limitations are related to the scalability and efficiency of the kNN approach. Essentially, kNN requires that the neighborhood formation phase be performed as an online process, and for very large data sets this may lead to unacceptable latency for providing ....
B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Analysis of recommendation algorithms for ecommerce. In Proceedings of the ACM Conferenceon E-Commerce (EC00), Minneapolis, October 2000.
No context found.
Sarwar, B. M.,Kary is, G., Konstan, J. A., and Riedl, J. (2000). Analy sis of Recommendation Algorithms for E-Commerce. In Proceedings of the ACM EC'00 Conference. Minneapolis, MN. pp. 158-167
....compute the similarity weighted frequency of the various classes that the genes in N g i belong to, and select the m most frequent classes as the predicted classes. This approach was motivated by similar algorithms developed by the information retrieval community for building recommender agents [28, 27, 29]. We will refer to this approach as the direct kNN method. 7 4 Experimental Results As discussed in Section 2, because some of the 249 gene function classes defined in the MIPS database cover a very small number of genes, our experimental evaluation was focused only on the 50 largest classes ....
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In Proc. of ACM Conference on E-Commerce, pages 158--167, 2000.
....compute the similarity weighted frequency of the various classes that the genes in N g i belong to, and select the m most frequent classes as the predicted classes. This approach was motivated by similar algorithms developed by the information retrieval community for building recommender agents [28, 27, 29]. We will refer to this approach as the direct kNN method. 4 Experimental Results As discussed in Section 2, because some of the 249 gene function classes de ned in the MIPS database cover a very small number of genes, our experimental evaluation was focused only on the 50 largest classes shown ....
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In Proceedings of ACM E-Commerce, 2000. 15
No context found.
Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of Recommendation Algorithms for E-Commerce. In: ACM Conference on Electronic Commerce (2000), (158-167)
No context found.
B. Sarwar, G. Karypis, J. Konstan, and R. J. Analysis of recommendation algorithms for e-commerce. In Proc. ACM Electronic Commerce Conf., pages 158--167, 2000.
No context found.
B. Sarwar, G. Karypis, J. Konstan, and R. J. Analysis of recommendation algorithms for e-commerce. In Proceedings of ACM Electronic Commerce Conference, pages 158--167, 2000.
No context found.
B. Sarwar, G. Karypis, J. Konstan, and Riedl J. Analysis of recommendation algorithms for e-commerce. In Proceedings of the ACM Electronic Commerce Conference, pages 158--167, 2000.
No context found.
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In ACM Conference on Electronic Commerce, pages 158--167, 2000.
No context found.
Sarwar, B.M., G. Karypis and J.A. Konstan, et al. 2000. Analysis of recommendation algorithms for e-commerce. In proceedings of the ACM Conference on Electronic Commerce.
No context found.
Sarwar, B. M., Karypis, G., Konstan, J. A., and Riedl, J. Analysis of recommendation algorithms for e-commerce. In ACM Conference on Electronic Commerce (2000), pp. 158--167.
No context found.
Badrul M. Sarwar, George Karypis, Joseph A. Konstan, and John Riedl, `Analysis of recommendation algorithms for e-commerce', in Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00), Minneapolis, MN, USA, pp. 158--167, (October 2000).
No context found.
Sarwar, B., Karypis, G., Konstan, J. and Reid, J. (2000), "Analysis of Recommendation Algorithms for ECommerce ". In Proceedings of the ACM EC'00 Conference. Minneapolis, MN. pp. 158-167.
No context found.
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In ACM Conference on Electronic Commerce, pages 158--167, 2000.
No context found.
Sarwar, B., Karypis, G., Konstan, J., Riedl J.: Analysis of recommendation algorithms for e-commerce. Proc. of ACM Electronic Commerce (2000)
No context found.
Badrul M. Sarwar, George Karypis, Joseph A. Konstan, and John Riedl. Analysis of recommendation algorithms for e-commerce. In ACM Conference on Electronic Commerce, pages 158--167, 2000.
No context found.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. "Analysis of Recommendation Algorithms for E-Commerce". In Proceedings of the Second ACM Conference on Electronic Commerce, pages 158--167. ACM Press, 2000.
No context found.
Badrul M. Sarwar, George Karypis, Joseph A. Konstan, and John Riedl. Analysis of recommendation algorithms for e-commerce. In ACM Conference on Electronic Commerce, pages 158--167, 2000.
No context found.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, "Analysis of recommendation algorithms for e-commerce," in Proceedings ACM E-Commerce Conference, 2000, pp. 158--167.
No context found.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. "Analysis of Recommendation Algorithms for E-Commerce". In Proceedings of the Second ACM Conference on Electronic Commerce, pages 158--167. ACM Press, 2000.
No context found.
B.M. Sarwar, G. Karypis, J.A. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In Proc. of ACM Conference on Electronic Commerce (EC-00), pages 158--167, Minneapolis, Minnesota, USA, 2000. ACM Press.
No context found.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, "Analysis of recommendation algorithms for e-Commerce," in Proceedings of ACM e-Commerce 2000 Conference, 2000.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC