Communication theoretic prediction on networked data

Chuang, Tzu-Yu; Lu, Jinsheng; Chen, Kwang-Cheng

doi:10.1109/icc.2015.7248486

“…Hence, σ 2 1k δ * 1k ≤ ε, which implies |δ * 1k −δ 1k | ≤ max σij =0 {σ −2 ij }ε, for k = 0, 2. Moreover, forδ 20 where the second inequality is due to δ * 20 ≤ 1, and the third inequality is from |α 0 | ≤ ε and σ 2 10 δ * 10 ≤ ε. Finally, the verification of (38) for the restδ ij 's is the same as the previous cases.…”

Section: Appendix a Proof Of Lemmamentioning

confidence: 99%

“…However, the Viterbi algorithm [10] allows us to reduce the complexity significantly. Note that (20) is equivalent to finding the path such that the inverse sum of σ 2,(k) ikik+1 is minimized.…”

Section: Multi-hop Layered Networkmentioning

confidence: 99%

Euclidean information theory of networks

Huang

¹

,

Suh

²

,

Zheng

³

2013

2013 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

In this paper, we extend the information theoretic framework that was developed in earlier works to multi-hop network settings. For a given network, we construct a novel deterministic model that quantifies the ability of the network in transmitting private and common messages across users. Based on this model, we formulate a linear optimization problem that explores the throughput of a multi-layer network, thereby offering the optimal strategy as to what kind of common messages should be generated in the network to maximize the throughput. With this deterministic model, we also investigate the role of feedback for multi-layer networks, from which we identify a variety of scenarios in which feedback can improve transmission efficiency. Our results provide fundamental guidelines as to how to coordinate cooperation between users to enable efficient information exchanges across them.

show abstract

“…However, the Viterbi algorithm [10] allows us to reduce the complexity significantly. Note that (20) is equivalent to finding the path such that the inverse sum of σ 2,(k) ikik+1 is minimized. Taking 1/σ 2,(k) ikik+1 as a cost, we can now apply the the Viterbi algorithm to find the path with minimal total cost, and hence the complexity is reduced to O(L).…”

Section: Remark 2 (Viterbi Algorithm)mentioning

confidence: 99%

“…It has been shown in [3] that the local geometric approach plays a crucial role in finding an investment strategy that maximizes an incremental growth rate in repeated investments [15]. The local geometric approach has also been exploited to a wide range of applications in machine learning: a learning problem in graphical models [16], an inference problem in hidden Markov models [17], [18], and big networked data analytics via communication and information theory [19], [20].…”

Section: Applications Of the Local Geometric Approachmentioning

confidence: 99%

Euclidean Information Theory of Networks

Huang

¹

,

Suh

²

,

Zheng

³

2015

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

In this paper, we extend the information theoretic framework that was developed in earlier works to multi-hop network settings. For a given network, we construct a novel deterministic model that quantifies the ability of the network in transmitting private and common messages across users. Based on this model, we formulate a linear optimization problem that explores the throughput of a multi-layer network, thereby offering the optimal strategy as to what kind of common messages should be generated in the network to maximize the throughput. With this deterministic model, we also investigate the role of feedback for multi-layer networks, from which we identify a variety of scenarios in which feedback can improve transmission efficiency. Our results provide fundamental guidelines as to how to coordinate cooperation between users to enable efficient information exchanges across them.

show abstract

Research on reliability data mining technology of electronic components

Yaru¹,

Zhang²,

Huaguang³

et al. 2020

J. Phys.: Conf. Ser.

0

View full text Add to dashboard Cite

This paper deeply analyzed the types of information that can be mined in component reliability data. According to specific needs, the clustering measurement method of reliability data sample similarity is studied, the distance measurement strategy is obtained, the algorithm steps and analysis methods of Apriori association rule data mining are improved, the reliability data prediction and analysis methods based on statistical methods are compared. AR prediction model, MA model and other component reliability information time prediction methods have formed data mining software such as clustering, correlation analysis and prediction, discovered a large amount of hidden reliability information, and realized the comprehensive mining and utilization of electronic component reliability data.

show abstract

Communication theoretic prediction on networked data

Cited by 5 publications

References 16 publications

Euclidean information theory of networks

Euclidean information theory of networks

Euclidean Information Theory of Networks

Research on reliability data mining technology of electronic components

Contact Info

Product

Resources

About