811 citations · 1.3k across the 5 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2013★ 13 cited
An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering
Michael Kearns, Yishay Mansour, Andrew Y. Ng
Assignment methods are at the heart of many algorithms for unsupervised learning and clustering - in particular, the well-known K-means and Expectation-Maximization (EM) algorithms…
cs.LG2012★ 10 cited
Learning Factor Graphs in Polynomial Time & Sample Complexity
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
We study computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded factor size…