Wang Xing

Wang Xing

Auto-generated profile, based on publicly available information

Wang Xing

School of Air Force Engineering University, Xi'an, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
19 November 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
JWJun Wang
Jun Wang
XWXing Wang
Xing Wang
Guoxian YuGuoxian Yu
Guoxian Yu
CDCarlotta Domeniconi
Carlotta Domeniconi
Zhiwen YuZhiwen Yu
Zhiwen Yu
ZZZili Zhang
Zili Zhang
Clustering is a fundamental data exploration task which aims at discovering the hidden grouping structure in the data. The traditional clustering methods typically compute a single partition. However, there often exist different and equally meaningful clusterings in complex data. To solve this issue, multiple clustering approaches have emerged with the goal of exploring alternative clusterings from different perspectives. Existing solutions to this problem mainly focus on one-way clustering, that is, they cluster either the samples or the features. However, for many practical tasks, it is meaningful and desirable to explore alternative two-way clusterings (or co-clusterings), which capture not only the sample cluster structure but also the feature cluster structure. To tackle this interesting and unresolved task, we introduce an approach, called multiple co-clusterings (MultiCCs), to generate multiple alternative co-clusterings at the same time. MultiCC takes advantage of matrix tri-factorization to seek the co-clustering indicator matrices for samples and features and defines the row and column redundancy quantification terms to enforce diversity among co-clusterings based on these indicator matrices. After that, it integrates matrix tri-factorization and two nonredundancy terms into a unified objective function and gives an alternative optimization procedure to optimize the objective function. Extensive experimental results demonstrate that MultiCC performs significantly better than the existing multiple clustering methods. In addition, MultiCC can find out interesting co-clusters, which cannot be made by those comparing methods.

1 June 2017
Verified
Conference Paper
Closed access
GPGuo Pengcheng
Guo Pengcheng
WXWang Xing
Wang Xing
YWYubing Wang
Yubing Wang
CYCheng Yue
Cheng Yue
Ying ZhangYing Zhang
Ying Zhang
Regarding the deficiencies of clustering algorithm with fast method of searching and finding density peaks which is published in Science in 2014, an automatically and fast finding of clustering centers clustering algorithm is proposed, which applies linear regression and residual analysis and optimizes sample density value. The proposed algorithm improves location stability of clustering centers by measuring point density through sample's nearest neighbors information, and it determines clustering centers fast and automatically by applying linear regression and residual analysis, which reduces the subjectivity of artificial selection. Theoretical analysis and simulation results show that the proposed algorithm can overcome deficiencies of the original algorithm, what's more, the results of clustering effect and calculation time is superior to original algorithm, K-means and DBSCAN.