<?xml version="1.0" encoding="utf-8" ?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:r="https://r-universe.dev"><channel><title>agostinognasso.r-universe.dev</title><link>https://agostinognasso.r-universe.dev</link><description>Recent package updates in agostinognasso</description><generator>R-universe</generator><image><url>https://github.com/agostinognasso.png</url><title>R packages by agostinognasso</title><link>https://agostinognasso.r-universe.dev</link></image><lastBuildDate>Wed, 09 Sep 2026 09:31:33 GMT</lastBuildDate><item><title>[agostinognasso] rankimp 1.0.0</title><author>agostino.gnasso@unina.it (Agostino Gnasso)</author><description>Variable importance rankings depend on the method, the
random seed and the resample used to compute them. This package
treats every source of importance as a judge expressing a
ranking over the predictors, and synthesises those rankings
into a Kemeny median ranking with ties. Uncertainty about the
consensus is quantified through bootstrap rank confidence sets,
top-k probabilities and clustering of disagreeing judges.</description><link>https://github.com/r-universe/agostinognasso/actions/runs/39113155482</link><pubDate>Wed, 09 Sep 2026 09:31:33 GMT</pubDate><r:package>rankimp</r:package><r:version>1.0.0</r:version><r:status>success</r:status><r:repository>https://agostinognasso.r-universe.dev</r:repository><r:upstream>https://github.com/agostinognasso/rankimp</r:upstream><r:article><r:source>rankimp-intro.Rmd</r:source><r:filename>rankimp-intro.html</r:filename><r:title>Consensus ranking of variable importance</r:title><r:created>2026-07-09 21:44:36</r:created><r:modified>2026-09-08 10:28:06</r:modified></r:article><r:article><r:source>reference.Rmd</r:source><r:filename>reference.html</r:filename><r:title>Every function, and when you want it</r:title><r:created>2026-09-08 10:28:06</r:created><r:modified>2026-09-08 10:28:06</r:modified></r:article><r:article><r:source>stability.Rmd</r:source><r:filename>stability.html</r:filename><r:title>How stable is a variable importance ranking?</r:title><r:created>2026-07-09 21:44:36</r:created><r:modified>2026-09-08 15:29:59</r:modified></r:article><r:article><r:source>credit-scoring.Rmd</r:source><r:filename>credit-scoring.html</r:filename><r:title>Robustly important variables in credit scoring</r:title><r:created>2026-07-09 21:44:36</r:created><r:modified>2026-09-08 15:29:59</r:modified></r:article><r:article><r:source>against-set-stability.Rmd</r:source><r:filename>against-set-stability.html</r:filename><r:title>Set stability is not rank stability</r:title><r:created>2026-07-10 07:41:23</r:created><r:modified>2026-09-08 10:28:06</r:modified></r:article><r:article><r:source>theory.Rmd</r:source><r:filename>theory.html</r:filename><r:title>The theory the package rests on</r:title><r:created>2026-09-08 10:28:06</r:created><r:modified>2026-09-08 10:28:06</r:modified></r:article><r:article><r:source>method-disagreement.Rmd</r:source><r:filename>method-disagreement.html</r:filename><r:title>When XAI methods disagree</r:title><r:created>2026-07-09 21:44:36</r:created><r:modified>2026-09-08 10:28:06</r:modified></r:article></item><item><title>[agostinognasso] Proximum 1.1.0</title><author>agostino.gnasso@unina.it (Agostino Gnasso)</author><description>Treats the proximity matrices produced by tree ensembles
as first-class statistical objects rather than as model
by-products. Provides a unified extractor across ensemble
engines, in-bag and out-of-bag definitions, transformations to
dissimilarities with metric diagnostics, corrections that make
an indefinite proximity usable as a kernel, and permutation
inference for comparing two proximity matrices or partitioning
one across the terms of a design. Also provides a Nystrom
approximation, a thresholded sparse representation and a
streaming form that never allocates the matrix at all, for
samples too large to hold it, measures how far the proximity
moves between replicates of the ensemble, and draws each object
through 'ggplot2': the seriated matrix, the configuration it
implies, and the thresholded graph with its communities.</description><link>https://github.com/r-universe/agostinognasso/actions/runs/39113047542</link><pubDate>Wed, 09 Sep 2026 09:26:52 GMT</pubDate><r:package>Proximum</r:package><r:version>1.1.0</r:version><r:status>success</r:status><r:repository>https://agostinognasso.r-universe.dev</r:repository><r:upstream>https://github.com/agostinognasso/proximum</r:upstream><r:article><r:source>credit-scoring-case.Rmd</r:source><r:filename>credit-scoring-case.html</r:filename><r:title>A credit scoring case study</r:title><r:created>2026-07-09 21:44:18</r:created><r:modified>2026-09-08 10:34:13</r:modified></r:article><r:article><r:source>comparing-forests.Rmd</r:source><r:filename>comparing-forests.html</r:filename><r:title>Comparing forests through their proximities</r:title><r:created>2026-07-09 21:44:18</r:created><r:modified>2026-09-08 10:34:13</r:modified></r:article><r:article><r:source>Proximum-intro.Rmd</r:source><r:filename>Proximum-intro.html</r:filename><r:title>Proximity matrices as statistical objects</r:title><r:created>2026-07-10 11:18:46</r:created><r:modified>2026-09-08 10:34:13</r:modified></r:article><r:article><r:source>large-n.Rmd</r:source><r:filename>large-n.html</r:filename><r:title>Proximity matrices when n is large</r:title><r:created>2026-07-09 21:44:18</r:created><r:modified>2026-09-08 15:29:36</r:modified></r:article></item></channel></rss>