本文選題：P系統(tǒng) + DNA-GA��； 參考：《山東師范大學(xué)》2017年碩士論文

【摘要】：DNA-GA算法本質(zhì)上是建立在DNA編碼上的遺傳算法,是將進(jìn)化計(jì)算領(lǐng)域和DNA計(jì)算相結(jié)合的一種表現(xiàn)形式。DNA-GA算法所采用的DNA編碼方式與傳統(tǒng)的二進(jìn)制編碼相比較起來(lái)更加靈活,并且還可以進(jìn)行較多的遺傳操作,這就使得DNA-GA算法相對(duì)于遺傳算法來(lái)說(shuō),可以表達(dá)更多的遺傳信息。所以DNA-GA算法能夠在更大程度上克服GA算法所存在的某些局限問(wèn)題,比如算法的早熟收斂、二進(jìn)制海明懸崖問(wèn)題等,因此DNA-GA近些年受到學(xué)者們的廣泛關(guān)注。當(dāng)下設(shè)計(jì)出更有效的DNA-GA算法,為人類(lèi)研究做出貢獻(xiàn),具有很強(qiáng)的理論和現(xiàn)實(shí)意義。膜計(jì)算又稱P系統(tǒng),是從生物細(xì)胞、組織或器官的功能和結(jié)構(gòu)中抽象出來(lái)的具有分布式的并行計(jì)算模型。從計(jì)算效率角度來(lái)看,P系統(tǒng)能夠在線性時(shí)間內(nèi)求解NP難問(wèn)題,因此能夠在計(jì)算智能方面為人們提供較多的方便。到目前為止,膜計(jì)算已被廣泛應(yīng)用于眾多領(lǐng)域,例如:計(jì)算機(jī)科學(xué),生物學(xué),語(yǔ)言學(xué),近似優(yōu)化,計(jì)算機(jī)圖形學(xué),經(jīng)濟(jì)學(xué),密碼學(xué)等。膜計(jì)算的應(yīng)用研究相對(duì)于理論方面研究,目前尚處于初級(jí)階段,學(xué)者們期待P系統(tǒng)在應(yīng)用領(lǐng)域上會(huì)有突破性進(jìn)展。聚類(lèi)分析屬于無(wú)監(jiān)督學(xué)習(xí)的一種技術(shù),也就是說(shuō)本身具有獨(dú)立的學(xué)習(xí)能力。聚類(lèi)的整個(gè)過(guò)程可以描述為:將整個(gè)數(shù)據(jù)空間中的每個(gè)對(duì)象根據(jù)歐式距離分別劃分到不同的簇中,距離較近的對(duì)象會(huì)被劃分到相同的簇中,反之距離較遠(yuǎn)的對(duì)象會(huì)被劃分到不同的簇中,最終使得同一類(lèi)中的對(duì)象盡可能地相似而不同類(lèi)中的對(duì)象盡可能地不同。隨著聚類(lèi)分析的研究發(fā)展,其在模式分析、機(jī)器學(xué)習(xí)、數(shù)據(jù)挖掘、文檔檢索、圖像分割、模式識(shí)別等領(lǐng)域都有十分廣泛的應(yīng)用。本文就是在以上所述的理論前提下,以膜計(jì)算模型中的組織型P系統(tǒng)為基礎(chǔ),提出了基于組織型P系統(tǒng)的DNA-GA算法(TPDNA-GA)。主要涉及三部分的創(chuàng)新:一、對(duì)基本DNA-GA算法中涉及的遺傳操作進(jìn)行部分修改,提出了基于新型重構(gòu)交叉算子的改進(jìn)DNA-GA算法;二、將改進(jìn)后的DNA-GA算法與組織型P系統(tǒng)相結(jié)合,結(jié)合的主要目的是利用組織型P系統(tǒng)的極大并行性和膜規(guī)則來(lái)提高DNA-GA的性能,其中包括了對(duì)適應(yīng)度函數(shù)的定義及膜規(guī)則的改進(jìn),從而尋找到等待處理的數(shù)據(jù)集的最佳聚類(lèi)結(jié)果。并且本文利用三個(gè)標(biāo)準(zhǔn)測(cè)試函數(shù)對(duì)所提出新算法的性能進(jìn)行了有效性驗(yàn)證;三、將TPDNA-GA算法與K-means相結(jié)合進(jìn)行了相關(guān)研究與對(duì)比分析,并利用標(biāo)準(zhǔn)測(cè)試集進(jìn)行了算法性能分析;最后本文將該TPDNA-GA算法的聚類(lèi)過(guò)程應(yīng)用在處理Web文檔中,提出了具體的文檔聚類(lèi)應(yīng)用過(guò)程,并且利用Reuters-21578中的數(shù)據(jù)進(jìn)行實(shí)驗(yàn),對(duì)聚類(lèi)精確度進(jìn)行驗(yàn)證和比較,證明該算法能夠?yàn)槿藗冊(cè)谌粘９ぷ髦胁樵兾臋n提供方便。
[Abstract]:The DNA-GA algorithm is essentially a genetic algorithm based on DNA coding. It is a representation of evolutionary computing and DNA computation, which is more flexible than the traditional binary coding. And more genetic operations can be carried out, which makes the DNA-GA algorithm can express more genetic information than the genetic algorithm. Therefore, DNA-GA algorithm can overcome some limitations of GA algorithm to a greater extent, such as the premature convergence of the algorithm, binary Hemming Cliff problem and so on. Therefore, DNA-GA has been widely concerned by scholars in recent years. It is of great theoretical and practical significance to design a more effective DNA-GA algorithm to contribute to human research. Membrane computing, also called P system, is a distributed parallel computing model abstracted from the functions and structures of biological cells, tissues or organs. From the point of view of computational efficiency, the P / P system can solve NP-hard problems in linear time, so it can provide more convenience for people in computing intelligence. Up to now, membrane computing has been widely used in many fields, such as computer science, biology, linguistics, approximate optimization, computer graphics, economics, cryptography and so on. Compared with the theoretical research, the application of membrane computing is still in its infancy, and scholars expect that there will be a breakthrough in the application of P system. Clustering analysis is a kind of unsupervised learning technology, that is to say, it has independent learning ability. The whole process of clustering can be described as: each object in the whole data space is divided into different clusters according to the Euclidean distance, and the objects close to each other are divided into the same cluster. On the other hand, objects far away will be divided into different clusters, making objects in the same class as similar as possible and objects in different classes as different as possible. With the development of clustering analysis, it has been widely used in the fields of pattern analysis, machine learning, data mining, document retrieval, image segmentation, pattern recognition and so on. In this paper, on the basis of the tissue P system in the membrane computing model, the DNA-GA algorithm based on the tissue P system is proposed. It mainly involves the innovation of three parts: first, the genetic operation involved in the basic DNA-GA algorithm is partly modified, and an improved DNA-GA algorithm based on the new reconstruction crossover operator is proposed; second, the improved DNA-GA algorithm is combined with the organizational P system. The main purpose of the combination is to improve the performance of DNA-GA by using the maximal parallelism and membrane rules of the tissue P system, including the definition of fitness function and the improvement of membrane rules, so as to find the best clustering result of the data set waiting for processing. Three standard test functions are used to verify the performance of the proposed algorithm. Thirdly, the TPDNA-GA algorithm and K-means are studied and compared, and the performance of the algorithm is analyzed by using the standard test set. Finally, this paper applies the clustering process of the TPDNA-GA algorithm to the processing of Web documents, proposes a specific document clustering application process, and makes use of the data in Reuters-21578 to carry out experiments to verify and compare the clustering accuracy. It is proved that the algorithm can provide convenience for people to query documents in their daily work.
【學(xué)位授予單位】：山東師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：Q811.4;TP311.13

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 詹曉娟;姚登舉;朱懷球;;高通量DNA測(cè)序數(shù)據(jù)的生物信息學(xué)方法[J];大數(shù)據(jù);2016年02期

2 �，�;張勛才;韓棟;王燕;崔光照;王子成;;一種基于DNA序列運(yùn)算的信息隱藏方案[J];輕工學(xué)報(bào);2016年01期

3 張菁芳;任家順;陳渝;黃春基;薛曉;向前;袁小山;;醫(yī)學(xué)應(yīng)急救援任務(wù)優(yōu)化調(diào)度策略研究[J];醫(yī)療衛(wèi)生裝備;2015年09期

4 鄭學(xué)東;;基于聚類(lèi)小生境遺傳算法的DNA編碼優(yōu)化[J];計(jì)算機(jī)工程;2015年02期

5 寇光杰;馬云艷;岳峻;鄒海林;;膜計(jì)算在圖像處理中應(yīng)用的研究進(jìn)展及展望[J];計(jì)算機(jī)科學(xué);2014年S2期

6 廖孝勇;李尚鍵;孫棣華;何偉;余楚中;;一種基于膜計(jì)算的改進(jìn)人工魚(yú)群算法[J];小型微型計(jì)算機(jī)系統(tǒng);2014年05期

7 宋春寧;劉少東;;基于SDNA-GA優(yōu)化的模糊神經(jīng)網(wǎng)絡(luò)控制[J];控制與決策;2014年04期

8 趙松;夏燕玲;何熊熊;;DNA遺傳算法的改進(jìn)二維最大熵圖像分割[J];硅谷;2013年02期

9 周洪煜;曾濟(jì)貧;王照陽(yáng);趙乾;;基于混沌DNA遺傳算法與PSO組合優(yōu)化的RNN短期風(fēng)電功率預(yù)測(cè)[J];電力系統(tǒng)保護(hù)與控制;2013年02期

10 王千;王成;馮振元;葉金鳳;;K-means聚類(lèi)算法研究綜述[J];電子設(shè)計(jì)工程;2012年07期

相關(guān)博士學(xué)位論文 前3條

1 李積英;融合量子衍生及DNA計(jì)算速率的智能算法在圖像分割中的研究[D];蘭州交通大學(xué);2014年

2 陳霄;DNA遺傳算法及應(yīng)用研究[D];浙江大學(xué);2010年

3 黃亮;膜計(jì)算優(yōu)化方法研究[D];浙江大學(xué);2007年

相關(guān)碩士學(xué)位論文 前10條

1 韓麗莎;類(lèi)細(xì)胞P系統(tǒng)在劃分聚類(lèi)中的研究[D];山東師范大學(xué);2015年

2 呂慧珍;DNA遺傳算法及其在燃料電池中的應(yīng)用研究[D];浙江工業(yè)大學(xué);2015年

3 高雪峰;膜計(jì)算在基因表達(dá)數(shù)據(jù)分析中的應(yīng)用[D];西華大學(xué);2015年

4 任碩;基于膜計(jì)算的輸電線路路徑優(yōu)化問(wèn)題的研究與應(yīng)用[D];山東師范大學(xué);2015年

5 李薈嬈;K-means聚類(lèi)方法的改進(jìn)及其應(yīng)用[D];東北農(nóng)業(yè)大學(xué);2014年

6 吳浩;DNA遺傳算法在表面貼裝生產(chǎn)線負(fù)荷均衡中的應(yīng)用研究[D];成都理工大學(xué);2014年

7 孫杰;細(xì)胞型膜系統(tǒng)在聚類(lèi)算法中的研究[D];山東師范大學(xué);2014年

8 蔣洋;基于膜計(jì)算的聚類(lèi)算法研究[D];西華大學(xué);2014年

9 夏燕玲;DNA遺傳算法及其在流程工業(yè)中的應(yīng)用研究[D];浙江工業(yè)大學(xué);2013年

10 黃小麗;細(xì)胞型膜系統(tǒng)設(shè)計(jì)方法研究[D];西南交通大學(xué);2012年

，

本文編號(hào)：1859200