분류 전체보기
-
Natural Language Processing (NLP)MLAI 2020. 1. 22. 23:32
1. Overview Natural language process (NLP) is an area of Computer Science and Artificial Intelligence concerned with interactions between computers and human or natural languages. NLP is used to apply machine learning models to text and language. 2. Description 2.1 Bag of Words Very popular NLP model. It is a model used to preprocess the texts to classify before fitting the classification algori..
-
Selection SortAlgoDS/Algorithm 2020. 1. 22. 17:35
1. Overview The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning. It's one of the Greedy Algorithms. 2. Description 2.1 Procedure The algorithm maintains two subarrays in a given array. In every iteration of selection sort, the minimum element (considering ascending order) from t..
-
DivideAndConquerAlgoDS/Algorithm 2020. 1. 22. 12:33
1. Overview Divide and Conquer is an algorithmic design paradigm that works by recursively breaking down a problem into sub-problems of a similar type until these become simple enough to be solved directly. The solutions to the sub-problems are then combined to give solution to the original problem. Divide: Break the given problem into subproblems of the same type Conquer: Recursively solve thes..
-
Greedy AlgorithmAlgoDS/Algorithm 2020. 1. 22. 12:32
1. Overview Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. So the problems where choosing locally optimal also leads to a global solution is the best fit for Greedy. Greedy Algorithm is an algorithmic paradigm that builds up a solution piece by pice It always chooses the next piece tha..
-
Thompson SamplingMLAI 2020. 1. 22. 08:31
1. Overview 2. Description 2.1 Intuition when you get a job description but basically just imagine distribution behind each one of these expected values. So this is just the center of central distribution or the actual expected return from that machine. the algorithm actually works the algorithm itself doesn't know this information. So this is hidden but it's just there for us so that we can bet..
-
EclatMLAI 2020. 1. 22. 07:31
1. Overview 2. Description 2.1 Supports In the Eclat model just like in the a priori model, we have the support factor. So people who are watching a certain combinations of movies. So we're just looking at how frequently does this set of items occur. How often does this set off to movies that say interstellar and ex-machine? How often does it occur in all of the watch lists or what percentage of..
-
Hierarchical Clustering and DendrogramsMLAI/Clustering 2020. 1. 22. 06:17
1. Overview If you have points on your scatterplot or data points as we looked at previously this is a two-dimensional space. If you apply a hierarchical clustering or just say H.C. for short. What'll happen is you will get clusters again very very similar to Kamins In fact sometimes the result of no results can be exactly the same as like k-means clustering. But the whole process is a bit diffe..
-
Decision TreeMLAI/Classification 2020. 1. 21. 16:55
1. Overview A decision tree is a decision support tool that uses a tree-like model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. It is one way to display an algorithm that only contains conditional control statements. Decision trees are commonly used in operations research, specifically in decision analysis, to help identify a strateg..