Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
alexhwoods
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
23 ms
·
31.
▲
Persistent Connections HTTP
(alexhwoods.com)
2 points
by
alexhwoods
7y ago
|
0 comments
32.
▲
Git's DAG
(alexhwoods.com)
1 points
by
alexhwoods
7y ago
|
0 comments
33.
▲
Gradle Is a DAG
(alexhwoods.com)
2 points
by
alexhwoods
7y ago
|
0 comments
34.
▲
What Is a Topological Ordering?
(alexhwoods.com)
1 points
by
alexhwoods
7y ago
|
0 comments
35.
▲
What Is a DAG?
(alexhwoods.com)
1 points
by
alexhwoods
7y ago
|
0 comments
36.
▲
Dijkstra's Algorithm in Kotlin
(alexhwoods.com)
1 points
by
alexhwoods
7y ago
|
0 comments
37.
▲
How similar is the execution of Java and JavaScript?
(alexhwoods.com)
2 points
by
alexhwoods
8y ago
|
0 comments
38.
▲
Dijkstra's Algorithm in Python
(alexhwoods.com)
4 points
by
alexhwoods
10y ago
|
0 comments
39.
▲
Three Challenging Combinatorics Problems
(alexhwoods.com)
2 points
by
alexhwoods
10y ago
|
0 comments
40.
▲
Using Terminal on a Mac
(alexhwoods.com)
3 points
by
alexhwoods
10y ago
|
0 comments
41.
▲
Information Theory: Entropy
(alexhwoods.com)
3 points
by
alexhwoods
11y ago
|
0 comments
42.
▲
Principal Component Analysis in 4 Steps
(alexhwoods.com)
7 points
by
alexhwoods
11y ago
|
0 comments
43.
▲
Guide to Linear Regression (2015)
(alexhwoods.com)
84 points
by
alexhwoods
11y ago
|
28 comments
44.
▲
Eigenvectors and Machine Learning
(alexhwoods.com)
3 points
by
alexhwoods
11y ago
|
1 comments
45.
▲
Markov Chains in R
(alexhwoods.com)
2 points
by
alexhwoods
11y ago
|
0 comments
46.
▲
Important Tools for Machine Learning–Eigenvalues
(alexhwoods.com)
1 points
by
alexhwoods
11y ago
|
0 comments
47.
▲
Bayes Theorem and Naive Bayes
(alexhwoods.com)
79 points
by
alexhwoods
11y ago
|
19 comments
48.
▲
Markov Chains in R
(alexhwoods.com)
2 points
by
alexhwoods
11y ago
|
0 comments
49.
▲
Matrices in Julia
(alexhwoods.com)
51 points
by
alexhwoods
11y ago
|
29 comments
50.
▲
Generating Text Using a Markov Model
(alexhwoods.com)
3 points
by
alexhwoods
11y ago
|
0 comments
51.
▲
K-Nearest Neighbors in scikit-learn
(alexhwoods.com)
2 points
by
alexhwoods
11y ago
|
0 comments
52.
▲
by
alexhwoods
11y ago
Good question! Each iteration of the model occurs for one unit of time. Because of this, we can directly compare distance and velocity. Like if velocity was meters per second, and distance was meters, since the velocity update occurs for on
53.
▲
by
alexhwoods
11y ago
Ya I didn't mean it literally. Thank you for reading!
54.
▲
Introduction to Monte Carlo Methods
(alexhwoods.com)
78 points
by
alexhwoods
11y ago
|
11 comments
55.
▲
by
alexhwoods
11y ago
I agree with everything said above. I think the term "data scientist" is used very loosely. With some of the "data science" I see in big companies, they tend to just import the library and leave the math up to PhD's
56.
▲
by
alexhwoods
11y ago
agreed
57.
▲
by
alexhwoods
11y ago
Hey, one easy way to decide features is to use a correlation matrix. The stronger the correlation coefficient r is, the more of a linear relationship exists. The code goes like this - install.packages('corrplot') library(corrplot)
58.
▲
Guide to Linear Regression
(alexhwoods.com)
67 points
by
alexhwoods
11y ago
|
15 comments