HN user

shazeline

125 karma

https://shahidchohan.com

Posts18
Comments19
View on HN
tim-one.github.io 1y ago

Tim Peters – Dispelling Information Asymmetry

shazeline
74pts25
statefun.io 6y ago

StateFun: Function-as-a-Service Powered by Apache Flink

shazeline
4pts0
engineeringblog.yelp.com 9y ago

Streaming Messages from Kafka into Redshift in Near Real-Time

shazeline
104pts10
www.youtube.com 10y ago

Videos from PyCon 2016

shazeline
17pts7
cs231n.stanford.edu 10y ago

CS231n: Convolutional Neural Networks for Visual Recognition

shazeline
2pts0
careynachenberg.weebly.com 10y ago

Finance 101 for Recent College Grads

shazeline
2pts0
blog.instavest.com 10y ago

Lessons from the early stage: Adwords (and Facebook) isn’t for you

shazeline
3pts1
www.catalysoft.com 11y ago

How to Strike a Match: White String Similarity

shazeline
1pts0
shahidchohan.com 11y ago

Resolving the Dress Color Debate with Code

shazeline
3pts0
modelviewculture.com 11y ago

The Code School-Industrial Complex

shazeline
2pts0
shahidchohan.com 12y ago

Clustering Jeopardy Categories Using Partially Labeled Topic Data

shazeline
1pts0
info.wealthfront.com 12y ago

2013 Silicon Valley Career Guide

shazeline
4pts0
www.linkedin.com 12y ago

Why Can’t Wall Street Out-Recruit Google and Facebook?

shazeline
2pts0
engineering.linkedin.com 12y ago

Using set cover algorithm to optimize query latency at LinkedIn

shazeline
1pts0
shahidchohan.com 12y ago

Building a Random Rap Generator

shazeline
4pts0
blog.arduino.cc 12y ago

Updates on the status of Arduino Yun

shazeline
2pts0
shahidchohan.com 13y ago

Silicon Beach Bums

shazeline
4pts0
www.engadget.com 13y ago

Stanford researchers create genetic transistors

shazeline
5pts0
Deep learning 11 years ago

You generally don't know if you've reached a suitable maxima, which is why it is good to run a nondeterministic optimizer a few times (if computation power allows) and see if there are any reliable parameters form there.

There are also somewhat better-than-random strategies such as Bayesian optimization and particle swarm optimization that can help you to search more efficiently.

I skimmed the source and didn't see anything regarding leader election. Am I missing something or is this implementation encapsulating some of the underlying terminology/analogies traditionally used by Raft?

One common approach is to look for the elbow in the curve <metric> vs K (number of clusters). This is essentially finding the number of clusters after which the rate of information gained/variance explained/<metric> slows. I believe it's possible to binary search for this point if you can assume the curve is convex.

Yeah, trg2 would need to put all the edge case rules towards the beginning. That, or just put the basic rules at the beginning and have separate conditionals at the end to handle the edge cases.