Applications

Efficient Online Learning via Randomized Rounding NeurIPS 2011 Estimating Probabilities in Recommendation Systems AISTATS 2011 Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks AISTATS 2011 Fast and Accurate k-means For Large Datasets NeurIPS 2011 Group Anomaly Detection using Flexible Genre Models NeurIPS 2011 Hierarchical Topic Modeling for Analysis of Time-Evolving Personal Choices NeurIPS 2011 Iterative Learning for Reliable Crowdsourcing Systems NeurIPS 2011 Linear Submodular Bandits and their Application to Diversified Retrieval NeurIPS 2011 LPmade: Link Prediction Made Easy JMLR 2011 Manifold Precis: An Annealing Technique for Diverse Sampling of Manifolds NeurIPS 2011 Minimax Localization of Structural Information in Large Noisy Matrices NeurIPS 2011 Multiscale Community Blockmodel for Network Exploration AISTATS 2011 On Time Varying Undirected Graphs AISTATS 2011 On U-processes and clustering performance NeurIPS 2011 Randomized Algorithms for Comparison-based Search NeurIPS 2011 Reconstructing Patterns of Information Diffusion from Incomplete Observations NeurIPS 2011 RTRMC: A Riemannian trust-region method for low-rank matrix completion NeurIPS 2011 Scalable Training of Mixture Models via Coresets NeurIPS 2011 Selective Prediction of Financial Trends with Hidden Markov Models NeurIPS 2011 Sequential Event Prediction with Association Rules COLT 2011 Shaping Level Sets with Submodular Functions NeurIPS 2011 Spectral Clustering on a Budget AISTATS 2011 TopicFlow Model: Unsupervised Learning of Topic-specific Influences of Hyperlinked Documents AISTATS 2011 A New Probabilistic Model for Rank Aggregation NeurIPS 2010 Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm NeurIPS 2010