16 November 2021 in IEEE Transactions on Industrial Informatics
Recommendation accuracy is a fundamental problem in the quality of the recommendation system. In this article, we propose an efficient deep matrix factorization (EDMF) with review feature learning for the industrial recommender system. Two characteristics in user’s review are revealed. First, interactivity between the user and the item, which can also be considered as the former’s scoring behavior on the latter, is exploited in a review. Second, the review is only a partial description of the user’s preferences for the item, which is revealed as the sparsity property. Specifically, in the first characteristic, EDMF extracts the interactive features of onefold review by convolutional neural networks with word-attention mechanism. Subsequently, ${L}_{0}$ norm is leveraged to constrain the review considering that the review information is a sparse feature, which is the second characteristic. Furthermore, the loss function is constructed by maximum a posteriori estimation theory, where the interactivity and sparsity property are converted as two prior probability functions. Finally, the alternative minimization algorithm is introduced to optimize the loss functions. Experimental results on several datasets demonstrate that the proposed methods, which show good industrial conversion application prospects, outperform the state-of-the-art methods in terms of effectiveness and efficiency.
12 February 2026 in IEEE Transactions on Services Computing
Next activity prediction, a critical subtask of Predictive Process Monitoring (PPM), aims to forecast the upcoming activity of an ongoing process instance based on event logs generated by process-aware information systems, thereby enabling businesses to proactively mitigate potential risks. While recent deep sequence models have shown strong predictive capabilities, they often fail to explicitly capture the intrinsic dependencies that govern the conditions and impacts of event occurrences in business processes. To address this limitation, we propose a novel Place-Transition Embedding (PTE) framework that captures these dependencies through Petri-net–inspired token consumption and generation semantics. PTE employs a deep embedding network to simulate the evolution of markings, i.e., how each observed event drives token dynamics over places over time under our resource interpretation. In addition, we introduce a temporal scoring mechanism that ranks candidate activities by jointly considering resource feasibility and temporal urgency, improving both interpretability and predictive accuracy. Extensive experiments on six real-world datasets show that PTE achieves state-of-the-art performance for next-activity prediction. Moreover, PTE generalizes robustly under sparse training conditions, highlighting its practical applicability in real-world scenarios with limited business data.