메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

논문 기본 정보

저자정보
(동국대학교) (동국대학교)
저널정보
한국경영과학회 경영과학 經營科學 第42卷 第4號
오류 신고하기

피인용 0

검색

    초록·키워드

    This study proposes a machine learning-based approximation framework to alleviate the substantial computational burden of two-stage network Data Envelopment Analysis (DEA) in large-scale applications. Although network DEA provides a more realistic representation of multi-stage production processes than conventional single-stage models, its computational cost grows rapidly as the number of decision-making units (DMUs) increases, limiting its applicability in big-data environments. To address this challenge, the proposed framework evaluates only a strategically selected subset of DMUs using an exact two-stage network DEA model and subsequently trains supervised learning models to approximate stage-wise and overall efficiency scores for the remaining units. Both regression and classification approaches are considered to capture efficiency levels and frontier membership. In addition, a frontier projection-based data augmentation scheme is introduced to mitigate data sparsity near the efficient frontier and improve model generalization. Extensive simulation experiments demonstrate that the proposed approach reduces computational time by up to 90% while preserving high predictive performance. In particular, tree-based models achieve coefficients of determination exceeding 0.95, and efficiency classification yields F1 scores above 0.98. These findings indicate that the proposed framework enables scalable and near-real-time efficiency evaluation in complex network production systems, thereby extending the practical applicability of network DEA to large-scale and data-intensive decision-making contexts.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-151-26-02-095550766