NEWS (original) (raw)

BGGM 2.1.4.9000 (development version)

Bug Fixes and Improvements

C++ search Function

  1. Improved Initialization
    • The initial adjacency matrix now takes start_adj (the maximum likelihood solution) as the starting point to avoid inefficient sampling.
  2. Adaptive Sampling
    • The sampling of zeros and nonzeros is now adapted to the newly accepted adjacency matrix(adj_s) rather than the static start_adj.
  3. Efficiency Enhancements
    • Skip updates on rejection since the graph remains unchanged.
    • Use find_ids(adj_mat) instead offind_ids(start_adj) to ensure edge modifications are correctly tracked after acceptance.

Minor Changes:

BGGM 2.1.4

BGGM 2.1.3

BGGM 2.1.2

BGGM 2.1.1

BFpack dependency error fixed.

BGGM 2.0.1

This version of BGGM included changes based on the JOSS reviews: seeherefor the overview and herefor specific issues.

BGGM 2.0.0

BGGM was almost completely rewritten for version2.0.0. This was due to adding support for binary, ordinal, and mixed data, which required that the methods be written inc ++. Unfortunately, as a result, lots of code from version1.0.0 is broken.

Added features

Extensions

BGGM 1.0.0

Initial CRAN release