scholarly journals GSPL: A Succinct Kernel Model for Group-Sparse Projections Learning of Multiview Data

2021 ◽  
Author(s):  
Danyang Wu ◽  
Jin Xu ◽  
Xia Dong ◽  
Meng Liao ◽  
Rong Wang ◽  
...  
Keyword(s):  
Feature Selection ◽  
Iterative Algorithm ◽  
Optimization Problem ◽  
Selection Task ◽  
Experimental Results ◽  
Multiple Views ◽  
Intrinsic Parameters ◽  
Norm Constraint ◽  
Kernel Model

This paper explores a succinct kernel model for Group-Sparse Projections Learning (GSPL), to handle multiview feature selection task completely. Compared to previous works, our model has the following useful properties: 1) Strictness: GSPL innovatively learns group-sparse projections strictly on multiview data via ‘2;0-norm constraint, which is different with previous works that encourage group-sparse projections softly. 2) Adaptivity: In GSPL model, when the total number of selected features is given, the numbers of selected features of different views can be determined adaptively, which avoids artificial settings. Besides, GSPL can capture the differences among multiple views adaptively, which handles the inconsistent problem among different views. 3) Succinctness: Except for the intrinsic parameters of projection-based feature selection task, GSPL does not bring extra parameters, which guarantees the applicability in practice. To solve the optimization problem involved in GSPL, a novel iterative algorithm is proposed with rigorously theoretical guarantees. Experimental results demonstrate the superb performance of GSPL on synthetic and real datasets.

scholarly journals Multi-view Clustering via Late Fusion Alignment Maximization

2019 ◽  
Author(s):  
Siwei Wang ◽  
Xinwang Liu ◽  
En Zhu ◽  
Chang Tang ◽  
Jiyuan Liu ◽  
...  
Keyword(s):  
Computational Complexity ◽  
Iterative Algorithm ◽  
Optimization Problem ◽  
Optimization Procedure ◽  
Multiple Views ◽  
Late Fusion ◽  
Complementary Information ◽  
Benchmark Datasets ◽  
Effectiveness And Efficiency ◽  
Consensus Partition

Multi-view clustering (MVC) optimally integrates complementary information from different views to improve clustering performance. Although demonstrating promising performance in many applications, we observe that most of existing methods directly combine multiple views to learn an optimal similarity for clustering. These methods would cause intensive computational complexity and over-complicated optimization. In this paper, we theoretically uncover the connection between existing k-means clustering and the alignment between base partitions and consensus partition. Based on this observation, we propose a simple but effective multi-view algorithm termed {Multi-view Clustering via Late Fusion Alignment Maximization (MVC-LFA)}. In specific, MVC-LFA proposes to maximally align the consensus partition with the weighted base partitions. Such a criterion is beneficial to significantly reduce the computational complexity and simplify the optimization procedure. Furthermore, we design a three-step iterative algorithm to solve the new resultant optimization problem with theoretically guaranteed convergence. Extensive experiments on five multi-view benchmark datasets demonstrate the effectiveness and efficiency of the proposed MVC-LFA.

Feature Extraction for Kernel Minimum Squared Error by Sparsity Shrinkage

2014 ◽  
Vol 536-537 ◽  
pp. 450-453 ◽  
Author(s):  
Jiang Jiang ◽  
Xi Chen ◽  
Hai Tao Gan
Keyword(s):  
Feature Extraction ◽  
Feature Selection ◽  
Optimization Problem ◽  
Subset Selection ◽  
Experimental Results ◽  
Computational Burden ◽  
Squared Error ◽  
Kernel Minimum Squared Error ◽  
Benchmark Datasets ◽  
Training Examples

In this paper, a sparsity based model is proposed for feature selection in kernel minimum squared error (KMSE). By imposing a sparsity shrinkage term, we formulate the procedure of subset selection as an optimization problem. With the chosen small portion of training examples, the computational burden of feature extraction is largely alleviated. Experimental results conducted on several benchmark datasets indicate the effectivity and efficiency of our method.

scholarly journals Fault diagnosis of bearing based on relevance vector machine classifier with improved binary bat algorithm for feature selection and parameter optimization

2017 ◽  
Vol 9 (1) ◽  
pp. 168781401668529 ◽  
Author(s):  
Sheng-wei Fei
Keyword(s):  
Feature Selection ◽  
Fault Diagnosis ◽  
Parameter Optimization ◽  
Bat Algorithm ◽  
Relevance Vector Machine ◽  
Experimental Results ◽  
Machine Method ◽  
Training Samples ◽  
Kernel Parameter

In this article, fault diagnosis of bearing based on relevance vector machine classifier with improved binary bat algorithm is proposed, and the improved binary bat algorithm is used to select the appropriate features and kernel parameter of relevance vector machine. In the improved binary bat algorithm, the new velocities updating method of the bats is presented in order to ensure the decreasing of the probabilities of changing their position vectors’ elements when the position vectors’ elements of the bats are equal to the current best location’s element, and the increasing of the probabilities of changing their position vectors’ elements when the position vectors’ elements of the bats are unequal to the current best location’s element, which are helpful to strengthen the optimization ability of binary bat algorithm. The traditional relevance vector machine trained by the training samples with the unreduced features can be used to compare with the proposed improved binary bat algorithm–relevance vector machine method. The experimental results indicate that improved binary bat algorithm–relevance vector machine has a stronger fault diagnosis ability of bearing than the traditional relevance vector machine trained by the training samples with the unreduced features, and fault diagnosis of bearing based on improved binary bat algorithm–relevance vector machine is feasible.

scholarly journals Cross-View Local Structure Preserved Diversity and Consensus Learning for Multi-View Unsupervised Feature Selection

2019 ◽  
Vol 33 ◽  
pp. 5101-5108 ◽  
Author(s):  
Chang Tang ◽  
Xinzhong Zhu ◽  
Xinwang Liu ◽  
Lizhe Wang
Keyword(s):  
Feature Selection ◽  
Local Structure ◽  
Feature Subset ◽  
Unsupervised Feature Selection ◽  
Semantic Learning ◽  
Common Information ◽  
Semantic Label ◽  
Similarity Graph ◽  
Feature Projection ◽  
Norm Constraint

Multi-view unsupervised feature selection (MV-UFS) aims to select a feature subset from multi-view data without using the labels of samples. However, we observe that existing MV-UFS algorithms do not well consider the local structure of cross views and the diversity of different views, which could adversely affect the performance of subsequent learning tasks. In this paper, we propose a cross-view local structure preserved diversity and consensus semantic learning model for MV-UFS, termed CRV-DCL briefly, to address these issues. Specifically, we project each view of data into a common semantic label space which is composed of a consensus part and a diversity part, with the aim to capture both the common information and distinguishing knowledge across different views. Further, an inter-view similarity graph between each pairwise view and an intra-view similarity graph of each view are respectively constructed to preserve the local structure of data in different views and different samples in the same view. An l2,1-norm constraint is imposed on the feature projection matrix to select discriminative features. We carefully design an efficient algorithm with convergence guarantee to solve the resultant optimization problem. Extensive experimental study is conducted on six publicly real multi-view datasets and the experimental results well demonstrate the effectiveness of CRV-DCL.

scholarly journals PredAmyl-MLP: Prediction of Amyloid Proteins Using Multilayer Perceptron

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Yanjuan Li ◽  
Zitong Zhang ◽  
Zhixia Teng ◽  
Xiaoyan Liu
Keyword(s):  
Feature Extraction ◽  
Feature Selection ◽  
Prediction Model ◽  
Multilayer Perceptron ◽  
Type Ii Diabetes ◽  
Cross Validation ◽  
Experimental Results ◽  
Type Ii ◽  
Fold Cross Validation ◽  
Better Than

Amyloid is generally an aggregate of insoluble fibrin; its abnormal deposition is the pathogenic mechanism of various diseases, such as Alzheimer’s disease and type II diabetes. Therefore, accurately identifying amyloid is necessary to understand its role in pathology. We proposed a machine learning-based prediction model called PredAmyl-MLP, which consists of the following three steps: feature extraction, feature selection, and classification. In the step of feature extraction, seven feature extraction algorithms and different combinations of them are investigated, and the combination of SVMProt-188D and tripeptide composition (TPC) is selected according to the experimental results. In the step of feature selection, maximum relevant maximum distance (MRMD) and binomial distribution (BD) are, respectively, used to remove the redundant or noise features, and the appropriate features are selected according to the experimental results. In the step of classification, we employed multilayer perceptron (MLP) to train the prediction model. The 10-fold cross-validation results show that the overall accuracy of PredAmyl-MLP reached 91.59%, and the performance was better than the existing methods.

scholarly journals End-to-End Game-Focused Learning of Adversary Behavior in Security Games

2020 ◽  
Vol 34 (02) ◽  
pp. 1378-1386
Author(s):  
Andrew Perrault ◽  
Bryan Wilder ◽  
Eric Ewing ◽  
Aditya Mate ◽  
Bistra Dilkina ◽  
...  
Keyword(s):  
Expected Utility ◽  
Optimization Problem ◽  
Predictive Accuracy ◽  
Experimental Results ◽  
Limited Data ◽  
Two Stage ◽  
Security Games ◽  
End To End ◽  
Feature Values ◽  
Adversary Model

Stackelberg security games are a critical tool for maximizing the utility of limited defense resources to protect important targets from an intelligent adversary. Motivated by green security, where the defender may only observe an adversary's response to defense on a limited set of targets, we study the problem of learning a defense that generalizes well to a new set of targets with novel feature values and combinations. Traditionally, this problem has been addressed via a two-stage approach where an adversary model is trained to maximize predictive accuracy without considering the defender's optimization problem. We develop an end-to-end game-focused approach, where the adversary model is trained to maximize a surrogate for the defender's expected utility. We show both in theory and experimental results that our game-focused approach achieves higher defender expected utility than the two-stage alternative when there is limited data.

scholarly journals Detecting Shilling Attacks with Automatic Features from Multiple Views

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Yaojun Hao ◽  
Fuzhi Zhang ◽  
Jian Wang ◽  
Qingshan Zhao ◽  
Jianfang Cao
Keyword(s):  
Principal Component Analysis ◽  
Recommender Systems ◽  
Detection Method ◽  
Principal Component ◽  
Component Analysis ◽  
Experimental Results ◽  
Detection Methods ◽  
Detection Accuracy ◽  
Multiple Views ◽  
Fine Grained

Due to the openness of the recommender systems, the attackers are likely to inject a large number of fake profiles to bias the prediction of such systems. The traditional detection methods mainly rely on the artificial features, which are often extracted from one kind of user-generated information. In these methods, fine-grained interactions between users and items cannot be captured comprehensively, leading to the degradation of detection accuracy under various types of attacks. In this paper, we propose an ensemble detection method based on the automatic features extracted from multiple views. Firstly, to collaboratively discover the shilling profiles, the users’ behaviors are analyzed from multiple views including ratings, item popularity, and user-user graph. Secondly, based on the data preprocessed from multiple views, the stacked denoising autoencoders are used to automatically extract user features with different corruption rates. Moreover, the features extracted from multiple views are effectively combined based on principal component analysis. Finally, according to the features extracted with different corruption rates, the weak classifiers are generated and then integrated to detect attacks. The experimental results on the MovieLens, Netflix, and Amazon datasets indicate that the proposed method can effectively detect various attacks.

scholarly journals An Algorithm for Accurate and Robust Indoor Localization Based on Nonlinear Programming

Electronics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 65 ◽  
Author(s):  
Stefania Monica ◽  
Federico Bergenti
Keyword(s):  
Nonlinear Programming ◽  
Mobile Devices ◽  
Optimization Problem ◽  
Indoor Localization ◽  
Wide Band ◽  
Location Based Services ◽  
Experimental Results ◽  
Indoor Environments ◽  
Anchor Nodes ◽  
The Impact

The study of techniques to estimate the position of mobile devices with a high level of accuracy and robustness is essential to provide advanced location based services in indoor environments. An algorithm to enable mobile devices to estimate their positions in known indoor environments is proposed in this paper under the assumption that fixed anchor nodes are available at known locations. The proposed algorithm is specifically designed to be executed on the mobile device whose position is under investigation, and it allows the device to estimate its position within the environment by actively measuring distance estimates from the anchor nodes. In order to reduce the impact of the errors caused by the arrangement of the anchor nodes in the environment, the proposed algorithm first transforms the localization problem into an optimization problem, and then, it solves the derived optimization problem using techniques inspired by nonlinear programming. Experimental results obtained using ultra-wide band signaling are presented to assess the performance of the algorithm and to compare it with reference alternatives. The presented experimental results confirm that the proposed algorithm provides an increased level of accuracy and robustness with respect to two reference alternatives, regardless of the position of the anchor nodes.

Sign in / Sign up

Export Citation Format

Share Document