Article

Free access

Distributed cooperative Bayesian learning strategies

Author:

Kenji YamanishiAuthors Info & Claims

COLT '97: Proceedings of the tenth annual conference on Computational learning theory

Pages 250 - 262

https://doi.org/10.1145/267460.267507

Published: 01 July 1997 Publication History

PDF eReader

References

[1]

J.O. Berger, Statistical Decision Theory and Bayesian Analysis, Springer-Verlag, 1985.

Google Scholar

[2]

B.S. Clarke and A.R. Barron, "Informationtheoretic asymptotics of Bayes methods," IEEE Trans. Inform. Theory, IT-36, pp.453-471, 1990.

Crossref

Google Scholar

[3]

A.E. Gelfand and A.F.M. Smith, "Sampling-based approach to calculating marginal densities," J. Am. Statist. Assoc., vol. 85, pp.398-409, 1990.

Crossref

Google Scholar

[4]

S. Geman and D. Geman, "Stochastic relaxation, Gibbs distributions, and the Bayes restoration of images," IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-6, pp.721-741, 1984.

Digital Library

Google Scholar

[5]

W.K. Hastings, "Monte Carlo sampling method using Markov chains and their applications," Biometrika, vol. 57, pp.97-109, 1970.

Crossref

Google Scholar

[6]

D. Haussler, J. Kivinen, and M. Warmuth, "Tight worst-case loss bounds for predicting with expert advice," Computational Learning Theory: Second European Conference. EuroCOLT'95, Springer, pp.69-83. 1995.

Digital Library

Google Scholar

[7]

M. Kearns and H.S. Seung, "Learning from a population of hypotheses," Proceedings of the Sixth Annual ACM Conference of Computational Learning Theory, ACM Press, pp.lOl-110, 1993.

Digital Library

Google Scholar

[8]

A. Nakamura, N. Abe, and J. Takeuchi, "Efficient distribution-free population learning of simple concepts," ALT'96 Algorithmic Learning Theoy, Springer, pp.500-515, 1994.

Digital Library

Google Scholar

[9]

E. Nummelin, General irreducible Markov chains and non-negative operators, Cambridge University Press, 1984.

Crossref

Google Scholar

[10]

J. Rosenthal, "Rates of convergence for Gibbs sampling for variance component models," Technical report No.9322, Univ. of Toronto, Dept. of Statistics, 1993.

Google Scholar

[11]

A. Sinclair, Algorithms for Random Generation & Counting: A Markov Chain Approach, Birkhauser, 1993.

Digital Library

Google Scholar

[12]

M.A. Tanner and H.W. Wong, "The calculation of posterior distributions by data augmentation," Jr. American Statist. Assoc., vol.82, pp.528-550, 1987.

Crossref

Google Scholar

[13]

V.G. Vovk. "Aggregating strategies," Proceedings of the Third Annual Workshop on Computational Learning Theory, Morgan Kaufmann, pp.371-386, 1990.

Digital Library

Google Scholar

[14]

K. Yamanishi, "A decision-theoretic extension of stochastic complexity and its approximation to learning," submitted for publication, 1995.

Digital Library

Google Scholar

[15]

K. Yamanishi, "A randomized approximation of the MDL for stochastic models with hidden variables," Proceedings of the Ninth Annual Conference on Computational Learning Theory, ACM Press, pp.99-109, 1996.

Digital Library

Google Scholar

Cited By

View all

Wang YZhang ZQian HGao YWang Q(2024)A High-Dimensional Temporal Data Publishing Method Based on Dynamic Bayesian Networks and Differential Privacy2024 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN60899.2024.10650346(1-8)Online publication date: 30-Jun-2024
https://doi.org/10.1109/IJCNN60899.2024.10650346
Varagnolo DPillonetto GSchenato L(2012)Distributed parametric and nonparametric regression with on-line performance bounds computationAutomatica (Journal of IFAC)10.1016/j.automatica.2012.06.08048:10(2468-2481)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1016/j.automatica.2012.06.080
Kechadi M(2010)The Data WaveProceedings of the 2010 19th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises10.1109/WETICE.2010.56(7-11)Online publication date: 28-Jun-2010
https://dl.acm.org/doi/10.1109/WETICE.2010.56
Show More Cited By

Index Terms

Distributed cooperative Bayesian learning strategies

Recommendations

Distributed Serially Concatenated Codes for Multi-Source Cooperative Relay Networks

In this paper, we propose a distributed turbo-like coding scheme for a multi-source relay scenario where multiple sources communicate with a destination with the help of a common relay, which uses the decode-and-forward strategy and operates in half-...
Distributed turbo trellis coded modulation for cooperative communications
ICC'09: Proceedings of the 2009 IEEE international conference on Communications

In this contribution, we propose a Distributed Turbo Trellis Coded Modulation (DTTCM) scheme for cooperative communications. The DTTCM scheme is designed based on its decoding convergence with the aid of non-binary Extrinsic Information Transfer (EXIT) ...
Cooperative Strategies for Simultaneous and Broadcast Relay Channels

Consider the simultaneous relay channel (SRC) that consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to that of sending ...

Comments

Information & Contributors

Information

Published In

COLT '97: Proceedings of the tenth annual conference on Computational learning theory

July 1997

338 pages

ISBN:0897918916

DOI:10.1145/267460

Chairmen:
Yoav Freund
AT&T Labs
,
Robert Schapire
AT&T Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

COLT97

Sponsor:

SIGAI
AT&T Labs
SIGACT
Vanderbilt University

COLT97: Tenth Annual Conference on Computational Learning Theory

July 6 - 9, 1997

Tennessee, Nashville, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
652
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)6

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang YZhang ZQian HGao YWang Q(2024)A High-Dimensional Temporal Data Publishing Method Based on Dynamic Bayesian Networks and Differential Privacy2024 International Joint Conference on Neural Networks (IJCNN)10.1109/IJCNN60899.2024.10650346(1-8)Online publication date: 30-Jun-2024
https://doi.org/10.1109/IJCNN60899.2024.10650346
Varagnolo DPillonetto GSchenato L(2012)Distributed parametric and nonparametric regression with on-line performance bounds computationAutomatica (Journal of IFAC)10.1016/j.automatica.2012.06.08048:10(2468-2481)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1016/j.automatica.2012.06.080
Kechadi M(2010)The Data WaveProceedings of the 2010 19th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises10.1109/WETICE.2010.56(7-11)Online publication date: 28-Jun-2010
https://dl.acm.org/doi/10.1109/WETICE.2010.56
Xue SLu Z(2007)Research of distributed data mining association rules model based on similarityProceedings of the 12th international conference on Human-computer interaction: applications and services10.5555/1769451.1769586(1180-1189)Online publication date: 22-Jul-2007
https://dl.acm.org/doi/10.5555/1769451.1769586
Xue SLu Z(2007)Research of Distributed Data Mining Association Rules Model Based on SimilarityHuman-Computer Interaction. HCI Applications and Services10.1007/978-3-540-73111-5_129(1180-1189)Online publication date: 2007
https://doi.org/10.1007/978-3-540-73111-5_129
Predd JKulkarni SPoor H(2006)Distributed learning in wireless sensor networksIEEE Signal Processing Magazine10.1109/MSP.2006.165781723:4(56-69)Online publication date: Jul-2006
https://doi.org/10.1109/MSP.2006.1657817
Schmidt RAberer K(2006)Efficient peer-to-peer belief propagationProceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I10.1007/11914853_31(516-532)Online publication date: 29-Oct-2006
https://dl.acm.org/doi/10.1007/11914853_31
Hongmei WZheng ZZhiwei S(2005)Privacy-Preserving Bayesian Network Structure Learning on Distributed Heterogeneous DataProceedings of the 11th Pacific Rim International Symposium on Dependable Computing10.1109/PRDC.2005.49(31-40)Online publication date: 12-Dec-2005
https://dl.acm.org/doi/10.1109/PRDC.2005.49
Yang ZWright R(2005)Improved Privacy-Preserving Bayesian Network Parameter Learning on Vertically Partitioned DataProceedings of the 21st International Conference on Data Engineering Workshops10.1109/ICDE.2005.230Online publication date: 5-Apr-2005
https://dl.acm.org/doi/10.1109/ICDE.2005.230
Baik SBala J(2004)A Decision Tree Algorithm for Distributed Data Mining: Towards Network Intrusion DetectionComputational Science and Its Applications – ICCSA 200410.1007/978-3-540-24768-5_22(206-212)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24768-5_22
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Distributed Serially Concatenated Codes for Multi-Source Cooperative Relay Networks

Distributed turbo trellis coded modulation for cooperative communications

Cooperative Strategies for Simultaneous and Broadcast Relay Channels

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Distributed Serially Concatenated Codes for Multi-Source Cooperative Relay Networks

Distributed turbo trellis coded modulation for cooperative communications

Cooperative Strategies for Simultaneous and Broadcast Relay Channels

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations