incanter

Namespaces

incanter
- bayes
- censored
- charts
- core
- datasets
- distributions
- excel
- infix
- internal
- io
- latex
- main
- mongodb
- optimize
- pdf
- processing
- som
- stats
- symbolic

1.2.3-SNAPSHOT

1.2.3-SNAPSHOT permalink

hamming-distance

http://en.wikipedia.org/wiki/Hamming_distance

In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. Put another way, it measures the minimum number of substitutions required to change one string into the other, or the number of errors that transformed one string into the other.

0 Examples top

Source incanter/stats.clj:3112 top

(defn hamming-distance
"http://en.wikipedia.org/wiki/Hamming_distance

In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. Put another way, it measures the minimum number of substitutions required to change one string into the other, or the number of errors that transformed one string into the other."
[a b]
(if (and (integer? a) (integer? b))
  (hamming-distance (str a) (str b))
(let [_ (assert (= (count a) (count b)))]
(apply
 tree-comp-each 
  + 
  #(bool-to-binary (not (apply = %)))
  (map vector a b)))))

Vars in incanter.stats/hamming-distance: + = and apply defn integer? let map not str vector

Used in 0 other vars

ClojureDocs(beta)

incanter

Namespaces

hamming-distance

incanter.stats

0 Examples top

See Also top

Source incanter/stats.clj:3112 top

Comments top

No comments for hamming-distance. Log in to add a comment.