Jia Liu Liu

Dr. Jia Liu Liu

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2024 in Information Fusion
Verified
Journal Article
Closed access
WHWei Huang
Wei Huang
DWDexian Wang
Dexian Wang
XOXiaocao Ouyang
Xiaocao Ouyang
JWJihong Wan
Jihong Wan
JLJia Liu Liu
Jia Liu Liu
TLTianrui Li
Tianrui Li

6 October 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
JWJihong Wan
Jihong Wan
HCHongmei Chen
Hongmei Chen
TLTianrui Li
Tianrui Li
ZYZhong Yuan
Zhong Yuan
JLJia Liu Liu
Jia Liu Liu
WHWei Huang
Wei Huang
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.

30 March 2022 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
DWDexian Wang
Dexian Wang
TLTianrui Li
Tianrui Li
PDPing Deng
Ping Deng
JLJia Liu Liu
Jia Liu Liu
WHWei Huang
Wei Huang
Fan ZhangFan Zhang
Fan Zhang
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.

21 July 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJia Liu Liu
Jia Liu Liu
TLTianrui Li
Tianrui Li
SJShenggong Ji
Shenggong Ji
PXPeng Xie
Peng Xie
SDShengdong Du
Shengdong Du
JZJunbo Zhang
Junbo Zhang
Urban flow analysis is an essential research for smart city construction, in which urban flow pattern analysis focuses on the continuous state of urban flow. How to mine, store and reuse traffic patterns from urban multi-source heterogeneous big data is challenging. Therefore, this paper proposes a knowledge mining network for regional flow pattern to mine and store the urban flow pattern. The proposed model consists of two modules. In the first module, the features of the region and its flow pattern are extracted as the entity and relation, respectively. In the second module, POI features are modeled to enhance the embedding representation of relation and entity. Based on the translation distance method, the knowledge triplets of regional flow patterns are mined. Finally, the proposed model is compared with some benchmark methods using Chengdu Didi order and POI datasets. Experimental results show that the proposed model is effective. In addition, the knowledge triplets are visualized and some application examples are introduced.

24 November 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
WHWei Huang
Wei Huang
JLJia Liu Liu
Jia Liu Liu
TLTianrui Li
Tianrui Li
THTianqiang Huang
Tianqiang Huang
SJShenggong Ji
Shenggong Ji
JWJihong Wan
Jihong Wan
Daily schedule recommendation is an intelligent approach to recommend multiple suitable activity locations and activity sequences for users based on their needs in a day. In such a scenario, training the model using traditional methods requires centralized data collection from individual users, which may be prohibited by data protection acts, such as GDPR and CCPA. In this paper, we address the problem of daily schedule recommendation utilizing the deep reinforcement learning model in a federated learning framework (FedDSR). And curriculum learning is applied to guide the training process towards better local optimization and better generalization. For the uploaded local parameters, a similarity aggregation algorithm is proposed to improve the quality of the model. The experimental results show that the proposed FedDSR model is superior and effective to multiple baselines on two real datasets Geolife and Chengdu . Comparing with baselines, our method not only ensures that the parties do not need to share data and thus achieve joint modeling, but also can exceed $\sim\!\! 18\%$ under evaluation metric perimeter and improve $\sim\! 0.72\%$ under evaluation metric ADTS .

4 May 2023 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
DWDexian Wang
Dexian Wang
TLTianrui Li
Tianrui Li
PDPing Deng
Ping Deng
Fan ZhangFan Zhang
Fan Zhang
WHWei Huang
Wei Huang
JLJia Liu Liu
Jia Liu Liu
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.