Lakhesis: Consensus Seriation Method for Binary Matrices

A method and R package for constructing and harmonizing partial seriations from binary matrices. The Lakhesis routine uses iterative regression to combine potentially discrepant orderings into a single consensus seriation. The package includes a graphical interface for exploring binary matrices and performing correspondence analysis.

Use Cases

• Perform consensus seriation on binary data based on the described Lakhesis algorithm.
• Explore and seriate partial subsets of binary matrices using correspondence analysis.
• Compare the performance of the Lakhesis method against conventional seriation approaches.

Strengths

• The method is described as having the capacity to outperform conventional approaches according to optimality measures.
• The associated R package provides a graphical interface for analysis.

Limitations

• Column-level documentation is absent; field semantics must be inferred after download.
• Row count is unknown, which may limit suitability assessment.

Provenance

Source

Stephen A. Collins-Elliott via figshare

Freshness

Last updated 2026-05-28 01:39:09; freshness should be verified.