Attribute Reduction Algorithm of Neighborhood Rough Set Based on Supervised Granulation and Its Application

In neighborhood rough set theory, attribute reduction based on measure of information has important application significance. The influence of different decision classes was not considered for calculation of traditional conditional neighborhood entropy, and the improvement of algorithm based on conditional neighborhood entropy mainly includes of introducing multi granularity and different levels, while the mutual influence between samples with different labels is less considered. To solve this problem, this paper uses the supervised strategy to improve the conditional neighborhood entropy of three-layer granulation. By using two different neighborhood radii to adjust the mutual influence degree of different label samples, and by considering the mutual influence between conditional attributes through the feature complementary relationship, a neighborhood rough set attribute reduction algorithm based on supervised granulation is proposed. Experiment results on UCI data sets show that the proposed algorithm is superior to the traditional conditional neighborhood entropy algorithm in both aspects of reduction rate and reduction accuracy. Finally, the proposed algorithm is applied to the evaluation of fatigue life influencing factors of titanium alloy welded joints. The results of coupling relationship analysis show that the effect of joint type should be most seriously considered in the calculation of stress concentration factor. The results of influencing factors analysis show that the stress range has the highest weight among all the fatigue life influencing factors of titanium alloy welded joint.

An Efficient Adaptive and Steep-Convergent Sidelobes Simultaneous Reduction Algorithm for Massive Linear Arrays

Antenna arrays have become an essential part of most wireless communications systems. In this paper, the unwanted sidelobes in the symmetric linear array power pattern are reduced efficiently by utilizing a faster simultaneous sidelobes processing algorithm, which generates nulling sub-beams that are adapted to control and maintain steep convergence toward lower sidelobe levels. The proposed algorithm is performed using adaptive damping and heuristic factors which result in learning curve perturbations during the first few loops of the reduction process and is followed by a very steep convergence profile towards deep sidelobe levels. The numerical results show that, using the proposed adaptive sidelobes simultaneous reduction algorithm, a maximum sidelobe level of −50 dB can be achieved after only 10 iteration loops (especially for very large antenna arrays formed by 256 elements, wherein the processing time is reduced to approximately 25% of that required by the conventional fixed damping factor case). On the other hand, the generated array weights can be applied to practical linear antenna arrays under mutual coupling effects, which have shown very similar results to the radiation pattern of the isotropic antenna elements with very deep sidelobe levels and the same beamwidth.

Integration of Feature Vectors from Raw Laboratory, Medication and Procedure Names Improves the Precision and Recall of Models to Predict Postoperative Mortality and Acute Kidney Injury

Introduction: Manuscripts that have successfully used machine learning (ML) to predict a variety of perioperative outcomes often use only a limited number of features selected by a clinician. We hypothesized that techniques leveraging a broad set of features for patient laboratory results, medications, and the surgical procedure name would improve performance as compared to a more limited set of features chosen by clinicians. Methods Feature vectors for laboratory results included 702 features total derived from 39 laboratory tests, medications consisted of a binary flag for 126 commonly used medications, procedure name used the Word2Vec package for create a vector of length 100. Nine models were trained: Baseline Features, one for each of the three types of data Baseline+Each data type (, all features, and then all features with feature reduction algorithm. Results Across both outcomes the models that contained all features (model 8) (Mortality ROC-AUC 94.42, PR-AUC 31.0; AKI ROC-AUC 92.47, PR-AUC 76.73) was superior to models with only subsets of features Conclusion Featurization techniques leveraging a broad away of clinical data can improve performance of perioperative prediction models.

TESS Eclipsing Binary Stars. I. Short-cadence Observations of 4584 Eclipsing Binaries in Sectors 1–26

In this paper we present a catalog of 4584 eclipsing binaries observed during the first two years (26 sectors) of the TESS survey. We discuss selection criteria for eclipsing binary candidates, detection of hitherto unknown eclipsing systems, determination of the ephemerides, the validation and triage process, and the derivation of heuristic estimates for the ephemerides. Instead of keeping to the widely used discrete classes, we propose a binary star morphology classification based on a dimensionality reduction algorithm. Finally, we present statistical properties of the sample, we qualitatively estimate completeness, and we discuss the results. The work presented here is organized and performed within the TESS Eclipsing Binary Working Group, an open group of professional and citizen scientists; we conclude by describing ongoing work and future goals for the group. The catalog is available from http://tessEBs.villanova.edu and from MAST.

Research on Face Image Digital Processing and Recognition Based on Data Dimensionality Reduction Algorithm

Because face recognition is greatly affected by external environmental factors and the partial lack of face information challenges the robustness of face recognition algorithm, while the existing methods have poor robustness and low accuracy in face image recognition, this paper proposes a face image digital processing and recognition based on data dimensionality reduction algorithm. Based on the analysis of the existing data dimensionality reduction and face recognition methods, according to the face image input, feature composition, and external environmental factors, the face recognition and processing technology flow is given, and the face feature extraction method is proposed based on nonparametric subspace analysis (NSA). Finally, different methods are used to carry out comparative experiments in different face databases. The results show that the method proposed in this paper has a higher correct recognition rate than the existing methods and has an obvious effect on the XM2VTS face database. This method not only improves the shortcomings of existing methods in dealing with complex face images but also provides a certain reference for face image feature extraction and recognition in complex environment.

A Clustering Algorithm in Stream Data Using Strong Coreset

There are various applications of clustering in the fields of machine learning, data mining, data compression along with pattern recognition. The existent techniques like the Llyods algorithm (sometimes called k-means) were affected by the issue of the algorithm which converges to a local optimum along with no approximation guarantee. For overcoming these shortcomings, an efficient k-means clustering approach is offered by this paper for stream data mining. Coreset is a popular and fundamental concept for k-means clustering in stream data. In each step, reduction determines a coreset of inputs, and represents the error, where P represents number of input points according to nested property of coreset. Hence, a bit reduction in error of final coreset gets n times more accurate. Therefore, this motivated the author to propose a new coreset-reduction algorithm. The proposed algorithm executed on the Covertype dataset, Spambase dataset, Census 1990 dataset, Bigcross dataset, and Tower dataset. Our algorithm outperforms with competitive algorithms like Streamkm[Formula: see text], BICO (BIRCH meets Coresets for k-means clustering), and BIRCH (Balance Iterative Reducing and Clustering using Hierarchies.