Automatic Aggregation Enhanced Affinity Propagation Clustering Based on Mutually Exclusive Exemplar Processing

Affinity propagation(AP)is a widely used exemplar-based clustering approach with superior efficiency and clustering quality.Nevertheless,a common issue with AP clustering is the presence of excessive exemplars,which limits its ability to perform effective aggregation.This research aims to enable AP to automatically aggregate to produce fewer and more compact clusters,without changing the similarity matrix or customizing preference parameters,as done in existing enhanced approaches.An automatic aggregation enhanced affinity propagation(AAEAP)clustering algorithm is proposed,which combines a dependable partitioning clustering approach with AP to achieve this purpose.The partitioning clustering approach generates an additional set of findings with an equivalent number of clusters whenever the clustering stabilizes and the exemplars emerge.Based on these findings,mutually exclusive exemplar detection was conducted on the current AP exemplars,and a pair of unsuitable exemplars for coexistence is recommended.The recommendation is then mapped as a novel constraint,designated mutual exclusion and aggregation.To address this limitation,a modified AP clustering model is derived and the clustering is restarted,which can result in exemplar number reduction,exemplar selection adjustment,and other data point redistribution.The clustering is ultimately completed and a smaller number of clusters are obtained by repeatedly performing automatic detection and clustering until no mutually exclusive exemplars are detected.Some standard classification data sets are adopted for experiments on AAEAP and other clustering algorithms for comparison,and many internal and external clustering evaluation indexes are used to measure the clustering performance.The findings demonstrate that the AAEAP clustering algorithm demonstrates a substantial automatic aggregation impact while maintaining good clustering quality.

Local and global approaches of affinity propagation clustering for large scale data

Recently a new clustering algorithm called 'affinity propagation' (AP) has been proposed, which efficiently clustered sparsely related data by passing messages between data points. However, we want to cluster large scale data where the similarities are not sparse in many cases. This paper presents two variants of AP for grouping large scale data with a dense similarity matrix. The local approach is partition affinity propagation (PAP) and the global method is landmark affinity propagation (LAP). PAP passes messages in the subsets of data first and then merges them as the number of initial step of iterations; it can effectively reduce the number of iterations of clustering. LAP passes messages between the landmark data points first and then clusters non-landmark data points; it is a large global approximation method to speed up clustering. Experiments are conducted on many datasets, such as random data points, manifold subspaces, images of faces and Chinese calligraphy, and the results demonstrate that the two ap-proaches are feasible and practicable.

Adaptive spectral affinity propagation clustering

Affinity propagation(AP)is a classic clustering algorithm.To improve the classical AP algorithms,we propose a clustering algorithm namely,adaptive spectral affinity propagation(AdaSAP).In particular,we discuss why AP is not suitable for non-spherical clusters and present a unifying view of nine famous arbitrary-shaped clustering algorithms.We propose a strategy of extending AP in non-spherical clustering by constructing category similarity of objects.Leveraging the monotonicity that the clusters’number increases with the self-similarity in AP,we propose a model selection procedure that can determine the number of clusters adaptively.For the parameters introduced by extending AP in non-spherical clustering,we provide a grid-evolving strategy to optimize them automatically.The effectiveness of AdaSAP is evaluated by experiments on both synthetic datasets and real-world clustering tasks.Experimental results validate that the superiority of AdaSAP over benchmark algorithms like the classical AP and spectral clustering algorithms.

3D Model Retrieval Method Based on Affinity Propagation Clustering

In order to improve the accuracy and efficiency of 3D model retrieval,the method based on affinity propagation clustering algorithm is proposed. Firstly,projection ray-based method is proposed to improve the feature extraction efficiency of 3D models. Based on the relationship between model and its projection,the intersection in 3D space is transformed into intersection in 2D space,which reduces the number of intersection and improves the efficiency of the extraction algorithm. In feature extraction,multi-layer spheres method is analyzed. The two-layer spheres method makes the feature vector more accurate and improves retrieval precision. Secondly,Semi-supervised Affinity Propagation ( S-AP) clustering is utilized because it can be applied to different cluster structures. The S-AP algorithm is adopted to find the center models and then the center model collection is built. During retrieval process,the collection is utilized to classify the query model into corresponding model base and then the most similar model is retrieved in the model base. Finally,75 sample models from Princeton library are selected to do the experiment and then 36 models are used for retrieval test. The results validate that the proposed method outperforms the original method and the retrieval precision and recall ratios are improved effectively.

Improved Semi-supervised Clustering Algorithm Based on Affinity Propagation

A clustering algorithm for semi-supervised affinity propagation based on layered combination is proposed in this paper in light of existing flaws. To improve accuracy of the algorithm,it introduces the idea of layered combination, divides an affinity propagation clustering( APC) process into several hierarchies evenly,draws samples from data of each hierarchy according to weight,and executes semi-supervised learning through construction of pairwise constraints and use of submanifold label mapping,weighting and combining clustering results of all hierarchies by combined promotion. It is shown by theoretical analysis and experimental result that clustering accuracy and computation complexity of the semi-supervised affinity propagation clustering algorithm based on layered combination( SAP-LC algorithm) have been greatly improved.

Semi-supervised Affinity Propagation Clustering Based on Subtractive Clustering for Large-Scale Data Sets

In the face of a growing number of large-scale data sets, affinity propagation clustering algorithm to calculate the process required to build the similarity matrix, will bring huge storage and computation. Therefore, this paper proposes an improved affinity propagation clustering algorithm. First, add the subtraction clustering, using the density value of the data points to obtain the point of initial clusters. Then, calculate the similarity distance between the initial cluster points, and reference the idea of semi-supervised clustering, adding pairs restriction information, structure sparse similarity matrix. Finally, the cluster representative points conduct AP clustering until a suitable cluster division.Experimental results show that the algorithm allows the calculation is greatly reduced, the similarity matrix storage capacity is also reduced, and better than the original algorithm on the clustering effect and processing speed.

基于Affinity Propagation聚类方法的图像检索技术在数字图书馆中的应用

随着数字图书馆包含的内容逐渐丰富,数字图像也越来越多。为了有效地检索这些图像,迫切需要一种效率更高的检索方法。目前的基于内容的图像检索算法在检索时间和效率上都还不能满足这一需求。本文采用最新提出的Af-finity Propagation聚类方法和颜色-形状直方图特征,提出一种新的检索方法应用到数字图书馆进行图像检索。经过试验证明在查准率、查全率和检索时间上均有较大的提高。

基于SIFT和Affinity Propagation的遥感图像配准算法

随着传感器和光学影像测量等各种技术的快速发展,航空遥感技术已经在电力巡检、森林防火、地理测绘等领域中发挥着越来越重要的作用,而图像配准作为遥感图像的预处理步骤为图像融合等后续处理提供了参考和依据,目前已经成为遥感图像处理领域的研究热点。文中提出了一种基于尺度不变特征变换(Scale-invariant Feature Transform,SIFT)和仿射传播聚类(Affinity Propagation,AP)的图像配准算法。该算法与原有算法相比优势在于无需预先设定参数,并且实验仿真表明该算法能有效地对多源图像进行高精度的配准,与随机抽样一致算法(Random Sample Consensus,RANSAC)相比提高了正确匹配点的数目。

Steganalysis Using Fractal Block Codes and AP Clustering in Grayscale Images

This paper presents a universal scheme （also called blind scheme） based on fractal compression and affinity propagation （AP） clustering to distinguish stego-images from cover grayscale images, which is a very challenging problem in steganalysis. Since fractal codes represent the ＂self-similarity＂ features of natural images, we adopt the statistical moment of fractal codes as the image features. We first build an image set to store the statistical features without hidden messages, of natural images with and and then apply the AP clustering technique to group this set. The experimental result shows that the proposed scheme performs better than Fridrich＇s traditional method.

基于AP-WOA-GRU的分布式光伏集群电压越限动态预测

针对整县光伏背景下规模化分布式光伏接入配电网导致的电压波动问题,提出了一种基于近邻传播聚类(affinity propagation,AP)与鲸鱼算法(whale optimization algorithm,WOA)优化门控循环单元(gated recurrent unit,GRU)的分布式光伏集群电压越限预测方法。首先,在考虑分布式光伏地理坐标气象特征的基础上,添加基于配电网节点负荷密度因素的位置特征,采用近邻传播聚类方法,在不指定聚类数目的情况下划分具有近似气象特征和地理位置特征的分布式光伏集群,提高模型训练效果及适应性;然后,采用鲸鱼优化算法全局搜索GRU模型的最优训练参数,进一步提高模型的训练速度和预测精度;最后,利用WOA-GRU组合模型实现配电网节点电压与环境温度、光照强度的关联匹配,进而实现区域配电网电压波动及电压越限情况的整体预测。实验证明:所提出的方法能够有效提高预测精度及训练速度,强化预测模型的适应能力,具有较好的经济性和实用性。

基于改进的Affnity Propagation聚类的木材缺陷识别

本文提出了一种基于快速Affnity Propagation聚类算法的木材缺陷识别方法.通过提取木材图像的颜色矩特征,建立样本特征集X,以平均平方残基为阈值降低样本特征集X及距离矩阵S的维数,自动识别木材缺陷位置并标记.实验表明,该方法的识别速度较传统的AP算法有明显提高,平均识别时间约为0.557s,平均识别查准率约为70.5%,平均识别查全率约为95.6%.

Optimizing radial basis function neural network based on rough sets and affinity propagation clustering algorithm

A novel method based on rough sets (RS) and the affinity propagation (AP) clustering algorithm is developed to optimize a radial basis function neural network (RBFNN). First, attribute reduction (AR) based on RS theory, as a preprocessor of RBFNN, is presented to eliminate noise and redundant attributes of datasets while determining the number of neurons in the input layer of RBFNN. Second, an AP clustering algorithm is proposed to search for the centers and their widths without a priori knowledge about the number of clusters. These parameters are transferred to the RBF units of RBFNN as the centers and widths of the RBF function. Then the weights connecting the hidden layer and output layer are evaluated and adjusted using the least square method (LSM) according to the output of the RBF units and desired output. Experimental results show that the proposed method has a more powerful generalization capability than conventional methods for an RBFNN.

基于BLAP聚类和多粒度犹豫模糊集的售电套餐推荐方法

现有基于用户评价信息的售电套餐推荐方法因忽略了差异化用户评价信息的多样性,且仅考虑了用户擅长评价售电套餐所有属性的情形,给推荐结果带来较大偏差。为此,提出了一种基于双层邻近传播(BLAP)聚类和多粒度犹豫模糊语言评价集的售电套餐推荐方法。首先,提出了基于用户画像标签体系和BLAP聚类的样本用户集划分方法,以辨别用电特性相似的用户;然后,考虑多粒度犹豫模糊语言评价集和权重不完整信息,提出了样本用户集对售电套餐选择的模糊评价方法;接着,提出了基于样本用户集评价信息的新用户满意度评估方法和售电套餐的全排序推荐方法,以实现售电公司对售电套餐的精准推荐。最后,以中国某地区用户为对象进行算例分析,结果表明基于BLAP聚类和多粒度犹豫模糊集的售电套餐推荐方法能够帮助售电公司提高推荐质量,进而提升用户满意度,增强用户黏性。

Semi-Supervised Clustering Fingerprint Positioning Algorithm Based on Distance Constraints

With the rapid development of WLAN( Wireless Local Area Network) technology,an important target of indoor positioning systems is to improve the positioning accuracy while reducing the online computation.In this paper,it proposes a novel fingerprint positioning algorithm known as semi-supervised affinity propagation clustering based on distance function constraints. We show that by employing affinity propagation techniques,it is able to use a fractional labeled data to adjust similarity matrix of signal space to cluster reference points with high accuracy. The semi-supervised APC uses a combination of machine learning,clustering analysis and fingerprinting algorithm. By collecting data and testing our algorithm in a realistic indoor WLAN environment,the experimental results indicate that the proposed algorithm can improve positioning accuracy while reduce the online localization computation,as compared with the widely used K nearest neighbor and maximum likelihood estimation algorithms.

寒区电动公交充电站选址及定容规划研究

寒区低温环境导致电动公交动力电池容量衰减,充电设施服务范围及规划数量受到影响,给电动公交充电站选址及定容规划带来挑战。为提高电动公交充电站的低温适应性,提出针对寒区电动公交充电站的选址算法及定容模型。首先,在选址规划中,构建充电站渐进覆盖服务半径,利用改进近邻传播聚类算法确定充电站选址点,基于算法聚类中心构建充电站Voronoi图划分充电集群。其次,在定容规划中,构建动力电池低温容量衰减模型,确定寒区电动公交的充电需求;基于容量有限的截尾排队论模型建立充电站有效服务强度、拒绝服务率及充电满意度等约束;引入成本权衡系数,以规划年限内全社会成本最小为优化目标,建立寒区充电站定容规划模型,并设计遗传算法进行求解。最后,以哈尔滨市市区电动公交充电站选址定容规划为例进行分析,算例结果得到9个充电站选址点及其充电集群,以及各充电站的充电机配置数量和各项成本。针对环境温度和成本权衡系数进行灵敏度分析,结果表明:寒区低温环境对充电站的充电机配置数量和各项成本有显著影响,合理权衡充电站和电动公交两者利益有助于提高充电服务满意度,降低全社会成本。

基于MapReduce的分布式近邻传播聚类算法

随着信息技术迅速发展,数据规模急剧增长,大规模数据处理非常具有挑战性.许多并行算法已被提出,如基于MapReduce的分布式K平均聚类算法、分布式谱聚类算法等.近邻传播(affinity propagation,AP)聚类能克服K平均聚类算法的局限性,但是处理海量数据性能不高.为有效实现海量数据聚类,提出基于MapReduce的分布式近邻传播聚类算法——DisAP.该算法先将数据点随机划分为规模相近的子集,并行地用AP聚类算法稀疏化各子集,然后融合各子集稀疏化后的数据再次进行AP聚类,由此产生的聚类代表作为所有数据点的聚类中心.在人工合成数据、人脸图像数据、IRIS数据以及大规模数据集上的实验表明:DisAP算法对数据规模有很好的适应性,在保持AP聚类效果的同时可有效缩减聚类时间.

自适应AP聚类算法及其在入侵检测中的应用

网络数据流量的增大对入侵检测系统的实时性提出了更高的要求,压缩训练数据可加快未知样本的分类处理速度。针对数据量过大造成压缩处理和聚类效率低下的难题,提出了一种改进的自适应AP(affinity propagation)聚类方法,采取直接关联与簇中心距离较近样本的方法,减少聚类样本数量,降低聚类时空消耗,并依据关联结果,不断调整聚类参数,精确聚类结果。2个网络安全数据集的应用结果表明,该方法可从大规模样本中有效聚出代表性子集,在保证准确率的前提下,提高入侵检测的实效性。

基于AP聚类和鲁棒优化的电网规划灵活性评估

高比例可再生能源的并网,给电力系统规划的灵活性带来了挑战。本文考虑源-荷双端的不确定性,提出了一种基于AP(affinity propagation)聚类和两阶段鲁棒优化的电网规划灵活性评估方法。首先,本文提出了基于AP聚类的远景年典型日负荷建模方法。其次,以区间的形式考虑可再生能源出力的不确定性,构建基于鲁棒优化的电力系统规划方案灵活性评估模型。最后,在整个周期的角度和各时间断面的角度提出了一组电网规划灵活性评估指标。本文利用IEEE RTS-24算例验证所提出方法的合理性。

基于APDE-RBF神经网络的网络安全态势预测方法

为了提高径向基函数(radical basis function,RBF)神经网络对网络安全态势的预测精度,提出了一种基于吸引力传播(affinity propagation,AP)聚类和差分进化(differential evolution,DE)优化RBF神经网络的算法。首先,利用AP聚类算法对样本数据进行划分聚类,从而获得RBF的中心和网络的隐含层节点数;其次,利用AP聚类得出种群差异度,自适应地改变DE算法的缩放因子和交叉概率,对RBF的宽度和连接权值进行优化;同时为了避免陷入局部最优以及跳出局部极值点,对每一代种群的精英个体和种群差异度中心进行混沌搜索。通过仿真实验表明,此算法在泛化能力增强的同时,对网络安全态势也达到了较高的预测精度。

基于简化HMM和时间分段的非侵入式负荷分解算法

针对现有非侵入式负荷分解算法需要以过去时刻的分解结果为依据,从而造成误差累积的问题,提出一种基于简化的隐马尔可夫模型和时间分段的非侵入式负荷分解算法,以实现居民家庭的负荷分解。对负荷的低频功率信号进行分层抽样和聚类分析,构建负荷功率模板并利用独热码对超状态进行编码表示。基于简化的隐马尔可夫模型和普遍生活规律对家庭用电时间段进行划分,在每个时间段内单独训练参数。结合总线数据和各时间段参数实现对各时刻负荷功率的独立求解。基于2种国外公开数据集的测试结果验证了所提算法的准确性和实时性。