Reinforced Labels: Multi-Agent Deep Reinforcement Learning for Point-Feature Label Placement

Over the recent years, Reinforcement Learning combined with Deep Learning techniques has successfully proven to solve complex problems in various domains, including robotics, self-driving cars, and finance. In this paper, we are introducing Reinforcement Learning (RL) to label placement, a complex task in data visualization that seeks optimal positioning for labels to avoid overlap and ensure legibility. Our novel point-feature label placement method utilizes Multi-Agent Deep Reinforcement Learning to learn the label placement strategy, the first machine-learning-driven labeling method, in contrast to the existing hand-crafted algorithms designed by human experts. To facilitate RL learning, we developed an environment where an agent acts as a proxy for a label, a short textual annotation that augments visualization. Our results show that the strategy trained by our method significantly outperforms the random strategy of an untrained agent and the compared methods designed by human experts in terms of completeness (i.e., the number of placed labels). The trade-off is increased computation time, making the proposed method slower than the compared methods. Nevertheless, our method is ideal for scenarios where the labeling can be computed in advance, and completeness is essential, such as cartographic maps, technical drawings, and medical atlases. Additionally, we conducted a user study to assess the perceived performance. The outcomes revealed that the participants considered the proposed method to be significantly better than the other examined methods. This indicates that the improved completeness is not just reflected in the quantitative metrics but also in the subjective evaluation by the participants

An Integrated Strategy for a Production Planning and Warehouse Layout Problem: Modeling and Solution Approaches

We study a real-world production warehousing case, where the company always faces the challenge to find available space for their products and to manage the items in the warehouse. To resolve the problem, an integrated strategy that combines warehouse layout with the capacitated lot-sizing problem is presented, which have been traditionally treated separately in the existing literature. We develop a mixed integer linear programming model to formulate the integrated optimization problem with the objective of minimizing the total cost of production and warehouse operations. The problem with real data is a large-scale instance that is beyond the capability of optimization solvers. A novel Lagrangian relax-and-fix heuristic approach and its variants are proposed to solve the large-scale problem. The preliminary numerical results from the heuristic approaches are reported

A point-feature label placement algorithm based on spatial data mining

The point-feature label placement (PFLP) refers to the process of positioning labels near point features on a map while adhering to specific rules and guidelines, finally obtaining clear, aesthetically pleasing, and conflict-free maps. While various approaches have been suggested for automated point feature placement on maps, few studies have fully considered the spatial distribution characteristics and label correlations of point datasets, resulting in poor label quality in the process of solving the label placement of dense and complex point datasets. In this paper, we propose a point-feature label placement algorithm based on spatial data mining that analyzes the local spatial distribution characteristics and label correlations of point features. The algorithm quantifies the interference among point features by designing a label frequent pattern framework (LFPF) and constructs an ascending label ordering method based on the pattern to reduce interference. Besides, three classical metaheuristic algorithms (simulated annealing algorithm, genetic algorithm, and ant colony algorithm) are applied to the PFLP in combination with the framework to verify the validity of this framework. Additionally, a bit-based grid spatial index is proposed to reduce cache memory and consumption time in conflict detection. The performance of the experiments is tested with 4000, 10000, and 20000 points of POI data obtained randomly under various label densities. The results of these experiments showed that: (1) the proposed method outperformed both the original algorithm and recent literature, with label quality improvements ranging from 3 to 6.7 and from 0.1 to 2.6, respectively. (2) The label efficiency was improved by 58.2% compared with the traditional grid index

Današnje uobičajene pogreške pri prikazivanju toponima na web-kartama i moguća rješenja

Primarily we dealt with the problem of toponyms placement on web maps and it can be noticed that even today on most visited sites with web maps toponyms placement is not in accordance with the cartographic principles, cartographic visualization conditions or cartographic generalization rules. There are good and bad examples of toponyms placement on web maps and the good are generally those who adhere to the cartographic principles for toponym label placement used for printed maps but are also implemented on the web maps. A simple method for decision of visible or invisible label is proposed when label is shown in a complex map environment with all other cartographic elements and different layers as it is usual on web maps. The perfect solution can be approached but we have to wait for more complex systems that apply artificial intelligence on which for now we think in theoretical form, that would use different ways of learning by examples and by own mistakes, much like humans do.Prvenstveno smo se bavili problemom smještaja toponima na web-kartama, jer se može primijetiti da i danas na najposjećenijim web stranicama s web-kartama smještaj toponima nije u skladu s kartografskim načelima, kartografskom vizualizacijom niti kartografskom generalizacijom. Postoje dobri i loši primjeri smještaja toponima na web-kartama, a dobri su uglavnom oni koji se drže kartografskih načela koja su primjenjivana i na tiskanim kartama, te to implementiraju u prikazu na web-kartama. Predložena je jednostavna metoda za odlučivanje o prikazivanju ili neprikazivanju nekog toponima u svom mogućem složenom okruženju pri prikazivanju sa svim ostalim kartografskim elementima i slojevima kako je to i uobičajeno na web-kartama. Možemo se približiti savršenom rješenju smještaja toponima, ali ipak će trebati pričekati složenije sustave koji primjenjuju umjetnu inteligenciju o kojima za sada možemo razmišljati u teorijskom obliku, a koji bi upotrebljavali razne načine učenja na primjerima i na vlastitim pogreškama, slično kao i ljudi

Unsupervised automatic music genre classification

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia InformáticaIn this study we explore automatic music genre recognition and classification of digital music. Music has always been a reflection of culture di erences and an influence in our society. Today’s digital content development triggered the massive use of digital music. Nowadays,digital music is manually labeled without following a universal taxonomy, thus, the labeling process to audio indexing is prone to errors. A human labeling will always be influenced by culture di erences, education, tastes, etc. Nonetheless, this indexing process is primordial to guarantee a correct organization of huge databases that contain thousands of music titles. In this study, our interest is about music genre organization. We propose a learning and classification methodology for automatic genre classification able to group several music samples based on their characteristics (this is achieved by the proposed learning process) as well as classify a new test music into the previously learned created groups(this is achieved by the proposed classification process). The learning method intends to group the music samples into di erent clusters only based on audio features and without any previous knowledge on the genre of the samples, and therefore it follows an unsupervised methodology. In addition a Model-Based approach is followed to generate clusters as we do not provide any information about the number of genres in the dataset. Features are related with rhythm analysis, timbre, melody, among others. In addition, Mahalanobis distance was used so that the classification method can deal with non-spherical clusters. The proposed learning method achieves a clustering accuracy of 55% when the dataset contains 11 di erent music genres: Blues, Classical, Country, Disco, Fado, Hiphop, Jazz, Metal,Pop, Reggae and Rock. The clustering accuracy improves significantly when the number of genres is reduced; with 4 genres (Classical, Fado, Metal and Reggae), we obtain an accuracy of 100%. As for the classification process, 82% of the submitted music samples were correctly classified