A K-Nearest Neighbor Based Approach for Determining the Weight Restrictions in Data Envelopment Analysis

dc.contributor.authorHayat, Elvan Aktürk
dc.contributor.authorAlpay, Olcay
dc.date.accessioned2025-03-23T18:55:13Z
dc.date.available2025-03-23T18:55:13Z
dc.date.issued2013
dc.departmentSinop Üniversitesi
dc.description.abstractData Envelopment Analysis (DEA), a method commonly used to measure the efficiency is becoming an increasingly popular management tool. On the contrary to classical efficiency approaches, the most important advantage of DEA is that researchers can determine the weight restrictions of input and output variables. Variable selection and determination of weight restrictions are important issues in DEA. This work investigates the use of K-nearest neighbor (KNN) algorithm in the definition of weight restrictions for DEA. With this purpose a new approach based on KNN is proposed. Applications are constructed with empirical and real data sets depending on the specific constraints. Performance scores were calculated for both KNN based restricted and unrestricted DEA models and the results are interpreted.
dc.description.abstractGenellikle etkinlik ölçümünde kullanilan Veri Zarflama Analizi (VZA), popüler bir yönetim araci olmaya baslamistir. Klasik etkinlik yaklasimlarinin tersine, VZA’nin en önemli avantaji, girdi ve çikti degiskenlerinin agirlik kisitlarini arastirmacilarin belirleyebilmesidir. Degisken seçimi ve agirlik kisitlarinin belirlenmesi VZA’da önemli konulardir. Bu çalisma VZA için agirlik kisitlarinin tanimlanmasinda K-en yakin komsuluk algoritmasinin kullanimini arastirmaktadir. Bu amaçla K-en yakin komsuluk temeline dayanan yeni bir yaklasim önerilmistir. Belirlenen kisitlara bagli olarak ampirik ve gerçek veri setleri ile uygulamalar yapilmistir. K-en yakin komsu temelinde kisitli model ve agilik kisitlamasiz VZA modeli için performans skorlari hesaplanmistir ve sonuçlar yorumlanmistir.
dc.identifier.endpage74
dc.identifier.issn1303-6319
dc.identifier.issn2791-7614
dc.identifier.issue3
dc.identifier.startpage64
dc.identifier.urihttps://hdl.handle.net/11486/2469
dc.identifier.volume10
dc.language.isoen
dc.publisherTÜIK
dc.relation.ispartofIstatistik Arastirma Dergisi
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_DergiPark_20250323
dc.subjectData envelopment analysis
dc.subjectEfficiency
dc.subjectK-nearest neighbor
dc.subjectWeight restrictions
dc.titleA K-Nearest Neighbor Based Approach for Determining the Weight Restrictions in Data Envelopment Analysis
dc.title.alternativeVeri Zarflama Analizinde Agirlik Kisitlarinin Belirlenmesinde K-En Yakin Komsuluga Dayali Bir Yaklasim
dc.typeArticle

Dosyalar