Qingsheng Zhu

Qingsheng Zhu

Auto-generated profile, based on publicly available information

Qingsheng Zhu

Chongqing University

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 September 2016 in Pattern Recognition Letters
Verified
Journal Article
Closed access
QZQingsheng Zhu
Qingsheng Zhu
JFJi Feng
Ji Feng
JHJinlong Huang
Jinlong Huang

1 January 2016 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JHJinlong Huang
Jinlong Huang
QZQingsheng Zhu
Qingsheng Zhu
LYLijun Yang
Lijun Yang
JFJi Feng
Ji Feng

29 July 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
DCDongdong Cheng
Dongdong Cheng
QZQingsheng Zhu
Qingsheng Zhu
JHJinlong Huang
Jinlong Huang
QWQuanwang Wu
Quanwang Wu
LYLijun Yang
Lijun Yang
Clustering analysis has been widely used in statistics, machine learning, pattern recognition, image processing and so on. It is a great challenge for most existing clustering algorithms to discover clusters with arbitrary shapes. Clustering algorithms based on Minimum spanning tree (MST) are able to discover clusters with arbitrary shapes, but they are time consuming and susceptible to noise points. In this paper, we employ local density peaks (LDP) to represent the whole data set and define a shared neighbors-based distance between local density peaks to better measure the dissimilarity between objects on manifold data. On the basis of local density peaks and the new distance, we propose a novel MST-based clustering algorithm called LDP-MST. It first uses local density peaks to construct MST and then repeatedly cuts the longest edge until a given number of clusters are found. The experimental results on synthetic data sets and real data sets show that our algorithm is competent with state-of-the-art methods when discovering clusters with complex structures.

24 June 2019 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
QWQuanwang Wu
Quanwang Wu
Mengchu ZhouMengchu Zhou
Mengchu Zhou
QZQingsheng Zhu
Qingsheng Zhu
YXYunni Xia
Yunni Xia
JWJunhao Wen
Junhao Wen
Cloud computing has nowadays become a dominant technology to reduce the computation cost by elastically providing resources to users on a pay-per-use basis. More and more scientific and business applications represented by workflows have been moved or are in active transition to cloud platforms. Therefore, efficient cloud workflow scheduling methods are in high demand. This paper investigates how to simultaneously optimize makespan and economical cost for workflow scheduling in clouds and proposes a multiobjective evolutionary list scheduling (MOELS) algorithm to address it. It embeds the classic list scheduling into a powerful multiobjective evolutionary algori-thm (MOEA): a genome is represented by a scheduling sequence and a preference weight and is interpreted to a scheduling solution via a specifically designed list scheduling heuristic, and the genomes in the population are evolved through tailored genetic operators. The simulation experiments with the real-world data show that MOELS outperforms some state-of-the-art methods as it can always achieve a higher hypervolume (HV) value.

29 August 2016 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
XWXin DI WU
Xin DI WU
Mengchu ZhouMengchu Zhou
Mengchu Zhou
ZWZidong Wang
Zidong Wang
YXYunni Xia
Yunni Xia
QZQingsheng Zhu
Qingsheng Zhu
Accurately estimating unknown quality-of-service (QoS) data based on historical records of Web-service invocations is vital for automatic service selection. This work presents an effective scheme for addressing this issue via alternating direction method-based matrix factorization. Its main idea consists of a) adopting the principle of the alternating direction method to decompose the task of building a matrix factorization-based QoS-estimator into small subtasks, where each one trains a subset of desired parameters based on the latest status of the whole parameter set; b) building an ensemble of diversified single models with sophisticated diversifying and aggregating mechanism; and c) parallelizing the construction process of the ensemble to drastically reduce the time cost. Experimental results on two industrial QoS datasets demonstrate that with the proposed scheme, more accurate QoS estimates can be achieved than its peers with comparable computing time with the help of its practical parallelization.

2 August 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
DCDongdong Cheng
Dongdong Cheng
QZQingsheng Zhu
Qingsheng Zhu
JHJinlong Huang
Jinlong Huang
QWQuanwang Wu
Quanwang Wu
LYLijun Yang
Lijun Yang
It is critical to evaluate the quality of clusters for most cluster analysis. A number of cluster validity indexes have been proposed, such as the Silhouette and Davies-Bouldin indexes. However, these validity indexes cannot be used to process clusters with arbitrary shapes. Some researchers employ graph-based distance to cluster nonspherical data sets, but the computation of graph-based distances between all pairs of points in a data set is time-consuming. A potential solution is to select some representative points. Inspired by this idea, we propose a novel Local Cores-based Cluster Validity (LCCV) index to improve the performance of Silhouette index. Local cores, with local maximum density, are selected as representative points. Since graph-based distance is used to evaluate the dissimilarity between local cores, the LCCV index is effective for obtaining the optimal cluster number for data sets containing clusters with arbitrary shapes. Moreover, a hierarchical clustering algorithm based on the LCCV index is proposed. The experimental results on synthetic and real data sets indicate that the new index outperforms existing ones.