发布求助
文献互助 智能选刊 最新文献

Entropy最新文献

筛选
英文 中文
Greedy Algorithm for Deriving Decision Rules from Decision Tree Ensembles.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-04 DOI: 10.3390/e27010035
Evans Teiko Tetteh, Beata Zielosko
{"title":"Greedy Algorithm for Deriving Decision Rules from Decision Tree Ensembles.","authors":"Evans Teiko Tetteh, Beata Zielosko","doi":"10.3390/e27010035","DOIUrl":"10.3390/e27010035","url":null,"abstract":"<p><p>This study introduces a greedy algorithm for deriving decision rules from decision tree ensembles, targeting enhanced interpretability and generalization in distributed data environments. Decision rules, known for their transparency, provide an accessible method for knowledge extraction from data, facilitating decision-making processes across diverse fields. Traditional decision tree algorithms, such as CART and ID3, are employed to induce decision trees from bootstrapped datasets, which represent distributed data sources. Subsequently, a greedy algorithm is applied to derive decision rules that are true across multiple decision trees. Experiments are performed, taking into account knowledge representation and discovery perspectives. They show that, as the value of α, 0≤α<1, increases, shorter rules are obtained, and also it is possible to improve the classification accuracy of rule-based models.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11764346/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032731","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Komlós-Révész SLLN for Ψ-Mixing Sequences.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-04 DOI: 10.3390/e27010036
Zbigniew S Szewczak
{"title":"On the Komlós-Révész SLLN for Ψ-Mixing Sequences.","authors":"Zbigniew S Szewczak","doi":"10.3390/e27010036","DOIUrl":"10.3390/e27010036","url":null,"abstract":"<p><p>The Komlós-Révész strong law of large numbers (SLLN) is proved for ψ-mixing sequences without a rate assumption.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11765373/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Erdős-Révész Type Law for the Length of the Longest Match of Two Coin-Tossing Sequences.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-03 DOI: 10.3390/e27010034
Karl Grill
{"title":"An Erdős-Révész Type Law for the Length of the Longest Match of Two Coin-Tossing Sequences.","authors":"Karl Grill","doi":"10.3390/e27010034","DOIUrl":"10.3390/e27010034","url":null,"abstract":"<p><p>Consider a coin-tossing sequence, i.e., a sequence of independent variables, taking values 0 and 1 with probability 1/2. The famous Erdős-Rényi law of large numbers implies that the longest run of ones in the first <i>n</i> observations has a length Rn that behaves like log(n), as <i>n</i> tends to infinity (throughout this article, log denotes logarithm with base 2). Erdős and Révész refined this result by providing a description of the Lévy upper and lower classes of the process Rn. In another direction, Arratia and Waterman extended the Erdős-Rényi result to the longest matching subsequence (with shifts) of two coin-tossing sequences, finding that it behaves asymptotically like 2log(n). The present paper provides some Erdős-Révész type results in this situation, obtaining a complete description of the upper classes and a partial result on the lower ones.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11765012/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Convergence Rate for the Longest at Most T-Contaminated Runs of Heads.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-03 DOI: 10.3390/e27010033
István Fazekas, Borbála Fazekas, László Fórián
{"title":"On the Convergence Rate for the Longest at Most <i>T</i>-Contaminated Runs of Heads.","authors":"István Fazekas, Borbála Fazekas, László Fórián","doi":"10.3390/e27010033","DOIUrl":"10.3390/e27010033","url":null,"abstract":"<p><p>In this paper, we study the usual coin tossing experiment. We call a run at most <i>T</i>-contaminated, if it contains at most <i>T</i> tails. We approximate the distribution of the length of the longest at most <i>T</i>-contaminated runs. We offer a more precise approximation than the previous one.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11765223/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards Secure Internet of Things: A Coercion-Resistant Attribute-Based Encryption Scheme with Policy Revocation.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-02 DOI: 10.3390/e27010032
Yuan Zhai, Tao Wang, Yanwei Zhou, Feng Zhu, Bo Yang
{"title":"Towards Secure Internet of Things: A Coercion-Resistant Attribute-Based Encryption Scheme with Policy Revocation.","authors":"Yuan Zhai, Tao Wang, Yanwei Zhou, Feng Zhu, Bo Yang","doi":"10.3390/e27010032","DOIUrl":"10.3390/e27010032","url":null,"abstract":"<p><p>With the development and application of the Internet of Things (IoT), the volume of data generated daily by IoT devices is growing exponentially. These IoT devices, such as smart wearable devices, produce data containing sensitive personal information. However, since IoT devices and users often operate in untrusted external environments, their encrypted data remain vulnerable to potential privacy leaks and security threats from malicious coercion. Additionally, access control and management of these data remain critical issues. To address these challenges, this paper proposes a novel coercion-resistant ciphertext-policy attribute-based encryption scheme. The scheme leverages chameleon hashing to enhance deniable encryption, achieving coercion resistance, thereby enabling IoT data to resist coercion attacks. Moreover, the scheme employs attribute-based encryption to secure IoT data, enabling fine-grained access control and dynamic user access management, providing a secure and flexible solution for vast IoT data. We construct the scheme on a composite order bilinear group and provide formal proofs for its coercion resistance, correctness, and security. Finally, through experimental comparisons, we demonstrate the efficiency and feasibility of the proposed scheme.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11765391/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Defining Expressions for Entropy and Cross-Entropy: The Entropic Transreals and Their Fracterm Calculus.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-02 DOI: 10.3390/e27010031
Jan A Bergstra, John V Tucker
{"title":"On Defining Expressions for Entropy and Cross-Entropy: The Entropic Transreals and Their Fracterm Calculus.","authors":"Jan A Bergstra, John V Tucker","doi":"10.3390/e27010031","DOIUrl":"10.3390/e27010031","url":null,"abstract":"<p><p>Classic formulae for entropy and cross-entropy contain operations x0 and log2x that are not defined on all inputs. This can lead to calculations with problematic subexpressions such as 0log20 and uncertainties in large scale calculations; partiality also introduces complications in logical analysis. Instead of adding conventions or splitting formulae into cases, we create a new algebra of real numbers with two symbols ±∞ for signed infinite values and a symbol named ⟂ for the undefined. In this resulting arithmetic, entropy, cross-entropy, Kullback-Leibler divergence, and Shannon divergence can be expressed without concerning any further conventions. The algebra may form a basis for probability theory more generally.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11765486/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Non-Orthogonality of QAM and Sunflower-like Modulated Coherent-State Signals.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-01 DOI: 10.3390/e27010030
Kentaro Kato
{"title":"Non-Orthogonality of QAM and Sunflower-like Modulated Coherent-State Signals.","authors":"Kentaro Kato","doi":"10.3390/e27010030","DOIUrl":"10.3390/e27010030","url":null,"abstract":"<p><p>The limitations of cloning and discriminating quantum states are related to the non-orthogonality of the states. Hence, understanding the collective features of quantum states is essential for the future development of quantum communications technology. This paper investigates the non-orthogonality of different coherent-state signal constellations used in quantum communications, namely phase-shift keying (PSK), quadrature-amplitude modulation (QAM), and a newly defined signal named the sunflower-like (SUN) coherent-state signal. The non-orthogonality index (NOI) and the average probability of correct detection (detection probability) are numerically computed. Results show that PSK NOI increases faster than QAM and SUN as the number of signals increases for a given number of signal photons. QAM and SUN exhibit similar NOI and detection probability, behaving similarly to randomly generated signals for a larger number of signals. Approximation formulas are provided for the detection probability as a function of NOI for each signal type. While similar to QAM, SUN signal offers potential advantages for applications requiring uniform signal-space distribution. The findings provide valuable insights for designing useful quantum signal constellations.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11764497/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unique Information Through the Lens of Channel Ordering: An Introduction and Review.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-01 DOI: 10.3390/e27010029
Pradeep Kr Banerjee
{"title":"Unique Information Through the Lens of Channel Ordering: An Introduction and Review.","authors":"Pradeep Kr Banerjee","doi":"10.3390/e27010029","DOIUrl":"10.3390/e27010029","url":null,"abstract":"<p><p>The problem of constructing information measures with a well-defined interpretation is of fundamental significance in information theory. A good definition of an information measure entails certain desirable properties while also providing answers to operational problems. In this work, we investigate the properties of the unique information, an information measure that quantifies a deviation from the Blackwell order. Beyond providing an accessible introduction to the topic from a channel ordering perspective, we present a novel resource-theoretic characterization of unique information in a cryptographic task related to secret key agreement. Our operational view of unique information entails rich physical intuition that leads to new insights into secret key agreement in the context of non-negative decompositions of the mutual information into redundant and synergistic contributions. Through this lens, we illuminate new directions for research in partial information decompositions and information-theoretic cryptography.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11764511/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Few-Shot Graph Anomaly Detection via Dual-Level Knowledge Distillation.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-01 DOI: 10.3390/e27010028
Xuan Li, Dejie Cheng, Luheng Zhang, Chengfang Zhang, Ziliang Feng
{"title":"Few-Shot Graph Anomaly Detection via Dual-Level Knowledge Distillation.","authors":"Xuan Li, Dejie Cheng, Luheng Zhang, Chengfang Zhang, Ziliang Feng","doi":"10.3390/e27010028","DOIUrl":"10.3390/e27010028","url":null,"abstract":"<p><p>Graph anomaly detection is crucial in many high-impact applications across diverse fields. In anomaly detection tasks, collecting plenty of annotated data tends to be costly and laborious. As a result, few-shot learning has been explored to address the issue by requiring only a few labeled samples to achieve good performance. However, conventional few-shot models may not fully exploit the information within auxiliary sets, leading to suboptimal performance. To tackle these limitations, we propose a dual-level knowledge distillation-based approach for graph anomaly detection, DualKD, which leverages two distinct distillation losses to improve generalization capabilities. In our approach, we initially train a teacher model to generate prediction distributions as soft labels, capturing the entropy of uncertainty in the data. These soft labels are then employed to construct the corresponding loss for training a student model, which can capture more detailed node features. In addition, we introduce two representation distillation losses-short and long representation distillation-to effectively transfer knowledge from the auxiliary set to the target set. Comprehensive experiments conducted on four datasets verify that DualKD remarkably outperforms the advanced baselines, highlighting its effectiveness in enhancing identification performance.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11765473/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Suppressing Polarization Mode Dispersion with the Quantum Zeno Effect.
IF 2.1 3区 物理与天体物理
Entropy Pub Date : 2025-01-01 DOI: 10.3390/e27010027
Ian Nodurft, Alejandro Rodriguez Perez, Naveed Naimipour, Harry C Shaw
{"title":"Suppressing Polarization Mode Dispersion with the Quantum Zeno Effect.","authors":"Ian Nodurft, Alejandro Rodriguez Perez, Naveed Naimipour, Harry C Shaw","doi":"10.3390/e27010027","DOIUrl":"10.3390/e27010027","url":null,"abstract":"<p><p>Polarization mode dispersion can introduce quantum decoherence in polarization encoded information, limiting the range of quantum communications protocols. Therefore, strategies to nullify the effect would reduce quantum decoherence and potentially increase the operational range of such technology. We constructed a quantum model of polarization mode dispersion alongside a two-level absorbing material. The two-level material serves to destructively measure one of two orthogonal polarization modes, thus projecting the polarization onto the other state. The theoretical results are supported by a numerical simulation in Mathematica Documentation where we compare the evolution of the polarization state with and without the absorbing material. We find that this strategy is effective in suppressing the effects of polarization mode dispersion, and that this method produces a global phase shift related to the waveguide's birefringent properties.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11764368/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143032154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信