Jason【Python & C#】Quick SortQuick Sort is also a very powerful and high performance Sorting Algorithm. And guest what? It’s similar to Merge Sort based on the Divide…6 min read·Apr 27, 2024----
Jason【C# & Python】Merge SortMerge Sort is one of the powerful Sorting Algorithms. Many interviewers use it to test their interviewees. So, let’s take a look at this…5 min read·Apr 19, 2024----
Jason【Python & C#】Bubble SortBubble Sort was the first algorithm I learned in my life. Even though it’s the simplest algorithm among sorting algorithms, I still spent…2 min read·Apr 5, 2024----
Jason【C# & Python】Insertion SortToday, I want to talks about Insertion Sort. This algorithm seems a little hard to understand for the beginners. However, I promise that…3 min read·Mar 31, 2024----
Jason【C# & Python】Selection SortBeing a software engineer, of course we know about the algorithms. But guess what? I hadn’t really focused on them when I was in college…3 min read·Mar 19, 2024----
Jason【學習筆記】K近鄰演算法-理論&Python實作K近鄰演算法,又稱KNN(K Nearest Neighbor),它跟我們先前介紹的K-means相當相似,都是「物以類聚」的機器學習演算法,而之間最大的差異,就在於KNN屬於監督是學習,K-means則為非監督式學習。6 min read·Jul 12, 2023----
Jason【學習筆記】Anova 理論&Python實作今天要來跟大家分享一個實用統計方法,那就叫做變異數分析(Anlysis of Variance, Anova)。其實簡單來說,Anova就是加強版的獨立樣本t檢定,之間不同之處,在於獨立樣本t檢定,只能兩組樣本之間來去做比較,而Anova可以進行兩組以上的樣本比較。10 min read·Jul 11, 2023----
Jason【學習筆記】獨立樣本t檢定-理論+Python實作獨立樣本t檢定(Independent sample t-test),是我們在學習統計時,必學的一個統計方式。雖然整體概念不複雜,但卻相當實用。在許多社會科學、醫學等相關論文,也常看到它的身影,所以這次就來深入探討一下,何謂獨立樣本t檢定。6 min read·Jul 5, 2023----
Jason【學習筆記】K-means實作篇上次介紹了K-means的基本原理,這次就來介紹一下Python的實作方式。首先介紹一下scikit-learne的KMeans套件,有哪些參數可以調整:7 min read·Jun 27, 2023----
Jason【學習筆記 】K-means理論篇K-means是一個典型的非監督式學習演算法,主要在處理資料的分群問題,例如將資料分成k個群體。K-means最大的特色,在於為非監督式學習,而所謂的非監督式學習,就是資料裡並沒有所謂標籤或標記,白話一點就是正確答案(依變項)。5 min read·Jun 26, 2023----