Jakramate Bootkrajang

Dr. Jakramate Bootkrajang

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2016 in Evolutionary Computation
Verified
Journal Article
Open access
AKAta Kabán
Ata Kabán
JBJakramate Bootkrajang
Jakramate Bootkrajang
RDR. J. Durrant
R. J. Durrant
Estimations of distribution algorithms (EDAs) are a major branch of evolutionary algorithms (EA) with some unique advantages in principle. They are able to take advantage of correlation structure to drive the search more efficiently, and they are able to provide insights about the structure of the search space. However, model building in high dimensions is extremely challenging, and as a result existing EDAs may become less attractive in large-scale problems because of the associated large computational requirements. Large-scale continuous global optimisation is key to many modern-day real-world problems. Scaling up EAs to large-scale problems has become one of the biggest challenges of the field. This paper pins down some fundamental roots of the problem and makes a start at developing a new and generic framework to yield effective and efficient EDA-type algorithms for large-scale continuous global optimisation problems. Our concept is to introduce an ensemble of random projections to low dimensions of the set of fittest search points as a basis for developing a new and generic divide-and-conquer methodology. Our ideas are rooted in the theory of random projections developed in theoretical computer science, and in developing and analysing our framework we exploit some recent results in nonasymptotic random matrix theory.

1 November 2014 in Pattern Recognition
Verified
Journal Article
Closed access
JBJakramate Bootkrajang
Jakramate Bootkrajang
AKAta Kabán
Ata Kabán

30 August 2018 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
JBJakramate Bootkrajang
Jakramate Bootkrajang
JCJeerayut Chaijaruwanich
Jeerayut Chaijaruwanich

14 September 2021 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
JBJakramate Bootkrajang
Jakramate Bootkrajang
JCJeerayut Chaijaruwanich
Jeerayut Chaijaruwanich

18 October 2019
Verified
Book Chapter
Closed access
PDF file
WSWatcharin Sarachai
Watcharin Sarachai
JBJakramate Bootkrajang
Jakramate Bootkrajang
JCJeerayut Chaijaruwanich
Jeerayut Chaijaruwanich
SSSamerkae Somhom
Samerkae Somhom

28 October 2022 in Machine Learning
Verified
Journal Article
Open access
PDF file
HRHenry W. J. Reeve
Henry W. J. Reeve
AKAta Kabán
Ata Kabán
JBJakramate Bootkrajang
Jakramate Bootkrajang
We present a general framework for dealing with set heterogeneity in data and learning problems, which is able to exploit low complexity components. The main ingredients are (i) A definition of complexity for elements of a convex union that takes into account the complexities of their individual composition – this is used to cover the heterogeneous convex union; and (ii) Upper bounds on the complexities of restricted subsets. We demonstrate this approach in two different application areas, highlighting their conceptual connection. (1) In random projection based dimensionality reduction, we obtain improved bounds on the uniform preservation of Euclidean norms and distances when low complexity components are present in the union. (2) In statistical learning, our generalisation bounds justify heterogeneous ensemble learning methods that were incompletely understood before. We exemplify empirical results with boosting type random subspace and random projection ensembles that implement our bounds.