IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v187y2008i3p1429-1448.html
   My bibliography  Save this article

Operations research and data mining

Author

Listed:
  • Olafsson, Sigurdur
  • Li, Xiaonan
  • Wu, Shuning

Abstract

No abstract is available for this item.

Suggested Citation

  • Olafsson, Sigurdur & Li, Xiaonan & Wu, Shuning, 2008. "Operations research and data mining," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1429-1448, June.
    • Handle: RePEc:eee:ejores:v:187:y:2008:i:3:p:1429-1448
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00854-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Anito Joseph & Noel Bryson, 1997. "W-efficient partitions and the solution of the sequential clustering problem," Annals of Operations Research, Springer, vol. 74(0), pages 305-319, November.
    2. Lauritzen, Steffen L., 1995. "The EM algorithm for graphical association models with missing data," Computational Statistics & Data Analysis, Elsevier, vol. 19(2), pages 191-201, February.
    3. W. Nick Street, 2005. "Oblique Multicategory Decision Trees Using Nonlinear Programming," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 25-31, February.
    4. P. S. Bradley & Usama M. Fayyad & O. L. Mangasarian, 1999. "Mathematical Programming for Data Mining: Formulations and Challenges," INFORMS Journal on Computing, INFORMS, vol. 11(3), pages 217-238, August.
    5. Giovanni Felici & Klaus Truemper, 2002. "A MINSAT Approach for Learning in Logic Domains," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 20-36, February.
    6. W-K Ching & M K Ng & K-K Wong & E Altman, 2004. "Customer lifetime value: stochastic optimization approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(8), pages 860-868, August.
    7. P. S. Bradley & O. L. Mangasarian & W. N. Street, 1998. "Feature Selection via Mathematical Programming," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 209-217, May.
    8. Paul Resnick & Neophytos Iacovou & Mitesh Suchak & Peter Bergstrom & John Riedl, 1994. "GroupLens: An Open Architecture for Collaborative Filtering of Netnews," Working Paper Series 165, MIT Center for Coordination Science.
    9. B. P. S. Murthi & Sumit Sarkar, 2003. "The Role of the Management Sciences in Research on Personalization," Management Science, INFORMS, vol. 49(10), pages 1344-1362, October.
    10. O. L. Mangasarian, 1965. "Linear and Nonlinear Separation of Patterns by Linear Programming," Operations Research, INFORMS, vol. 13(3), pages 444-452, June.
    11. Zhiwei Fu & Bruce L. Golden & Shreevardhan Lele & S. Raghavan & Edward A. Wasil, 2003. "A Genetic Algorithm-Based Approach for Building Accurate Decision Trees," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 3-22, February.
    12. Balaji Padmanabhan & Alexander Tuzhilin, 2003. "On the Use of Optimization for Data Mining: Theoretical Interactions and eCRM Opportunities," Management Science, INFORMS, vol. 49(10), pages 1327-1343, October.
    13. David C. Schmittlein & Donald G. Morrison & Richard Colombo, 1987. "Counting Your Customers: Who-Are They and What Will They Do Next?," Management Science, INFORMS, vol. 33(1), pages 1-24, January.
    14. Leyuan Shi & Sigurdur Ólafsson, 2000. "Nested Partitions Method for Global Optimization," Operations Research, INFORMS, vol. 48(3), pages 390-407, June.
    15. Zhiwei Fu & Bruce Golden & Shreevardhan Lele & S. Raghavan & Edward Wasil, 2003. "Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees," Operations Research, INFORMS, vol. 51(6), pages 894-907, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Balaji Padmanabhan & Alexander Tuzhilin, 2003. "On the Use of Optimization for Data Mining: Theoretical Interactions and eCRM Opportunities," Management Science, INFORMS, vol. 49(10), pages 1327-1343, October.
    2. Brandner, Hubertus & Lessmann, Stefan & Voß, Stefan, 2013. "A memetic approach to construct transductive discrete support vector machines," European Journal of Operational Research, Elsevier, vol. 230(3), pages 581-595.
    3. Roland T. Rust & Tuck Siong Chung, 2006. "Marketing Models of Service and Relationships," Marketing Science, INFORMS, vol. 25(6), pages 560-580, 11-12.
    4. Heydari Majeed & Yousefli Amir, 2017. "A new optimization model for market basket analysis with allocation considerations: A genetic algorithm solution approach," Management & Marketing, Sciendo, vol. 12(1), pages 1-11, March.
    5. W. Nick Street, 2005. "Oblique Multicategory Decision Trees Using Nonlinear Programming," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 25-31, February.
    6. Meisel, Stephan & Mattfeld, Dirk, 2010. "Synergies of Operations Research and Data Mining," European Journal of Operational Research, Elsevier, vol. 206(1), pages 1-10, October.
    7. Sigurdur Ólafsson & Jaekyung Yang, 2005. "Intelligent Partitioning for Feature Selection," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 339-355, August.
    8. Arthur M. Geoffrion & Ramayya Krishnan, 2003. "E-Business and Management Science: Mutual Impacts (Part 2 of 2)," Management Science, INFORMS, vol. 49(11), pages 1445-1456, November.
    9. Arthur M. Geoffrion & Ramayya Krishnan, 2003. "E-Business and Management Science: Mutual Impacts (Part 1 of 2)," Management Science, INFORMS, vol. 49(10), pages 1275-1286, October.
    10. Saglam, Burcu & Salman, F. Sibel & Sayin, Serpil & Turkay, Metin, 2006. "A mixed-integer programming approach to the clustering problem with an application in customer segmentation," European Journal of Operational Research, Elsevier, vol. 173(3), pages 866-879, September.
    11. B Baesens & C Mues & D Martens & J Vanthienen, 2009. "50 years of data mining and OR: upcoming trends and challenges," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 16-23, May.
    12. J Kim & J Yang & S Ólafsson, 2009. "An optimization approach to partitional data clustering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(8), pages 1069-1084, August.
    13. Doukidis, Georgios I. & Pramatari, Katerina & Lekakos, Georgios, 2008. "OR and the management of electronic services," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1296-1309, June.
    14. Emilio Carrizosa & Cristina Molero-Río & Dolores Romero Morales, 2021. "Mathematical optimization in classification and regression trees," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 5-33, April.
    15. R. Chandrasekaran & Young U. Ryu & Varghese S. Jacob & Sungchul Hong, 2005. "Isotonic Separation," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 462-474, November.
    16. Boschetti, Marco A. & Golfarelli, Matteo & Graziani, Simone, 2020. "An exact method for shrinking pivot tables," Omega, Elsevier, vol. 93(C).
    17. Xue Bai & Rema Padman & Joseph Ramsey & Peter Spirtes, 2008. "Tabu Search-Enhanced Graphical Models for Classification in High Dimensions," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 423-437, August.
    18. Fader, Peter S. & Hardie, Bruce G.S., 2009. "Probability Models for Customer-Base Analysis," Journal of Interactive Marketing, Elsevier, vol. 23(1), pages 61-69.
    19. Wedad Elmaghraby & P{i}nar Keskinocak, 2003. "Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions," Management Science, INFORMS, vol. 49(10), pages 1287-1309, October.
    20. P. S. Bradley & Usama M. Fayyad & O. L. Mangasarian, 1999. "Mathematical Programming for Data Mining: Formulations and Challenges," INFORMS Journal on Computing, INFORMS, vol. 11(3), pages 217-238, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:187:y:2008:i:3:p:1429-1448. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.