Dataset Groups Activity Stream Restricted Boltzmann Machine Assignment Algorithm The dataset is used to solve a perfect matching problem on a bipartite weighted graph. It contains 351 elements for the set A and 35 for the set B. BibTex: @dataset{Francesco_Curia_2024, abstract = {The dataset is used to solve a perfect matching problem on a bipartite weighted graph. It contains 351 elements for the set A and 35 for the set B.}, author = {Francesco Curia}, doi = {10.57702/nh088k1p}, institution = {No Organization}, keyword = {'Restricted Boltzmann Machine', 'many-to-one matching', 'weighted bipartite graph'}, month = {dec}, publisher = {TIB}, title = {Restricted Boltzmann Machine Assignment Algorithm}, url = {https://service.tib.eu/ldmservice/dataset/restricted-boltzmann-machine-assignment-algorithm}, year = {2024} }
