no code implementations • 10 Nov 2022 • Coralia Cartis, Jaroslav Fowkes, Zhen Shao
We propose a Randomised Subspace Gauss-Newton (R-SGN) algorithm for solving nonlinear least-squares optimization problems, that uses a sketched Jacobian of the residual in the variable domain and solves a reduced linear least-squares on each iteration.
1 code implementation • 16 Feb 2016 • Jaroslav Fowkes, Charles Sutton
Recent sequential pattern mining methods have used the minimum description length (MDL) principle to define an encoding scheme which describes an algorithm for mining the most compressing patterns in a database.
1 code implementation • 14 Oct 2015 • Jaroslav Fowkes, Charles Sutton
Mining itemsets that are the most interesting under a statistical model of the underlying data is a commonly used and well-studied technique for exploratory data analysis, with the most recent interestingness models exhibiting state of the art performance.