- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes SDBC-RO for multi-behavior recommendation. It groups interactions by auxiliary-behavior combinations and learns user, item, and category representations through two-level heterogeneous hypergraphs. Behavior text embeddings and multiple knowledge-graph views further refine these representations, which are combined through attention and category-aware fusion. Experiments on Tmall and Taobao report improvements over fourteen baselines, supported by component ablations and parameter analyses.
Critical strengths
-
The method addresses heterogeneous paths to purchasing by distinguishing different auxiliary-behavior combinations and direct purchases.
-
Table 2 reports the prevalence and conversion rates of behavior groups, providing useful motivation for modeling them separately.
-
The experiments include two datasets, fourteen baselines, and seven ablation variants, offering reasonably broad coverage of the proposed components.
Critical weaknesses
-
The behavior graph in Section 3.3.1 includes both directions between every pair of distinct behaviors under one relation. As written, it does not represent a partial order and leaves no non-self negative triples under head/tail corruption. If this is abbreviated notation, the actual edge construction and negative-sampling rules are missing.
-
The paper does not specify the data split, ranking candidates, or temporal boundaries for graph construction. Table 3 also needs clarification: with one test positive per user and identical ranked lists and users, the Taobao NDCG increase from K=10 to K=20 cannot exceed 0.0048/log2(12), approximately 0.00134, whereas the reported increase is 0.0198. The unspecified protocol prevents determining whether this bound applies.
-
The meaning of "strong dependency" is not operationally defined. Moreover, w/o Adaptive-Chain changes interaction grouping and propagation structure together by replacing the grouped architecture with one chain. It therefore does not isolate the proposed mechanism or substantiate the claim that two-level propagation eliminates preference superposition.
Questions for authors
-
Which directed behavior edges are actually used, how are they determined, and what triples are eligible negative samples?
-
What data-splitting and ranking protocol is used, and how does it explain the Taobao HR and NDCG changes between K=10 and K=20?
-
How is "strong dependency" determined during chain construction, and must auxiliary actions occur before the target interaction?
1:We will supplement the exact positive-edge set and negative sampling filtering rules in the method description of Section 3.3.1, to ensure the optimization objective is fully specified and consistent with the actual implementation. In our actual implementation, the only directed positive edges are Click > Cart and Cart > Buy, encoded as the triplets (Click, r, Cart) and (Cart, r, Buy). They represent the direct progressive relation between behaviors, reflecting the transition from initial interest to stronger purchase intention, and no reciprocal edges are included. For TransE negative sampling, we corrupt each positive triplet by replacing either its head or tail entity with a candidate drawn from {Click, Cart, Buy}. Candidate triplets that coincide with ground-truth positive triplets or form invalid self-loops are filtered out, and the remaining corrupted triplets are used as negative samples. We have explicitly specified this sampling and filtering rule in Section 3.3.1 of the revised manuscript. 2:We thank the reviewer for raising this question. Our data splitting and ranking protocol follow the widely adopted conventional paradigm in multi-behavior recommendation: we split the dataset using the standard leave-one-out strategy, where one target behavior interaction of each user is held out for testing and the remaining interactions are used for training. For evaluation, we generate a unified ranking list for each user and compute HR@K and NDCG@K on this list, with only the truncation threshold K set to 10 and 20 separately. The previously observed inconsistency in metrics arose because the early statistics aggregated the maximum values across different experimental runs. We have now standardized our reporting to present averaged results over multiple independent runs under identical settings. The revised Taobao results in Section 4.3 of the revised manuscript are HR@10=0.2415, HR@20=0.2463, NDCG@10=0.1215, NDCG@20=0.1227. The NDCG increment from K=10 to K=20 is 0.0012, which is below the theoretical upper bound of approximately 0.00134 under this evaluation scheme and thus reasonable. Critical Weakness 3:We agree with the two insightful comments raised by the reviewer. First, in Section 3.2.1 of the revised manuscript, we will explicitly operationalize the concept of "strong dependency" as structural relations centered on target behaviors. For each user-item interaction pair, we only incorporate auxiliary behaviors that occur before the first Buy action, based on which four types of behavior chains are constructed: Click > Buy, Cart > Buy, Click & Cart > Buy, and Only Buy. For the Click & Cart > Buy chain, we do not impose a fixed order between Click and Cart as long as both precede the Buy behavior. Second, the current w/o Adaptive-Chain variant in Section 4.4 of the revised manuscript essentially serves as a composite comparison. When replacing the SDBC-based grouping architecture with a cascade strategy similar to DA-GCN, both the interaction grouping logic and the message-passing mechanism change simultaneously. Accordingly, this variant should not be described as a strict single-variable ablation for a single propagation path. Instead, this set of comparisons verifies that under the same multi-behavior propagation paths, the strong-dependency partitioning mechanism of our model can effectively alleviate the interest shift caused by preference accumulation in existing cascade paradigms. Question 3:We agree with the two insightful comments raised by the reviewer. First, in Section 3.2.1 of the revised manuscript, we will explicitly operationalize the concept of "strong dependency" as structural relations centered on target behaviors. For each user-item interaction pair, we only incorporate auxiliary behaviors that occur before the first Buy action, based on which four types of behavior chains are constructed: Click > Buy, Cart > Buy, Click & Cart > Buy, and Only Buy. For the Click & Cart > Buy chain, we do not impose a fixed order between Click and Cart as long as both precede the Buy behavior. Second, the current w/o Adaptive-Chain variant in Section 4.4 of the revised manuscript essentially serves as a composite comparison. When replacing the SDBC-based grouping architecture with a cascade strategy similar to DA-GCN, both the interaction grouping logic and the message-passing mechanism change simultaneously. Accordingly, this variant should not be described as a strict single-variable ablation for a single propagation path. Instead, this set of comparisons verifies that under the same multi-behavior propagation paths, the strong-dependency partitioning mechanism of our model can effectively alleviate the interest shift caused by preference accumulation in existing cascade paradigms.