A Machine Learning Approach for Automated Filling of Categorical Fields in Data Entry Forms

TL;DR

This paper introduces LAFF, a machine learning-based system that automates filling categorical fields in data entry forms by learning field dependencies from historical data, improving accuracy and efficiency.

Contribution

LAFF is a novel approach that uses Bayesian Networks with local modeling to predict categorical field values, enhancing form filling support.

Findings

LAFF achieves a Mean Reciprocal Rank above 0.73 in predictions.

LAFF provides suggestions within 317 milliseconds per query.

The approach effectively models local dependencies in data.

Abstract

Users frequently interact with software systems through data entry forms. However, form filling is time-consuming and error-prone. Although several techniques have been proposed to auto-complete or pre-fill fields in the forms, they provide limited support to help users fill categorical fields, i.e., fields that require users to choose the right value among a large set of options. In this paper, we propose LAFF, a learning-based automated approach for filling categorical fields in data entry forms. LAFF first builds Bayesian Network models by learning field dependencies from a set of historical input instances, representing the values of the fields that have been filled in the past. To improve its learning ability, LAFF uses local modeling to effectively mine the local dependencies of fields in a cluster of input instances. During the form filling phase, LAFF uses such models to predict possible values of a target field, based on the values in the already-filled fields of the form and their dependencies; the predicted values (endorsed based on field dependencies and prediction confidence) are then provided to the end-user as a list of suggestions. We evaluated LAFF by assessing its effectiveness and efficiency in form filling on two datasets, one of them proprietary from the banking domain. Experimental results show that LAFF is able to provide accurate suggestions with a Mean Reciprocal Rank value above 0.73. Furthermore, LAFF is efficient, requiring at most 317 ms per suggestion.