原创 非支配解Non-dominated solution/帕累託解Pareto set

當目標函數處於衝突狀態時,就不會存在使所有目標函數同時達到最大或最小的最優解,於是我們只能尋求非劣解(又稱非支配解或帕累託解) 可以通過定義評價函數進一步最Pareto set進行評價,得到在Pareto set的最佳滿意解  

原创 Python self是什麼

類變量和實例變量 類變量可以被所有的實例使用 所有實例得到的類變量相同 實例變量屬於實例 Class SomeClass:     variable_1 = “ This is a class variable”     va

原创 1.Two Sum

class Solution(object): def twoSum(self, nums, target): """ :type nums: List[int] :type ta

原创 13. Roman to Integer

""" Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I

原创 進化計算/進化算法×傳統數學優化方法×機器學習

進化算法VS傳統數學優化方法 進化算法是基於種羣的搜索 進化算法是隨機的搜索算法,不需要梯度,不需要解析的目標函數   進化算法優勢 適用於沒有解析目標函數和無法得到目標函數梯度信息的優化問題 基於種羣,一次運行得到一組解,

原创 數組和鏈表-Array and Linked list

數組和鏈表 數組 數組必須相連 若超出預留空間(添加元素):預留更多空間 缺點: 用不上,浪費內存 超出內存要轉移 鏈表 鏈表中的元素可以存儲在內存任何地方,鏈表的每個元素都存儲了下一個元素的地址,從而使一系列隨機的內存地址串在一

原创 動態規劃-Dynamic planning

動態規劃(dynamic planning) WIKI Dynamic programming is both a mathematical optimization method and a computer programming m

原创 提升算法-boosting algorithm

WIKI Boosting is a machine learning ensemble meta-algorithm for primarily reducing bias, and also variance[1] in superv

原创 二分查找-Binary search

二分查找 WIKI In computer science, binary search, also known as half-interval search,[1] logarithmic search,[2] or binary c

原创 支持向量機-support vector machines

WIKI In machine learning, support vector machines (SVMs, also support vector networks[1]) are supervised learning model

原创 邏輯斯諦迴歸與最大熵模型-logistic regression and maximum entropy model

Logistic迴歸模型 WIKI In statistics, the logistic model (or logit model) is a statistical model that is usually taken to ap

原创 K最近鄰算法-k-nearest neighbors algorithm

K最近鄰算法(k-nearest neighbors algorithm) WIKI In pattern recognition, the k-nearest neighbors algorithm (k-NN) is a non-pa

原创 K近鄰法-k-nearest neighbor,KNN

WIKI In pattern recognition, the k-nearest neighbors algorithm (k-NN) is a non-parametric method used for classificatio

原创 感知機(Perceptron)

WIKI In machine learning, the perceptron is an algorithm for supervised learning of binary classifiers (functions that

原创 決策樹-decision tree

WIKI Decision tree learning uses a decision tree (as a predictive model) to go from observations about an item (represe