Haifeng Yang 0001

dblp:65/3698-1 · DBLP profile ↗
← Back
9ranked-venue papers in the field
1as first author
9since 2021 · last 2026
0000-0002-3280-7584ORCID · conflict

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

Knowledge Engineering, Semantic Web & Information Systems · 4Information Retrieval & Web Search · 3Data Mining & Knowledge Discovery · 2 (1 first)
YearPublicationVenuePosition
2026 Multi-view clustering based on the association of graph structure and feature distribution
Chenhui Shi 0002, Yongjie Xin, Haifeng Yang 0001, Jianghui Cai, Jie Wang 0046, Lichan Zhou, Yanting He, Fuxing Cui, Xujun Zhao, Yaling Xun
Inf. Process. Manag.3
2026 PTQNet: Periodic-temporal query network for long-term multivariate time series forecasting
Yaling Xun, Jiahui Yan, Haifeng Yang 0001, Jianghui Cai
Inf. Process. Manag.3
2025 Meta learning-based relevant user identification and aggregation for cold-start recommendation
Qian Xing, Yaling Xun, Haifeng Yang 0001
J. Intell. Inf. Syst.3
2024 Higher-order embedded learning for heterogeneous information networks and adaptive POI recommendation
Yaling Xun, Jifu Zhang, Haifeng Yang 0001, Jianghui Cai
Inf. Process. Manag.4
2023 A review on semi-supervised clustering
Jianghui Cai, Haifeng Yang 0001, Xujun Zhao
Inf. Sci.3
2023 A new interest extraction method based on multi-head attention mechanism for CTR prediction
Haifeng Yang 0001, Linjing Yao, Jianghui Cai, Xujun Zhao
Knowl. Inf. Syst.1
2022 Mining relevant partial periodic pattern of multi-source time series data
Yaling Xun, Linqing Wang, Haifeng Yang 0001, Jianghui Cai
Inf. Sci.3
2022 Density clustering with divergence distance and automatic center selection
Jianghui Cai, Haifeng Yang 0001, Xujun Zhao
Inf. Sci.3
2022 ARIS: A Noise Insensitive Data Pre-Processing Scheme for Data Reduction Using Influence Space
abstract
The extensive growth of data quantity has posed many challenges to data analysis and retrieval. Noise and redundancy are typical representatives of the above-mentioned challenges, which may reduce the reliability of analysis and retrieval results and increase storage and computing overhead. To solve the above problems, a two-stage data pre-processing framework for noise identification and data reduction, called ARIS, is proposed in this article. The first stage identifies and removes noises by the following steps: First, the influence space (IS) is introduced to elaborate data distribution. Second, a ranking factor (RF) is defined to describe the possibility that the points are regarded as noises, then, the definition of noise is given based on RF. Third, a clean dataset (CD) is obtained by removing noise from the original dataset. The second stage learns representative data and realizes data reduction. In this process, CD is divided into multiple small regions by IS. Then the reduced dataset is formed by collecting the representations of each region. The performance of ARIS is verified by experiments on artificial and real datasets. Experimental results show that ARIS effectively weakens the impact of noise and reduces the amount of data and significantly improves the accuracy of data analysis within a reasonable time cost range.
Jianghui Cai, Haifeng Yang 0001, Xujun Zhao
ACM Trans. Knowl. Discov. Data3