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.

Yu Sun 0076

dblp:62/3689-76 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0006-5684-2639ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 2 since 2021

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.

Databases, data mining, and information retrieval
2 papers
Data mining · 75% Knowledge graphs · 25%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.812024
High-Order Contrastive Learning with Fine-grained Comparative Levels for Sparse Ordinal Tensor Completion · ICML 2024
Data mining › structured data mining
graph mining
0.812024
A Transformative Topological Representation for Link Modeling, Prediction and Cross-Domain Network Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Knowledge graphs
link prediction
0.812024
A Transformative Topological Representation for Link Modeling, Prediction and Cross-Domain Network Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Data mining
network analysis
0.812024
A Transformative Topological Representation for Link Modeling, Prediction and Cross-Domain Network Analysis · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Data mining › multidimensional data analysis › multiway data analysis › tensor analysis
tensor completion
0.812024
High-Order Contrastive Learning with Fine-grained Comparative Levels for Sparse Ordinal Tensor Completion · ICML 2024

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

self-supervised learning · 1.5contrastive learning · 1.5attention mechanism · 1.5matrix factorization · 0.8graph neural network · 0.8
YearPublicationVenuePosition
2024 High-Order Contrastive Learning with Fine-grained Comparative Levels for Sparse Ordinal Tensor Completion
abstract
Contrastive learning is a powerful paradigm for representation learning with prominent success in computer vision and NLP, but how to extend its success to high-dimensional tensors remains a challenge. This is because tensor data often exhibit high-order mode-interactions that are hard to profile and with negative samples growing combinatorially faster than second-order contrastive learning; furthermore, many real-world tensors have ordinal entries that necessitate more delicate comparative levels. To solve the challenge, we propose High-Order Contrastive Tensor Completion (HOCTC), an innovative network to extend contrastive learning to sparse ordinal tensor data. HOCTC employs a novel attention-based strategy with query-expansion to capture high-order mode interactions even in case of very limited tokens, which transcends beyond second-order learning scenarios. Besides, it extends two-level comparisons (positive-vs-negative) to fine-grained contrast-levels using ordinal tensor entries as a natural guidance. Efficient sampling scheme is proposed to enforce such delicate comparative structures, generating comprehensive self-supervised signals for high-order representation learning. Extensive experiments show that HOCTC has promising results in sparse tensor completion in traffic/recommender applications.
Junchen Shen, Zijie Zhai, Danlin Liu, Yu Sun 0076, Ping Li 0024, Jie Zhang 0012, Kai Zhang 0001
ICML6
2024 A Transformative Topological Representation for Link Modeling, Prediction and Cross-Domain Network Analysis
abstract
Many complex social, biological, or physical systems are characterized as networks, and recovering the missing links of a network could shed important lights on its structure and dynamics. A good topological representation is crucial to accurate link modeling and prediction, yet how to account for the kaleidoscopic changes in link formation patterns remains a challenge, especially for analysis in cross-domain studies. We propose a new link representation scheme by projecting the local environment of a link into a "dipole plane", where neighboring nodes of the link are positioned via their relative proximity to the two anchors of the link, like a dipole. By doing this, complex and discrete topology arising from link formation is turned to differentiable point-cloud distribution, opening up new possibilities for topological feature-engineering with desired expressiveness, interpretability and generalization. Our approach has comparable or even superior results against state-of-the-art GNNs, meanwhile with a model up to hundreds of times smaller and running much faster. Furthermore, it provides a universal platform to systematically profile, study, and compare link-patterns from miscellaneous real-world networks. This allows building a global link-pattern atlas, based on which we have uncovered interesting common patterns of link formation, i.e., the bridge-style, the radiation-style, and the community-style across a wide collection of networks with highly different nature.
Kai Zhang 0001, Junchen Shen, Gaoqi He, Yu Sun 0076, Haibin Ling, Hongyuan Zha, Honglin Li 0003, Jie Zhang 0012
IEEE Trans. Pattern Anal. Mach. Intell.4
2014 Sparse semi-supervised learning on low-rank kernel
Kai Zhang 0001, Qiaojun Wang, Liang Lan, Yu Sun 0076, Ivan Marsic
Neurocomputing4