Subspace clustering (SC) approximates high-dimensional data as a combination of low-dimensional subspaces, which is suitable for high-dimensional data analysis across various domains including image segmentation and face recognition. Existing SC methods typically obtain the global structure representation solely through the self-representation of the samples, thereby neglecting the intrinsic local connections among the samples. Moreover, due to their inherent framework design, obtaining additional a priori information in unsupervised scenarios presents a significant challenge. To address these limitations, this paper proposes a new method, named Sample-Dependent Subspace Clustering with Elastic Structure Consistency Constraints (SDSC). Firstly, we introduce a new Elastic Structure Consistency Constraints (ESCC) strategy to measure global and local structures elastically. Benefiting from this strategy, SDSC can flexibly explore the structural information within the samples to obtain a comprehensive data representation. By employing the joint regularization term, SDSC can learn effective cluster assignment information directly from the constrained structured data representation, and the cluster assignment information and representation coefficient matrix are smoothly integrated into a unified framework and learn in a mutually reinforcing manner. This learning approach contributes to comprehensive and high-quality clustering results, enhancing the robustness and utility of SDSC. Extensive experiments on several real-world benchmarks and synthetic datasets demonstrate the feasibility and effectiveness of SDSC.

Anomaly detection in multivariate time series (MTS) has been applied to various areas. Recent studies for detecting anomalies in high-dimensional data have yielded promising results. However, these methods are incapable of explicitly dealing with the complex contextual information that exists between features. In this paper, we present a novel unsupervised anomaly detection framework for MTS. We model the complex relationships of MTS using graph attention networks from the perspectives of time and features, respectively. Furthermore, our framework employs masked autoregressive flow for density estimation, which is then treated as an anomaly score, to identify anomalies. Extensive experiments show that our model outperforms baseline approaches in terms of accuracy on three publicly available datasets and accurately captures temporal and inter-feature relationships.

In current storage systems, to protect data security, disk failure prediction is required. Machine learning proved to be a method to solve the problem of disk failure prediction. However, because the disk-related values are affected by factors such as their use and usage environment, the values of different disks in the event of a failure are not the same. The normal value on one disk may be the value when another disk fails. Some studies have introduced the concept of time windows into disk failure prediction, trying to improve the ability of disk failure prediction by studying the relationship of a disk’s value change over time, and achieved good prediction results. We chose the neural network with time-series model to further validate the prediction of time series affect performance, and would like to be able to further improve the prediction performance by using a neural network. In this paper, we will introduce a disk failure prediction system based on LSTM networks. Considering the individual differences of the disks, we replace the input in the LSTM network with the continuous running records of the disks. The network will learn the disk information over a period of time and predict whether this disk will fail. With the proposed approach we are able to predict a disk will fail in next fifteen days with an average precision of 86.31. By comparing with other algorithms, our method performs well.

Multi-Instance Multi-Label learning (MIML) is a popular framework for supervised classification where an example is described by multiple instances and associated with multiple labels. Previous MIML approaches have focused on predicting labels for instances. The idea of tackling the problem is to identify its equivalence in the traditional supervised learning framework. Motivated by the recent advancement in deep learning, in this paper, we still consider the problem of predicting labels and attempt to model deep learning in MIML learning framework. The proposed approach enables us to train deep convolutional neural network with images from social networks where images are well labeled, even labeled with several labels or uncorrelated labels. Experiments on real-world datasets demonstrate the effectiveness of our proposed approach.

Recommender systems are effective in predicting the most suitable products for users, such as movies and books. To facilitate personalized recommendations, the quality of item ratings should be guaranteed. However, a few ratings might not be accurate enough due to the uncertainty of user behavior and are referred to as natural noise. In this article, we present a novel fuzzy clustering‐based method for detecting noisy ratings. The entropy of a subset of the original ratings dataset is used to indicate the data‐driven uncertainty, and evaluation metrics are adopted to represent the prediction‐driven uncertainty. After the repetition of resampling and the execution of a recommendation algorithm, the entropy and evaluation metrics vectors are obtained and are empirically categorized to identify the proportion of the potential noise. Then, the fuzzy C‐means‐based denoising (FCMD) algorithm is performed to verify the natural noise under the assumption that natural noise is primarily the result of the exceptional behavior of users. Finally, a case study is performed using two real‐world datasets. The experimental results show that our proposal outperforms previous proposals and has an advantage in dealing with natural noise.

Recently, machine learning techniques have become an indispensable alternative for computational studies of cancers and efficient prediction of cancer-drug responses or drug resistance levels. Meanwhile, in cancer characterization, molecular dynamics (MD) simulations can greatly reveal the dynamic and functional features of cancer-related proteins. In our work, MD simulations were implemented to extract the EGFR TK mutation (dynamic) features of a non-small-cell lung cancer (NSCLC)-patient group. Specifically, the relative positions of a drug-binding site and a drug molecule in the dynamics-trajectory were calculated and used for characterizing the dynamic features. These derived features, couples with patient personal features, were subsequently handled by a model called SFABSRM, which combines Supervised Factor Analysis and Softmax Regression Model. SFABSRM first uses factor analysis to evaluate the contributions of the selected features, and in our analysis it suggested that dynamic features play an important role in correlating with the cancer-drug responses. Further, SFABSRM applies the regression model for a drug response prediction, which further verified the important contribution of dynamic characteristics to this prediction. The support vector machine (SVM) model was conducted as a comparison with SFABSRM, leading to an agreement with the earlier conclusion. Overall, these studies can greatly benefit the NSCLC studies and drug discovery.

Analyzing the underlying social network is very important for the development of online applications. Owing to the increasingly growing size of these networks, parallel techniques play important roles in many network analysis tasks. In this paper, we explore the link sign prediction problem in large-scale online social networks, and propose a parallel approach, called PLSP, to solve the problem. Specifically, we first extract a set of features that serve as a base for prediction. Experiments on several real datasets show that these features outperform those proposed by existing methods in predictive accuracy. Next, we present two speedup strategies, i.e. dataset division and feature selection, to shorten the training time. Experimental evaluations show that our parallel approach is much faster than the traditional non-parallel method and achieves higher predictive accuracy than other methods at the same time.

This paper proposes a set of adaptive learning rules for binary feedforward neural networks (BFNNs) by means of the sensitivity measure that is established to investigate the effect of a BFNN's weight variation on its output. The rules are based on three basic adaptive learning principles: the benefit principle, the minimal disturbance principle, and the burden-sharing principle. In order to follow the benefit principle and the minimal disturbance principle, a neuron selection rule and a weight adaptation rule are developed. Besides, a learning control rule is developed to follow the burden-sharing principle. The advantage of the rules is that they can effectively guide the BFNN's learning to conduct constructive adaptations and avoid destructive ones. With these rules, a sensitivity-based adaptive learning (SBALR) algorithm for BFNNs is presented. Experimental results on a number of benchmark data demonstrate that the SBALR algorithm has better learning performance than the Madaline rule II and backpropagation algorithms.

Fuzzy biclustering analysis is a useful tool for identifying relevant subsets of microarray data. This paper proposes a fuzzy biclustering clustering method for microarray data analysis. The method employs a combination of the Nelder-Mead and min-max algorithm to construct hierarchically structured biclustering. The method can automatically identify the groups of genes that show similar expression patterns under a specific subset of the samples.