Learning vector quantization: The dynamics of winner-takes-all algorithms

Using Data-Driven Methods and Aging Information to Quantitatively Identify Microplastic Environmental Sources and Establish a Comprehensive Discrimination Index

The global distribution of microplastics (MPs) across various environmental compartments has garnered significant attention. However, the differences in the characteristics of MPs in different environments remain unclear, and there is still a lack of quantitative analysis of their environmental sources. In addition, the inclusion of aging in source apportionment is a novel approach that has not been widely explored. In this study, we conducted a meta-analysis of the literature from the past 10 years and extracted conventional and aging characteristic data of MPs from 321 sampling points across 7 environmental compartments worldwide. We established a data-driven analysis framework using these data sets to identify different MP communities across environmental compartments, screen key MP features, and develop an environmental source analysis model for MPs. Our results indicate significant differences in the characteristics of MP communities across environments. The key features of differentiation were identified using the LEfSe method and include the carbonyl index, hydroxyl index, fouling index, proportions of polypropylene, white, black/gray, and film/sheet. These features were screened for each environmental compartment. An environmental source identification model was established based on these features with an accuracy of 75.1%. In order to accurately represent the single/multisource case in a more probabilistic manner, we proposed the MP environmental source index (MESI) to provide a probability estimation of the sample having multiple sources. Our findings contribute to a better understanding of MP migration trends and fluxes in the plastic cycle and inform effective prevention and control strategies for MP pollution.

Enhancing the Speed of the Learning Vector Quantization (LVQ) Algorithm by Adding Partial Distance Computation

Learning Vector Quantization (LVQ) is one of the most widely used classification approaches. LVQ faces a problem as when the size of data grows large it becomes slower. In this paper, a modified version of LVQ, which is called PDLVQ is proposed to accelerate the traditional version. The proposed scheme aims to avoid unnecessary computations by applying an efficient Partial Distance (PD) computation strategy. Three different benchmark datasets are used in the experiments. The comparisons have been done between LVQ and PDLVQ in terms of runtime and in result, it turns out that PDLVQ shows better efficiency than LVQ. PDLVQ has achieved up to 37% efficiency in runtime compared to LVQ when the dimensions have increased. Also, the enhanced algorithm (PDLVQ) shows clear enhancement to decrease runtime when the size of dimensions, the number of clusters, or the size of data becomes increased compared with the traditional one which is LVQ.

A New Competitive Neural Architecture for Object Classification

In this paper, we propose a new neural architecture for object classification, made up from a set of competitive layers whose number and size are dynamically learned from training data using a two-step process that combines unsupervised and supervised learning modes. The first step consists in finding a set of one or more optimal prototypes for each of the c classes that form the training data. For this, it uses the unsupervised learning and prototype generator algorithm called fuzzy learning vector quantization (FLVQ). The second step aims to assess the quality of the learned prototypes in terms of classification results. For this, the c classes are reconstructed by assigning each object to the class represented by its nearest prototype, and the obtained results are compared to the original classes. If one or more constructed classes differ from the original ones, the corresponding prototypes are not validated and the whole process is repeated for all misclassified objects, using additional competitive layers, until no difference persists between the constructed and the original classes or a maximum number of layers is reached. Experimental results show the effectiveness of the proposed method on a variety of well-known benchmark data sets.

Energy Management Strategy for Plug-In Hybrid Electric Vehicles Based on Driving Condition Recognition: A Review

Appropriate energy management strategies (EMSs) have been selected for plug-in hybrid electric vehicles (PHEVs) based on driving-condition recognition (DCR) according to the acquired driving information, so as to minimize the target parameters. With online control and offline optimization, the strategy is suitable for real-time applications and is of great significance to repetitive routes, owing to its simplicity and ease of implementation. This paper aims to identity the DCR-based EMSs, develop efficient EMSs, and invite researchers involved in this field to discover new solutions. This paper presents a comprehensive analysis of EMSs based on DCR in terms of principles, the scope of application as well as their advantages and disadvantages, and provides a thorough survey of the latest progress in EMSs. We concluded that DCR-based EMSs show an improvement in energy saving and the pollutant-discharging effect.

Virtual mirror rendering with stationary RGB-D cameras and stored 3-D background

Mirrors are indispensable objects in our lives. The capability of simulating a mirror on a computer display, augmented with virtual scenes and objects, opens the door to many interesting and useful applications from fashion design to medical interventions. Realistic simulation of a mirror is challenging as it requires accurate viewpoint tracking and rendering, wide-angle viewing of the environment, as well as real-time performance to provide immediate visual feedback. In this paper, we propose a virtual mirror rendering system using a network of commodity structured-light RGB-D cameras. The depth information provided by the RGB-D cameras can be used to track the viewpoint and render the scene from different prospectives. Missing and erroneous depth measurements are common problems with structured-light cameras. A novel depth denoising and completion algorithm is proposed in which the noise removal and interpolation procedures are guided by the foreground/background label at each pixel. The foreground/background label is estimated using a probabilistic graphical model that considers color, depth, background modeling, depth noise modeling, and spatial constraints. The wide viewing angle of the mirror system is realized by combining the dynamic scene, captured by the static camera network with a 3-D background model created off-line, using a color-depth sequence captured by a movable RGB-D camera. To ensure a real-time response, a scalable client-and-server architecture is used with the 3-D point cloud processing, the viewpoint estimate, and the mirror image rendering are all done on the client side. The mirror image and the viewpoint estimate are then sent to the server for final mirror view synthesis and viewpoint refinement. Experimental results are presented to show the accuracy and effectiveness of each component and the entire system.

Adaptive relevance matrices in learning vector quantization

We propose a new matrix learning scheme to extend relevance learning vector quantization (RLVQ), an efficient prototype-based classification algorithm, toward a general adaptive metric. By introducing a full matrix of relevance factors in the distance measure, correlations between different features and their importance for the classification scheme can be taken into account and automated, and general metric adaptation takes place during training. In comparison to the weighted Euclidean metric used in RLVQ and its variations, a full matrix is more powerful to represent the internal structure of the data appropriately. Large margin generalization bounds can be transferred to this case, leading to bounds that are independent of the input dimensionality. This also holds for local metrics attached to each prototype, which corresponds to piecewise quadratic decision boundaries. The algorithm is tested in comparison to alternative learning vector quantization schemes using an artificial data set, a benchmark multiclass problem from the UCI repository, and a problem from bioinformatics, the recognition of splice sites for C. elegans.

Performance analysis of LVQ algorithms: A statistical physics approach

Learning vector quantization (LVQ) constitutes a powerful and intuitive method for adaptive nearest prototype classification. However, original LVQ has been introduced based on heuristics and numerous modifications exist to achieve better convergence and stability. Recently, a mathematical foundation by means of a cost function has been proposed which, as a limiting case, yields a learning rule similar to classical LVQ2.1. It also motivates a modification which shows better stability. However, the exact dynamics as well as the generalization ability of many LVQ algorithms have not been thoroughly investigated so far. Using concepts from statistical physics and the theory of on-line learning, we present a mathematical framework to analyse the performance of different LVQ algorithms in a typical scenario in terms of their dynamics, sensitivity to initial conditions, and generalization ability. Significant differences in the algorithmic stability and generalization ability can be found already for slightly different variants of LVQ. We study five LVQ algorithms in detail: Kohonen's original LVQ1, unsupervised vector quantization (VQ), a mixture of VQ and LVQ, LVQ2.1, and a variant of LVQ which is based on a cost function. Surprisingly, basic LVQ1 shows very good performance in terms of stability, asymptotic generalization ability, and robustness to initializations and model parameters which, in many cases, is superior to recent alternative proposals.