Traveling Salesman Problem Algorithm-Based Uniqueness Explainable Features of the Jawi-Arabic Manuscript for Digitalization
This study introduces an explainable feature representation approach based on the Traveling Salesman Problem (TSP) algorithm to enhance traceability for the machine knowledge using mathematical formula and computing algorithms due to the complexity of curvature in recognizing each character for manuscript digitization.