Recommendation systems with complex constraints: A course recommendation perspective

ACM Transactions on Information Systems

Volumn 29, Issue 4, 2011, Pages

  Parameswaran, Aditya ^a   Venetis, Petros ^a   Garcia Molina, Hector ^a  

^a Stanford University   (United States)

Author keywords

Complex constraints; Package recommendations; Recommender systems

Indexed keywords

ACADEMIC PROGRAM; COMPLEX CONSTRAINTS; COURSE REQUIREMENTS; HEURISTIC TECHNIQUES; OTHER APPLICATIONS; PACKAGE RECOMMENDATIONS; STANFORD UNIVERSITY;

COLLEGE BUILDINGS; CURRICULA; HEURISTIC METHODS; MODEL CHECKING; RECOMMENDER SYSTEMS;

STUDENTS;

EID: 81155153211     PISSN: 10468188     EISSN: 15582868     Source Type: Journal    
DOI: 10.1145/2037661.2037665     Document Type: Review

References (29)

1. ADOMAVICIUS, G. AND TUZHILIN, E. 2005. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowl. Data Engin. 17, 734-749. (Pubitemid 40860454)
2. BARAHONA, F. AND JENSEN, D. 1998. Plant location with minimum inventory. Math. Program. 83, 1, 101-111. (Pubitemid 128431381)
3. BOKHARI, S. H. 1988. Partitioning problems in parallel, pipeline, and distributed computing. IEEE Trans. Comput. 37, 1, 48-57.
4. BURKE, R. 2000. Knowledge-based recommender systems. In Encyclopedia of Library and Information Systems, Vol. 69.
5. BURKE, R. 2002. Hybrid recommender systems: Survey and experiments. User Model. User-Adapt. Interact. 12. CERIA, S. 1996. CPLEX 3.0.
6. EDMONDS, J. AND KARP, R. M. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248-264.
7. FELFERNIG, A. AND BURKE, R. D. 2008. Constraint-based recommender systems: Technologies and research issues. In Proceedings of the 10th International Conference on Electronic Commerce. 1-10.
8. FORD, L. R. AND FULKERSON, D. R. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
9. GEOFFRION, A. M. 1967. Integer programming by implicit enumeration and balas' method. SIAM Review, 178-190.
10. GOMORY, R. E. 1958. Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. 64, 5, 275-278.
11. KARIMZADEHGAN, M. AND ZHAI, C. 2009. Constrained multi-aspect expertise matching for committee review assignment. In Proceedings of the ACM International Conference on Information and Knowledge Management, ACM, New York, NY, 1697-1700.
12. LAPPAS, T., LIU, K., AND TERZI, E. 2009. Finding a team of experts in social networks. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, New York, NY. 467-476.
13. LAWLER, E. L. 1972. A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem. Manage. Sci. 18, 7, 401-405.
14. LEVNER, E. V. AND NEMIROVSKY, A. S. 1994. A network flow algorithm for just-in-time project scheduling. Euro. J. Rev. Res. 79, 2, 167-175.
15. MAHENDRARAJAH, A. AND FIALA, F. 1976. A comparison of three algorithms for linear zero-one programs. ACM Trans. Math. Softw. 2, 4, 331-334.
16. MAKHORIN, A. 2000. Gnu linear programming toolkit.
17. MCNEE, S. M., ALBERT, I., COSLEY, D., GOPALKRISHNAN, P., LAM, S. K., RASHID, A. M., KONSTAN, J. A., AND RIEDL, J. 2002. On the recommending of citations for research papers. In Proceedings of the Conference on Supported Cooperative Work, ACM, New York, NY, 116-125.
18. NEMHAUSER, G. AND SAVELSBERGH, M. 2004. Minto 3.1.
19. PARAMESWARAN, A., GARCIA-MOLINA, H., AND ULLMAN, J. D. 2010. Evaluating combining and generalizing recommendations with prerequisites. In Proceedings of the ACM International Conference on Information and Knowledge Management, ACM, New York, NY, 919-928.
20. PARAMESWARAN, A. G., KOUTRIKA, G., BERCOVITZ, B., AND GARCIA-MOLINA, H. 2010. Recsplorer: recommendation algorithms based on precedence mining. In Proceedings of the ACM SIGMOD International Conference on Management of Data, ACM, New York, NY, 87-98.
21. PAZZANI, M. J. AND BILLSUS, D. 2007. Content-based recommendation systems. In The Adaptive Web, 325-341. (Pubitemid 351189202)
22. RUSSELL, S. AND NORVIG, P. 2003. Artificial Intelligence: A Modern Approach 2nd Ed. Prentice-Hall, NJ.
23. SARWAR, B., KARYPIS, G., KONSTAN, J., AND REIDL, J. 2001. Item-based collaborative filtering recommendation algorithms. In Proceedings of the International World Wide Web Conference, ACM, New York, NY, 285-295.
24. TARJAN, R. E. 1983. Data Structures and Network Algorithms. SIAM.
25. WU, Y., CHOU, P., ZHANG, Q., JAIN, K., ZHU, W., AND KUNG, S.-Y. 2005. Network planning in wireless ad hoc networks: A cross-layer approach. IEEE Select. Areas Comm. J. 23, 1, 136-150.
26. XIAO, L., JOHANSSON, M., AND BOYD, S. 2004. Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. Comm. 52, 7, 1136-1144.
27. XIE, M., LAKSHMANAN, L. V., AND WOOD, P. T. 2010. Breaking out of the box of recommendations: from items to packages. In Proceedings of RecSys. 151-158.
28. ZANKER, M. 2008. A collaborative constraint-based meta-level recommender. In Proceedings of RecSys. 139-146.
29. ZANKER, M. AND JESSENITSCHNIG, M. 2009. Case-studies on exploiting explicit customer requirements in recommender systems. User Model. User-Adapt. Interact. 19, 133-166.