alluvial - Alluvial Diagrams
Creating alluvial diagrams (also known as parallel sets plots) for multivariate and time series-like data.
Last updated
alluvial-diagrams
11.25 score 145 stars 8 dependents 281 scripts 8.6k downloadsintergraph - Coercion Routines for Network Data Objects
Functions implemented in this package allow to coerce (i.e. convert) network data between classes provided by other R packages. Currently supported classes are those defined in packages: network and igraph.
Last updated
10.17 score 22 stars 21 dependents 966 scripts 7.3k downloads
oai - General Purpose 'Oai-PMH' Services Client
A general purpose client to work with any 'OAI-PMH' (Open Archives Initiative Protocol for 'Metadata' Harvesting) service. The 'OAI-PMH' protocol is described at <http://www.openarchives.org/OAI/openarchivesprotocol.html>. Functions are provided to work with the 'OAI-PMH' verbs: 'GetRecord', 'Identify', 'ListIdentifiers', 'ListMetadataFormats', 'ListRecords', and 'ListSets'.
Last updated
data-accessoai-pmhpeer-reviewedscholarly-api
8.77 score 15 stars 30 dependents 24 scripts 7.2k downloads
netseg - Measures of Network Segregation and Homophily
Segregation is a network-level property such that edges between predefined groups of vertices are relatively less likely. Network homophily is a individual-level tendency to form relations with people who are similar on some attribute (e.g. gender, music taste, social status, etc.). In general homophily leads to segregation, but segregation might arise without homophily. This package implements descriptive indices measuring homophily/segregation. It is a computational companion to Bojanowski & Corten (2014) <doi:10.1016/j.socnet.2014.04.001>.
Last updated
homophilysegregationsocial-networks
5.84 score 19 stars 24 scripts 266 downloadslinkprediction - Link Prediction Methods
Implementations of most of the existing proximity-based methods of link prediction in graphs. Among the 20 implemented methods are e.g.: Adamic L. and Adar E. (2003) <doi:10.1016/S0378-8733(03)00009-1>, Leicht E., Holme P., Newman M. (2006) <doi:10.1103/PhysRevE.73.026120>, Zhou T. and Zhang Y (2009) <doi:10.1140/epjb/e2009-00335-8>, and Fouss F., Pirotte A., Renders J., and Saerens M. (2007) <doi:10.1109/TKDE.2007.46>.
Last updated
5.70 score 12 stars 28 scripts 282 downloadslinkprediction - Link Prediction Methods
Implementations of most of the existing proximity-based methods of link prediction in graphs. Among the 20 implemented methods are e.g.: Adamic L. and Adar E. (2003) <doi:10.1016/S0378-8733(03)00009-1>, Leicht E., Holme P., Newman M. (2006) <doi:10.1103/PhysRevE.73.026120>, Zhou T. and Zhang Y (2009) <doi:10.1140/epjb/e2009-00335-8>, and Fouss F., Pirotte A., Renders J., and Saerens M. (2007) <doi:10.1109/TKDE.2007.46>.
Last updated
5.70 score 12 stars 28 scripts 282 downloads
rgraph6 - Representing Graphs as 'graph6', 'digraph6' or 'sparse6' Strings
Encode network data as strings of printable ASCII characters. Implemented functions include encoding and decoding adjacency matrices, edgelists, igraph, and network objects to/from formats 'graph6', 'sparse6', and 'digraph6'. The formats and methods are described in McKay, B.D. and Piperno, A (2014) <doi:10.1016/j.jsc.2013.09.003>.
Last updated
network-analysiscpp
5.08 score 12 stars 9 scripts 529 downloads