{"title":"Pareto multi-objective optimization for high locality-preserving space-filling curve identification","authors":"Patrick Franco, Rémy Mullot, Valentin Owczarek","doi":"10.1016/j.swevo.2024.101797","DOIUrl":null,"url":null,"abstract":"<div><div>Space-filling curves are widely used in applications that take advantage of the locality-preserving property. The pattern (the first order curve) plays a central role in locality preserving property. This was highlighted in previous works well-received by the community. A formulation was established leading to defined new patterns, including competitive patterns, i.e., patterns carrying comparable (and sometimes better) locality-preserving level than the Hilbert curve, so far the reference. Nevertheless, the number of pattern solutions resulting from the given formulation exponentially grows up with the space dimension.</div><div>In this article, with the help of an evolutionary algorithm, an original approach dedicated to the identification of high locality-preserving multidimensional patterns is proposed. Our idea is to embed the problem in a multi-objective optimization framework guided by Pareto optimality. In a such framework, each locality score (through a standard criteria) obtained by a pattern at a specific radius value can be processed as an objective function (to be minimized). The overall multi-objective function then illustrates how well the objectives are met, i.e. how the locality is achieved as progressively the space is filled. So, several space radii of interest are taken into account in the locality estimation and not a single one. This track contributes to define an accurately process of pattern identification.</div><div>Comparative experimental results led on dimensions upper than three, seem to confirm that the proposed approach is <em>Reliable</em>, <em>Efficient</em> and <em>Flexible</em>. The results showed that the classical RBG pattern is not Pareto optimal in the 5-D case and alternative patterns are emerging. Finally, being able to identify patterns that preserve locality at a competitive level compare to the referent Hilbert curve (RBG pattern-based) constitutes a real contribution and could greatly improve the effectiveness of applications.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"92 ","pages":"Article 101797"},"PeriodicalIF":8.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224003353","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Space-filling curves are widely used in applications that take advantage of the locality-preserving property. The pattern (the first order curve) plays a central role in locality preserving property. This was highlighted in previous works well-received by the community. A formulation was established leading to defined new patterns, including competitive patterns, i.e., patterns carrying comparable (and sometimes better) locality-preserving level than the Hilbert curve, so far the reference. Nevertheless, the number of pattern solutions resulting from the given formulation exponentially grows up with the space dimension.
In this article, with the help of an evolutionary algorithm, an original approach dedicated to the identification of high locality-preserving multidimensional patterns is proposed. Our idea is to embed the problem in a multi-objective optimization framework guided by Pareto optimality. In a such framework, each locality score (through a standard criteria) obtained by a pattern at a specific radius value can be processed as an objective function (to be minimized). The overall multi-objective function then illustrates how well the objectives are met, i.e. how the locality is achieved as progressively the space is filled. So, several space radii of interest are taken into account in the locality estimation and not a single one. This track contributes to define an accurately process of pattern identification.
Comparative experimental results led on dimensions upper than three, seem to confirm that the proposed approach is Reliable, Efficient and Flexible. The results showed that the classical RBG pattern is not Pareto optimal in the 5-D case and alternative patterns are emerging. Finally, being able to identify patterns that preserve locality at a competitive level compare to the referent Hilbert curve (RBG pattern-based) constitutes a real contribution and could greatly improve the effectiveness of applications.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.