基于群智能算法的聚類挖掘方法研究
發(fā)布時(shí)間：2018-09-12 15:09
【摘要】：互聯(lián)網(wǎng)時(shí)代來臨,為了避免陷入“數(shù)據(jù)豐富,信息匱乏”的窘迫境地,數(shù)據(jù)挖掘擔(dān)負(fù)著從海量數(shù)據(jù)中提取有價(jià)值的潛在信息并實(shí)現(xiàn)數(shù)據(jù)價(jià)值的重要使命。數(shù)據(jù)挖掘成為了眾多學(xué)者在信息時(shí)代研究的熱點(diǎn)之一。聚類是數(shù)據(jù)挖掘中的一個(gè)重要研究領(lǐng)域,它作為一種數(shù)據(jù)挖掘工具在諸多領(lǐng)域都有重要的應(yīng)用。群智能算法是一種新興的啟發(fā)式優(yōu)化算法,根據(jù)生物在生態(tài)系統(tǒng)中以存活、覓食、求偶等行為模擬而來。它具有自學(xué)習(xí)、分布性、自組織、并行性等特點(diǎn),能很好地處理傳統(tǒng)計(jì)算方法難以解決的一些復(fù)雜問題,特別是數(shù)據(jù)分析。群智能算法在處理一些復(fù)雜優(yōu)化問題方面具備較大的發(fā)展?jié)摿Α１疚脑敿?xì)論述了數(shù)據(jù)挖掘的基礎(chǔ)知識(shí)和幾種常見的群智能算法,分析了聚類算法存在的問題。論文對螢火蟲算法的理論進(jìn)行了研究和算法改進(jìn),并利用改進(jìn)的算法來解決聚類問題。主要工作如下:(1)針對傳統(tǒng)模糊C均值聚類算法初始聚類中心隨機(jī)選取、容易陷入局部最優(yōu)、效率低等問題,本文引入了混沌相關(guān)理論,提出了一種混沌初始化方法。然后利用Logistic映射修改螢火蟲位置更新公式,得到較好的聚類效果。實(shí)驗(yàn)結(jié)果表明:該算法準(zhǔn)確率較高,迭代次數(shù)較少。(2)針對傳統(tǒng)模糊C均值聚類算法全局搜索能力較差、對初始聚類中心選擇較敏感、聚類效果差等缺點(diǎn),在上一個(gè)算法的基礎(chǔ)上提出了一種新的小生境螢火蟲模糊聚類算法。該算法首先采用了隨機(jī)性和遍歷性更好的立方映射初始化種群,然后引入隨機(jī)慣性權(quán)重以修改螢火蟲位置更新公式,以平衡探索和開發(fā)的性能。通過實(shí)驗(yàn)結(jié)果可知:該算法提高了聚類質(zhì)量并具有較強(qiáng)魯棒性。(3)針對k-means聚類算法聚類效果差、對初始聚類中心選擇過分依賴、全局搜索能力較差等缺點(diǎn),提出了一種引入萊維飛行機(jī)制的螢火蟲劃分聚類算法。該算法利用基于密度和最大最小距離法來初始化種群,并在螢火蟲個(gè)體位置更新公式中引入萊維飛行機(jī)制,以避免陷入局部最優(yōu),同時(shí)使收斂速度更快,且具有良好的全局搜索能力,最后利用平衡方差評價(jià)函數(shù)優(yōu)化目標(biāo)函數(shù)。實(shí)驗(yàn)結(jié)果表明,該算法不僅避免了陷入局部最優(yōu),提高了k-means算法聚類結(jié)果質(zhì)量,同時(shí)削弱了其對初始值的依賴程度。
[Abstract]:With the advent of the Internet era, in order to avoid falling into the dilemma of "rich data and lack of information", data mining is shouldering the important mission of extracting valuable potential information from massive data and realizing the value of data. Data mining has become one of the hotspots of many scholars in the information age. Clustering is an important research field in data mining. As a data mining tool, it has important applications in many fields. Swarm intelligence algorithm is a new heuristic optimization algorithm, which is simulated by the behavior of survival, foraging, courtship and so on. It has the characteristics of self-learning, distribution, self-organization and parallelism. It can deal with some complicated problems, especially data analysis, which are difficult to solve by traditional computing methods. Swarm intelligence algorithm has great development potential in dealing with some complex optimization problems. In this paper, the basic knowledge of data mining and several common swarm intelligence algorithms are discussed in detail, and the problems of clustering algorithm are analyzed. In this paper, the theory of firefly algorithm is studied and improved, and the improved algorithm is used to solve the clustering problem. The main work is as follows: (1) aiming at the problems of random selection of initial clustering center, easy to fall into local optimum and low efficiency in traditional fuzzy C-means clustering algorithm, chaos correlation theory is introduced and a chaos initialization method is proposed in this paper. Then the Logistic mapping is used to modify the update formula of the firefly position and the clustering effect is obtained. The experimental results show that the algorithm has higher accuracy and fewer iterations. (2) the traditional fuzzy C-means clustering algorithm has poor global search ability, sensitive to the selection of initial clustering centers, and poor clustering effect. Based on the previous algorithm, a new fuzzy clustering algorithm for niche fireflies is proposed. In this algorithm, the population is initialized by cubic mapping with better randomness and ergodicity, and then random inertial weight is introduced to modify the update formula of firefly position to balance the performance of exploration and development. The experimental results show that the algorithm improves the clustering quality and has strong robustness. (3) aiming at the shortcomings of k-means clustering algorithm, such as poor clustering effect, over-dependence on the initial clustering center, poor global search ability, etc. A firefly clustering algorithm based on Levi flight mechanism is proposed. The algorithm initializes the population based on density and maximum and minimum distance, and introduces Levy flight mechanism into the updating formula of individual position of fireflies, so as to avoid falling into local optimum, and at the same time make the convergence speed faster. And it has good global search ability. Finally, the objective function is optimized by the balanced variance evaluation function. Experimental results show that the algorithm not only avoids falling into local optimum, but also improves the quality of clustering results of k-means algorithm and weakens its dependence on initial values.
【學(xué)位授予單位】：長沙理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TP18;TP311.13
本文編號(hào)：2239416
[Abstract]:With the advent of the Internet era, in order to avoid falling into the dilemma of "rich data and lack of information", data mining is shouldering the important mission of extracting valuable potential information from massive data and realizing the value of data. Data mining has become one of the hotspots of many scholars in the information age. Clustering is an important research field in data mining. As a data mining tool, it has important applications in many fields. Swarm intelligence algorithm is a new heuristic optimization algorithm, which is simulated by the behavior of survival, foraging, courtship and so on. It has the characteristics of self-learning, distribution, self-organization and parallelism. It can deal with some complicated problems, especially data analysis, which are difficult to solve by traditional computing methods. Swarm intelligence algorithm has great development potential in dealing with some complex optimization problems. In this paper, the basic knowledge of data mining and several common swarm intelligence algorithms are discussed in detail, and the problems of clustering algorithm are analyzed. In this paper, the theory of firefly algorithm is studied and improved, and the improved algorithm is used to solve the clustering problem. The main work is as follows: (1) aiming at the problems of random selection of initial clustering center, easy to fall into local optimum and low efficiency in traditional fuzzy C-means clustering algorithm, chaos correlation theory is introduced and a chaos initialization method is proposed in this paper. Then the Logistic mapping is used to modify the update formula of the firefly position and the clustering effect is obtained. The experimental results show that the algorithm has higher accuracy and fewer iterations. (2) the traditional fuzzy C-means clustering algorithm has poor global search ability, sensitive to the selection of initial clustering centers, and poor clustering effect. Based on the previous algorithm, a new fuzzy clustering algorithm for niche fireflies is proposed. In this algorithm, the population is initialized by cubic mapping with better randomness and ergodicity, and then random inertial weight is introduced to modify the update formula of firefly position to balance the performance of exploration and development. The experimental results show that the algorithm improves the clustering quality and has strong robustness. (3) aiming at the shortcomings of k-means clustering algorithm, such as poor clustering effect, over-dependence on the initial clustering center, poor global search ability, etc. A firefly clustering algorithm based on Levi flight mechanism is proposed. The algorithm initializes the population based on density and maximum and minimum distance, and introduces Levy flight mechanism into the updating formula of individual position of fireflies, so as to avoid falling into local optimum, and at the same time make the convergence speed faster. And it has good global search ability. Finally, the objective function is optimized by the balanced variance evaluation function. Experimental results show that the algorithm not only avoids falling into local optimum, but also improves the quality of clustering results of k-means algorithm and weakens its dependence on initial values.
【學(xué)位授予單位】：長沙理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：TP18;TP311.13
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 趙杰;雷秀娟;吳振強(qiáng);;基于最優(yōu)類中心擾動(dòng)的螢火蟲聚類算法[J];計(jì)算機(jī)工程與科學(xué);2015年02期
2 卿銘;孫曉梅;;一種新的聚類有效性函數(shù):模糊劃分的模糊熵[J];智能系統(tǒng)學(xué)報(bào);2015年01期
3 王吉權(quán);王福林;;螢火蟲算法的改進(jìn)分析及應(yīng)用[J];計(jì)算機(jī)應(yīng)用;2014年09期
4 張桂珠;胥楓;趙芳;吳德龍;;一種具有領(lǐng)導(dǎo)機(jī)制的混合蛙跳優(yōu)化算法[J];計(jì)算機(jī)應(yīng)用研究;2014年07期
5 袁鋒;陳守強(qiáng);劉弘;鐘安帥;;一種改進(jìn)的文化螢火蟲算法[J];計(jì)算機(jī)仿真;2014年06期
6 王沖;雷秀娟;;新的小生境螢火蟲劃分聚類算法[J];計(jì)算機(jī)工程;2014年05期
7 符強(qiáng);童楠;鐘才明;趙一鳴;;基于改進(jìn)型進(jìn)化機(jī)制的螢火蟲優(yōu)化算法[J];計(jì)算機(jī)科學(xué);2014年03期
8 胥小波;鄭康鋒;李丹;武斌;楊義先;;新的混沌粒子群優(yōu)化算法[J];通信學(xué)報(bào);2012年01期
9 蒲蓬勃;王鴿;劉太安;;基于粒子群優(yōu)化的模糊C-均值聚類改進(jìn)算法[J];計(jì)算機(jī)工程與設(shè)計(jì);2008年16期
10 賈東立;張家樹;;基于混沌變異的小生境粒子群算法[J];控制與決策;2007年01期
相關(guān)博士學(xué)位論文 前1條
1 匡芳君;群智能混合優(yōu)化算法及其應(yīng)用研究[D];南京理工大學(xué);2014年
相關(guān)碩士學(xué)位論文 前1條
1 李蓮;基于蜂群和粗糙集的聚類算法研究[D];長沙理工大學(xué);2014年
，本文編號(hào)：2239416
本文鏈接：http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2239416.html
最近更新
教材專著
