March 2024
What is this page?
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
Publications (12)
February 2023
·
78 Reads
·
8 Citations
Mathematical Modelling and Control
Collaborative filtering (CF) algorithm is one of the most widely used recommendation algorithms in recommender systems. However, there is a data sparsity problem in the traditional CF algorithm, which may reduce the recommended efficiency of recommender systems. This paper proposes an improved collaborative filtering personalized recommendation (ICF) algorithm, which can effectively improve the data sparsity problem by reducing item space. By using the k-means clustering method to secondarily extract the similarity information, ICF algorithm can obtain the similarity information of users more accurately, thus improving the accuracy of recommender systems. The experiments using MovieLens and Netflix data set show that the ICF algorithm has a significant improvement in the accuracy and quality of recommendation.
January 2023
·
7 Reads
Open Journal of Applied Sciences
January 2022
·
53 Reads
Journal of Applied Mathematics and Physics
June 2021
·
64 Reads
·
6 Citations
In this study, we studied the eigenvalue spectrum and synchronizability of two types of double-layer hybrid directionally coupled star-ring networks, namely, the double-layer star-ring networks with the leaf node pointing to the hub node (Network I) and the double-layer star-ring networks with the hub node pointing to the leaf node (Network II). We strictly derived the eigenvalue spectrum of the supra-Laplacian matrix of these two types of networks and analyzed the relationship between the synchronizability and the structural parameters of networks based on the master stability function theory. Furthermore, the correctness of the theoretical results was verified through numerical simulations, and the optimum structural parameters were obtained to achieve the optimal synchronizability.
January 2021
·
32 Reads
·
1 Citation
Journal of Applied Mathematics and Physics
July 2020
·
47 Reads
·
7 Citations
Journal of Geometric Analysis
The existence of nontrivial solutions for the following kind of Klein–Gordon–Maxwell system is investigated, where is a constant, is either periodic or coercive and is allowed to be sign-changing, and f is subcritical and local super-linear. Using local super-quadratic conditions and other suitable assumptions on the nonlinearity f(x, u) and the potential V(x), the existence of nontrivial solutions for the above system is established. The obtained results in this paper improve the related ones in the literature.
May 2020
·
183 Reads
·
11 Citations
Mathematical Methods in the Applied Sciences
In this paper, we intend to study the following Klein‐Gordon‐Maxwell system: −Δu+(λA(x)+1)u−(2ω+φ)φu=f(u),x∈ℝ3,Δφ=(ω+φ)u2,x∈ℝ3. By adopting some new analytical skills and employing variational methods, the existence of a ground state solution for the above system is established under suitable conditions on A and f . The range of ω is more wider than Liu et al., Theorem 1.1
April 2020
·
125 Reads
·
9 Citations
Synchronization of multilayer complex networks is one of the important frontier issues in network science. In this paper, we strictly derived the analytic expressions of the eigenvalue spectrum of multilayer star and star-ring networks and analyzed the synchronizability of these two networks by using the master stability function (MSF) theory. In particular, we investigated the synchronizability of the networks under different interlayer coupling strength, and the relationship between the synchronizability and structural parameters of the networks (i.e., the number of nodes, intralayer and interlayer coupling strengths, and the number of layers) is discussed. Finally, numerical simulations demonstrated the validity of the theoretical results.
September 2019
·
27 Reads
·
19 Citations
Physica A Statistical Mechanics and its Applications
Synchronization phenomena are of broad interest across disciplines and increasingly of interest in a multiplex network setting. In this paper, the problem of synchronization of two multiplex chain networks is investigated, according to the master stability function method. We define two kinds of multiplex chain networks according to different coupling modes: one is a class of the multiplex chain networks with one-to-one undirected coupling between layers(Networks-A), and the other is a class of the multiplex chain networks with one-to-one unidirectional coupling between layers(Networks-B). The eigenvalue spectrum of the supra-Laplacian matrices of two kinds of the networks is strictly derived theoretically, and the relationships between the structural parameters and synchronizability of the networks are further revealed. The structural parameter values of the networks to achieve the optimal synchronizability are obtained. Numerical examples are also provided to verify the effectiveness of theoretical analysis.
Citations (8)
... Huang et al. [27] introduced an enhanced CF personalized recommendation "(ICF)" algorithm designed to effectively address the issue of "data sparsity" by minimizing the item space. By employing the "k-means clustering" method to extract similarity information secondarily, the "ICF" algorithm more accurately acquires user similarity information, thereby enhancing the precision of recommender systems. ...
- Citing Article
- Full-text available
February 2023
Mathematical Modelling and Control
... To solve the coordination problems, the connecting relations of the networked systems are always characterized by the graph structures ( ). There exists a lot of important articles on coordination topics related to the approach of graph theory [1,[10][11][12][13][14][15][16][17][18][19][20][21][22]. In the enlightening articles, Ref. [10] described the robustness of the systems by Laplacian eigenvalues of some classic graphs. ...
- Citing Article
- Full-text available
June 2021
... In [13], they studied the existence of infnitely many radially symmetric solutions for problem (2) under one of the following conditions: (1) has two nontrivial solutions if h is nonzero and has infnitely many solutions when f is odd in u and h ≡ 0. When system (1) is related with steep potential well, Zhang, Gan, Xiao, and Jia [18] obtained the existence result of a ground state solution, which improves the range of ω. Other related studies on the Klein-Gordon-Maxwell equations can be seen in [19][20][21][22][23][24][25][26][27][28] and reference therein. ...
- Citing Article
July 2020
Journal of Geometric Analysis
... In [12], D'Aprile and Mugnai showed that system (2) only has a trivial solution when 0 < q ≤ 2 or q ≥ 6. In [13], they studied the existence of infnitely many radially symmetric solutions for problem (2) under one of the following conditions: (1) has two nontrivial solutions if h is nonzero and has infnitely many solutions when f is odd in u and h ≡ 0. When system (1) is related with steep potential well, Zhang, Gan, Xiao, and Jia [18] obtained the existence result of a ground state solution, which improves the range of ω. Other related studies on the Klein-Gordon-Maxwell equations can be seen in [19][20][21][22][23][24][25][26][27][28] and reference therein. ...
- Citing Article
- Full-text available
May 2020
Mathematical Methods in the Applied Sciences
... Later, people studied the influence of the number and mode of interlayer connections on the synchronizability [16][17][18]. On the basis of single-layer networks research, the study of network synchronizability is also extended to M-layer and more complex network structures [19][20][21][22]. But the above researches all consider the same structure for different layers. ...
- Citing Article
- Full-text available
April 2020
... In [10]- [16], synchronization of multiplex networks was analyzed. In [11], [12], the following model was studied ...
- Citing Article
September 2019
Physica A Statistical Mechanics and its Applications
... In Fig. 4, the cluster synchronizability ratio, ρ, is plotted vs. the minimum of the negative of the eigenvalues, µ R min , in the interval 0.1 to 14 for each real network. In order to vary µ R min , we vary the self-loop coupling strength κ. Figure 4 shows that in general: (i) networks with more clusters are more difficult to cluster-synchronize than networks with fewer clusters and (ii) network with more nodes are more difficult to cluster-synchronize than networks with fewer nodes, see also 7,23 . Interestingly, we see that for all the real networks represented in the figure and for each value of the parameter κ, there is at least a pair of blocks that are related by Partially Disjoint CS. ...
- Citing Article
- Full-text available
January 2019
Communications and Network
... The type of data and the purpose of application are the main points to choose the best clustering method. Many researches have used clustering algorithms, like Hierarchical clustering [12], k−means clustering [13] [14] in applications. Partitioning methods work based on iterative reallocating data objects among subsets and determine the initial number of subsets. ...
- Citing Article
- Full-text available
January 2019
Communications and Network