"summary.PlacketLuce"objects now respect
nwhich is now weighted count of rankings (previously only returned unweighted count with argument
aggregate = TRUE).
AIC.pltreeto work on
"pltree"object with one node.
AIC.pltreeto enable computation of AIC on new observations (e.g. data held out in cross-validation).
fitted.pltreeto return combined fitted probabilities for each choice within each ranking, for each node in a Plackett-Luce tree.
vcov.PlackettLucenow works for models with non-integer weights (fixes #25).
plot.pltreenow works for
worth = TRUEwith psychotree version 0.15-2 (currently pre-release on https://r-forge.r-project.org/R/?group_id=330)
plfitnow work when
startargument is set.
itempar.PlackettLucenow works with
alias = FALSE
plot.PlackettLucemethod so that plotting works for a saved
beansdata (which has been updated).
package?PlackettLuce. (Fixes #14 and #21).
maxitdefaults to 500 in
log = TRUEargument (fixes #19).
[.grouped_rankings]now works for replicated indices.
pltree()function for use with
partykit::mob(). Requires new objects of type
"grouped_rankings"that add a grouping index to a
"rankings"object and store other derived objects used by
PlackettLuce. Methods to print, plot and predict from Plackett-Luce tree are provided.
connectivity()function to check connectivity of a network given adjacency matrix. New
adjacency()function computes adjacency matrix without creating edgelist, so remove
as.edgelistgeneric and method for `“PlackettLuce” objects.
as.data.framemethods so that rankings and grouped rankings can be added to model frames.
formatmethods for rankings and grouped_rankings, for pretty printing.
[methods for rankings and grouped_rankings, to create valid rankings from selected rankings and/or items.
itemparmethod for “PlackettLuce” objects to obtain different parameterizations of the worth parameters.
read.socfunction to read Strict Orders - Complete List (.soc) files from http://www.preflib.org.
Old behaviour should be reproducible with arguments
npseudo = 0, steffensen = 0, start = c(rep(1/N, N), rep(0.1, D))
N is number of items and
D is maximum order of ties.
PlackettLuce; should be specified instead when calling
qvcalcgeneric now imported from qvcalc
coefso that worth parameters (probability of coming first in strict ranking of all items) can be obtained easily.