{"entities":{"Q2570898":{"pageid":2581641,"ns":120,"title":"Item:Q2570898","lastrevid":72805092,"modified":"2026-04-14T07:56:57Z","type":"item","id":"Q2570898","labels":{"en":{"language":"en","value":"Prioritization method for frontier DMUs: a distance-based approach"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2220775"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2570898$07763185-F177-486C-8848-054A6B668D20","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"693869f4088e098be67148fe7f4c8c8c52c22844","datavalue":{"value":{"text":"Prioritization method for frontier DMUs: a distance-based approach","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2570898$DBE871D5-F68B-4054-BF52-9A4EB00655E4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"852b1746707d6652d7a9b4d0fb3229adc3522407","datavalue":{"value":"1077.90021","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2570898$77D694DF-E951-407A-9E5C-F39CDE885796","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"bc17e3031f162c1d7dc12b963167540c9c5e9750","datavalue":{"value":"10.1155/S1110757X04310028","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2570898$E68948F0-382B-4800-A8B1-6D676D9FD749","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"80ccaeaa458d73a2acc6a713de4d644d744f7c34","datavalue":{"value":{"entity-type":"item","numeric-id":300963,"id":"Q300963"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2570898$9B22A8E8-E4BC-45CD-91EB-DC9A492DE0D8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e84ae7af7908e64e1ef7e06c2e59310b56c9ba3d","datavalue":{"value":{"entity-type":"item","numeric-id":427684,"id":"Q427684"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2570898$E77DFD50-7B04-4183-9B71-2918BE4DFE96","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4e15c022998decad512ee045124bd3dacf7cab13","datavalue":{"value":{"entity-type":"item","numeric-id":345500,"id":"Q345500"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2570898$AF6879A2-67EF-4EDB-B983-A8D27755DB5C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"bb299feb2b87699ac8beef494c52fd2765eaf609","datavalue":{"value":{"entity-type":"item","numeric-id":118601,"id":"Q118601"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2570898$EBCC8BF8-B668-42C2-90CF-41D8CB70F5EF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a6f96483ea2fa24d32d2153605a61149b3369346","datavalue":{"value":{"time":"+2005-10-31T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2570898$60BBFB73-6CEC-41EC-9C0C-A1AE874B2732","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"bebe17711fc61c2384838ebb045dddd2536e04be","datavalue":{"value":"https://eudml.org/doc/51903","type":"string"},"datatype":"url"},"type":"statement","id":"Q2570898$0E9F2CC2-564D-462D-A53D-79E4849EDF6F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"5631f8ffcad112541342879c4b9d40bc034471d3","datavalue":{"value":"Summary: In nonparametric methods, if the number of observations is relatively small as compared to the sum of number of inputs and outputs, many units are evaluated as efficient. Several methods for prioritizing these efficient units are reported in literature. Andersen et al. and Mehrabian et al. proposed two methods for ranking efficient units, but both methods break down in some cases. This paper describes a new DEA ranking approach that uses \\(L_2\\)-norm.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2570898$540F771C-3D37-43CF-9B03-45038322D800","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"38e213338db24b8f359e8c3fca9e6e9ae655d7ca","datavalue":{"value":"90B30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2570898$B3B5F654-77AE-4C9E-BE45-5BF608401D76","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"306e8f65eab4f086795d9337f8e86ca94ed2db57","datavalue":{"value":"90B50","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2570898$88F97575-0DEB-467D-8D56-BDD820842017","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"637fc86e65d0926dbae2924beca7b4a8133075f6","datavalue":{"value":"2220775","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2570898$D162C4EB-9BAA-453F-A78B-FC1CCE5FC793","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2570898$48E7FE9E-EC93-4628-904A-9D1BBD00E8F6","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"28e85f53bb30e544172a4dc59ea459e0c15cdd9a","datavalue":{"value":{"entity-type":"item","numeric-id":3371191,"id":"Q3371191"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4bafe36a656ef3207ce68d0341a11aed711733c4","datavalue":{"value":{"amount":"+0.9063540697097778","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2570898$CEC8CBAA-A073-4EB5-8401-E609E94AE6F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"879f2980c6aa062cb8888176bf3154fc80cf7e12","datavalue":{"value":{"entity-type":"item","numeric-id":814704,"id":"Q814704"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a9ffd25dbe9856730cadfb7cb59cd0223441eb1a","datavalue":{"value":{"amount":"+0.8858484029769897","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2570898$E67B7A65-2EF9-4C89-8A26-03C7FFB633D8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e4dc2fdf84c0ad01592700b1c60850276dc4c5c8","datavalue":{"value":{"entity-type":"item","numeric-id":2490219,"id":"Q2490219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a9c0d7414819a5dfb6fab9a84789e85d53a61524","datavalue":{"value":{"amount":"+0.8359978795051575","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2570898$E7B24D0D-BBF7-4EDE-9C88-6879810FB1B0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5f82c7716301c877d46a453bcc688042ef5fbe89","datavalue":{"value":{"entity-type":"item","numeric-id":3538374,"id":"Q3538374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c0c5a78f49be90582f8085ea00d415dac11ba2a8","datavalue":{"value":{"amount":"+0.7730845808982849","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2570898$92890757-84FE-4EA7-9B78-D9887D1545F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"660ac00db5d41b546227b2e297f82ab8ffb728b1","datavalue":{"value":{"entity-type":"item","numeric-id":710401,"id":"Q710401"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"37c22a58c6816cce94e4f58dede4ae9abd107727","datavalue":{"value":{"amount":"+0.756131649017334","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2570898$F3E69BDC-1286-4B34-BF9A-59D786225195","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Prioritization method for frontier DMUs: a distance-based approach","badges":[]}}}}}