LAUSR

Data stream mining has recently emerged in response to the rapidly increasing continuous data generation. While the majority of Ant Colony Optimisation (ACO) rule induction algorithms have proved to be successful in producing both accurate and comprehensive classification models in nonstreaming (batch) settings, currently ACO‐based algorithms for classification problems are not suited to be applied to data stream mining. One of the main challenges is the iterative nature of ACO algorithms, where many procedures—for example, heuristic calculation, selection of continuous attributes, pruning—require multiple passes through the data to create a model. In this paper, we present a new ACO‐based algorithm for data stream classification. The proposed algorithm, called Stream Ant‐Miner (sAnt‐Miner), uses a novel hybrid pheromone model combining both a traditional construction graph and solution archives models to efficiently handle a large number of mixed‐type (nominal and continuous) attributes directly without the need for additional procedures, reducing the computational time required to complete an iteration of the algorithm. Our results show that sAnt‐Miner produces statistically significant concise models compared with state‐of‐the‐art rule induction data stream algorithms, without negative effects on their predictive accuracy.