• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.3086-3101
• /
• 2021

To supply precise marketing and differentiated service for the electric power service department, it is very important to predict the customers with high sensitivity of electric power failure. To solve this problem, we propose a novel grouped 𝑙_1/2 sparsity constrained logistic regression method for sensitivity assessment of electric power failure. Different from the 𝑙₁ norm and k-support norm, the proposed grouped 𝑙_1/2 sparsity constrained logistic regression method simultaneously imposes the inter-class information and tighter approximation to the nonconvex 𝑙₀ sparsity to exploit multiple correlated attributions for prediction. Firstly, the attributes or factors for predicting the customer sensitivity of power failure are selected from customer sheets, such as customer information, electric consuming information, electrical bill, 95598 work sheet, power failure events, etc. Secondly, all these samples with attributes are clustered into several categories, and samples in the same category are assumed to be sharing similar properties. Then, 𝑙_1/2 norm constrained logistic regression model is built to predict the customer's sensitivity of power failure. Alternating direction of multipliers (ADMM) algorithm is finally employed to solve the problem by splitting it into several sub-problems effectively. Experimental results on power electrical dataset with about one million customer data from a province validate that the proposed method has a good prediction accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3194-3216
• /
• 2018

Slow Feature Discriminant Analysis (SFDA) is a supervised feature extraction method inspired by biological mechanism. In this paper, a novel method called Two Dimensional Slow Feature Discriminant Analysis via $L_{2,1}$ norm minimization ($2DSFDA-L_{2,1}$) is proposed. $2DSFDA-L_{2,1}$ integrates $L_{2,1}$ norm regularization and 2D statically uncorrelated constraint to extract discriminant feature. First, $L_{2,1}$ norm regularization can promote the projection matrix row-sparsity, which makes the feature selection and subspace learning simultaneously. Second, uncorrelated features of minimum redundancy are effective for classification. We define 2D statistically uncorrelated model that each row (or column) are independent. Third, we provide a feasible solution by transforming the proposed $L_{2,1}$ nonlinear model into a linear regression type. Additionally, $2DSFDA-L_{2,1}$ is extended to a bilateral projection version called $BSFDA-L_{2,1}$. The advantage of $BSFDA-L_{2,1}$ is that an image can be represented with much less coefficients. Experimental results on three face databases demonstrate that the proposed $2DSFDA-L_{2,1}/BSFDA-L_{2,1}$ can obtain competitive performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.3
• /
• pp.2141-2145
• /
• 2015

A new broadcasting signal transmission, which can save its channel bandwidth using compressive sensing(CS), is proposed in this paper. A new compression technique, which uses two dimensional discrete wavelet transform technique, is proposed to get high sparsity of multimedia image. A L1 minimization technique based on orthogonal matching pursuit is also introduced in order to reconstruct the compressed multimedia image. The CS enables us to save the channel bandwidth of wired and wireless broadcasting signal because various transmitted data are compressed using it. A $256{\times}256$ gray-scale image with compression rato of 20 %, which is sampled by 10 Gs/s, was transmitted to an optical receiver through 20-km optical transmission and then was reconstructed successfully using L1 minimization (bit error rate of $10^{-12}$ at the received optical power of -12.2 dB).

• Smart Structures and Systems
• /
• v.34 no.2
• /
• pp.97-116
• /
• 2024

The standard l₁-norm regularization is recently introduced for impact force identification, but generally underestimates the peak force. Compared to l₁-norm regularization, l_p-norm (0 ≤ p < 1) regularization, with a nonconvex penalty function, has some promising properties such as enforcing sparsity. In the framework of sparse regularization, if the desired solution is sparse in the time domain or other domains, the under-determined problem with fewer measurements than candidate excitations may obtain the unique solution, i.e., the sparsest solution. Considering the joint sparse structure of impact force in temporal and spatial domains, we propose a general l_p-norm (0 ≤ p < 1) regularization methodology for simultaneous identification of the impact location and force time-history from highly incomplete measurements. Firstly, a nonconvex optimization model based on l_p-norm penalty is developed for regularizing the highly under-determined problem of impact force identification. Secondly, an iteratively reweighed l₁-norm algorithm is introduced to solve such an under-determined and unconditioned regularization model through transforming it into a series of l₁-norm regularization problems. Finally, numerical simulation and experimental validation including single-source and two-source cases of impact force identification are conducted on plate structures to evaluate the performance of l_p-norm (0 ≤ p < 1) regularization. Both numerical and experimental results demonstrate that the proposed l_p-norm regularization method, merely using a single accelerometer, can locate the actual impacts from nine fixed candidate sources and simultaneously reconstruct the impact force time-history; compared to the state-of-the-art l₁-norm regularization, l_p-norm (0 ≤ p < 1) regularization procures sufficiently sparse and more accurate estimates; although the peak relative error of the identified impact force using l_p-norm regularization has a decreasing tendency as p is approaching 0, the results of l_p-norm regularization with 0 ≤ p ≤ 1/2 have no significant differences.

• Current Optics and Photonics
• /
• v.5 no.3
• /
• pp.270-277
• /
• 2021

The adaptive sparse representation (ASR) can effectively combine the structure information of a sample dictionary and the sparsity of coding coefficients. This algorithm can effectively consider the correlation between training samples and convert between sparse representation-based classifier (SRC) and collaborative representation classification (CRC) under different training samples. Unlike SRC and CRC which use fixed norm constraints, ASR can adaptively adjust the constraints based on the correlation between different training samples, seeking a balance between l₁ and l₂ norm, greatly strengthening the robustness and adaptability of the classification algorithm. The correlation coefficients (CC) can better identify the pixels with strong correlation. Therefore, this article proposes a hyperspectral image classification method called correlation coefficients and adaptive sparse representation (CCASR), based on ASR and CC. This method is divided into three steps. In the first step, we determine the pixel to be measured and calculate the CC value between the pixel to be tested and various training samples. Then we represent the pixel using ASR and calculate the reconstruction error corresponding to each category. Finally, the target pixels are classified according to the reconstruction error and the CC value. In this article, a new hyperspectral image classification method is proposed by fusing CC and ASR. The method in this paper is verified through two sets of experimental data. In the hyperspectral image (Indian Pines), the overall accuracy of CCASR has reached 0.9596. In the hyperspectral images taken by HIS-300, the classification results show that the classification accuracy of the proposed method achieves 0.9354, which is better than other commonly used methods.