agop: Aggregation Operators and Preordered Sets
Version 0.1-4

Tools supporting multi-criteria decision making, including variable number of criteria, by means of aggregation operators and preordered sets. Possible applications include, but are not limited to, scientometrics and bibliometrics.

Browse man pages Browse package API and functions Browse package files

AuthorMarek Gagolewski [aut, cre], Anna Cena [ctb]
Date of publication2014-09-14 23:59:28
MaintainerMarek Gagolewski <gagolews@rexamine.com>
LicenseLGPL (>= 3)
Version0.1-4
URL http://agop.rexamine.com/
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("agop")

Man pages

agop-package: Aggregation Operators Package for R
closure_total_fair: Total Closure of Adjacency Matrix [Fair Totalization]
closure_transitive: Transitive Closure of Adjacency Matrix
de_transitive: De-transitivitize Graph
get_equivalence_classes: Get All Equivalence Classes of a Total Binary Relation
get_incomparable_pairs: Get Incomparable Pairs in an Adjacency Matrix
get_independent_sets: Get All Maximal Independent Sets
index_g: Egghe's g-index
index_h: Hirsch's h-index
index_lp: The l_p-index
index_maxprod: Kosmulski's MAXPROD-index
index_rp: The r_p-index
index_w: Woeginger's w-index
is_reflexive: Check if Given Adjacency Matrix is Reflexive
is_total: Check if Given Adjacency Matrix is Total
is_transitive: Check if Given Adjacency Matrix is Transitive
owa: WAM and OWA Operators
owmax: WMax, WMin, OWMax, and OWMin Operators
Pareto2: Pareto Type-II (Lomax) Distribution
pareto2_estimate_mle: Parameter Estimation in the Pareto-II Distribution (MLE)
pareto2_estimate_mmse: Parameter Estimation in the Pareto-II Distribution (MMSE)
pareto2_test_f: Two-Sample F-test For Equality of Shape Parameters for Type...
plot_producer: Draws a Graphical Representation of a Given Vector
pord_weakdom: Weak Dominance Relation (Preorder)
rel_graph: Create Adjacency Matrix of Given Binary Relation

Functions

agop-package Man page
closure_total_fair Man page Source code
closure_transitive Man page Source code
de_transitive Man page Source code
dpareto2 Man page Source code
get_equivalence_classes Man page Source code
get_incomparable_pairs Man page Source code
get_independent_sets Man page Source code
index.g Man page
index.h Man page
index.lp Man page
index.rp Man page
index_g Man page Source code
index_g_zi Man page Source code
index_h Man page Source code
index_lp Man page Source code
index_maxprod Man page Source code
index_rp Man page Source code
index_w Man page Source code
is_reflexive Man page Source code
is_total Man page Source code
is_transitive Man page Source code
owa Man page Source code
owmax Man page Source code
owmin Man page Source code
pareto2_estimate_mle Man page Source code
pareto2_estimate_mmse Man page Source code
pareto2_test_f Man page Source code
plot.citfun Man page
plot_producer Man page Source code
pord_weakdom Man page Source code
ppareto2 Man page Source code
qpareto2 Man page Source code
rel_graph Man page Source code
rpareto2 Man page Source code
wam Man page Source code
wmax Man page Source code
wmin Man page Source code

Files

inst
inst/CITATION
src
src/agops_impact.cpp
src/agop.h
src/agop.cpp
src/agops_classical.cpp
src/preorders.cpp
src/prepare_arg.cpp
NAMESPACE
NEWS
R
R/distrib-pareto2.R
R/agops-classical.R
R/preorders.R
R/distrib-pareto2-estimators.R
R/distrib-pareto2-ftest.R
R/visualization.R
R/agop-package.R
R/agops-impact.R
MD5
DESCRIPTION
man
man/get_incomparable_pairs.Rd
man/get_independent_sets.Rd
man/index_w.Rd
man/index_h.Rd
man/index_g.Rd
man/pord_weakdom.Rd
man/rel_graph.Rd
man/index_rp.Rd
man/pareto2_estimate_mmse.Rd
man/owa.Rd
man/plot_producer.Rd
man/owmax.Rd
man/pareto2_estimate_mle.Rd
man/agop-package.Rd
man/pareto2_test_f.Rd
man/is_total.Rd
man/index_lp.Rd
man/index_maxprod.Rd
man/is_reflexive.Rd
man/de_transitive.Rd
man/closure_transitive.Rd
man/Pareto2.Rd
man/is_transitive.Rd
man/closure_total_fair.Rd
man/get_equivalence_classes.Rd
agop documentation built on May 20, 2017, 4:38 a.m.