Shopping for products you don't know you need

Proceedings of the 4th ACM International Conference on Web Search and Data Mining, WSDM 2011

Volumn , Issue , 2011, Pages 705-714

  Jagabathula, Srikanth ^a   Mishra, Nina ^b   Gollapudi, Sreenivas ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Long range recommendations; Query communities

Indexed keywords

EARLY WARNING; LONG-RANGE RECOMMENDATIONS; QUERY COMMUNITIES; QUERY SUGGESTION; RANDOM MODEL; RECOMMENDATION ENGINE; SEARCH LOGS; SEARCH QUERIES; TECHNICAL CONTRIBUTION;

CLUSTERING ALGORITHMS; DATA MINING; INFORMATION RETRIEVAL; SEARCH ENGINES; SPORTING GOODS;

WORLD WIDE WEB;

EID: 79952381428     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1935826.1935921     Document Type: Conference Paper

References (31)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In STOC, pages 611-618, 2001.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB'94, Proceedings of 20th International Conference on Very Large Data Bases, pages 487-499, 1994.
3. R. Bell, Y. Koren, and C. Volinsky. Modeling relationships at multiple scales to improve accuracy of large recommender systems. In KDD, pages 95-104, 2007.
4. P. Boldi, F. Bonchi, C. Castillo, D. Donato, A. Gionis, and S. Vigna. The query-flow graph: model and applications. In CIKM, pages 609-618, 2008.
5. H. Cao, D. Jiang, J. Pei, Q. He, Z. Liao, E. Chen, and H. Li. Context-aware query suggestion by mining click-through and session data. In KDD, pages 875-883, 2008.
6. N. Craswell and M. Szummer. Random walks on the click graph. In SIGIR, pages 239-246, 2007.
7. A. Freund, D. Pelleg, and Y. Richter. Clustering from constraint graphs. In SIAM International Conference on Data Mining, 2008.
8. R. Frey, A. McNeil, and M. Nyfeler. Copulas and credit models. Risk, 14 (10): 111-114, 2001.
9. A. Fuxman, A. Kannan, A. Goldberg, R. Agrawal, P. Tsaparas, and J. Shafer. Improving classification accuracy using automatically extracted training data. In KDD, pages 1145-1154, 2009.
10. A. Fuxman, P. Tsaparas, K. Achan, and R. Agrawal. Using the wisdom of the crowds for keyword generation. In WWW, pages 61-70, 2008.
11. S. Gupta, M. Bilenko, and M. Richardson. Catching the drift: Learning broad matches from clickthrough data. In KDD, 2009.
12. T. Hofmann and J. Puzicha. Latent class models for collaborative filtering. In IJCAI, pages 688-693, 1999.
13. T. Joachims, L. Granka, B. Pan, H. Hembrooke, F. Radlinski, and G. Gay. Evaluating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Trans. Inf. Syst., 25 (2), 2007.
14. D.S. Johnson, C. H. Papadimitriou, and M. Yannakakis. On generating all maximal independent sets. Information Processing Letters, 27 (3): 119-123, 1988. (Pubitemid 18590751)
15. J. Kleinberg and M. Sandler. Using mixture models for collaborative filtering. In STOC, pages 569-578, 2004.
16. A. Korolova, K. Kenthapadi, N. Mishra, and A. Ntoulas. Releasing search queries and clicks privately. In WWW, pages 171-180, 2009.
17. G. Linden, B. Smith, and J. York. Amazon.com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 7 (1): 76-80, 2003.
18. F. McSherry and I. Mironov. Differentially private recommender systems: building privacy into the net. In KDD, pages 627-636, 2009.
19. Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In CIKM, pages 469-478, 2008.
20. N. Mishra, R. Schreiber, I. Stanton, and R. Tarjan. Finding strongly knit clusters in social networks. Internet Mathematics, 5 (1): 155-174, 2009.
21. P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: an open architecture for collaborative filtering of netnews. In CSCW, pages 175-186, 1994.
22. M. Richardson. Learning about the world through long-term query logs. TWEB, 2 (4): 1-27, 2008.
23. D. Ron, Y Singer, and N. Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 25 (2-3): 117-149, 1996. (Pubitemid 126724391)
24. D. Ron, Y. Singer, and N. Tishby. On the leamability and usage of acyclic probabilistic finite automata. J. Comput. Syst. Sci., 56 (2):133-152, 1998. (Pubitemid 128415328)
25. E. Sadikov, J. Madhavan, L. Wang, and A. Halevy. Clustering query refinements by user intent. In WWW, pages 841-850, 2010.
26. M. Sahami and T. Heilman. A web-based kernel function for measuring the similarity of short text snippets. In WWW, pages 377-386, 2006.
27. B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. In WWW, pages 285-295, 2001.
28. D. Stern, R. Herbrich, and T. Graepel. Matchbox: large scale online bayesian recommendations. In WWW, pages 111-120, 2009.
29. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all the maximal independent sets. SIAM J. Comput, 6 (3): 505-517, 1977.
30. J. Yi and F. Maghoul. Query clustering using click-through graph. In WWW, pages 1055-1056, 2009.
31. J. Zheng, X. Wu, J. Niu, and A. Bolivar. Substitutes or complements: another step forward in recommendations. In EC, pages 139-146, 2009.