templateK40

A cluster template created by handwriter with 40 clusters. This
template was created from 100 handwriting samples from the CSAFE Handwriting
Database, the CVL Handwriting Database, and the IAM Handwriting Database.

cluster

Perform forensic handwriting analysis of two scanned handwritten documents. This package implements the statistical method described by Madeline Johnson and Danica Ommen (2021) <doi:10.1002/sam.11566>. Similarity measures and a random forest produce a score-based likelihood ratio that quantifies the strength of the evidence in favor of the documents being written by the same writer or different writers.

Stephanie Reinders

handwriterRF

Handwriting Analysis with Random Forests

Iowa State University of Science and Technology on behalf of its Center for Statistics and Applications in Forensic Evidence 

templateK40 function

A list containing the contents of the cluster template.<dl>
<dt>cluster</dt>
<dd>A vector of cluster assignments
for each graph used to create the cluster template. The clusters are numbered sequentially 1, 2,...,40.</dd><dt>centers</dt>
<dd>The final cluster centers produced by the K-Means algorithm.</dd><dt>K</dt>
<dd>The number of clusters in the template (40).</dd><dt>n</dt>
<dd>The number of training graphs to used to create the template (32,708).</dd><dt>wcd</dt>
<dd>The within cluster
distances, the distance between each graph and the nearest cluster center, on the final iteration of the K-means algorithm.</dd>
</dl>

Format

Cluster Template with 40 Clusters — templateK40

A list containing the contents of the cluster template.<dl>
<dt>cluster</dt>
<dd>A vector of cluster assignments
for each graph used to create the cluster template. The clusters are numbered sequentially 1, 2,...,40.</dd>

<dt>centers</dt>
<dd>The final cluster centers produced by the K-Means algorithm.</dd>

<dt>K</dt>
<dd>The number of clusters in the template (40).</dd>

<dt>n</dt>
<dd>The number of training graphs to used to create the template (32,708).</dd>

<dt>wcd</dt>
<dd>The within cluster
distances, the distance between each graph and the nearest cluster center, on the final iteration of the K-means algorithm.</dd>


</dl>

templateK40: Cluster Template with 40 Clusters

Description

Usage

Arguments

Format

Details

Examples