Optimal Matching Analysis
Optimal matching analysis measures how dissimilar two categorical sequences are by computing the minimum total cost of editing one sequence into the other through substitution and insertion/deletion operations. Borrowed from computer science and molecular biology and introduced to sociology by Andrew Abbott, it supplies the pairwise distances that underpin sequence analysis of careers, family histories, and other life-course trajectories.
Rekod sumber
Petikan disalin secara verbatim daripada rekod sumber kaedah. Tiada pengesahan peringkat tuntutan disimpulkan daripadanya.
- Abbott, A., & Tsay, A. (2000). Sequence analysis and optimal matching methods in sociology: review and prospect. Sociological Methods & Research, 29(1), 3–33. · DOI 10.1177/0049124100029001001
- Studer, M., & Ritschard, G. (2016). What matters in differences between life trajectories: a comparative review of sequence dissimilarity measures. Journal of the Royal Statistical Society: Series A, 179(2), 481–511. · DOI 10.1111/rssa.12125
Tuntutan yang dikurasi
Tuntutan disimpan dalam lejar bukti, setiap satu dengan penilaiannya sendiri.
Pandangan ini tidak mencipta penilaian tuntutan apabila lejar tiada.
Kaedah berkaitan
Dijana daripada graf kaedah dan ditunjukkan sebagai perhubungan yang dicadangkan mesin — tiada tuntutan bukti disimpulkan.