Optimal Matching in Julia Using Distributed Computing: Time Use Data (ATUS)

Kamila Kolpashnikova

No cuyqn, OSF Preprints from Center for Open Science

Abstract: A brief tutorial on how to run optimal matching in Julia. The performance gains: it is twice faster than TraMineR on a dataset of about 20000 sequences with 96 steps each.

Date: 2021-12-07
References: Add references at CitEc
Citations:

Downloads: (external link)
https://osf.io/download/61af9d5fc7d9fb0b91eb3d23/

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:osf:osfxxx:cuyqn

DOI: 10.31219/osf.io/cuyqn

Access Statistics for this paper

More papers in OSF Preprints from Center for Open Science
Bibliographic data for series maintained by OSF ().