Hoyt A. Koepke

On the limits of clustering in high dimensions via cost functions

Bertrand S. Clarke, Hoyt A. Koepke, 2011, Stat. Anal. Data Min..

A General Hybrid Clustering Technique

Saeid Amiri, Jennifer Clarke, Bertrand S. Clarke, 2015, Journal of Computational and Graphical Statistics.

Efficient Identification of Equivalences in Dynamic Graphs and Pedigree Structures

Hoyt A. Koepke, Elizabeth Thompson, E. Thompson, 2013, J. Comput. Biol..

Convergence Rates for Greedy Kaczmarz Algorithms, and Randomized Kaczmarz Rules Using the Orthogonality Graph

Mark W. Schmidt, Issam H. Laradji, Julie Nutini, 2016, UAI.

A Bayesian criterion for cluster stability

Bertrand S. Clarke, Hoyt A. Koepke, B. Clarke, 2013, Stat. Anal. Data Min..

Fast Prediction of New Feature Utility pdf

Mikhail Bilenko, Hoyt A. Koepke, H. Koepke, 2012, ICML.

Convergence Rates for Greedy Kaczmarz Algorithms, and Randomized Kaczmarz Rules Using the Orthogonality Graph pdf

Mark W. Schmidt, Issam H. Laradji, Julie Nutini, 2016, UAI.

Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection pdf

Mark W. Schmidt, Michael P. Friedlander, Issam H. Laradji, 2015, ICML.

A Bayesian Approach to Cluster Validation

Bertrand S. Clarke, Hoyt A. Koepke, B. Clarke, 2008, ISAIM.