基于维数学习和二次插值的混沌飞蛾火焰优化算法

针对K-means算法对初始聚类中心敏感和容易陷入局部最优的问题,首先提出一种基于维数学习和二次插值的飞蛾火焰优化算法以提高基本算法的求解精度和收敛速度,即采用Tent混沌映射产生多样性较好的初始种群,增强算法的全局搜索能力;对火焰位置采用维数学习策略生成更优良的火焰来指导飞蛾寻优,以提高算法的搜索效率;把二次插值引入...     

基于多目标进化聚类的信用风险特征识别

在信用风险识别领域,聚类算法常被用于区分不同风险等级的样本并识别风险特征。然而该领域中通常面临高维数据处理问题,导致传统聚类算法存在不适应此类问题的缺陷：易陷入局部最优、受冗余特征干扰、鲁棒性不强等。采用高维信用风险数据,研究上市公司信用风险,建立信用风险特征识别的三目标优化模型,设计基于分解的多目标子空间聚类算法进行求解。通过算法的横向对比实验,展示了所提出的算法在聚类精度和鲁棒性方面的优势,并根据聚类算法的权重分配结果,归纳总结上市公司信用风险评估过程中应重点关注的指标。     

基于方差与改进群智能算法的K-means聚类优化

利用K-means进行数据聚类时,借用不同处理手段其统计距离和聚类中心等会有所差异,从而影响聚类结果,尤其是当数据维度增高时,这种现象更为明显.对此,文章提出一种基于样本方差的多元统计距离算法,并引入改进人工蜂群算法及评价准则函数确定聚类中心和最佳聚类数,优化K-means算法.理论上,该方法可以克服原算法易陷入局部最优和固定聚类数等缺陷.最后,通过特异值检测,人工数据集以及UCI真实数据集测试验证该优化算法性能.     

硬聚类和模糊聚类的结合——双层FCM快速算法

模糊c均值(FCM)聚类算法在模式识别领域中得到了广泛的应用,但FCM算法在大数据集的情况下需要大量的CPU时间,令用户感到十分不便,提高算法的速度是一个急待解决的问题。本文提出的双层FCM聚类算法是一种快速算法,它体现了硬聚类和模糊聚类的结合,以硬聚类的结果对模糊聚类的初始值进行指导,从而明显地缩短了迭代过程。双层FCM算法所用的CPU时间仅为FCM算法的十三分之一,因而具有很强的实用价值。     

个性化推荐系统中协同过滤推荐算法优化研究

协同过滤推荐算法是目前个性化推荐系统中应用比较广泛的一种算法。然而,它在处理数据稀疏性、可扩展性等方面存在一定不足。针对数据稀疏性问题,本文首先基于Slope One算法对初始的评分矩阵进行缺失值填充,其次利用基于K-means聚类的协同过滤算法预测目标用户的评分,并结合MovieLens数据集给出了相关对比实验;针对扩展性问题,本文首先提出了一种基于中心聚集参数的改进K-means算法,其次,给出了基于中心聚集参数改进K-means的协同过滤推荐算法流程,并结合MovieLens数据集设计了相关对比实验。实验结果表明,本文所提方法推荐精度均得到显著提高,数据稀疏性和扩展性问题得到了有效改善。因此,本文的研究结论不仅可进一步丰富协同过滤推荐算法的现有理论成果,还可以为提高推荐系统的精度提供理论依据和决策参考。     

一种动态获取簇核心的自动聚类tNN-MEANS算法

K-means算法是一种非常重要的聚类算法,然而算法的聚类效果受簇的个数、初始中心点位置的影响很大.提出基于优化初始中心集合和中心移动算法tNN-MEANS,算法有效解决了以下三个问题:1)准确确定大规模数据集中簇的个数;2)精确确定全局高密度的核心区域;3)克服了簇中存在多个高密度区域的问题.运用UCI数据集分别对X-means算法、DBSCAN算法和tNN-MEANS算法进行对比实验,实验结果验证了tNN-MEANS算法的聚类精度、确定簇的个数、蔟划分的正确率等性能均优于与之对比的其它算法.     

函数型聚类分析:基于距离的一步法框架

基于距离的函数型聚类分析包含曲线拟合和聚类两个独立步骤,最优曲线拟合未必有利于类别信息的提取和保留。根据曲线拟合与聚类分析的计算过程,重新梳理了函数型聚类算法;基于距离度量,提出了同时考虑拟合和聚类效果的函数型聚类一步法;在交替方向乘子法(ADMM)框架下推导并给出了迭代求解算法。模拟试验结果显示,该函数型聚类算法有助于提高聚类精度;针对北京市空气质量监测站点二氧化氮(NO_2)污染物小时浓度数据的实例验证分析表明,该函数型聚类算法对不同类别空气质量监测点具有更好的区分度。     

基于优化初始聚类中心和轮廓系数的 K-means 聚类算法

传统K-means聚类算法初始聚类中心以及聚类数目K是随机确定的,聚类结果受其影响较大,这样容易造成聚类结果不稳定且准确率较低.针对上述问题,本文提出一种基于优化初始聚类中心和轮廓系数的K-means聚类算法.首先,为了选出准确的初始聚类中心,引入平均样本距离和误差平方和,构造初始聚类中心的选取方法,使得选取的初始聚类...     

改进的布谷鸟算法求解物流配送中心选址问题

针对基本布谷鸟算法求解物流配送中心选址问题时存在搜索精度低、易陷入局部最优值的缺陷,提出一种改进的布谷鸟算法.算法采用基于寄生巢适应度值排序的自适应方法改进基本布谷鸟算法的惯性权重,以平衡算法的全局开发能力和局部探索能力;利用NEH领域搜索以提高算法的搜索精度和收敛速度;引入停止阻止策略对全局最优寄生巢位置进行变异避免算法陷入局部最优值、增加种群的多样性.通过实验仿真表明,改进的布谷鸟算法在求解物流配送中心选址问题上要优与基本布谷鸟算法以及其它智群算法,是一种有效的算法.     

一种基于谱聚类分析的粒子群聚类算法

本文研究了谱聚类中NJW算法的样本最优划分问题.利用粒子群算法在聚类问题上搜索到的全局最优,获得了NJW算法对聚类样本的最优划分.推广了谱聚类算法在样本划分时的普适性和稳定性.实验对比验证该算法是有效的.     

Application of honey-bee mating optimization algorithm on clustering

Cluster analysis is one of attractive data mining technique that use in many fields. One popular class of data clustering algorithms is the center based clustering algorithm. K-means used as a popular clustering method due to its simplicity and high speed in clustering large datasets. However, K-means has two shortcomings: dependency on the initial state and convergence to local optima and global solutions of large problems cannot found with reasonable amount of computation effort. In order to overcome local optima problem lots of studies done in clustering. Over the last decade, modeling the behavior of social insects, such as ants and bees, for the purpose of search and problem solving has been the context of the emerging area of swarm intelligence. Honey-bees are among the most closely studied social insects. Honey-bee mating may also be considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of marriage in real honey-bee. Honey-bee has been used to model agent-based systems. In this paper, we proposed application of honeybee mating optimization in clustering (HBMK-means). We compared HBMK-means with other heuristics algorithm in clustering, such as GA, SA, TS, and ACO, by implementing them on several well-known datasets. Our finding shows that the proposed algorithm works than the best one.     

An extended study of the K-means algorithm for data clustering and its applications

The K-means algorithm has been a widely applied clustering technique, especially in the area of marketing research. In spite of its popularity and ability to deal with large volumes of data quickly and efficiently, K-means has its drawbacks, such as its inability to provide good solution quality and robustness. In this paper, an extended study of the K-means algorithm is carried out. We propose a new clustering algorithm that integrates the concepts of hierarchical approaches and the K-means algorithm to yield improved performance in terms of solution quality and robustness. This proposed algorithm and score function are introduced and thoroughly discussed. Comparison studies with the K-means algorithm and three popular K-means initialization methods using five well-known test data sets are also presented. Finally, a business application involving segmenting credit card users demonstrates the algorithm's capability.     

Candidate groups search for K-harmonic means data clustering

Clustering is a very popular data analysis and data mining technique. K-means is one of the most popular methods for clustering. Although K-mean is easy to implement and works fast in most situations, it suffers from two major drawbacks, sensitivity to initialization and convergence to local optimum. K-harmonic means clustering has been proposed to overcome the first drawback, sensitivity to initialization. In this paper we propose a new algorithm, candidate groups search (CGS), combining with K-harmonic mean to solve clustering problem. Computational results showed CGS does get better performance with less computational time in clustering, especially for large datasets or the number of centers is big.     

聚类分析中非0,1编码的遗传算法

K-平均算法属于聚类分析中的动态聚类法,但其聚类效果受初始聚类分类或初始点的影响较大。本文提出一种遗传算法(GA)来进行近代初始分类,以内部聚类准则作为评价指标,实验结果表明,该算法明显好于K-平均算法。     

PSOHS: an efficient two-stage approach for data clustering

Cluster analysis is an important task in data mining and refers to group a set of objects such that the similarities among objects within the same group are maximal while similarities among objects from different groups are minimal. The particle swarm optimization algorithm (PSO) is one of the famous metaheuristic optimization algorithms, which has been successfully applied to solve the clustering problem. However, it has two major shortcomings. The PSO algorithm converges rapidly during the initial stages of the search process, but near global optimum, the convergence speed will become very slow. Moreover, it may get trapped in local optimum if the global best and local best values are equal to the particle’s position over a certain number of iterations. In this paper we hybridized the PSO with a heuristic search algorithm to overcome the shortcomings of the PSO algorithm. In the proposed algorithm, called PSOHS, the particle swarm optimization is used to produce an initial solution to the clustering problem and then a heuristic search algorithm is applied to improve the quality of this solution by searching around it. The superiority of the proposed PSOHS clustering method, as compared to other popular methods for clustering problem is established for seven benchmark and real datasets including Iris, Wine, Crude Oil, Cancer, CMC, Glass and Vowel.     

基于加权相似性的BIRCH聚类算法

BIRCH方法是一个集成的层次聚类方法.它克服了凝聚层次聚类方法所面临的两个难点:可伸缩性和不能撤销前一步工作的问题.基于BIRCH聚类的多阶段聚类算法思想,结合基于权重的欧式距离度量和基于划分的K-means算法,提出了一种基于加权相似性的BIRCH聚类方法,并将方法应用在时间序列的气象数据分析中.     

Hierarchical hesitant fuzzy K-means clustering algorithm简

Due to the limitation and hesitation in one＇s knowledge, the membership degree of an element to a given set usually has a few different values, in which the conventional fuzzy sets are invalid. Hesitant fuzzy sets are a powerful tool to treat this case. The present paper focuses on investigating the clustering technique for hesitant fuzzy sets based on the K-means clustering algorithm which takes the results of hierarchical clustering as the initial clusters. Finally, two examples demonstrate the validity of our algorithm.     

基于自适应均匀变异人工鱼群投资组合优化算法的研究

投资市场具有一定的风险,影响因素包括经济、政治、市场自身规律等,根据市场机制构建合适的投资组合模型,可以有效降低市场风险,提高投资回报率.人工鱼群算法是模仿自然界鱼类的一种人工智能优化算法,具有较好的优化能力,但有时会陷入局部最优解.首先将人工鱼群算法与均匀变异相结合,加入均匀变异随机数,使算法能够跳出局部最优解,得到全局最优,从而提高算法精度.然后采用改进人工鱼群算法对投资组合模型进行优化求解.实验表明,改进人工鱼群算法具有较好的收敛精度和收敛速度,对投资组合模型的求解效果更好,风险下降,收益增加、