Feature selection has been studied by many researchers using information theory to select the most informative features. Up to now, however, little attention has been paid to the interactivity and complementarity between features and their relationships. In addition, most of the approaches do not cope well with fuzzy and uncertain data and are not adaptable to the distribution characteristics of data. Therefore, to make up for these two deficiencies, a novel interactive and complementary feature selection approach based on fuzzy multineighborhood rough set model (ICFS_FmNRS) is proposed. First, fuzzy multineighborhood granules are constructed to better adapt to the data distribution. Second, feature multicorrelations (i.e., relevancy, redundancy, interactivity, and complementarity) are considered and defined comprehensively using fuzzy multigranularity uncertainty measures. Next, the features with interactivity and complementarity are mined by the forward iterative selection strategy. Finally, compared with the benchmark approaches on several datasets, the experimental results show that ICFS_FmNRS effectively improves the classification performance of feature subsets while reducing the dimension of feature space.
Multi-view clustering research is a hot topic in the field of data mining, where complementary information between views can better describe data objects and improve the clustering performance. Non-negative matrix factorization (NMF) based multi-view clustering algorithm suffers from weak feature extraction, slow convergence speed and low accuracy. To solve these problems, this paper proposes a generalized deep learning multi-view clustering (GDLMC) algorithm based on NMF. Firstly, via decoupling the elements in the matrix, the matrix elements are non-negatively restricted using an activation function with a non-negative value domain, and the elements are updated employing stochastic gradient descent with learning rate guidance. Then, the corresponding gradients when the elements update are transformed into generalized weights and generalized biases, followed by combining the generalized weights and generalized biases with activation functions to construct generalized deep learning (GDL). Further, GDL is adopted to learn the corresponding low-dimensional matrix of each view and consensus matrix for obtaining the GDLMC algorithm. In addition, the detailed reasoning of the GDLMC algorithm are given. Finally, extensive experiments are conducted on four public datasets including regular and large-scale datasets, and the experimental results show that GDLMC has significant advantages.
19 September 2024 in Journal of Parallel and Distributed Computing
As the spatio-temporal data of a city is not always available, insufficient data would lead to poor performance in some urban prediction tasks. Existing works utilize transfer learning to solve the data scarcity problem, but they ignore the differences in data distributions across cities, which leads to the ineffectiveness of knowledge transfer. In this paper, we propose a domain adversarial model with knowledge transfer for spatio-temporal prediction across cities, entitled CityTrans . Specifically, 1) the self-adaptive spatio-temporal knowledge (namely ST-Knowledge) is mined, to learn the latent spatial and temporal patterns among cities; 2) the domain-adversarial training strategy is introduced to enhance domain invariance; 3) a knowledge attention mechanism is proposed to extract the transferable information from the ST-Knowledge. Note that our CityTrans is an end-to-end domain adversarial spatio-temporal network without two-stage training (i.e., pre-training and fine-tuning). Finally, we conduct extensive experiments on two spatio-temporal prediction tasks: traffic (flow and speed) prediction, and air quality prediction. Experimental results demonstrate that CityTrans outperforms state-of-the-art models on all tasks by a significant margin.
4 May 2023 in ACM Transactions on Knowledge Discovery From Data
Clustering is a popular research topic in the field of data mining, in which the clustering method based on non-negative matrix factorization (NMF) has been widely employed. However, in the update process of NMF, there is no learning rate to guide the update as well as the update depends on the data itself, which leads to slow convergence and low clustering accuracy. To solve these problems, a generalized deep learning clustering (GDLC) algorithm based on NMF is proposed in this article. Firstly, a nonlinear constrained NMF (NNMF) algorithm is constructed to achieve sequential updates of the elements in the matrix guided by the learning rate. Then, the gradient values corresponding to the element update are transformed into generalized weights and generalized biases, by inputting the elements as well as their corresponding generalized weights and generalized biases into the nonlinear activation function to construct the GDLC algorithm. In addition, for improving the understanding of the GDLC algorithm, its detailed inference procedure and algorithm design are provided. Finally, the experimental results on eight datasets show that the GDLC algorithm has efficient performance.