A method for globally sequence-aware product-service combination fair recommendation
By generating candidate service compositions through a time-aware Transformer encoder and combining entity verification and resource constraints, the problems of global resource constraints and state ignoring in existing methods are solved. This achieves fair resource allocation and throughput maximization in a multi-user environment, improving the feasibility of service composition and system robustness.
CN122264900APending Publication Date: 2026-06-23ZHEJIANG UNIV +1
View PDF 0 Cites 0 Cited by
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- ZHEJIANG UNIV
- Filing Date
- 2026-04-02
- Publication Date
- 2026-06-23
Smart Images

Figure CN122264900A_ABST
Abstract
The application discloses a kind of global sequence perception-oriented product service combination fair recommendation method, belong to intelligent service computing and recommendation field.The method includes: introducing time bias to obtain TiTE encoder, according to the user set and product service set obtained by acquisition, the historical service call sequence of each user and historical service call timestamp sequence are passed through TiTE encoder, obtain hidden state sequence, further through self-recurrence and cluster search, generate multiple candidate service combinations;Each candidate service combination is filtered in turn according to two conditions of entity check and resource constraint, and the final score of each candidate service combination is calculated by combining interest score, throughput score and user hunger value;Establish joint programming model about final score, and the optimal candidate service combination of each user is obtained by using hierarchical greedy heuristic algorithm.The method of the application realizes the leap from single user local optimum to system overall efficiency optimum.
Need to check novelty before this filing date? Find Prior Art