3,192 research outputs found
Recommended from our members
A Clustering System for Dynamic Data Streams Based on Metaheuristic Optimisation
open access articleThis article presents the Optimised Stream clustering algorithm (OpStream), a novel approach to cluster dynamic data streams. The proposed system displays desirable features, such as a low number of parameters and good scalability capabilities to both high-dimensional data and numbers of clusters in the dataset, and it is based on a hybrid structure using deterministic clustering methods and stochastic optimisation approaches to optimally centre the clusters. Similar to other state-of-the-art methods available in the literature, it uses âmicroclustersâ and other established techniques, such as density based clustering. Unlike other methods, it makes use of metaheuristic optimisation to maximise performances during the initialisation phase, which precedes the classic online phase. Experimental results show that OpStream outperforms the state-of-the-art methods in several cases, and it is always competitive against other comparison algorithms regardless of the chosen optimisation method. Three variants of OpStream, each coming with a different optimisation algorithm, are presented in this study. A thorough sensitive analysis is performed by using the best variant to point out OpStreamâs robustness to noise and resiliency to parameter changes
Clustering outdoor soundscapes using fuzzy ants
A classification algorithm for environmental sound recordings or "soundscapes" is outlined. An ant clustering approach is proposed, in which the behavior of the ants is governed by fuzzy rules. These rules are optimized by a genetic algorithm specially designed in order to achieve the optimal set of homogeneous clusters. Soundscape similarity is expressed as fuzzy resemblance of the shape of the sound pressure level histogram, the frequency spectrum and the spectrum of temporal fluctuations. These represent the loudness, the spectral and the temporal content of the soundscapes. Compared to traditional clustering methods, the advantages of this approach are that no a priori information is needed, such as the desired number of clusters, and that a flexible set of soundscape measures can be used. The clustering algorithm was applied to a set of 1116 acoustic measurements in 16 urban parks of Stockholm. The resulting clusters were validated against visitor's perceptual measurements of soundscape quality
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (âefficientâ) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find âquicklyâ (reasonable run-times), with âhighâ probability, provable âgoodâ solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
Finding groups in data: Cluster analysis with ants
Wepresent in this paper a modification of Lumer and Faietaâs algorithm for data clustering. This approach
mimics the clustering behavior observed in real ant colonies. This algorithm discovers automatically
clusters in numerical data without prior knowledge of possible number of clusters. In this paper we focus
on ant-based clustering algorithms, a particular kind of a swarm intelligent system, and on the effects on
the final clustering by using during the classification differentmetrics of dissimilarity: Euclidean, Cosine,
and Gower measures. Clustering with swarm-based algorithms is emerging as an alternative to more
conventional clustering methods, such as e.g. k-means, etc. Among the many bio-inspired techniques, ant
clustering algorithms have received special attention, especially because they still require much
investigation to improve performance, stability and other key features that would make such algorithms
mature tools for data mining.
As a case study, this paper focus on the behavior of clustering procedures in those new approaches.
The proposed algorithm and its modifications are evaluated in a number of well-known benchmark
datasets. Empirical results clearly show that ant-based clustering algorithms performs well when
compared to another techniques
Scaling Ant Colony Optimization with Hierarchical Reinforcement Learning Partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. This paper describes two specific implementations of the new algorithm: the first a modification to Dietterichâs MAXQ-Q HRL algorithm, the second a hierarchical ant colony system algorithm. These implementations generate faster results, with little to no significant change in the quality of solutions for the tested problem domains. The application of ACO to the MAXQ-Q algorithm replaces the reinforcement learning, Q-learning, with the modified ant colony optimization method, Ant-Q. This algorithm, MAXQ-AntQ, converges to solutions not significantly different from MAXQ-Q in 88% of the time. This paper then transfers HRL techniques to the ACO domain and traveling salesman problem (TSP). To apply HRL to ACO, a hierarchy must be created for the TSP. A data clustering algorithm creates these subtasks, with an ACO algorithm to solve the individual and complete problems. This paper tests two clustering algorithms, k-means and G-means. The results demonstrate the algorithm with data clustering produces solutions 20 times faster with 5-10% decrease in solution quality due to the effects of clustering
Multi-objective ant colony optimization for the twin-screw configuration problem
The Twin-Screw Configuration Problem (TSCP) consists in identifying the
best location of a set of available screw elements along a screw shaft. Due to its
combinatorial nature, it can be seen as a sequencing problem. In addition,
different conflicting objectives may have to be considered when defining a
screw configuration and, thus, it is usually tackled as a multi-objective
optimization problem. In this research, a multi-objective ant colony
optimization (MOACO) algorithm was adapted to deal with the TSCP. The
influence of different parameters of the MOACO algorithm was studied and its
performance was compared with that of a previously proposed multi-objective
evolutionary algorithm and a two-phase local search algorithm. The
experimental results showed that MOACO algorithms have a significant
potential for solving the TSCP.This work has been supported by the Portuguese Fundacao para a Ciencia e Tecnologia under PhD grant SFRH/BD/21921/2005. Thomas Stutzle acknowledges support of the Belgian F.R.S-FNRS of which he is a research associate, the E-SWARM project, funded by an ERC Advanced Grant, and by the Meta-X project, funded by the Scientific Research Directorate of the French Community of Belgium
- âŚ