package modelkit
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Portable classical machine learning workflows for OCaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
modelkit-0.5.0.tbz
sha256=1fe8fa7c7f904dd098a21a2ca30fd69230750b8cf8aa2ae481b97a16531b47b4
sha512=c946cd1ac014726f4d21791e14d806a205680e6edfa2f80ed8d3680f24f48ca3c5a2f89d5afa68c11eac4053ead448b6381fb3d06dc8ff129097af6c69b262fb
doc/modelkit/Modelkit/Ranking_metrics/index.html
Module Modelkit.Ranking_metrics
Discounted cumulative gain over per-row graded relevance.
Each row of relevance holds finite non-negative gains for the row's items and each row of scores holds the ranking scores; both matrices share one shape with at least two columns. Rank r receives discount 1 / log2 (r + 2), and k zeroes discounts from rank k onward. By default tied scores share the mean gain of their group times the group's summed discount, following McSherry and Najork; ignore_ties instead ranks tied items by descending column index as scikit-learn's reversed stable sort does. NDCG divides each row by its ideal DCG and scores an all-zero row as zero. Both metrics average rows by sample weight and cost O(rows * columns log columns).
val dcg :
?k:int ->
?ignore_ties:bool ->
?sample_weight:Sample_weight.t ->
relevance:Matrix.t ->
scores:Matrix.t ->
unit ->
(float, Error.t) resultval ndcg :
?k:int ->
?ignore_ties:bool ->
?sample_weight:Sample_weight.t ->
relevance:Matrix.t ->
scores:Matrix.t ->
unit ->
(float, Error.t) result sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>