User : adkatrit
![]() |
Title | User | Language | Tags | Description | Date |
|---|---|---|---|---|---|---|
|
backup into folder daily | adkatrit | Bash | backup | i've got this running on an hourly cron. works beautifully. |
June 29 |
|
robotic script done notification | adkatrit | Bash | say | February 18, 2011 | |
|
Hierarchical Clustering | adkatrit | Python | agglomerative | Helps if you have a distance function. This will be implementation specific, but this is the main algo |
February 11, 2011 |
|
K-Means Clustering | adkatrit | Python | K-Means | This is from the book: Programming Collective Intelligence |
February 11, 2011 |
|
Entropy | adkatrit | Python | entropy | takes a list and returns the entropy |
February 11, 2011 |
|
Variance | adkatrit | Python | variance | February 11, 2011 | |
|
Gaussian | adkatrit | Python | Gaussian | February 11, 2011 | |
|
calculate angle between two vectors | adkatrit | Python | Vector | February 11, 2011 | |
|
Weighted Mean | adkatrit | Python | mean | February 11, 2011 | |
|
Tanimoto Coefficient | adkatrit | Python | tanimototanimoto | February 11, 2011 | |
|
Gini Impurity | adkatrit | Python | Impurity | February 11, 2011 | |
|
Pearson Correlation Coefficient | adkatrit | Python | correlation | February 11, 2011 | |
|
Euclidean Distance | adkatrit | Python | euclidean | February 11, 2011 | |
|
Matching elements in an array | adkatrit | Java | Coefficient | compare individual array elements with one another, without doing the same comparison twice (3vs2 then 2vs3). this reduces the number of iterations by roughly half. it's still O(n^2), an 1000 member array won't iterate a 1000X1000 times, it will be (1000X999)/2. efficient!! an array of 0,1,2,3 will print out the following: 01,02,03,,12,13,2,3 ENJOY MY MATHS |
October 30, 2010 |
|
new york times article api function | adkatrit | PHP | times | October 16, 2010 | |

