CourseClub Me O`REILLY - Data Science Bookcamp video edition

1. 1 - Case study 1 - Finding the winning strategy in a card game.mp46.89MB
2. 10 - Chapter 3. Using permutations to shuffle cards.mp435.4MB
3. 100 - Chapter 20. Network-driven supervised machine learning.mp448.95MB
4. 101 - Chapter 20. The basics of supervised machine learning.mp449.2MB
5. 102 - Chapter 20. Measuring predicted label accuracy, Part 1.mp437.28MB
6. 103 - Chapter 20. Measuring predicted label accuracy, Part 2.mp455.24MB
7. 104 - Chapter 20. Optimizing KNN performance.mp435.68MB
8. 105 - Chapter 20. Running a grid search using scikit-learn.mp439.33MB
9. 106 - Chapter 20. Limitations of the KNN algorithm.mp463.16MB
10. 107 - Chapter 21. Training linear classifiers with logistic regression.mp458.26MB
11. 108 - Chapter 21. Training a linear classifier, Part 1.mp443.52MB
12. 109 - Chapter 21. Training a linear classifier, Part 2.mp473.26MB
13. 11 - Chapter 4. Case study 1 solution.mp434.27MB
14. 110 - Chapter 21. Improving linear classification with logistic regression, Part 1.mp443.42MB
15. 111 - Chapter 21. Improving linear classification with logistic regression, Part 2.mp443.12MB
16. 112 - Chapter 21. Training linear classifiers using scikit-learn.mp449.64MB
17. 113 - Chapter 21. Measuring feature importance with coefficients.mp493.13MB
18. 114 - Chapter 22. Training nonlinear classifiers with decision tree techniques.mp465.2MB
19. 115 - Chapter 22. Training a nested if_else model using two features.mp453.25MB
20. 116 - Chapter 22. Deciding which feature to split on.mp457.23MB
21. 117 - Chapter 22. Training if_else models with more than two features.mp457.79MB
22. 118 - Chapter 22. Training decision tree classifiers using scikit-learn.mp451.86MB
23. 119 - Chapter 22. Studying cancerous cells using feature importance.mp459.29MB
24. 12 - Chapter 4. Optimizing strategies using the sample space for a 10-card deck.mp447.1MB
25. 120 - Chapter 22. Improving performance using random forest classification.mp457.38MB
26. 121 - Chapter 22. Training random forest classifiers using scikit-learn.mp452.96MB
27. 122 - Chapter 23. Case study 5 solution.mp432.94MB
28. 123 - Chapter 23. Exploring the experimental observations.mp438.99MB
29. 124 - Chapter 23. Training a predictive model using network features, Part 1.mp452.59MB
30. 125 - Chapter 23. Training a predictive model using network features, Part 2.mp453.87MB
31. 126 - Chapter 23. Adding profile features to the model.mp462.03MB
32. 127 - Chapter 23. Optimizing performance across a steady set of features.mp442.55MB
33. 128 - Chapter 23. Interpreting the trained model.mp464.17MB
34. 13 - Case study 2 - Assessing online ad clicks for significance.mp431.4MB
35. 14 - Chapter 5. Basic probability and statistical analysis using SciPy.mp476.23MB
36. 15 - Chapter 5. Mean as a measure of centrality.mp436.58MB
37. 16 - Chapter 5. Variance as a measure of dispersion.mp473.89MB
38. 17 - Chapter 6. Making predictions using the central limit theorem and SciPy.mp458.61MB
39. 18 - Chapter 6. Comparing two sampled normal curves.mp431.46MB
40. 19 - Chapter 6. Determining the mean and variance of a population through random sampling.mp455.19MB
41. 2 - Chapter 1. Computing probabilities using Python This section covers.mp456.75MB
42. 20 - Chapter 6. Computing the area beneath a normal curve.mp464.57MB
43. 21 - Chapter 7. Statistical hypothesis testing.mp439.19MB
44. 22 - Chapter 7. Assessing the divergence between sample mean and population mean.mp468.3MB
45. 23 - Chapter 7. Data dredging - Coming to false conclusions through oversampling.mp479.88MB
46. 24 - Chapter 7. Bootstrapping with replacement - Testing a hypothesis when the population variance is unknown 1.mp453.28MB
47. 25 - Chapter 7. Bootstrapping with replacement - Testing a hypothesis when the population variance is unknown 2.mp452.78MB
48. 26 - Chapter 7. Permutation testing - Comparing means of samples when the population parameters are unknown.mp443.69MB
49. 27 - Chapter 8. Analyzing tables using Pandas.mp440.87MB
50. 28 - Chapter 8. Retrieving table rows.mp438.24MB
51. 29 - Chapter 8. Saving and loading table data.mp440.28MB
52. 3 - Chapter 1. Problem 2 - Analyzing multiple die rolls.mp460.89MB
53. 30 - Chapter 9. Case study 2 solution.mp433.6MB
54. 31 - Chapter 9. Determining statistical significance.mp443.58MB
55. 32 - Case study 3 - Tracking disease outbreaks using news headlines.mp46.6MB
56. 33 - Chapter 10. Clustering data into groups.mp461.4MB
57. 34 - Chapter 10. K-means - A clustering algorithm for grouping data into K central groups.mp461.2MB
58. 35 - Chapter 10. Using density to discover clusters.mp452.23MB
59. 36 - Chapter 10. Clustering based on non-Euclidean distance.mp468.79MB
60. 37 - Chapter 10. Analyzing clusters using Pandas.mp440.48MB
61. 38 - Chapter 11. Geographic location visualization and analysis.mp446.58MB
62. 39 - Chapter 11. Plotting maps using Cartopy.mp433.23MB
63. 4 - Chapter 2. Plotting probabilities using Matplotlib.mp453.74MB
64. 40 - Chapter 11. Visualizing maps.mp458.27MB
65. 41 - Chapter 11. Location tracking using GeoNamesCache.mp462.35MB
66. 42 - Chapter 11. Limitations of the GeoNamesCache library.mp469.19MB
67. 43 - Chapter 12. Case study 3 solution.mp434.63MB
68. 44 - Chapter 12. Visualizing and clustering the extracted location data.mp470.72MB
69. 45 - Case study 4 - Using online job postings to improve your data science resume.mp423.95MB
70. 46 - Chapter 13. Measuring text similarities.mp436.28MB
71. 47 - Chapter 13. Simple text comparison.mp444MB
72. 48 - Chapter 13. Replacing words with numeric values.mp442.07MB
73. 49 - Chapter 13. Vectorizing texts using word counts.mp444.5MB
74. 5 - Chapter 2. Comparing multiple coin-flip probability distributions.mp465.57MB
75. 50 - Chapter 13. Using normalization to improve TF vector similarity.mp448.56MB
76. 51 - Chapter 13. Using unit vector dot products to convert between relevance metrics.mp441.64MB
77. 52 - Chapter 13. Basic matrix operations, Part 1.mp448.78MB
78. 53 - Chapter 13. Basic matrix operations, Part 2.mp427.15MB
79. 54 - Chapter 13. Computational limits of matrix multiplication.mp447.81MB
80. 55 - Chapter 14. Dimension reduction of matrix data.mp461.74MB
81. 56 - Chapter 14. Reducing dimensions using rotation, Part 1.mp438.99MB
82. 57 - Chapter 14. Reducing dimensions using rotation, Part 2.mp437.56MB
83. 58 - Chapter 14. Dimension reduction using PCA and scikit-learn.mp464.72MB
84. 59 - Chapter 14. Clustering 4D data in two dimensions.mp454.44MB
85. 6 - Chapter 3. Running random simulations in NumPy.mp436.35MB
86. 60 - Chapter 14. Limitations of PCA.mp430.77MB
87. 61 - Chapter 14. Computing principal components without rotation.mp447.8MB
88. 62 - Chapter 14. Extracting eigenvectors using power iteration, Part 1.mp444.67MB
89. 63 - Chapter 14. Extracting eigenvectors using power iteration, Part 2.mp434.38MB
90. 64 - Chapter 14. Efficient dimension reduction using SVD and scikit-learn.mp468.6MB
91. 65 - Chapter 15. NLP analysis of large text datasets.mp447.16MB
92. 66 - Chapter 15. Vectorizing documents using scikit-learn.mp487.06MB
93. 67 - Chapter 15. Ranking words by both post frequency and count, Part 1.mp456.59MB
94. 68 - Chapter 15. Ranking words by both post frequency and count, Part 2.mp448.13MB
95. 69 - Chapter 15. Computing similarities across large document datasets.mp460.24MB
96. 7 - Chapter 3. Computing confidence intervals using histograms and NumPy arrays.mp447.59MB
97. 70 - Chapter 15. Clustering texts by topic, Part 1.mp473.3MB
98. 71 - Chapter 15. Clustering texts by topic, Part 2.mp487.08MB
99. 72 - Chapter 15. Visualizing text clusters.mp458.9MB
100. 73 - Chapter 15. Using subplots to display multiple word clouds, Part 1.mp450.57MB
101. 74 - Chapter 15. Using subplots to display multiple word clouds, Part 2.mp458.83MB
102. 75 - Chapter 16. Extracting text from web pages.mp439.55MB
103. 76 - Chapter 16. The structure of HTML documents.mp462.95MB
104. 77 - Chapter 16. Parsing HTML using Beautiful Soup, Part 1.mp440.42MB
105. 78 - Chapter 16. Parsing HTML using Beautiful Soup, Part 2.mp446.78MB
106. 79 - Chapter 17. Case study 4 solution.mp437.42MB
107. 8 - Chapter 3. Deriving probabilities from histograms.mp457.63MB
108. 80 - Chapter 17. Exploring the HTML for skill descriptions.mp459.65MB
109. 81 - Chapter 17. Filtering jobs by relevance.mp473.18MB
110. 82 - Chapter 17. Clustering skills in relevant job postings.mp466.54MB
111. 83 - Chapter 17. Investigating the technical skill clusters.mp441.46MB
112. 84 - Chapter 17. Exploring clusters at alternative values of K.mp469.37MB
113. 85 - Chapter 17. Analyzing the 700 most relevant postings.mp440.95MB
114. 86 - Case study 5 - Predicting future friendships from social network data.mp480.4MB
115. 87 - Chapter 18. An introduction to graph theory and network analysis.mp474.88MB
116. 88 - Chapter 18. Analyzing web networks using NetworkX, Part 1.mp430.92MB
117. 89 - Chapter 18. Analyzing web networks using NetworkX, Part 2.mp453.06MB
118. 9 - Chapter 3. Computing histograms in NumPy.mp452.99MB
119. 90 - Chapter 18. Utilizing undirected graphs to optimize the travel time between towns.mp457.39MB
120. 91 - Chapter 18. Computing the fastest travel time between nodes, Part 1.mp432.12MB
121. 92 - Chapter 18. Computing the fastest travel time between nodes, Part 2.mp449.04MB
122. 93 - Chapter 19. Dynamic graph theory techniques for node ranking and social network analysis.mp475.08MB
123. 94 - Chapter 19. Computing travel probabilities using matrix multiplication.mp440.21MB
124. 95 - Chapter 19. Deriving PageRank centrality from probability theory.mp448.36MB
125. 96 - Chapter 19. Computing PageRank centrality using NetworkX.mp444.66MB
126. 97 - Chapter 19. Community detection using Markov clustering, Part 1.mp460.05MB
127. 98 - Chapter 19. Community detection using Markov clustering, Part 2.mp475.21MB
128. 99 - Chapter 19. Uncovering friend groups in social networks.mp457.99MB