An empirical comparison between stochastic and deterministic centroid initialisation for K-means variations

Fitting a collider in a quantum computer: tackling the challenges of quantum machine learning for big datasets

Current quantum systems have significant limitations affecting the processing of large datasets with high dimensionality, typical of high energy physics. In the present paper, feature and data prototype selection techniques were studied to tackle this challenge. A grid search was performed and quantum machine learning models were trained and benchmarked against classical shallow machine learning methods, trained both in the reduced and the complete datasets. The performance of the quantum algorithms was found to be comparable to the classical ones, even when using large datasets. Sequential Backward Selection and Principal Component Analysis techniques were used for feature's selection and while the former can produce the better quantum machine learning models in specific cases, it is more unstable. Additionally, we show that such variability in the results is caused by the use of discrete variables, highlighting the suitability of Principal Component analysis transformed data for quantum machine learning applications in the high energy physics context.

Strategies discovery in the active allothetic place avoidance task

The Active Allothetic Place Avoidance task is an alternative setup to Morris Water Maze that allows studying spatial memory in a dynamic world in the presence of conflicting information. In this task, a rat, freely moving on a rotating circular arena, has to avoid a sector defined within the room frame where shocks are presented. While for Morris Water Maze several studies have identified animal strategies which specifically affect performance, there were no such studies for the Active Allothetic Place Avoidance task. Using standard machine learning methods, we were able to reveal for the first time, to the best of our knowledge, explainable strategies that the animals employ in this task and demonstrate that they can provide a high-level interpretation for performance differences between an animal group treated with silver nanoparticles (AgNPs) and the control group.

Performance of Parallel K-Means Algorithms in Java

K-means is a well-known clustering algorithm often used for its simplicity and potential efficiency. Its properties and limitations have been investigated by many works reported in the literature. K-means, though, suffers from computational problems when dealing with large datasets with many dimensions and great number of clusters. Therefore, many authors have proposed and experimented different techniques for the parallel execution of K-means. This paper describes a novel approach to parallel K-means which, today, is based on commodity multicore machines with shared memory. Two reference implementations in Java are developed and their performances are compared. The first one is structured according to a map/reduce schema that leverages the built-in multi-threaded concurrency automatically provided by Java to parallel streams. The second one, allocated on the available cores, exploits the parallel programming model of the Theatre actor system, which is control-based, totally lock-free, and purposely relies on threads as coarse-grain “programming-in-the-large” units. The experimental results confirm that some good execution performance can be achieved through the implicit and intuitive use of Java concurrency in parallel streams. However, better execution performance can be guaranteed by the modular Theatre implementation which proves more adequate for an exploitation of the computational resources.