Mining Value-Based Item Packages – An Integer Programming Approach - Data Mining: Theory, Methodology, Techniques, and Applications - page 88

standard commercial software products such as CPLEX to solve the model proposed
in this paper. Furthermore, future research can be focused on developing specially
designed branch and cut algorithms [13] [14] [15], branch and price algorithms and/or
efficient heuristics and probabilistic methods to solve our ILP formulations of these
models. When N and T are large, the future research can explore the possibility of
solving these models restricted to some random samples drawn from the database and
developing methods of estimating the required information.
References
1. Kleinberg, J., Papadimitriou, C., Raghavan, P.: A Microeconomic View of Data Mining.
Data Mining and Knowledge Discovery. Vol. 2 (1998) 311-324
2. Brijs, T., Swinnen, G., Vanhoof, K, Wets, G.: Building an Association Rules Framework
to Improve Product Assortment Decisions. Data Mining and Knowledge Discovery. Vol. 8
(2004) 7-23
3. Gopalan, R.P., Sucahyo, Y.G.: High Performance Frequent Patterns Extraction using
Compressed FP-Tree. Proceedings of SIAM International Workshop on High Performance
and Distributed Mining (HPDM04), Orlando, USA (2004)
4. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation.
Proceedings of ACM SIGMOD, Dallas, TX (2000)
5. Liu, J., Pan, Y., Wang, K., Han, J.: Mining Frequent Item Sets by Opportunistic Projection.
Proceedings of ACM SIGKDD, Edmonton, Alberta, Canada (2002)
6. Ali, K., Manganaris, S., Srikant, R.: Partial Classification using Association Rules.
Proceedings of KDD-97, Newport Beach, California (1997)
7. Viveros, M.S., Nearhos, J.P., Rothman, M.J.: Applying Data Mining Techniques to a
Health Insurance Information System. Proceedings of VLDB-96, Bombay, India, (1996)
8. Demiriz, A., Bennett, K.P.: Optimization Approaches to Semi-Supervised Learning. In
Complementarity: Applications, Algorithms and Extensions. Kluwer Academic Publishers,
Boston (2001) 121-141
9. Bradley, P., Gehrke, J., Ramakrishnan, R., Srikant, R.: Scaling Mining Algorithms to
Large Databases. Communications of the ACM. Vol. 45 (2002) 38-43
10. Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R.: Advances in Knowledge
Discovery and Data Mining. MIT Press, Cambridge, MA (1996)
11. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann
Publishers, San Francisco (2001)
12. Hand, D., Mannila, H., Smyth, P.: Principles of Data Mining. MIT Press, Cambridge, MA
(2001)
13. Achuthan, N.R., Caccetta, L., Hill, S.P.: A New Subtour Elimination Constraint for the
Vehicle Routing Problem. E.J.O.R. Vol. 91 (1996) 573-586
14. Achuthan, N.R., Caccetta, L., Hill, S.P.: Capacitated Vehicle Routing Problem: Some New
Cutting Planes. Asia-Pacific Journal of Operational Research. Vol. 15 (1998) 109-123
15. Achuthan, N.R., Caccetta, L., Hill, S.P.: An Improved Branch and Cut Algorithm for the
Capacitated Vehicle Routing Problem. Transportation Science. Vol. 37 (2003) 153-169
16. Brijs T., Swinnen G., Vanhoof K., and Wets G. The Use of Association Rules for Product
Assortment Decisions: A Case Study, in: Proceedings of the Fifth International Conference
on Knowledge Discovery and Data Mining, San Diego (USA), August 15-18, (1999) 254-
260