Hong Yu 0007

dblp:55/6749-7 · DBLP profile ↗
← Back
25ranked-venue papers in the field
10as first author
11since 2021 · last 2027
0000-0003-0667-8413ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 13 (3 first)Information Retrieval & Web Search · 4Data Mining & Knowledge Discovery · 3 (3 first)Database Systems & Data Management · 2 (2 first)Big Data, Cloud & Distributed Data Systems · 2 (1 first)Other / Interdisciplinary · 1 (1 first)
YearPublicationVenuePosition
2027 Tabular continual learning from high-heterogeneity feature spaces via memory and forgetting dual-driven
Yan Xian, Hong Yu 0007, Yongfang Xie, Guoyin Wang 0001
Inf. Process. Manag.2
2026 Evidential Uncertainty Modulated Adaptive Predictive Contrastive Learning for Multimodal Fusion
abstract
Multimodal learning has achieved remarkable success by integrating heterogeneous information from multiple sources. However, most existing methods either treat all samples uniformly or rely on deterministic prediction correctness to guide cross-modal alignment, overlooking the varying degrees of epistemic uncertainty inherent in each modality. Such assumptions often lead to noise propagation, especially when models exhibit over-confident yet unreliable predictions. To address this limitation, we propose Adaptive Predictive Contrastive Learning (AdaPCL), an evidential uncertainty modulated framework designed to regulate cross-modal interactions based on modality-specific reliability. Specifically, we first employ evidential deep learning to explicitly quantify modality-specific epistemic uncertainty, establishing a dual-view assessment that calibrates discriminative confidence with evidential reliability. Building upon this, we introduce a continuous reliability-modulated mechanism that synthesizes these dual perspectives to assign soft, instance-specific weights. This design enables AdaPCL to formulate a unified and adaptive contrastive objective encompassing three complementary alignment strategies: (i) Symmetric Alignment for mutually reliable modality pairs, (ii) Directional Distillation where a reliable modality provides pseudo-supervision for its uncertain counterpart, and (iii) Reliability-Aware Slack Regularization that adaptively attenuates the influence of mutually unreliable samples without enforcing rigid geometric constraints. Extensive experiments on multiple benchmark datasets demonstrate that AdaPCL consistently outperforms baseline multimodal classification methods. Code is available at https://github.com/yuhongcqupt/AdaPCL.
Qiuyu Mei, Hong Yu 0007, Shijie Yu
ICMR2
2025 Hierarchical chat-based strategies with MLLMs for Spatio-temporal action detection
Ye Wang 0006, Fei Tao 0003, Hong Yu 0007, Qun Liu 0005
Inf. Process. Manag.4
2024 Knowledge graph embedding based on dynamic adaptive atrous convolution and attention mechanism for link prediction
Weibin Deng, Hong Yu 0007
Inf. Process. Manag.3
2023 A Novel Discriminative Dictionary Pair Learning Constrained by Ordinal Locality for Mixed Frequency Data Classification : Extended abstract
abstract
A dilemma faced by classification is that the data is not collected at the same frequency in some applications. We investigate the mixed frequency data in a new way and recognize them as a special style of multi-view data, in which each view data is collected at a different sampling frequency. This paper proposes a discriminative dictionary pair learning method constrained by ordinal locality for mixed frequency data classification (shorted by DPLOL-MF). This method integrates synthesis dictionary and analysis dictionary into a dictionary pair, which not only improves computational cost caused by the ℓ0or ℓ1-norm constraint, but also can deal with the sampling frequency inconsistency. The DPLOL-MF utilizes a synthesis dictionary to learn class-specified reconstruction information and employs an analysis dictionary to generate coding coefficients by analyzing samples. Particularly, the ordinal locality preserving term is leveraged to constrain the atoms of dictionaries pair to further facilitate the learned dictionary pair to be more discriminative. Besides, we design a specific classification scheme for the inconsistent sample size of mixed frequency data. This paper illustrates a novel idea to solve the classification task of mixed frequency data and the experimental results demonstrate the effectiveness of the proposed method.
Hong Yu 0007, Guoyin Wang 0001, Yongfang Xie
ICDE1
2023 Three-way decision for probabilistic linguistic conflict analysis via compounded risk preference
Tianxing Wang 0002, Huaxiong Li, Dun Liu, Hong Yu 0007
Inf. Sci.5
2023 LSTC: When label-specific features meet third-order label correlations
Xing-Yi Zhang, Fan Min 0001, Guojie Song, Hong Yu 0007
Inf. Sci.4
2022 Improving nonnegative matrix factorization with advanced graph regularization
Degang Chen 0002, Hong Yu 0007, Guoyin Wang 0001, Houjun Tang, Kesheng Wu
Inf. Sci.3
2022 Path-based reasoning with K-nearest neighbor and position embedding for knowledge graph completion
Zhihan Peng, Hong Yu 0007, Xiuyi Jia
J. Intell. Inf. Syst.2
2022 A Novel Discriminative Dictionary Pair Learning Constrained by Ordinal Locality for Mixed Frequency Data Classification
abstract
A dilemma faced by classification is that the data is not collected at the same frequency in some applications. We investigate the mixed frequency data in a new way and recognize them as a special style of multi-view data, in which each view data is collected at a different sampling frequency. This article proposes a discriminative dictionary pair learning method constrained by ordinal locality for mixed frequency data classification (shorted by DPLOL-MF). This method integrates synthesis dictionary and analysis dictionary into a dictionary pair, which not only improves computational cost caused by the${\ell _0}$or${\ell _1}$-norm constraint, but also can deal with the sampling frequency inconsistency. The DPLOL-MF utilizes a synthesis dictionary to learn class-specified reconstruction information and employs an analysis dictionary to generate coding coefficients by analyzing samples. Particularly, the ordinal locality preserving term is leveraged to constrain the atoms of dictionaries pair to further facilitate the learned dictionary pair to be more discriminative. Besides, we design a specific classification scheme for the inconsistent sample size of mixed frequency data. This paper illustrates a novel idea to solve the classification task of mixed frequency data and the experimental results demonstrate the effectiveness of the proposed method.
Hong Yu 0007, Guoyin Wang 0001, Yongfang Xie
IEEE Trans. Knowl. Data Eng.1
2021 A Novel Multi-View Clustering Method for Unknown Mapping Relationships Between Cross-View Samples
abstract
The existing multi-view clustering algorithms require that a sample in a view is completely or partially mapped onto one or more samples in a different corresponding view. However, this requirement could not be satisfied in many practical applications. Fortunately, there is a common cognition that the graph structure formed from each view should be as consistent as possible. Thus, this paper proposes a novel multi-view clustering method for unknown mapping relationships between cross-view samples based on the framework of non-negative matrix factorization, as an attempt to solve this problem. The objective function is designed by effectively building reconstruction error terms, local structural constraint terms, and cross-view mapping loss terms by exploring cross-view relationships. The experimental results show that the proposed method not only performs well to reveal the real mapping relationships between cross-view samples but also outperforms the comparison algorithms on the obtained clustering results.
Hong Yu 0007, Guoyin Wang 0001, Xinbo Gao 0001
KDD1
2020 Incremental approaches for heterogeneous feature selection in dynamic ordered data
Binbin Sang, Hongmei Chen 0001, Tianrui Li 0001, Weihua Xu 0003, Hong Yu 0007
Inf. Sci.5
2020 An active three-way clustering method via low-rank matrices for multi-view data
Hong Yu 0007, Guoyin Wang 0001
Inf. Sci.1
2019 Granular ball computing classifiers for efficient, scalable and robust learning
Shuyin Xia, Yunsheng Liu, Guoyin Wang 0001, Hong Yu 0007, Yuoguo Luo
Inf. Sci.5
2018 A Soft Sensing Prediction Model of Superheat Degree in the Aluminum Electrolysis Production
abstract
Aluminum alloy is widely used in transportation, catering, industry, sports, health and other fields, because of their excellent high specific strength and corrosion resistance. Aluminum industry has been an important mainstay industry of a national economy. In the process of electrolytic aluminum, the superheat degree is a very important production target. When an electrolysis cell is working in the appropriate superheat degree state, the life of cell is prolonged and the amounts of aluminum released will enhanced. However, to measure the superheat degree is very difficult and the measured results cannot timely feedback to the process of production. To address the problem, a soft sensing prediction model of superheat degree is proposed in this paper, in which some new concepts such as the decay function of data weight, the credibility of a rule and the rule tree are introduced. Basically speaking, the processing of the soft sensing prediction model is mainly based on the rough set data analysis method and a tree data structure. The static rules are obtained from the history data by using the attribute reduction and value reduction method in the rough sets. The rule tree is updated timely based on the incremental data set accordingly. The effectiveness of the proposed model is verified with the aluminum production data provided by Shandong Weiqiao Aluminum Electrolysis limited company in China.
Hong Yu 0007, Jisen Yang, Zhong Zou, Guoyin Wang 0001, Tao Sang
IEEE BigData1
2018 An Efficient Gradual Three-Way Decision Cluster Ensemble Approach
Hong Yu 0007, Guoyin Wang 0001
IPMU (2)1
2018 A Multi-objective Optimization Algorithm Based on Preference Three-Way Decomposition
Zhao Fu, Hong Yu 0007
KSEM (2)2
2018 Tag recommendation method in folksonomy based on user tagging status
Hong Yu 0007, Bing Zhou 0002, Mingyao Deng, Feng Hu 0001
J. Intell. Inf. Syst.1
2017 Noise self-filtering K-nearest neighbors algorithms
abstract
In the human cognition learning, the noise self-filtering filters the noise data by itself, making the human brain very robust. Although k-Nearest Neighbors (kNN) can decrease the affection of noise data by optimizing the parameter k, noise data still may deteriorate the learning results to an extent on various data. Therefore, this paper proposes the strategy for kNNs. Here, we formalize such training strategies in the context of kNNs, and they are called with “Noise Self-filtering k-Nearest Neighbors” (NSF-kNNs). As its name suggests, it is determined by the model itself based on what it has already learned, as oppose to some predefined heuristic criteria. We derive the mathematical model of the NSF-kNNs, which is an algorithm framework. The NSF-kNNs are compared with the exact kNNs and as far as we know the most efficient approximate kNN [1]. The results show the achievement of improvements in the robustness and generalizability on various data sets.
Shuyin Xia, Guoyin Wang 0001, Yunsheng Liu, Qun Liu 0005, Hong Yu 0007
IEEE BigData5
2016 Detecting and refining overlapping regions in complex networks with three-way decisions
Hong Yu 0007, Peng Jiao, Yiyu Yao, Guoyin Wang 0001
Inf. Sci.1
2015 The approximation set of a vague set in rough approximation space
Qinghua Zhang 0001, Jin Wang 0006, Guoyin Wang 0001, Hong Yu 0007
Inf. Sci.4
2014 Decision region distribution preservation reduction in decision-theoretic rough set model
Xi'ao Ma, Guoyin Wang 0001, Hong Yu 0007, Tianrui Li 0001
Inf. Sci.3
2011 A QoS-Aware Web Services Selection Model Using AND/OR Graph
Hong Yu 0007
ADMA (1)1
2010 Web Users Access Paths Clustering Based on Possibilistic and Fuzzy Sets Theory
Hong Yu 0007, Hu Luo, Shuangshuang Chu
ADMA (1)1
2010 Rough implication operator based on strong topological rough algebras
Xiaohong Zhang 0001, Yiyu Yao, Hong Yu 0007
Inf. Sci.3