Yan Zhang

Orcid: 0000-0003-1585-0801

Affiliations:
  • University of Electronic Science and Technology of China, Big Data Research Center, Chengdu, China


According to our database1, Yan Zhang authored at least 16 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Graph-coupled time interval network for sequential recommendation.
Inf. Sci., November, 2023

MetaCAR: Cross-Domain Meta-Augmentation for Content-Aware Recommendation.
IEEE Trans. Knowl. Data Eng., August, 2023

2022
Deep Pairwise Hashing for Cold-Start Recommendation.
IEEE Trans. Knowl. Data Eng., 2022

Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations.
Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Artificial Noise Assisted Interference Alignment for Physical Layer Security Enhancement.
Proceedings of the IEEE Global Communications Conference, 2022

2021
Attention is not Enough: Mitigating the Distribution Discrepancy in Asynchronous Multimodal Sequence Fusion.
Proceedings of the 2021 IEEE/CVF International Conference on Computer Vision, 2021

2020
Quantization-based hashing with optimal bits for efficient recommendation.
Multim. Tools Appl., 2020

Collaborative Generative Hashing for Marketing and Fast Cold-Start Recommendation.
IEEE Intell. Syst., 2020

Deep Pairwise Hashing for Cold-start Recommendation.
CoRR, 2020

2018
Discrete Deep Learning for Fast Content-Aware Recommendation.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

Discrete Ranking-based Matrix Factorization with Self-Paced Learning.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

2017
An Efficient NPN Boolean Matching Algorithm Based on Structural Signature and Shannon Expansion.
CoRR, 2017

Dot-product based preference preserved hashing for fast collaborative filtering.
Proceedings of the IEEE International Conference on Communications, 2017

Discrete Personalized Ranking for Fast Collaborative Filtering from Implicit Feedback.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Computing Affine Equivalence Classes of Boolean Functions by Group Isomorphism.
IEEE Trans. Computers, 2016

Constraint Free Preference Preserving Hashing for Fast Recommendation.
Proceedings of the 2016 IEEE Global Communications Conference, 2016


  Loading...