最小努力原则与拉链式信息平均成本之间的关系

IF 3.4 2区管理学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Informetrics Pub Date : 2023-12-06 DOI:10.1016/j.joi.2023.101478

Abdellatif Agouzal , Thierry Lafouge , Marc Bertin

{"title":"最小努力原则与拉链式信息平均成本之间的关系","authors":"Abdellatif Agouzal , Thierry Lafouge , Marc Bertin","doi":"10.1016/j.joi.2023.101478","DOIUrl":null,"url":null,"abstract":"<div><p>From an informetrics perspective, we discuss the relationship between the Least Effort Principle and information cost minimisation, and discuss the implications for Zipf's law. We propose a mathematical proof of a theorem demonstrating that if one minimises the average cost per unit of information, the Least Effort Principle (LEP) will be verified regardless of the effort function chosen. We then show that Zipf's law can be demonstrated on the basis of the two models studied, namely Average Cost per Unit of Information and the Least Effort Principle (LEP).</p></div>","PeriodicalId":48662,"journal":{"name":"Journal of Informetrics","volume":null,"pages":null},"PeriodicalIF":3.4000,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1751157723001037/pdfft?md5=723b631669de9ffe4fa6f31cbd14e0c0&pid=1-s2.0-S1751157723001037-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Relationship between the principle of least effort and the average cost of information in a zipfian context\",\"authors\":\"Abdellatif Agouzal , Thierry Lafouge , Marc Bertin\",\"doi\":\"10.1016/j.joi.2023.101478\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>From an informetrics perspective, we discuss the relationship between the Least Effort Principle and information cost minimisation, and discuss the implications for Zipf's law. We propose a mathematical proof of a theorem demonstrating that if one minimises the average cost per unit of information, the Least Effort Principle (LEP) will be verified regardless of the effort function chosen. We then show that Zipf's law can be demonstrated on the basis of the two models studied, namely Average Cost per Unit of Information and the Least Effort Principle (LEP).</p></div>\",\"PeriodicalId\":48662,\"journal\":{\"name\":\"Journal of Informetrics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.4000,\"publicationDate\":\"2023-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S1751157723001037/pdfft?md5=723b631669de9ffe4fa6f31cbd14e0c0&pid=1-s2.0-S1751157723001037-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Informetrics\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1751157723001037\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Informetrics","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1751157723001037","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

从信息计量学的角度，我们讨论了最小努力原则与信息成本最小化之间的关系，并讨论了齐普夫定律的含义。我们提出了一个定理的数学证明，证明如果最小化单位信息的平均成本，那么无论选择何种努力函数，最小努力原则（LEP）都将得到验证。然后，我们证明，齐普夫定律可以在所研究的两个模型（即单位信息平均成本和最小努力原则 (LEP)）的基础上得到证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Relationship between the principle of least effort and the average cost of information in a zipfian context

From an informetrics perspective, we discuss the relationship between the Least Effort Principle and information cost minimisation, and discuss the implications for Zipf's law. We propose a mathematical proof of a theorem demonstrating that if one minimises the average cost per unit of information, the Least Effort Principle (LEP) will be verified regardless of the effort function chosen. We then show that Zipf's law can be demonstrated on the basis of the two models studied, namely Average Cost per Unit of Information and the Least Effort Principle (LEP).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Informetrics Social Sciences-Library and Information Sciences

CiteScore

6.40

自引率

16.20%

发文量

期刊介绍： Journal of Informetrics (JOI) publishes rigorous high-quality research on quantitative aspects of information science. The main focus of the journal is on topics in bibliometrics, scientometrics, webometrics, patentometrics, altmetrics and research evaluation. Contributions studying informetric problems using methods from other quantitative fields, such as mathematics, statistics, computer science, economics and econometrics, and network science, are especially encouraged. JOI publishes both theoretical and empirical work. In general, case studies, for instance a bibliometric analysis focusing on a specific research field or a specific country, are not considered suitable for publication in JOI, unless they contain innovative methodological elements.