Active Sample Selection Based Incremental Algorithm for Attribute Reduction with Rough Sets

Attribute reduction with rough sets is an effective technique for obtaining a compact and informative attribute set from a given dataset. However, traditional algorithms have no explicit provision for handling dynamic datasets where data present themselves in successive samples. Incremental algorithms for attribute reduction with rough sets have been recently introduced to handle dynamic datasets with large samples, though they have high complexity in time and space. To address the time/space complexity issue of the algorithms, this paper presents a novel incremental algorithm for attribute reduction with rough sets based on the adoption of an active sample selection process and an insight into the attribute reduction process. This algorithm first decides whether each incoming sample is useful with respect to the current dataset by the active sample selection process. A useless sample is discarded while a useful sample is selected to update a reduct. At the arrival of a useful sample, the attribute reduction process is then employed to guide how to add and/or delete attributes in the current reduct. The two processes thus constitute the theoretical framework of our algorithm. The proposed algorithm is finally experimentally shown to be efficient in time and space

Parameterized Local Reduction of Decision Systems

One important and valuable topic in rough sets is attribute reduction of a decision system. The existing attribute reductions are designed to just keep confidence of every certain rule as they cannot identify key conditional attributes explicitly for special decision rules. In this paper, we develop the concept of -local reduction in order to offer a minimal description for special -possible decision rules. The approach of discernibility matrix is employed to investigate the structure of a -local reduction and compute all -local reductions. An example of medical diagnosis is employed to illustrate our idea of the -local reduction. Finally, numerical experiments are performed to show that our method proposed in this paper is feasible and valid

Terminal Sliding Mode Control with Adaptive Feedback Control in a Class of Chaotic Systems

This paper analyzes semifinite time stability for a general chaotic system. By cooperating methods terminal sliding mode (TSM) with adaptive feedback control (AFC), a controller based on the two methods is derived to achieve semifinite time stability. The theoretical analysis employs the theories of linear matrix inequalities and Lyapunov functional method. Finally, numerical simulation is given to illustrate the derived theoretical results

AKConv: Convolutional Kernel with Arbitrary Sampled Shapes and Arbitrary Number of Parameters

Neural networks based on convolutional operations have achieved remarkable results in the field of deep learning, but there are two inherent flaws in standard convolutional operations. On the one hand, the convolution operation be confined to a local window and cannot capture information from other locations, and its sampled shapes is fixed. On the other hand, the size of the convolutional kernel is fixed to k $\times$ k, which is a fixed square shape, and the number of parameters tends to grow squarely with size. It is obvious that the shape and size of targets are various in different datasets and at different locations. Convolutional kernels with fixed sample shapes and squares do not adapt well to changing targets. In response to the above questions, the Alterable Kernel Convolution (AKConv) is explored in this work, which gives the convolution kernel an arbitrary number of parameters and arbitrary sampled shapes to provide richer options for the trade-off between network overhead and performance. In AKConv, we define initial positions for convolutional kernels of arbitrary size by means of a new coordinate generation algorithm. To adapt to changes for targets, we introduce offsets to adjust the shape of the samples at each position. Moreover, we explore the effect of the neural network by using the AKConv with the same size and different initial sampled shapes. AKConv completes the process of efficient feature extraction by irregular convolutional operations and brings more exploration options for convolutional sampling shapes. Object detection experiments on representative datasets COCO2017, VOC 7+12 and VisDrone-DET2021 fully demonstrate the advantages of AKConv. AKConv can be used as a plug-and-play convolutional operation to replace convolutional operations to improve network performance. The code for the relevant tasks can be found at https://github.com/CV-ZhangXin/AKConv.Comment: 10 pages, 5 figure

RFAConv: Innovating Spatital Attention and Standard Convolutional Operation

Spatial attention has been widely used to improve the performance of convolutional neural networks by allowing them to focus on important information. However, it has certain limitations. In this paper, we propose a new perspective on the effectiveness of spatial attention, which is that it can solve the problem of convolutional kernel parameter sharing. Despite this, the information contained in the attention map generated by spatial attention is not sufficient for large-size convolutional kernels. Therefore, we introduce a new attention mechanism called Receptive-Field Attention (RFA). While previous attention mechanisms such as the Convolutional Block Attention Module (CBAM) and Coordinate Attention (CA) only focus on spatial features, they cannot fully address the issue of convolutional kernel parameter sharing. In contrast, RFA not only focuses on the receptive-field spatial feature but also provides effective attention weights for large-size convolutional kernels. The Receptive-Field Attention convolutional operation (RFAConv), developed by RFA, represents a new approach to replace the standard convolution operation. It offers nearly negligible increment of computational cost and parameters, while significantly improving network performance. We conducted a series of experiments on ImageNet-1k, MS COCO, and VOC datasets, which demonstrated the superiority of our approach in various tasks including classification, object detection, and semantic segmentation. Of particular importance, we believe that it is time to shift focus from spatial features to receptive-field spatial features for current spatial attention mechanisms. By doing so, we can further improve network performance and achieve even better results. The code and pre-trained models for the relevant tasks can be found at https://github.com/Liuchen1997/RFAConv.Comment: 14 pages, 5 figure

Comparison between New-Onset and Old-Diagnosed Type 2 Diabetes with Ketosis in Rural Regions of China

Objectives. Type 2 diabetes (T2D) with ketosis was common because of late diagnosis and lacking adequate treatment in rural regions of China. This study aimed to provide the data of T2D with ketosis among inpatients in a south-west border city of China. Methods. Data of 371 patients of T2D with ketosis who were hospitalized between January 2011 and July 2015 in Baoshan People’s Hospital, Yunnan, China, were analyzed. New-onset and old-diagnosed T2D patients presenting with ketosis were compared according to clinical characteristics, laboratory results, and chronic diabetic complications. Results. Overall, the blood glucose control was poor in our study subjects. Male predominated in both groups (male prevalence was 68% in new-onset and 64% in old-diagnosed groups). Overweight and obesity accounted for 50% in new-onset and 46% in old-diagnosed cases. Inducements of ketosis were 13.8% in new-onset and 38.7% in old-diagnosed patients. Infections were the first inducements in both groups. The prevalence of chronic complications of diabetes was common in both groups. Conclusions. More medical supports were needed for the early detection and adequate treatment of diabetes in rural areas of China