scholarly journals Empirical Comparative Study of Wearable Service Trust Based on User Clustering

2021 ◽  
Vol 33 (6) ◽  
pp. 1-16
Author(s):  
Zhongwei Gu ◽  
Hongjun Xiong ◽  
Wei Hu
Keyword(s):  
Particle Swarm Optimization ◽  
Comparative Study ◽  
Influencing Factors ◽  
Clustering Analysis ◽  
Clustering Algorithm ◽  
Consumption Patterns ◽  
Swarm Optimization ◽  
Clustering Model ◽  
User Clustering ◽  
Chaotic Particle Swarm Optimization

Users of wearable services are different in age, occupation, income, education, personality, values and lifestyle, which also determine their different consumption patterns. Therefore, for the trust of wearable services, the influencing factors or strength may not be the same for different users. This article starts with the resource and motivation dimensions of VALSTM model, and the clustering model and questionnaire scale for consumers of wearable services were constructed. And then the users and potential users of wearable service are clustered by an improved clustering algorithm based on adaptive chaotic particle swarm optimization. Through clustering analysis of 535 valid questionnaires, users are grouped into three types of consumers with different lifestyles, respectively named: trend-following users, fashion-leading users and economic-rational users. Finally, this paper analyzes and compares the trust subgroup models of three clusters, and draws some conclusions.

scholarly journals Empirical Comparative Study of Wearable Service Trust Based on User Clustering

2021 ◽  
Vol 33 (6) ◽  
pp. 0-0
Keyword(s):  
Particle Swarm Optimization ◽  
Comparative Study ◽  
Influencing Factors ◽  
Clustering Analysis ◽  
Clustering Algorithm ◽  
Consumption Patterns ◽  
Swarm Optimization ◽  
Clustering Model ◽  
User Clustering ◽  
Chaotic Particle Swarm Optimization

Users of wearable services are different in age, occupation, income, education, personality, values and lifestyle, which also determine their different consumption patterns. Therefore, for the trust of wearable services, the influencing factors or strength may not be the same for different users. This article starts with the resource and motivation dimensions of VALSTM model, and the clustering model and questionnaire scale for consumers of wearable services were constructed. And then the users and potential users of wearable service are clustered by an improved clustering algorithm based on adaptive chaotic particle swarm optimization. Through clustering analysis of 535 valid questionnaires, users are grouped into three types of consumers with different lifestyles, respectively named: trend-following users, fashion-leading users and economic-rational users. Finally, this paper analyzes and compares the trust subgroup models of three clusters, and draws some conclusions.

scholarly journals Memetic Variable Clustering and Its Application

2019 ◽  
Vol 2019 ◽  
pp. 1-15
Author(s):  
JiaCheng Ni ◽  
Li Li
Keyword(s):  
Particle Swarm Optimization ◽  
Local Search ◽  
Clustering Analysis ◽  
Clustering Algorithm ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Experimental Result ◽  
Swarm Optimization ◽  
Metaheuristic Optimization ◽  
Variable Clustering

Clustering analysis is an important and difficult task in data mining and big data analysis. Although being a widely used clustering analysis technique, variable clustering did not get enough attention in previous studies. Inspired by the metaheuristic optimization techniques developed for clustering data items, we try to overcome the main shortcoming of k-means-based variable clustering algorithm, which is being sensitive to initial centroids by introducing the metaheuristic optimization. A novel memetic algorithm named MCLPSO (Memetic Comprehensive Learning Particle Swarm Optimization) based on CLPSO (Comprehensive Learning Particle Swarm Optimization) has been studied under the framework of memetic computing in our previous work. In this work, MCLPSO is used as a metaheuristic approach to improve the k-means-based variable clustering algorithm by adjusting the initial centroids iteratively to maximize the homogeneity of the clustering results. In MCLPSO, a chaotic local search operator is used and a simulated annealing- (SA-) based local search strategy is developed by combining the cognition-only PSO model with SA. The adaptive memetic strategy can enable the stagnant particles which cannot be improved by the comprehensive learning strategy to escape from the local optima and enable some elite particles to give fine-grained local search around the promising regions. The experimental result demonstrates a good performance of MCLPSO in optimizing the variable clustering criterion on several datasets compared with the original variable clustering method. Finally, for practical use, we also developed a web-based interactive software platform for the proposed approach and give a practical case study—analyzing the performance of semiconductor manufacturing system to demonstrate the usage.

scholarly journals Effectual Clustering and Node Placement with Differential Evolution Particle Swarm Optimization using Markov Chain Clustering in FANET

2019 ◽  
Vol 9 (1) ◽  
pp. 3927-3934
Keyword(s):  
Particle Swarm Optimization ◽  
Markov Chain ◽  
Differential Evolution ◽  
Clustering Algorithm ◽  
Fitness Function ◽  
Particle Swarm ◽  
Future Generation ◽  
Superior Performance ◽  
Swarm Optimization ◽  
Clustering Model

Flying ad hoc network (FANET) comprises of multiple unmanned aerial vehicles (UAVs) which is effectual technology for future generation. In this investigation, the specific way for constructing a FANET topology using clustering technique to achieve end-to-end communication is elaborated. For this purpose, an application that uses the meta-heuristics approach for cluster analysis is anticipated. Specifically, the parameters of differential evolution (DE) and particle swarm optimization (PSO) have gained the attention and extensive popularity in various communities based on its working effectiveness in resolving complex combinational optimization crisis. Thus, hybrid model of DE and PSO based Markov Chain Clustering Model (MCCM) is designed in this investigation to analyse the problems of clustering in FANET and reliability parameters are examined. The proposed (DEPSO-MCM) model is to enhance search capability and to attain superior flexibility in forming nodes cluster. Empirical outcomes demonstrate DEPSOMCM based clustering algorithm attains superior performance in number of epochs to acquire fitness function effectually. The simulation was carried out in NS-2 simulator, the outcomes based on the simulation shows that the proposed method works effectually and shows better trade-off than the existing techniques to provide a meaningful clustering.

Joint user clustering and salp based particle swarm optimization algorithm for power allocation in MIMO-NOMA

2021 ◽  
Vol 40 (5) ◽  
pp. 9007-9019
Author(s):  
Jyotirmayee Subudhi ◽  
P. Indumathi
Keyword(s):  
Energy Efficiency ◽  
Particle Swarm Optimization ◽  
Power Allocation ◽  
Multiple Access ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Allocation Algorithm ◽  
User Clustering ◽  
Sum Rate

Non-Orthogonal Multiple Access (NOMA) provides a positive solution for multiple access issues and meets the criteria of fifth-generation (5G) networks by improving service quality that includes vast convergence and energy efficiency. The problem is formulated for maximizing the sum rate of MIMO-NOMA by assigning power to multiple layers of users. In order to overcome these problems, two distinct evolutionary algorithms are applied. In particular, the recently implemented Salp Swarm Algorithm (SSA) and the prominent Optimization of Particle Swarm (PSO) are utilized in this process. The MIMO-NOMA model optimizes the power allocation by layered transmission using the proposed Joint User Clustering and Salp Particle Swarm Optimization (PPSO) power allocation algorithm. Also, the closed-form expression is extracted from the current Channel State Information (CSI) on the transmitter side for the achievable sum rate. The efficiency of the proposed optimal power allocation algorithm is evaluated by the spectral efficiency, achievable rate, and energy efficiency of 120.8134bits/s/Hz, 98Mbps, and 22.35bits/Joule/Hz respectively. Numerical results have shown that the proposed PSO algorithm has improved performance than the state of art techniques in optimization. The outcomes on the numeric values indicate that the proposed PSO algorithm is capable of accurately improving the initial random solutions and converging to the optimum.

Sign in / Sign up

Export Citation Format

Share Document