REVIEW 4 major objections 5 minor 74 references
Cognitive-Inspired Hierarchical Attention Fusion With Visual and Textual for Cross-Domain Sequential Recommendation
T0 review · 4 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash
Pith's one-line read Frozen CLIP image and text embeddings, added to a cross-domain sequential recommender, beat prior state-of-the-art on two e-commerce scenarios.
desk verdict HAF-VT reports consistent gains on two CDSR benchmarks, but its claimed cross-domain fusion is degenerate as written: the source-domain branch cannot score target-domain items, so the paper's central mechanism is broken on the page. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The carrying mechanism is a three-way ensemble of multimodal prediction scores, which is what the paper calls its hierarchical attention. For each of the three sub-sequences $S_X$, $S_Y$, and $S_{X+Y}$, the model runs self-attention over ID, image, and text embeddings, producing nine sequence vectors; it maps each to a softmax cosine-similarity score against the item embedding matrices (Eqs. 4–6), fuses the three modalities inside each branch as $\alpha P^{X}_{\mathrm{id}}+\beta P^{X}_{\mathrm{img}}+(1-\alpha-\beta)P^{X}_{\mathrm{tex}}$ (Eq. 7), and finally sums the branch scores as $P(x_i|S)=P^{X}(x_i|S)+\lambda_1 P^{Y}(x_i|S)+\lambda_2 P^{X+Y}(x_i|S)$ (Eq. 10). The frozen CLIP encoder supplies the aligned image and text embeddings, the learnable matrix $E_{\mathrm{id}}$ supplies the identity signal, and the score-level combination is what lets the model weight the source domain and the merged sequence when predicting in the target domain.
What would settle it
On an unseen cross-domain pair (for example, Beauty and Sports), run HAF-VT with the paper's hyperparameter settings and compare MRR and NDCG against MIFN and Tri-CDR; if the reported gains do not reproduce in both domains, the blanket superior-performance claim fails. Also, replace the merged $S_{X+Y}$ branch with a simple arithmetic average of the $S_X$ and $S_Y$ prediction scores; matching performance would show the hierarchical branch is not responsible for the gains.
Extended reading notes
Core claim
HAF-VT's central claim is that a cross-domain sequential recommender can be improved by appending frozen CLIP image and text embeddings to the usual learnable item-ID embeddings and by running self-attention independently on the domain-X sequence, the domain-Y sequence, and the merged sequence, then combining the three softmax prediction scores with learned weights. The paper reports that this yields state-of-the-art results on four Amazon e-commerce domains: MRR of 9.16 on Food and 5.03 on Kitchen (best baselines: 8.55 and 4.29), and MRR of 6.27 on Movie and 2.84 on Book (best baselines: 5.15 and 2.51). An ablation on Movie attributes the result to the cumulative effect of the visual fusion, textual fusion, and the three-branch hierarchical attention: the framework starts at MRR 5.03 and reaches 6.27 when all components are present. In the paper's framing, this shows that mimicking how people combine visual, semantic, and identity information improves cross-domain next-item prediction.
Load-bearing premise
The whole method rests on the assumption that running self-attention separately on the two single-domain sequences and on the merged sequence, then adding their prediction scores together, actually captures cross-domain preferences, even though no information is exchanged between the three streams.
Editorial extensions
If this is right
- On the Food-Kitchen scenario, HAF-VT reports MRR of 9.16 on Food and 5.03 on Kitchen, improving on the best baseline by 0.61 and 0.74 points, respectively.
- On the Movie-Book scenario, HAF-VT reports MRR of 6.27 on Movie and 2.84 on Book, improving on the best baseline by 1.12 and 0.33 points, respectively.
- The ablations on Movie show that visual fusion, textual fusion, and the three-branch hierarchical attention each add measurable MRR, and the full combination outperforms any subset.
- If the result holds beyond these two scenarios, recommenders can improve cross-domain next-item prediction by attaching frozen CLIP embeddings to existing ID-based sequence models without retraining the visual or textual encoders.
Reading between the lines
- I would infer, though the paper does not analyze it, that the benefit of visual and textual fusion is uneven: relative MRR gains over the best baseline are about 22% on Movie, 17% on Kitchen, 13% on Book, and 7% on Food, so the mechanism may interact with domain-specific data properties.
- I would also test whether the merged $S_{X+Y}$ branch is what carries the cross-domain signal: a cheaper alternative that averages the $S_X$ and $S_Y$ prediction scores would isolate whether the separate merged-stream attention is needed or whether the gains come from the multimodal embeddings alone.
- Because CLIP embeddings are computed for every item independent of user history, I would expect HAF-VT's image and text branch to give some cold-start capability for items with few or no interactions; the paper does not report such an experiment, but it is a direct extension of the architecture.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes HAF-VT, a cross-domain sequential recommendation (CDSR) model that combines a learned item-ID embedding matrix with frozen CLIP image and text embeddings. The model processes three input sequences, SX, SY, and the merged SX+Y, through self-attention layers, extracts the last attention output as a user-state vector, and computes next-item scores by cosine similarity to the corresponding item embedding matrices. The final target-domain score is a linear combination of the three domain-specific softmax scores (Eq. 10), with weights α, β, λ1, and λ2. The authors evaluate on two Amazon CDSR scenarios, Food-Kitchen and Movie-Book, under MRR and NDCG@5/10, and report consistent gains over six baselines. The title and abstract present the model as a cognitive-inspired hierarchical attention fusion framework.
Significance. If the reported gains hold, the paper would provide a useful empirical demonstration that frozen CLIP features plus a relatively simple sequence ensemble can improve cross-domain next-item prediction on e-commerce data. The paper is organized clearly and reports complete metric tables for all compared models and for the ablation study. However, the significance is currently limited by the absence of code, unreported fusion hyperparameters, no variance or significance testing, a narrow baseline set, and, most importantly, an internal inconsistency in the inference formula described below. As written, the central claim of hierarchical cross-domain fusion is not supported by the equations, so the paper's contribution cannot be fully assessed. The paper does not include machine-checked proofs or reproducibility artifacts; its value rests entirely on the empirical comparison, which currently needs strengthening.
major comments (4)
- [Section III-D, Eqs. (10)-(11)] As written, the claimed cross-domain fusion is degenerate. P^Y is defined by applying the same softmax construction as Eq. (4) to the domain-Y item embedding matrix E^Y, so P^Y(·|S) is a probability distribution supported only on the item set Y. Eq. (11) restricts the candidate items to xi ∈ X, and the domain item sets are disjoint. Therefore, for every candidate xi in the target domain, P^Y(xi|S) = 0, and the λ1 term in Eq. (10) never affects the target-domain ranking. The evaluation score consequently collapses to P^X + λ2 P^{X+Y}. This is not a notational subtlety: it implies that the source-domain branch, the weight λ1, and the loss term L_Y do not contribute to the target-domain inference described in the paper. The authors must specify the support of each probability (for example, by stating whether P^Y is computed over the union item set or whether the implementation scores h^Y against E^X), correct Eq. (10), and revise the cross-domain fusion claims accordingly.
- [Section III-D and Fig. 2] The architecture described is a weighted ensemble of three independently processed sequences rather than a hierarchical attention mechanism. Each of SX, SY, and SX+Y is processed by its own self-attention stack, and the equations contain no attention or learned interaction between the SX and SY branches; the only cross-domain pathway is the separate SX+Y merged sequence. The phrases 'hierarchical attention' and 'jointly learns single-domain and cross-domain preferences' (Introduction, Section III-B) therefore overstate what the equations and Fig. 2 actually implement. Either the authors should add an explicit cross-branch interaction (such as cross-attention between SX and SY) or they should revise the novelty wording and provide an ablation that isolates the contribution of the SX+Y branch and of each fusion weight, since the current ablation study (Table IV) does not ablate the source-domain branch or the merged branch.
- [Section IV, Tables II-III and Eqs. (7), (9)] The fusion weights α, β, λ1, and λ2 are free parameters tuned on validation data, but their chosen values are never reported in the paper. All results in Tables II and III are single runs, with no confidence intervals, standard deviations, or significance tests. At the observed margins, for instance MRR 6.27 vs. 5.15 on Movie and 5.03 vs. 4.29 on Kitchen, it is impossible to judge whether the improvements are statistically reliable. Because the central claim of Section IV-A is that HAF-VT 'surpasses the current SOTA,' the authors should report the selected hyperparameter values, the number of random seeds, and either error bars with a significance test (e.g., paired tests over users) or at least a sensitivity analysis for the unreported weights.
- [Section IV-A, Tables II-III] The baseline set is too narrow and outdated to support the 'current SOTA' claim in Section IV-A and the abstract. The tables compare against GRU4Rec, SASRec, SR-GNN, PSJNet, MIFN, and Tri-CDR only, while the paper's own related work cites more recent CDSR methods such as DA-GCN and contrastive cross-domain approaches (refs. [7], [9]) that are not included. The dataset construction also appears to differ from some prior CDSR papers, and the authors do not state whether the baseline numbers are re-run under this exact protocol or taken from earlier publications. The supported claim is 'better than the evaluated baselines under this protocol'; the authors should either add stronger and more recent baselines, or temper the wording to avoid claiming general state-of-the-art performance.
minor comments (5)
- [Table I] The last column of Table I is corrupted in the printed text: the entries run together ('9.91Kitchen', '11.98Movie'), making the average sequence lengths unreadable. Please fix the line breaks and clarify whether 'Avg.length' is the average over users or over sequences.
- [Throughout] The same symbols X and Y are used for both the domains and the item sets, which makes expressions such as 'argmax_{xi ∈ X}' in Eq. (11) confusing. Please use distinct notation, for example calligraphic letters for item sets.
- [Eq. (7)] The weights α and β are not constrained in the text. If α or β can be negative or if α + β > 1, then P^X is not a normalized probability distribution over the candidate items. Please state the admissible ranges (for example, α, β ≥ 0 and α + β ≤ 1) or define an alternative normalization.
- [Section III-D] The sentence 'The same method is applied to domains Y and X+Y' is under-specified for the merged sequence. It is not stated whether the softmax for P^{X+Y} is over the union item set, whether the next-item prediction in L_{X+Y} is defined for items from both domains, or whether the self-attention parameters are shared across the nine branches. Please clarify these details, as they are needed to reproduce the method.
- [Reproducibility] No code or reproducibility statement is provided, and no random seeds are mentioned. Adding a code repository link and reporting the random seeds would materially improve the paper's reproducibility.
Circularity Check
No significant circularity: the core SOTA claim rests on held-out test evaluation against external baselines, and no prediction reduces to a fitted parameter or to a self-citation.
full rationale
HAF-VT's derivation is empirical rather than tautological. Item representations combine a learnable ID matrix with frozen CLIP image/text encoders, all of which are external or standard learnable components; sequence representations are produced by self-attention over SX, SY, and SX+Y; and the training loss (Eqs. 8–9) plus evaluation score (Eq. 10) are conventional likelihood/ranking objectives. The reported MRR/NDCG improvements are computed on held-out test sequences against published baselines, so the central claim is not equivalent to any input by construction. Self-citations such as [38], [41], and [58] appear only in related-work context and are not load-bearing premises; no uniqueness theorem or ansatz is imported from them. The most notable technical issue is internal consistency of Eq. 10: since P^Y is defined as a softmax over domain-Y items (Eq. 4 applied to Y by the 'same method' statement), P^Y(x_i|S)=0 for target-domain candidates x_i, making the λ1 term vacuous as written. This is a correctness/implementation concern about one branch, not a circularity, because the SX+Y branch still carries cross-domain information and the empirical evaluation remains independent. Hyperparameters α, β, λ1, λ2 are not reported and appear to be validation-tuned, which is a reporting weakness but standard validation fitting, not a derivation-level circularity.
Assumptions & free parameters
free parameters (4)
- alpha, beta (Eq. 7) =
not reported
- lambda1, lambda2 (Eqs. 9-10) =
not reported
- Item ID embedding matrix E_id (q=256) =
learned during training
- Self-attention layer weights =
learned during training
assumptions (4)
- domain assumption Frozen CLIP vision/text encoders produce usable representations for Amazon item images and titles.
- ad hoc to paper Independent self-attention on SX, SY, and SX+Y plus linear score fusion is sufficient to model cross-domain preference transfer.
- standard math Self-attention with last-vector readout is a valid next-item sequence encoder.
- domain assumption The validation-based split and filtering rules produce a fair CDSR benchmark.
Cite this review
Pith. "Pith review of Cognitive-Inspired Hierarchical Attention Fusion With Visual and Textual for Cross-Domain Sequential Recommendation." pith.science (2026). https://pith.science/paper/JFZE2EYI
@misc{pith2026250415085,
author = {Pith},
title = {Pith review of: Cognitive-Inspired Hierarchical Attention Fusion With Visual and Textual for Cross-Domain Sequential Recommendation},
year = {2026},
howpublished = {\url{https://pith.science/paper/JFZE2EYI}},
note = {Machine review of arXiv:2504.15085}
}
read the original abstract
Cross-Domain Sequential Recommendation (CDSR) predicts user behavior by leveraging historical interactions across multiple domains, focusing on modeling cross-domain preferences through intra- and inter-sequence item relationships. Inspired by human cognitive processes, we propose Hierarchical Attention Fusion of Visual and Textual Representations (HAF-VT), a novel approach integrating visual and textual data to enhance cognitive modeling. Using the frozen CLIP model, we generate image and text embeddings, enriching item representations with multimodal data. A hierarchical attention mechanism jointly learns single-domain and cross-domain preferences, mimicking human information integration. Evaluated on four e-commerce datasets, HAF-VT outperforms existing methods in capturing cross-domain user interests, bridging cognitive principles with computational models and highlighting the role of multimodal data in sequential decision-making.
Figures
Reference graph
Works this paper leans on
-
[58]
Image fusion for cross-domain sequential recommenda- tion,
Wangyu Wu, Siqi Song, Xianglin Qiu, Xiaowei Huang, Fei Ma, and Jimin Xiao, “Image fusion for cross-domain sequential recommenda- tion,” in Companion Proceedings of the ACM Web Conference 2025 , 2025
work page 2025
-
[7]
Lei Guo, Li Tang, Tong Chen, Lei Zhu, Quoc Viet Hung Nguyen, and Hongzhi Yin, “Da-gcn: A domain-aware attentive graph convolution network for shared-account cross-domain sequential recommendation,” in International Joint Conference on Artificial Intelligence (IJCAI) , 2021
work page 2021
-
[9]
Contrastive cross-domain sequential recommendation,
Jiangxia Cao, Xin Cong, Jiawei Sheng, Tingwen Liu, and Bin Wang, “Contrastive cross-domain sequential recommendation,” in Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022, pp. 138–147
work page 2022
-
[1]
An mdp-based recommender system,
Guy Shani, David Heckerman, and Ronen I. Brafman, “An mdp-based recommender system,” Journal of Machine Learning Research (JMLR) , 2002
work page 2002
-
[2]
Translation- based recommendation,
Ruining He, Wang-Cheng Kang, and Julian McAuley, “Translation- based recommendation,” 2017
work page 2017
-
[3]
Fusing similarity models with markov chains for sparse sequential recommendation,
Ruining He and Julian McAuley, “Fusing similarity models with markov chains for sparse sequential recommendation,” in IEEE International Conference on Data Mining (ICDM) , 2016
work page 2016
-
[4]
Neural attentive session-based recommendation,
J. Li, Pengjie Ren, Zhumin Chen, Zhaochun Ren, Tao Lian, and Jun Ma, “Neural attentive session-based recommendation,” in ACM International Conference on Information and Knowledge Management (CIKM) , 2017
work page 2017
-
[5]
Muyang Ma, Pengjie Ren, Yujie Lin, Zhumin Chen, Jun Ma, and Maarten de Rijke, “ π-net: A parallel information-sharing network for shared-account cross-domain sequential recommendations,” in Proceed- ings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval , 2019, pp. 685–694
work page 2019
Show all 74 references
-
[6]
Sequential recommendation via cross-domain novelty seeking trait mining,
Fuzhen Zhuang, Yingmin Zhou, Haochao Ying, Fuzheng Zhang, Xiang Ao, Xing Xie, Qing He, and Hui Xiong, “Sequential recommendation via cross-domain novelty seeking trait mining,” Journal of Computer Science and Technology (JCST) , 2020
2020
-
[8]
Semi: A sequential multi-modal information transfer network for e-commerce micro-video recommenda- tions,
Chenyi Lei, Yong Liu, Lingzi Zhang, Guoxin Wang, Haihong Tang, Houqiang Li, and Chunyan Miao, “Semi: A sequential multi-modal information transfer network for e-commerce micro-video recommenda- tions,” in ACM Knowledge Discovery and Data Mining (KDD) , 2021
2021
-
[10]
Recguru: Adversarial learning of generalized user representations for cross-domain recommendation,
Chenglin Li, Mingjun Zhao, Huanming Zhang, Chenyun Yu, Lei Cheng, Guoqiang Shu, Beibei Kong, and Di Niu, “Recguru: Adversarial learning of generalized user representations for cross-domain recommendation,” in ACM International Conference on Web Search and Data Mining (WSDM), 2022
2022
-
[11]
Mixed information flow for cross-domain sequential recommendations,
Muyang Ma, Pengjie Ren, Zhumin Chen, Zhaochun Ren, Lifan Zhao, Jun Ma, and M. de Rijke, “Mixed information flow for cross-domain sequential recommendations,” ACM Transactions on Knowledge Dis- covery from Data (TKDD) , 2022
2022
-
[12]
The cognitive science of visual-spatial displays: Im- plications for design,
Mary Hegarty, “The cognitive science of visual-spatial displays: Im- plications for design,” Topics in cognitive science , vol. 3, no. 3, pp. 446–474, 2011
2011
-
[13]
Benefits of multisensory learning,
Ladan Shams and Aaron R Seitz, “Benefits of multisensory learning,” Trends in cognitive sciences , vol. 12, no. 11, pp. 411–417, 2008
2008
-
[14]
Learning transferable visual models from natural language supervision,
Alec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh, Gabriel Goh, Sandhini Agarwal, Girish Sastry, Amanda Askell, Pamela Mishkin, Jack Clark, et al., “Learning transferable visual models from natural language supervision,” in International conference on machine learning....
2021
-
[15]
SLCF-Net: Sequential LiDAR-camera fusion for semantic scene completion using a 3D recurrent U-Net,
Helin Cao and Sven Behnke, “SLCF-Net: Sequential LiDAR-camera fusion for semantic scene completion using a 3D recurrent U-Net,” in IEEE International Conference on Robotics and Automation (ICRA) , 2024, pp. 2767–2773
2024
-
[16]
OC-SOP: Enhancing Vision-Based 3d semantic occupancy prediction by Object-Centric awareness,
Helin Cao and Sven Behnke, “OC-SOP: Enhancing Vision-Based 3d semantic occupancy prediction by Object-Centric awareness,” arXiv preprint arXiv:2506.18798, 2025
2025 arXiv
-
[17]
SW A-SOP: Spatially- aware window attention for semantic occupancy prediction in au- tonomous driving,
Helin Cao, Rafael Materla, and Sven Behnke, “SW A-SOP: Spatially- aware window attention for semantic occupancy prediction in au- tonomous driving,” arXiv preprint arXiv:2506.18785 , 2025
2025 arXiv
-
[18]
DiffSSC: Semantic LiDAR scan com- pletion using denoising diffusion probabilistic models,
Helin Cao and Sven Behnke, “DiffSSC: Semantic LiDAR scan com- pletion using denoising diffusion probabilistic models,” arXiv preprint arXiv:2409.18092, 2024
2024 arXiv
-
[19]
Crisp-sam2: Sam2 with cross-modal interaction and semantic prompting for multi-organ segmentation,
Xinlei Yu, Changmiao Wang, Hui Jin, Ahmed Elazab, Gangyong Jia, Xiang Wan, Changqing Zou, and Ruiquan Ge, “Crisp-sam2: Sam2 with cross-modal interaction and semantic prompting for multi-organ segmentation,” arXiv preprint arXiv:2506.23121 , 2025
2025 arXiv
-
[20]
Ich-prnet: a cross-modal intracerebral haemorrhage prognostic pre- diction method using joint-attention interaction mechanism,
Xinlei Yu, Ahmed Elazab, Ruiquan Ge, Jichao Zhu, Lingyan Zhang, Gangyong Jia, Qing Wu, Xiang Wan, Lihua Li, and Changmiao Wang, “Ich-prnet: a cross-modal intracerebral haemorrhage prognostic pre- diction method using joint-attention interaction mechanism,” Neural Networks, vol...
2025
-
[21]
Ich-scnet: Intracerebral hemorrhage segmentation and prognosis classification net- work using clip-guided sam mechanism,
Xinlei Yu, Ahmed Elazab, Ruiquan Ge, Hui Jin, Xinchen Jiang, Gangy- ong Jia, Qing Wu, Qinglei Shi, and Changmiao Wang, “Ich-scnet: Intracerebral hemorrhage segmentation and prognosis classification net- work using clip-guided sam mechanism,” in 2024 IEEE International Conferen...
2024
-
[22]
Towards visual-prompt temporal answer grounding in instructional video,
Shutao Li, Bin Li, Bin Sun, and Yixuan Weng, “Towards visual-prompt temporal answer grounding in instructional video,” IEEE transactions on pattern analysis and machine intelligence , vol. 46, no. 12, pp. 8836– 8853, 2024
2024
-
[23]
Distinct but correct: generating diver- sified and entity-revised medical response,
Bin Li, Bin Sun, Shutao Li, Encheng Chen, Hongru Liu, Yixuan Weng, Yongping Bai, and Meiling Hu, “Distinct but correct: generating diver- sified and entity-revised medical response,” Science China Information Sciences, vol. 67, no. 3, pp. 132106, 2024
2024
-
[24]
Towards better chinese-centric neural machine translation for low-resource languages,
Bin Li, Yixuan Weng, Fei Xia, and Hanjun Deng, “Towards better chinese-centric neural machine translation for low-resource languages,” Computer Speech & Language , vol. 84, pp. 101566, 2024
2024
-
[25]
Image protection scheme for bridge management systems based on quantum coupling function,
Lingzhi Zhou, Han Xia, Wenming Lyu, Gesong Huang, Hongjing Chen, Hangyu Zhou, Zejie Zhang, and zhou man, “Image protection scheme for bridge management systems based on quantum coupling function,” Physica Scripta, 2025
2025
-
[26]
A smart agriculture image protection scheme based on annealing algorithm and affine transformation is optimized for s-box generated by chaos,
Lingzhi Zhou, Hongjing Chen, Xunming Zhou, Yuan Yuan, WanNing Zhu, and Man Zhou, “A smart agriculture image protection scheme based on annealing algorithm and affine transformation is optimized for s-box generated by chaos,” Nonlinear Dynamics, pp. 1–25, 2024
2024
-
[27]
Magic- vqa: Multimodal and grounded inference with commonsense knowledge for visual question answering,
Shuo Yang, Siwen Luo, Soyeon Caren Han, and Eduard Hovy, “Magic- vqa: Multimodal and grounded inference with commonsense knowledge for visual question answering,” arXiv preprint arXiv:2503.18491, 2025
2025 arXiv
-
[28]
Multimodal com- monsense knowledge distillation for visual question answering (student abstract),
Shuo Yang, Siwen Luo, and Soyeon Caren Han, “Multimodal com- monsense knowledge distillation for visual question answering (student abstract),” in Proceedings of the AAAI conference on artificial intelli- gence, 2025, vol. 39, pp. 29545–29547
2025
-
[29]
Diverse cotraining makes strong semi- supervised segmentor,
Yijiang Li and Xinjiang Wang, “Diverse cotraining makes strong semi- supervised segmentor,” 2023, pp. 16055–16067
2023
-
[30]
Core knowledge deficits in multi-modal language models,
Yijiang Li and Qingying Gao, “Core knowledge deficits in multi-modal language models,” arXiv preprint arXiv:2410.10855 , 2025
2025 arXiv
-
[31]
Egoprivacy: What your first-person cam- era says about you?,
Yijiang Li and Genpei Zhang, “Egoprivacy: What your first-person cam- era says about you?,” International Conference on Machine Learning , 2025
2025
-
[32]
Cracknex: a few-shot low-light crack segmentation model based on retinex theory for uav inspections,
Zhen Yao, Jiawei Xu, Shuhang Hou, and Mooi Choo Chuah, “Cracknex: a few-shot low-light crack segmentation model based on retinex theory for uav inspections,” in ICRA, 2024, pp. 11155–11162
2024
-
[33]
Event-guided low-light video semantic segmentation,
Zhen Yao and Mooi Choo Chuah, “Event-guided low-light video semantic segmentation,” arXiv preprint arXiv:2411.00639 , 2024
2024
-
[34]
Two-dimensional hyperchaos-based encryption and compression algorithm for agricultural uav-captured planar images,
Lingzhi Zhou, Han Xia, Qingfa Lin, Xin Yang, Xiangwei Zhang, and Man Zhou, “Two-dimensional hyperchaos-based encryption and compression algorithm for agricultural uav-captured planar images,” Scientific Reports, 2024
2024
-
[35]
Adaptive attention-enhanced yolo for wall crack detection.,
Ying Chen, Wangyu Wu, and Junxia Li, “Adaptive attention-enhanced yolo for wall crack detection.,” Applied Sciences (2076-3417) , vol. 14, no. 17, 2024
2024
-
[36]
Tfb: Towards comprehensive and fair benchmarking of time series forecasting methods,
Xiangfei Qiu, Jilin Hu, Lekui Zhou, Xingjian Wu, Junyang Du, Buang Zhang, Chenjuan Guo, Aoying Zhou, Christian S. Jensen, Zhenli Sheng, and Bin Yang, “Tfb: Towards comprehensive and fair benchmarking of time series forecasting methods,” in Proc. VLDB Endow. , 2024, pp. 2363–2377
2024
-
[37]
Spiking point trans- former for point cloud classification,
Peixi Wu, Bosong Chai, Hebei Li, Menghua Zheng, Yansong Peng, Zeyu Wang, Xuan Nie, Yueyi Zhang, and Xiaoyan Sun, “Spiking point trans- former for point cloud classification,” arXiv preprint arXiv:2502.15811, 2025
2025 arXiv
-
[38]
Generative prompt controlled diffusion for weakly supervised semantic segmentation,
Wangyu Wu, Tianhong Dai, Zhenhong Chen, Xiaowei Huang, Fei Ma, and Jimin Xiao, “Generative prompt controlled diffusion for weakly supervised semantic segmentation,” Neurocomputing, p. 130103, 2025
2025
-
[39]
What’s in a name? a large-scale computational study on how competition between names affects naming variation,
Eleonora Gualdoni, Thomas Brochhagen, Andreas M ¨adebach, and Gemma Boleda, “What’s in a name? a large-scale computational study on how competition between names affects naming variation,” Journal of Memory and Language , vol. 133, pp. 104459, 2023
2023
-
[40]
Vispa (vision spaces): A computer-vision-based representation system for individual images and concept prototypes, with large-scale evaluation.,
Fritz G ¨unther, Marco Marelli, Sam Tureski, and Marco Alessandro Petilli, “Vispa (vision spaces): A computer-vision-based representation system for individual images and concept prototypes, with large-scale evaluation.,” Psychological Review, vol. 130, no. 4, pp. 896, 2023
2023
-
[41]
Prompt categories cluster for weakly supervised semantic segmentation,
Wangyu Wu, Xianglin Qiu, Siqi Song, Xiaowei Huang, Fei Ma, and Jimin Xiao, “Prompt categories cluster for weakly supervised semantic segmentation,” arXiv preprint arXiv:2412.13823 , 2024
2024 arXiv
-
[42]
Learning to gen- erate text-grounded mask for open-world semantic segmentation from only image-text pairs,
Junbum Cha, Jonghwan Mun, and Byungseok Roh, “Learning to gen- erate text-grounded mask for open-world semantic segmentation from only image-text pairs,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2023, pp. 11165–11174
2023
-
[43]
Sequential recommender systems: challenges, progress and prospects,
Shoujin Wang, Liang Hu, Yan Wang, Longbing Cao, Quan Z. Sheng, and Mehmet Orgun, “Sequential recommender systems: challenges, progress and prospects,” 2019
2019
-
[44]
Factorizing personalized markov chains for next-basket recommenda- tion,
Steffen Rendle, Christoph Freudenthaler, and Lars Schmidt-Thieme, “Factorizing personalized markov chains for next-basket recommenda- tion,” in WWW, 2010, pp. 811–820
2010
-
[45]
Empirical evaluation of gated recurrent neural networks on sequence modeling,
Junyoung Chung, Caglar Gulcehre, Kyunghyun Cho, and Yoshua Ben- gio, “Empirical evaluation of gated recurrent neural networks on sequence modeling,” in NIPS 2014 Workshop on Deep Learning, December 2014, 2014
2014
-
[46]
Long short-term memory,
Sepp Hochreiter and J ¨urgen Schmidhuber, “Long short-term memory,” Neural computation, vol. 9, no. 8, pp. 1735–1780, 1997
1997
-
[47]
Convolutional networks for images, speech, and time series,
Yann LeCun, Yoshua Bengio, et al., “Convolutional networks for images, speech, and time series,” The handbook of brain theory and neural networks, 1995
1995
-
[48]
Attention is all you need,
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin, “Attention is all you need,” in NeurIPS, 2017, pp. 5998–6008
2017
-
[49]
Session-based recommendations with recurrent neural networks,
Bal ´azs Hidasi, Alexandros Karatzoglou, Linas Baltrunas, and Domonkos Tikk, “Session-based recommendations with recurrent neural networks,” in International Conference on Learning Representations (ICLR) , 2015
2015
-
[50]
Deep interest evolution network for click-through rate prediction,
Guorui Zhou, Na Mou, Ying Fan, Qi Pi, Weijie Bian, Chang Zhou, Xiaoqiang Zhu, and Kun Gai, “Deep interest evolution network for click-through rate prediction,” in AAAI, 2019, pp. 5941–5948
2019
-
[51]
Personalized top-n sequential recommen- dation via convolutional sequence embedding,
Jiaxi Tang and Ke Wang, “Personalized top-n sequential recommen- dation via convolutional sequence embedding,” in ACM International Conference on Web Search and Data Mining (WSDM) , 2018
2018
-
[52]
Self-attentive sequential recommendation,
Wang-Cheng Kang and Julian McAuley, “Self-attentive sequential recommendation,” in 2018 IEEE International Conference on Data Mining (ICDM). IEEE, 2018, pp. 197–206
2018
-
[53]
Deep interest network for click-through rate prediction,
Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai, “Deep interest network for click-through rate prediction,” in KDD, 2018, pp. 1059– 1068
2018
-
[54]
Sequential recommendation with graph neural networks,
Jianxin Chang, Chen Gao, Yu Zheng, Yiqun Hui, Yanan Niu, Yang Song, Depeng Jin, and Yong Li, “Sequential recommendation with graph neural networks,” in Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval , 2021, pp. 378–387
2021
-
[55]
Dual-interest factorization- heads attention for sequential recommendation,
Guanyu Lin, Chen Gao, Yu Zheng, Jianxin Chang, Yanan Niu, Yang Song, Zhiheng Li, Depeng Jin, and Yong Li, “Dual-interest factorization- heads attention for sequential recommendation,” in Proceedings of the ACM Web Conference 2023 , 2023, pp. 917–927
2023
-
[56]
Dual contrastive network for sequential recommendation,
Guanyu Lin, Chen Gao, Yinfeng Li, Yu Zheng, Zhiheng Li, Depeng Jin, and Yong Li, “Dual contrastive network for sequential recommendation,” in Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, 2022, pp. 2686–2691
2022
-
[57]
Cross-domain recommender systems,
Iv ´an Cantador, Ignacio Fern´andez-Tob´ıas, Shlomo Berkovsky, and Paolo Cremonesi, “Cross-domain recommender systems,” in Recommender systems handbook, pp. 919–959. Springer, 2015
2015
-
[59]
Relation- fused attention in knowledge graphs for recommendation,
Huanyi Cai, Wangyu Wu, Bosong Chai, and Yafeng Zhang, “Relation- fused attention in knowledge graphs for recommendation,” in Interna- tional Conference on Neural Information Processing . Springer, 2024, pp. 285–299
2024
-
[60]
Relational learning via collective matrix factorization,
Ajit P. Singh and Geoffrey J. Gordon, “Relational learning via collective matrix factorization,” in Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining , 2008, pp. 650–658
2008
-
[61]
A survey on transfer learning,
Sinno Jialin Pan and Qiang Yang, “A survey on transfer learning,” vol. 22, no. 10, pp. 1345–1359, 2009, Publisher: IEEE
2009
-
[62]
Minet: Mixed interest network for cross-domain click-through rate prediction,
Wentao Ouyang, Xiuwu Zhang, Lei Zhao, Jinmei Luo, Yu Zhang, Heng Zou, Zhaojie Liu, and Yanlong Du, “Minet: Mixed interest network for cross-domain click-through rate prediction,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 202...
2020
-
[63]
Conet: Collaborative cross networks for cross-domain recommendation,
Guangneng Hu, Yu Zhang, and Qiang Yang, “Conet: Collaborative cross networks for cross-domain recommendation,” in ACM International Conference on Information and Knowledge Management (CIKM) , 2018
2018
-
[64]
Transfer learning in collaborative filtering for sparsity reduction,
Weike Pan, Evan Xiang, Nathan Liu, and Qiang Yang, “Transfer learning in collaborative filtering for sparsity reduction,” in Proceedings of the AAAI Conference on Artificial Intelligence , 2010, vol. 24, Issue: 1
2010
-
[65]
Easytime: Time series forecasting made easy,
Xiangfei Qiu, Xiuwen Li, Ruiyang Pang, Zhicheng Pan, Xingjian Wu, Liu Yang, Jilin Hu, Yang Shu, Xuesong Lu, Chengcheng Yang, Chenjuan Guo, Aoying Zhou, Christian S. Jensen, and Bin Yang, “Easytime: Time series forecasting made easy,” in ICDE, 2025
2025
-
[66]
Duet: Dual clustering enhanced multivariate time series forecasting,
Xiangfei Qiu, Xingjian Wu, Yan Lin, Chenjuan Guo, Jilin Hu, and Bin Yang, “Duet: Dual clustering enhanced multivariate time series forecasting,” in SIGKDD, 2025, pp. 1185–1196
2025
-
[67]
Self-attentive sequential recommendation,
Wang-Cheng Kang and Julian McAuley, “Self-attentive sequential recommendation,” in IEEE International Conference on Data Mining (ICDM), 2018
2018
-
[68]
Contrastive learning for cold-start recommendation,
Yinwei Wei, Xiang Wang, Qi Li, Liqiang Nie, Yan Li, Xuanping Li, and Tat-Seng Chua, “Contrastive learning for cold-start recommendation,” in Proceedings of the 29th ACM International Conference on Multimedia , 2021, pp. 5382–5390
2021
-
[69]
The trec-8 question answering track report,
Ellen M. V oorhees, “The trec-8 question answering track report,” in Text REtrieval Conference (TREC) , 1999
1999
-
[70]
Cumulated gain-based eval- uation of ir techniques,
Kalervo J ¨arvelin and Jaana Kek ¨al¨ainen, “Cumulated gain-based eval- uation of ir techniques,” ACM Transactions on Information Systems (TOIS), 2002
2002
-
[71]
Adam: A method for stochastic optimization,
P. Diederik Kingma and Lei Jimmy Ba, “Adam: A method for stochastic optimization,” in International Conference on Learning Representations (ICLR), 2015
2015
-
[72]
Session-based recommendation with graph neural networks,
Shu Wu, Yuyuan Tang, Yanqiao Zhu, Liang Wang, Xing Xie, and Tieniu Tan, “Session-based recommendation with graph neural networks,” in AAAI Conference on Artificial Intelligence (AAAI) , 2019
2019
-
[73]
Triple sequence learning for cross-domain recommen- dation,
Haokai Ma, Ruobing Xie, Lei Meng, Xin Chen, Xu Zhang, Leyu Lin, and Jie Zhou, “Triple sequence learning for cross-domain recommen- dation,” ACM Transactions on Information Systems , vol. 42, no. 4, pp. 1–29, 2024
2024
-
[74]
Parallel split-join networks for shared account cross-domain sequential recommendations,
Wenchao Sun, Pengjie Ren, Yujie Lin, Muyang Ma, Zhumin Chen, Zhaochun Ren, Jun Ma, and Maarten de Rijke, “Parallel split-join networks for shared account cross-domain sequential recommendations,” IEEE Transactions on Knowledge and Data Engineering (TKDE), 2022
2022
Reviewed August 16, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.