Search Results for author:
Found 12 papers, 3 papers with code
A Dataset Fusion Algorithm for Generalised Anomaly Detection in Homogeneous Periodic Time Series Datasets
In a commercial environment, however, generalisation can effectively utilise available data and computational power, which is essential in the context of Green AI, the sustainable development of AI models.
Herder Ants: Ant Colony Optimization with Aphids for Discrete Event-Triggered Dynamic Optimization Problems
Currently available dynamic optimization strategies for Ant Colony Optimization (ACO) algorithm offer a trade-off of slower algorithm convergence or significant penalty to solution quality after each dynamic change occurs.
Hybridization of Capsule and LSTM Networks for unsupervised anomaly detection on multivariate data
Additionally, results also show that the branched input models can learn multivariate data more consistently with or without Capsules in comparison to the non-branched input models.
Ranked #1 on
Change Point Detection
on SKAB
Class Density and Dataset Quality in High-Dimensional, Unstructured Data
We provide a definition for class density that can be used to measure the aggregate similarity of the samples within each of the classes in a high-dimensional, unstructured dataset.
Towards an Analytical Definition of Sufficient Data
We show that, for each of five datasets of increasing complexity, certain training samples are more informative of class membership than others.
On the Importance of Capturing a Sufficient Diversity of Perspective for the Classification of micro-PCBs
We present a dataset consisting of high-resolution images of 13 micro-PCBs captured in various rotations and perspectives relative to the camera, with each sample labeled for PCB type, rotation category, and perspective categories.
Hybrid 2-stage Imperialist Competitive Algorithm with Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problem
The Multi-Depot Vehicle Routing Problem (MDVRP) is a real-world model of the simplistic Vehicle Routing Problem (VRP) that considers how to satisfy multiple customer demands from numerous depots.
Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem
The multidimensional knapsack problem is a well-known constrained optimization problem with many real-world engineering applications.
Dynamic Impact for Ant Colony Optimization algorithm
This paper proposes an extension method for Ant Colony Optimization (ACO) algorithm called Dynamic Impact.
No Routing Needed Between Capsules
Most capsule network designs rely on traditional matrix multiplication between capsule layers and computationally expensive routing mechanisms to deal with the capsule dimensional entanglement that the matrix multiplication introduces.
Ranked #1 on
Image Classification
on MNIST
Accelerating supply chains with Ant Colony Optimization across range of hardware solutions
This paper looks at real-life outbound supply chain problem using Ant Colony Optimization (ACO) and its scaling dynamics with two parallel ACO architectures - Independent Ant Colonies (IAC) and Parallel Ants (PA).
Homogeneous Vector Capsules Enable Adaptive Gradient Descent in Convolutional Neural Networks
Capsules, on the other hand, produce a vector of values, which Hinton argues correspond to a single, composite feature wherein the values of the components of the vectors indicate properties of the feature such as transformation or contrast.
