메뉴 건너뛰기




Volumn 33, Issue 11, 2006, Pages 3067-3069

Introduction to operations research and data mining

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33644679730     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.01.019     Document Type: Editorial
Times cited : (12)

References (12)
  • 1
    • 0000963583 scopus 로고
    • Linear and nonlinear separation of patterns by linear programming
    • O.L. Mangasarian Linear and nonlinear separation of patterns by linear programming Operations Research 13 1965 444 452
    • (1965) Operations Research , vol.13 , pp. 444-452
    • Mangasarian, O.L.1
  • 4
    • 0242624459 scopus 로고    scopus 로고
    • On the use of optimization for data mining: Theoretical interactions and eCRM opportunities
    • B. Padmanabhan, and A. Tuzhilin On the use of optimization for data mining Theoretical interactions and eCRM opportunities Management Science 49 10 2003 1327 1343
    • (2003) Management Science , vol.49 , Issue.10 , pp. 1327-1343
    • Padmanabhan, B.1    Tuzhilin, A.2
  • 6
    • 33644666033 scopus 로고    scopus 로고
    • Optimization-based feature selection with adaptive instance sampling
    • in this issue
    • Yang J, Ólafsson S. Optimization-based feature selection with adaptive instance sampling. Computers and Operations Research 2005; in this issue.
    • (2005) Computers and Operations Research
    • Yang, J.1    Ólafsson, S.2
  • 7
    • 33644700315 scopus 로고    scopus 로고
    • Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
    • in this issue
    • Janssens D, Brijs T, Vanhoof K, Wets G. Evaluating the performance of cost-based discretization versus entropy- and error-based discretization. Computers and Operations Research 2005; in this issue.
    • (2005) Computers and Operations Research
    • Janssens, D.1    Brijs, T.2    Vanhoof, K.3    Wets, G.4
  • 8
    • 33644701777 scopus 로고    scopus 로고
    • A data mining constraint satisfaction optimization problem for cost effective classification
    • in this issue
    • Pendharkar PC. A data mining constraint satisfaction optimization problem for cost effective classification. Computers and Operations Research 2005; in this issue.
    • (2005) Computers and Operations Research
    • Pendharkar, P.C.1
  • 9
    • 33644693278 scopus 로고    scopus 로고
    • Effects of the neural network s-sigmoid function on KDD in the presence of imprecise data
    • in this issue
    • Kros JF, Brown ML, Lin M. Effects of the neural network s-sigmoid function on KDD in the presence of imprecise data. Computers and Operations Research 2005; in this issue.
    • (2005) Computers and Operations Research
    • Kros, J.F.1    Brown, M.L.2    Lin, M.3
  • 10
    • 33644701996 scopus 로고    scopus 로고
    • Data mining in an engineering design environment: Or applications from graph matching
    • in this issue
    • Romanowski CJ, Nagi R, Sudit M. Data mining in an engineering design environment: OR applications from graph matching. Computers and Operations Research 2005; in this issue.
    • (2005) Computers and Operations Research
    • Romanowski, C.J.1    Nagi, R.2    Sudit, M.3
  • 11
    • 33644693051 scopus 로고    scopus 로고
    • Application of frequent itemset mining to identify a small subset of items that can satisfy a large percentage of orders in a warehouse
    • in this issue
    • Wu C. Application of frequent itemset mining to identify a small subset of items that can satisfy a large percentage of orders in a warehouse. Computers and Operations Research 2005; in this issue.
    • (2005) Computers and Operations Research
    • Wu, C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.