基于星座图聚类分析调制识别的改进算法

通过分析聚类分析在星座图中的应用,得出星座图聚类分析对高阶QAM短突发信号的类内调制识别不适用的结论,从而提出了星座图聚类调制识别法在短突发信号的改进方法。将星座点在坐标轴上投影,利用投影点进行聚类分析,可以提高星座聚类算法在高阶QAM短突发信号调制识别中的性能。仿真结果表明,在短突发信号的条件下,该方法具有良好的识别效果。     

基于最佳样本标记的主动支持向量机学习策略

支持向量机通过随机选择标记的训练样本进行有监督学习,随着信息容量的增加和数据收集能力的提高,这需要耗费大量的标记工作量,给实际应用带来不少困难.本文提出了基于最佳样本标记的主动支持向量机学习策略:首先利用无监督聚类选择一个小规模的样本集进行标记,然后训练该标记样本集得到一个初始SVM分类器,然后利用该分类器主动选择最感兴趣的无标记样本进行标记,逐渐增加标记样本的数量,并在此基础上更新分类器,反复进行直到得到最佳性能的分类器.实验结果表明在基本不影响分类精度的情况下,主动学习选择的标记样本数量大大低于随机选择的标记样本数量,这大大降低了标记的工作量,而且训练速度同样有所提高.     

Application of a New Fuzzy Clustering Algorithm in Intrusion Detection

This paper presents a new Section Set Adaptive FCM algorithm. The algorithm solved the shortcomings of localoptimality, unsure classification and clustering numbers ascertained previously. And it improved on the architecture of FCM al-gorithm, enhanced the analysis for effective clustering. During the clustering processing, it may adjust clustering numbers dy-namically. Finally, it used the method of section set decreasing the time of classification. By experiments, the algorithm can im-prove dependability of clustering and correctness of classification.     

The rise and fall of spatio-temporal clusters in mobile ad hoc networks

Cluster detection has been widely applied to the problem of efficient data delivery in highly dynamic mobile ad hoc networks. By grouping participants who meet most often into clusters, hierarchical structures in the network are formed which can be used to efficiently transfer data between the participants. However, data delivery algorithms which rely on clusters can be inefficient in some situations. In the case of dynamic networks formed by encounters between humans, sometimes called Pocket Switched Networks (PSNs), cluster based data delivery methods may see a drop in efficiency if obsolete cluster membership persists despite changes to behavioural patterns. Our work aims to improve the relevance of clusters to particular time frames, and thus improve the performance of cluster based data delivery algorithms in PSNs. Furthermore, we will show that by detecting spatio-temporal clusters in PSNs, we can now improve on the data delivery success rates and efficiency of data delivery algorithms which do not use clustering; something which has been difficult to demonstrate in the past.     

A Max‐Flow‐Based Similarity Measure for Spectral Clustering

In most spectral clustering approaches, the Gaussian kernel‐based similarity measure is used to construct the affinity matrix. However, such a similarity measure does not work well on a dataset with a nonlinear and elongated structure. In this paper, we present a new similarity measure to deal with the nonlinearity issue. The maximum flow between data points is computed as the new similarity, which can satisfy the requirement for similarity in the clustering method. Additionally, the new similarity carries the global and local relations between data. We apply it to spectral clustering and compare the proposed similarity measure with other state‐of‐the‐art methods on both synthetic and real‐world data. The experiment results show the superiority of the new similarity: 1) The max‐flow‐based similarity measure can significantly improve the performance of spectral clustering; 2) It is robust and not sensitive to the parameters.     

A matching game framework for users clustering and resource allocation with wireless power transfer in a CR-NOMA network

This paper investigates the resource allocation in a massively deployed user cognitive radio enabled non-orthogonal multiple access (CR-NOMA) network considering the downlink scenario. The system performance deteriorates with the number of users who are experiencing similar channel characteristics from the base station (BS) in NOMA. To address this challenge, we propose a framework for maximizing the system throughput that is based on one-to-one matching game theory integrated with the machine learning technique. The proposed approach is decomposed to solve users clustering and power allocation subproblems. The selection of optimal cluster heads (CHs) and their associated cluster members is based on Gale-Shapley matching game theoretical model with the application of Hungarian method. The CHs can harvest energy from the BS and transfer their surplus power to the primary user (PU) through wireless power transfer. In return, they are allowed to access the licensed band for secondary transmission. The power allocation to the users intended for power conservation at CHs is formulated as a probabilistic constraint, which is then solved by employing the support vector machine (SVM) algorithm. The simulation results demonstrate the efficacy of our proposed schemes that enable the CHs to transfer the residual power while ensuring maximum system throughput. The effects of different parameters on the performance are also studied.     

DEICA: A differential evolution-based improved clustering algorithm for IoT-based heterogeneous wireless sensor networks

With the evolution of technology, many modern applications like habitat monitoring, environmental monitoring, disaster prediction and management, and telehealth care have been proposed on wireless sensor networks (WSNs) with Internet of Things (IoT) integration. However, the performance of these networks is restricted because of the various constraints imposed due to the participating sensor nodes, such as nonreplaceable limited power units, constrained computation, and limited storage. Power limitation is the most severe among these restrictions. Hence, the researchers have sought schemes enabling energy-efficient network operations as the most crucial issue. A metaheuristic clustering scheme is proposed here to address this problem, which employs the differential evolution (DE) technique as a tool. The proposed scheme achieves improved network performance via the formulation of load-balanced clusters, resulting in a more scalable and adaptable network. The proposed scheme considers multiple parameters such as nodes' energy level, degree, proximity, and population for suitable network partitioning. Through various simulation results and experimentation, it establishes its efficacy over state-of-the-art schemes in respect of load-balanced cluster formation, improved network lifetime, network resource utilization, and network throughput. The proposed scheme ensures up to 57.69%, 33.16%, and 57.74% gains in network lifetime, energy utilization, and data packet delivery under varying network configurations. Besides providing the quantitative analysis, a detailed statistical analysis has also been performed that describes the acceptability of the proposed scheme under different network configurations.     

下降迭代算法对数值聚类分析技术的优化研究

提出使用下降迭代算法对数值聚类分析技术进行优化.下降迭代通过设定函数,给出初始假设解,然后按照某种规则依次找到最优解.首先介绍常用聚类算法,从而引出下降迭代法聚类.通过实验证明了下降迭代算法对数值聚类优化的可行性.     

幅度与相位分步识别的QAM调制模式识别算法

正交幅度调制(Quadrature Amplitude Modulation,QAM)信号的调制模式识别一直以来是人们研究的热点,通过星座图来进行调制模式识别也是一种常见的方法。然而,大多数调制模式识别算法会受到频偏和相偏的干扰,因此提出了一种幅度相位分步识别的QAM识别算法来识别调制模式。先利用卷积神经网络(Convolutional Neural Networks,CNN)识别出未消除频偏相偏的QAM星座图的幅度层数,对信号进行第一次分类;再检测每个信号点的瞬时相位进行差分,得到每个点之间的相位跳变幅度;经过减法聚类确定相位跳变次数,由此对信号在相位上进行二次分类,最后识别出QAM信号的调制模式。该方法虽然步骤比传统方法繁琐,但是不依赖于信号的频偏消除和相偏消除,能够起到很好的抗频偏作用。此外,因为没有频偏消除和相偏消除的步骤,所以使得信号不至于在频偏消除和相偏消除等预处理过程中损失信息量。经过试验,这种方法在识别率上比传统的神经网络识别方法在低信噪比下有更好的识别率。     

CMDC:an iterative algorithm for complementary multi-view document clustering

In response to the problems traditional multi-view document clustering methods separate the multi-view document representation from the clustering process and ignore the complementary characteristics of multi-view document clustering,an iterative algorithm for complementary multi-view document clustering——CMDC was proposed,in which the multi-view document clustering process and the multi-view feature adjustment were conducted in a mutually unified manner.In CMDC algorithm,complementary text documents were selected from the clustering results to aid adjusting the contribution of view features via learning a local measurement metric of each document view.The complementary text document of the results among the dimensionality clusters was selected by CMDC,and used to promote the feature tuning of the clusters.The partition consistency of the multi-dimensional document clustering was solved by the measure consistency of the dimensions.Experimental results show that CMDC effectively improves multi-dimensional clustering performance.