Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Cao Yuan

dblp:00/1012 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-8775-0626ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Computer networks · 2 · 1 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 50% Image recognition and object detection · 25% Learning theory · 25%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › metric learning
deep metric learning
0.712023
Deep Metric Learning for K Nearest Neighbor Classification · IEEE Trans. Knowl. Data Eng. 2023
Computer vision › Image recognition and object detection
image classification
0.712023
Deep Metric Learning for K Nearest Neighbor Classification · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Representation and self-supervised learning › representation learning
metric learning
0.712023
Deep Metric Learning for K Nearest Neighbor Classification · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Learning theory › classification › nonparametric classification
nearest neighbor classification
0.712023
Deep Metric Learning for K Nearest Neighbor Classification · IEEE Trans. Knowl. Data Eng. 2023

Methods — techniques the papers use, named apart from their topics

prototype reduction · 0.7k-NN · 0.7convolutional neural network · 0.7
YearPublicationVenuePosition
2025 Multi-modal information fusion for multi-task end-to-end behavior prediction in autonomous driving
Baicang Guo, Liu Hao, Cao Yuan, Lisheng Jin, Yin-lin Wang
Neurocomputing4
2023 Deep Metric Learning for K Nearest Neighbor Classification
abstract
KNN has gained popularity in machine learning due to its simplicity and good performance. However, kNN faces two problems with classification tasks. The first is that an appropriate distance measurement is required to compute distances between test sample and training samples. The other is the highly computational complexity due to the requirement of searching the nearest neighbors in the whole training data. In order to mitigate these two problems, we propose a novel method named KCNN to enhance the performance of kNN. KCNN uses convolutional neural networks to learn a suitable distance metric as well as prototype reduction to learn a reduced set of prototypes which can represent the original set. It has several superiorities compared with related methods. The combination of CNN and kNN empowers it to extract discriminative hierarchical features with which kNN can easily classify. KCNN learns spatial information on an image instead of considering it as a vector to learn distance metric. Moreover, KCNN simultaneously learns a reduced set of prototypes, which help improve classification efficiency and avoid noisy samples of the massive training set. The proposed method has a better robustness and convergence than CNN, especially when projecting input data into a low-dimension space.
Tingting Liao, Zhen Lei 0001, Tianqing Zhu, Shan Zeng, Cao Yuan
IEEE Trans. Knowl. Data Eng.6
2021 Conditional image generation with One-Vs-All classifier
Xiangrui Xu 0001, Cao Yuan
Neurocomputing3
2017 Low-Rate DDoS Attack Detection Using Expectation of Packet Size
abstract
Low-rate Distributed Denial-of-Service (low-rate DDoS) attacks are a new challenge to cyberspace, as the attackers send a large amount of attack packets similar to normal traffic, to throttle legitimate flows. In this paper, we propose a measurement—expectation of packet size—that is based on the distribution difference of the packet size to distinguish two typical low-rate DDoS attacks, the constant attack and the pulsing attack, from legitimate traffic. The experimental results, obtained using a series of real datasets with different times and different tolerance factors, are presented to demonstrate the effectiveness of the proposed measurement. In addition, extensive experiments are performed to show that the proposed measurement can detect the low-rate DDoS attacks not only in the short and long terms but also for low packet rates and high packet rates. Furthermore, the false-negative rates and the adjudication distance can be adjusted based on the detection sensitivity requirements.
Lu Zhou 0003, Mingchao Liao, Cao Yuan
Secur. Commun. Networks3
2016 Privacy-preserving topic model for tagging recommender systems
Tianqing Zhu, Gang Li 0009, Wanlei Zhou 0001, Ping Xiong 0001, Cao Yuan
Knowl. Inf. Syst.5
2014 Deferentially Private Tagging Recommendation Based on Topic Model
Tianqing Zhu, Gang Li 0009, Wanlei Zhou 0001, Ping Xiong 0001, Cao Yuan
PAKDD (1)5
2008 A Generalized FAST TCP scheme
Cao Yuan, Liansheng Tan, Lachlan L. H. Andrew, Wei Zhang 0168, Moshe Zukerman
Comput. Commun.1
2007 Fairness comparison of FAST TCP and TCP Reno
Liansheng Tan, Lina Dong, Cao Yuan, Moshe Zukerman
Comput. Commun.3