Skip to content

Commit ded2108

Browse files
committed
working on submission
1 parent 4bae1a5 commit ded2108

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

projects/student_intervention/student_intervention.ipynb

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1049,7 +1049,7 @@
10491049
"source": [
10501050
"The Support Vector Classifier was the best performing model with an F<sub>1</sub> score of 0.8462 when testing on 300 samples. Compared to a score of 0.7681 for K Nearest Neighbors and 0.7481 for Decision Trees.\n",
10511051
"\n",
1052-
"The resources, cost and performanc were not a major factor for the given data. This is due to the small amount of data in this example. Although all training and prediction times were very low, training was shortest for k-nearest neighbors because it does it's computation at prediction time, then decision trees, and the SVC was the slowest. Prediction time was shortest for decision trees, then the SVC and slowest for k-nearest neighbors.\n"
1052+
"The resources, cost and performanc were not a major factor for the given data. This is due to the small amount of data in this example. Although all training and prediction times were very low, training was shortest for K Nearest Neighbors at 0.001 seconds for 300 samples because it does it's computation at prediction time, then decision trees at 0.003 seconds for 300 samples, and the SVC at 0.009 seconds for 300 samples was the slowest. Prediction time was shortest for decision trees, then the SVC and slowest for k-nearest neighbors.\n"
10531053
]
10541054
},
10551055
{
@@ -1058,7 +1058,7 @@
10581058
"source": [
10591059
"Support Vector classification works by linearly separating classes of data. A linear separator is chosen by finding the largest margin between classes. Data points that are closest to the margins on both sides of the separator are considerted the support vecotors.\n",
10601060
"\n",
1061-
"When a linear separation of data cannot be acoomplished, SVM uses a kernel trick to map the data into a higher dimension. With a kernel trick applied, the data becomes linearly separable."
1061+
"When a linear separation of data cannot be acoomplished, SVM uses a kernel trick to map add the data into a higher dimension. With a kernel trick applied, the data becomes linearly separable."
10621062
]
10631063
},
10641064
{

0 commit comments

Comments
 (0)