{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:18:28Z","timestamp":1777645108478,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2014,10]]},"abstract":"<jats:p>The Heuristic Ratio Estimation (HRE) approach proposes a new way of using the pairwise comparisons matrix. It allows the assumption that the weights of some alternatives (herein referred to as concepts) are known and fixed, hence the weight vector needs to be estimated only for the other unknown values. The main purpose of this paper is to extend the previously proposed iterative HRE algorithm and present all the heuristics that create a generalized approach. Theoretical considerations are accompanied by a few numerical examples demonstrating how the selected heuristics can be used in practice.<\/jats:p>","DOI":"10.3233\/fi-2014-1081","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T01:10:53Z","timestamp":1575335453000},"page":"367-386","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":15,"title":["Heuristic Rating Estimation Approach to The Pairwise Comparisons Method"],"prefix":"10.1177","volume":"133","author":[{"given":"Konrad","family":"Ku\u0142akowski","sequence":"first","affiliation":[{"name":"Department of Applied Computer Science, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Cracow, Poland. konrad.kulakowski@agh.edu.pl"}]}],"member":"179","published-online":{"date-parts":[[2014,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2014-1081","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2014-1081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:31:22Z","timestamp":1777444282000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2014-1081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["10.3233\/FI-2014-1081"],"URL":"https:\/\/doi.org\/10.3233\/fi-2014-1081","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}