10TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTING AND COMMUNICATION TECHNOLOGIES, CONECCT 2024(2024)
Ganpat Univ
被引用0|浏览8
摘要
Pairing is a vital task in industries today for rational allocation of resources and generating the best match for high productivity. To develop the most compatible match for a huge database, pairing the records without the help of an automated approach is impractical. so this paper proposes a computerized pairing algorithm, i.e., Brace, which is designed to cater to the most compatible human resource pairing. A few of its applications include pairing mentor-mentee, co-workers for a project, etc. Brace generates a score for each field, affecting the pairing of every record to create a final compatibility matrix. The matrix is cumulative of all individual compatibility scores for the fields of every record on both category sides. The paper takes the intricacies of algorithm design through a use case of mentor-mentee pairing. Finally, Brace performance evaluation demonstrates its effectiveness based on various parameters.