Maksym Arzubov

Hierarchical classification, which organizes items into structured categories and subcategories, has emerged as a powerful solution for handling large and complex datasets. However, traditional flat classification approaches often overlook the hierarchical dependencies between classes, leading to suboptimal predictions and limited interpretability. This paper addresses these challenges by proposing a novel integration of tree-based models with hierarchical-aware split criteria through adjusted entropy calculations. The proposed method calculates entropy at multiple hierarchical levels, ensuring that the model respects the taxonomic structure during training. This approach aligns statistical optimization with class semantic relationships, enabling more accurate and coherent predictions. Experiments conducted on real-world datasets structured according to the GS1 Global Product Classification (GPC) system demonstrate the effectiveness of our method. The proposed model was applied using tree-based ensemble methods combined with the newly developed hierarchy-aware metric Penalized Information Gain (PIG). PIG was implemented with level-wise entropy adjustments, assigning greater weight to higher hierarchical levels to maintain the taxonomic structure. The model was trained and evaluated on two real-world datasets based on the GS1 Global Product Classification (GPC) system. The final dataset included approximately 30,000 product descriptions spanning four hierarchical levels. An 80-20 train–test split was used, with model hyperparameters optimized through 5-fold cross-validation and Bayesian search. The experimental results showed a 12.7% improvement in classification accuracy at the lowest hierarchy level compared to traditional flat classification methods, with significant gains in datasets featuring highly imbalanced class distributions and deep hierarchies. The proposed approach also increased the F1 score by 12.6%. Despite these promising results, challenges remain in scaling the model for very large datasets and handling classes with limited training samples. Future research will focus on integrating neural networks with hierarchy-aware metrics, enhancing data augmentation to address class imbalance, and developing real-time classification systems for practical use in industries such as retail, logistics, and healthcare.

The object of this study is the process of constructing hierarchical classifiers for textual data within a defined taxonomy. The task addressed focuses on minimizing cascading errors and enhancing classification consistency across all hierarchy levels, a critical challenge for deep and imbalanced hierarchical structures. The proposed model leverages the Penalized Information Gain (PIG) criterion with dynamically adjusted weight coefficients. A model for hierarchical text classification has been built. It aims to improve classification accuracy and preserve the structural logic of data within multi-level taxonomies. Data featuring a multi-level taxonomy that meets classification requirements have been synthesized and are employed for training and testing classifiers. The performance of local and global hierarchical classification models was compared against conventional classifiers that do not account for taxonomic relationships between classes. The results demonstrate that using weight coefficients based on hierarchical levels enables an adequate representation of taxonomic dependences, which is crucial for maintaining data integrity and improving categorization quality at various levels. Experimental findings show an 8 % increase in the F1 score at the class and subclass levels. A distinctive feature of the model built is the integration of dynamic weights into the splitting criterion, which allows hierarchical dependences between classes to be effectively addressed and cascading errors, typical of conventional approaches, to be minimized. The model’s practical application spans product management systems in e-commerce, text analytics in the restaurant business, and automated categorization systems for multi-level structures

The precise categorization of brief texts holds significant importance in various applications within the ever-changing realm of artificial intelligence (AI) and natural language processing (NLP). Short texts are everywhere in the digital world, from social media updates to customer reviews and feedback. Nevertheless, short texts’ limited length and context pose unique challenges for accurate classification. This research article delves into the influence of data sorting methods on the quality of manual labeling in hierarchical classification, with a particular focus on short texts. The study is set against the backdrop of the increasing reliance on manual labeling in AI and NLP, highlighting its significance in the accuracy of hierarchical text classification. Methodologically, the study integrates AI, notably zero-shot learning, with human annotation processes to examine the efficacy of various data-sorting strategies. The results demonstrate how different sorting approaches impact the accuracy and consistency of manual labeling, a critical aspect of creating high-quality datasets for NLP applications. The study’s findings reveal a significant time efficiency improvement in terms of labeling, where ordered manual labeling required 760 min per 1000 samples, compared to 800 min for traditional manual labeling, illustrating the practical benefits of optimized data sorting strategies. Comparatively, ordered manual labeling achieved the highest mean accuracy rates across all hierarchical levels, with figures reaching up to 99% for segments, 95% for families, 92% for classes, and 90% for bricks, underscoring the efficiency of structured data sorting. It offers valuable insights and practical guidelines for improving labeling quality in hierarchical classification tasks, thereby advancing the precision of text analysis in AI-driven research. This abstract encapsulates the article’s background, methods, results, and conclusions, providing a comprehensive yet succinct study overview.

In the contemporary epoch, the management and visualization of geospatial information in web browsers have gained substantial importance. Web maps are indispensable tools across various tourism, goods delivery, and ecology sectors. Furthermore, the extensive support of web browsers on diverse devices enhances the accessibility of geospatial data on the web for various users. However, the incessant increment of geospatial information poses new challenges in efficiently displaying data and navigation through these data on web maps. Therefore, the clustering of geospatial data is crucial in dealing with them. Different clustering methods may affect the performance or visual clarity of web maps. To improve the user experience and optimize the use of computing resources, geodata clustering becomes a necessary tool for processing large volumes of markers on the map. Despite significant progress in the development of geodata clustering solutions in web maps, there are some challenges that developers and users may encounter. In this article, challenges with scaling, dynamic cluster data, and heterogeneity of data are described. Existing problems in geodata clustering in web maps require additional research and development. Understanding these issues will help developers and researchers improve existing solutions and create new methods and approaches for efficient clustering of geodata in web maps. The urgency of solving the problem lies in the search for effective clustering solutions that provide an opportunity to ensure convenient interactivity and fast processing of geodata in web maps. This study provides a comprehensive review of data types and clustering methods. Tools and libraries for geodata clustering in web maps are analyzed. Different types of geodata and approaches to working with them were also studied. Concepts such as semi-static data and their positions alongside static and dynamic data types are elucidated. Through the analysis, optimal scenarios for applying specific clustering methods or the utilization of server-side clustering approaches have been identified. Conclusions have also been drawn on the preferred approach when handling extensive volumes of static or semi-static geospatial data, particularly advocating for the application of server-side clustering with caching. In conclusion, various clustering approaches in web maps, both client-side and server-side, have been scrutinized. The advantages and disadvantages of both approaches, along with recommendations on when to apply each method, have been delineated. A noticeable absence of explicit approaches in clustering vast geospatial data for web map representation underpins the relevance and necessity of research in this direction.

This research presents the development and implementation of information technology for monitoring and analyzing segments of a mobile operator's stores using clustering methods. The study addresses a pertinent issue in marketing and business optimization, namely the enhancement of strategies for the network of mobile communication stores. The research paper presents a novel approach to segmenting mobile operator stores using clustering algorithms. A software product was developed that includes machine learning algorithms for clustering stores according to critical parameters. A comprehensive analysis of the mobile operator's database was conducted to identify critical characteristics of the stores, such as profitability, patterns of mobile operator service usage, the number of new and lost customers, geographical location, and other vital indicators. Particular attention was paid to developing tools for preparing and processing input data, ensuring the accuracy of subsequent clustering. With the created product, the mobile operator can identify the most profitable stores, uncover growth opportunities, and develop targeted strategies for each segment. By applying the developed technology, the mobile operator gains the ability not only to identify crucial and profitable sales points but also to develop focused strategies for different groups of stores, taking into account their unique characteristics. This approach strengthens the company's market position, increasing customer satisfaction and profitability. Additionally, when examining the possibilities of analyzing store dynamics over time, it is necessary to consider the ever-evolving business environment. Such a tool can assist the operator in swiftly adapting strategies and responding to new trends and challenges while preserving stability and profitability. Similar innovative approaches not only facilitate the management of a mobile operator's store network but also enable the establishment of more open and flexible customer relationships. By providing personalized services and responding to their needs, businesses can enhance customer loyalty and increase their profits. In conclusion, this research endeavour carries significant practical implications for the realms of marketing and mobile operator development. Its findings can be harnessed to enhance the efficiency of operations and profitability within this industry.