Estimating a mixture of two product distributions

Yoav Freund; Yishay Mansour

doi:10.1145/307400.307412

Estimating a mixture of two product distributions

Yoav Freund^*, Yishay Mansour

^*Corresponding author for this work

AT&T

Research output: Contribution to conference › Paper › peer-review

35 Scopus citations

Abstract

This study addresses a case involving a mixture of two product distributions over binary vectors. A polynomial time algorithm is given that computes a mixture distribution which is close to the target distribution. The algorithm is efficient both in its sample complexity and its computational complexity.

Original language	English
Pages	53-62
Number of pages	10
DOIs	https://doi.org/10.1145/307400.307412
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99) - Santa Cruz, CA, USA Duration: 6 Jul 1999 → 9 Jul 1999

Conference

Conference	Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99)
City	Santa Cruz, CA, USA
Period	6/07/99 → 9/07/99

Access to Document

10.1145/307400.307412

Cite this

@conference{f766107869e540699e6a8b27a7ce6ca0,

title = "Estimating a mixture of two product distributions",

abstract = "This study addresses a case involving a mixture of two product distributions over binary vectors. A polynomial time algorithm is given that computes a mixture distribution which is close to the target distribution. The algorithm is efficient both in its sample complexity and its computational complexity.",

author = "Yoav Freund and Yishay Mansour",

year = "1999",

doi = "10.1145/307400.307412",

language = "אנגלית",

pages = "53--62",

note = "Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99) ; Conference date: 06-07-1999 Through 09-07-1999",

}

TY - CONF

T1 - Estimating a mixture of two product distributions

AU - Freund, Yoav

AU - Mansour, Yishay

PY - 1999

Y1 - 1999

N2 - This study addresses a case involving a mixture of two product distributions over binary vectors. A polynomial time algorithm is given that computes a mixture distribution which is close to the target distribution. The algorithm is efficient both in its sample complexity and its computational complexity.

AB - This study addresses a case involving a mixture of two product distributions over binary vectors. A polynomial time algorithm is given that computes a mixture distribution which is close to the target distribution. The algorithm is efficient both in its sample complexity and its computational complexity.

UR - http://www.scopus.com/inward/record.url?scp=0033280348&partnerID=8YFLogxK

U2 - 10.1145/307400.307412

DO - 10.1145/307400.307412

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0033280348

SP - 53

EP - 62

T2 - Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99)

Y2 - 6 July 1999 through 9 July 1999

ER -

Estimating a mixture of two product distributions

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this