Bootstrap aggregative mean shift clustering for big data anti-pattern detection analytics in 5G/6G communication networks

Ramakrishnan, Vinothsaravanan; Palanisamy, C.; Dhanaraj, Rajesh Kumar; Hsu, Ching‐Hsien; Xiao, Yingyuan; Al‐Turjman, Fadi

doi:10.1016/j.compeleceng.2021.107380

Cited by 37 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The clustering is a traditional unsupervised learning method, which means that it does not need to use labeled samples for learning, so its learning effect is often not satisfactory. In contrast, our evaluation of unknown things and people is often not accurate enough [6].…”

Section: Introductionmentioning

confidence: 99%

Analysis of College Students’ Ability to Improve Innovation and Entrepreneurship Based on Constrained Clustering Algorithm

Chen

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

With the expansion of college enrollment, college graduates have continued to expand, and the employment situation has become more and more severe. As a new form of employment, innovation and entrepreneurship are becoming more and more important in college teaching. Entrepreneurial success is crucial. This paper proposes an entropy-based active learning method (ALPCS), which is divided into three stages: selection, exploration, and consolidation. The main contents are as follows: in the selection stage, the fuzzy c -means algorithm is used to obtain the membership of all samples, then calculate their Shannon entropy, and finally, select the sample with large Shannon entropy to generate an information subset (the larger the Shannon entropy, the greater the uncertainty, and the more information it contains). The distance-first strategy actively selects samples from the information subset to construct a cluster skeleton cluster. If it is equal to the real number of clusters, it enters the consolidation phase; otherwise, the active learning method stops. In the consolidation phase, sequentially from the information, the nonskeleton set points with the largest uncertainty are selected in the subset to form queries with the points in the skeleton set until the must-link constraint is formed. In this stage, the principle of minimum symmetric relative entropy first is used to reduce the number of queries. The ALPCS algorithm is compared and evaluated, and the final experimental results show that the ALPCS algorithm has a good performance when the number of queries is large.

show abstract

Section: Introductionmentioning

confidence: 99%