hill climbing algorithm 中文意思是什麼
hill climbing algorithm
解釋
梯度演算法-
To deal with the question that how we can guarantee the dna sequences which are stored in the personal dna database are anonymous, that no one can find out whom a special dna sequence is collected from, this paper get a new method ? savior, by improve dnala ( dna lattice anonymization ), which is a method settling this question. savior replaces the multiple alignment in dnala with pairwise alignment between every tow sequences, and replaces the greedy algorithm in dnala with stochastic hill - climbing. for doing this, it can save the time for data pretreatment, and add the precision of classing
針對個人dna數據的隱私保護問題，即:如何保證無法將存儲在數據庫中的dna序列信息與其提供者的個人身份信息（如:姓名，身份證號碼等）聯系起來，本文對一種新近開發的隱私保護方法? dnala （ dnalatticeanonymization ）進行了改進，在數據預處理階段，用兩兩雙序列比對代替了原演算法中的多序列比對，在不降低處理精度的情況下減少了數據預處理所耗費的時間;用隨機爬山法代替了原演算法中的貪心策略，增加了演算法後期處理的精度，從而形成了一種新的演算法? savior 。 -
In the process of seeking the inverse solution, the traditional method abandoned, a new " way - - - - ihca was gained by extracting the advantages of hill climbing and enlightening from the numeral described in the computer threory, and the algorithm flow chart was written out clearly
在求取運動學逆解的過程中，對新方法進行努力的探索。吸收人工智慧中的啟發式搜索演算法? ?爬山法的優點，從計算機原理中位置數制的描述獲得啟發，得到搜索演算法的步長，探尋求取運動學逆解新方法? ?智能登山法，並寫出完整的演算法流程。 -
Iterative tfidf algorithm belongs to hill - climbing algorithm, it has the common problem of converging to local optimal value and sensitive to initial point
迭代tfidf演算法屬于爬山演算法，初始值的選取對精度影響較大，演算法容易收斂到局部最優值。 -
An axial direction line multi - sensors placed method is presented. in the process of machine learning, use genetic algorithm to fit the curve of sensor ' s output. to improve the convergence speed of genetic algorithm, hill climbing method is joined with
對示教過程中進行曲線擬和所用的遺傳演算法進行了一定的研究，為了解決遺傳演算法在接近收斂點時收斂速度慢的缺點，使用爬山法對其進行改進。 -
For example nonlinearity, algebraic degree, correlation immunity, etc. basing on the method of hill climbing and the properties of boolean function, an algorithm, which is better than hc algorithm, named ihc is gave out to improve the design of nonlinearity of boolean functions. by analyzing the output and input sequences of a nonlinear combined generator, we also give out an algorithm ( lhc ) to evolve the correlation from a random function to a very lower one
本文研究了hillclimbing演算法以及布爾函數非線性度的性質，對hillclimbing演算法進行改進，提高了該方法下對布爾函數非線性度的優化設計;通過研究非線性組合生成器中驅動序列和輸出序列之間的關系，基於hillclimbing方法，本文進一步提出了改善非線性組合序列相關性指標（ f ）的組合函數f （ x ）的優化設計演算法lhc 。 -
By simulating the growth process in living nature, the structure of simple genetic algorithm was improved by growth operator which was realized by the hill climbing method
在具有強烈非線性的連續攪拌釜式反應器模型上進行模擬試驗。
分享友人