The rapid growth in Internet-based services has increased the demand for user data to enable personalized and adaptive digital experiences. These services typically require users to disclose various types of personal information, which are organized into user profiles and used to tailor content, recommendations, and accessibility settings. However, achieving an effective balance between personalization accuracy and user data protection remains a persistent and complex challenge. Excessive data disclosure raises the risk of re-identification and privacy breaches, while excessive anonymization can significantly diminish personalization and overall service quality. In this paper, we address this trade-off by proposing a context-aware learning-based data generalization framework that preserves user privacy while maintaining the functional usefulness of personal data. We first conduct a systematic classification of user data commonly collected into five main categories: demographic, location, accessibility, preference, and behavior data. To generalize these data categories dynamically and adaptively, we use a Multi-Layer Perceptron (MLP) model that learns patterns across heterogeneous data types. Unlike traditional rule-based generalization techniques, the MLP-based approach captures nonlinear relationships, adapts to heterogeneous data distributions, and scales efficiently with large datasets. The proposed MLP-based generalization method reduces the granularity of personal data, preserving privacy without significantly compromising information usefulness. Experimental results show that the proposed method reduces the risk of re-identification to approximately 35%, compared to non-anonymized data, where the re-identification risk is about 80–90%. These findings highlight the potential of learning-based data generalization as a strategy for privacy-preserving personalization in modern Internet services. They also show how the proposed generalization method can be applied in practice to transform user data while maintaining both utility and confidentiality.
Maraj et al. (Wed,) studied this question.