Yue Liu

Yue Liu

Auto-generated profile, based on publicly available information

Yue Liu

School of Computer Engineering and Science, Shanghai University, Shanghai, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 January 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YLYue Liu
Yue Liu
ZLZitu Liu
Zitu Liu
SLShuang Li
Shuang Li
YGYike Guo
Yike Guo
QLQun Liu
Qun Liu
GWGuoyin Wang
Guoyin Wang

2 March 2022 in Information Sciences
Verified
Journal Article
Closed access
YLYue Liu
Yue Liu
WTWeize Tang
Weize Tang
ZLZitu Liu
Zitu Liu
LDLin Ding
Lin Ding
Aihua TangAihua Tang
Aihua Tang

1 January 2022 in Journal of Inorganic Materials
Verified
Journal Article
Closed access
PDF file
SSShiyu Sun
Shiyu Sun
SMShuchang Ma
Shuchang Ma
XZXinxin Zou
Xinxin Zou
QQQuan Qian
Quan Qian
YLYue Liu
Yue Liu
Siqi ShiSiqi Shi
Siqi Shi

8 May 2021
Verified
Book Chapter
Closed access
PDF file
YLYue Liu
Yue Liu
SLShuang Li
Shuang Li
WTWenjie Tian
Wenjie Tian

30 September 2020 in Intelligent Data Analysis: An International Journal
Verified
Journal Article
Closed access
YLYue Liu
Yue Liu
BLBufang Li
Bufang Li
Clustering algorithm is the foundation and important technology in data mining. In fact, in the real world, the data itself often has a hierarchical structure. Hierarchical clustering aims at constructing a cluster tree, which reveals the underlying modal structure of a complex density. Due to its inherent complexity, most existing hierarchical clustering algorithms are usually designed heuristically without an explicit objective function, which limits its utilization and analysis. K-means clustering, the well-known simple yet effective algorithm which can be expressed from the view of probability distribution, has inherent connection to Mixture of Gaussians (MoG). At this point, we consider combining Bayesian theory analysis with K-means algorithm. This motivates us to develop a hierarchical clustering based on K-means under the probability distribution framework, which is different from existing hierarchical K-means algorithms processing data in a single-pass manner along with heuristic strategies. For this goal, we propose an explicit objective function for hierarchical clustering, termed as Bayesian hierarchical K-means (BHK-means). In our method, a cascaded clustering tree is constructed, in which all layers interact with each other in the network-like manner. In this cluster tree, the clustering results of each layer are influenced by the parent and child nodes. Therefore, the clustering result of each layer is dynamically improved in accordance with the global hierarchical clustering objective function. The objective function is solved using the same algorithm as K-means, the Expectation-maximization algorithm. The experimental results on both synthetic data and benchmark datasets demonstrate the effectiveness of our algorithm over the existing related ones.

30 April 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
YLYue Liu
Yue Liu
ZYZhenyao Yu
Zhenyao Yu
ZLZitu Liu
Zitu Liu
ZYZiyi Yu
Ziyi Yu
XYXinyan Yang
Xinyan Yang
GWGuoyin Wang
Guoyin Wang