DWDongsheng Wang

Dongsheng Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Dongsheng Wang has a total of 19 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Robust Hierarchical Contrastive Learning for Multi-view Clustering with Imbalanced Views

    by Zhengzhong Zhu, Yixuan Ye, Pei Zhou, Li Cheng, Dongsheng Wang, Jiangping Zhu

  • Large language model with retrieval semantics for cold-start recommendations

    by Zelong Wu, Dongsheng Wang, Ying Wang, Rui Zhang, Lisi Chen, Peng Han

  • Open Access

    Generative Next POI Recommendation with Semantic ID

    by Dongsheng Wang, Yuxi Huang, Shen Gao, Yifan Wang, Chengrui Huang, Shuo Shang


  • Open Access

    Fuzzy Regional Co-location Pattern Mining Based on Efficient Density Peak Clustering and Maximal Fuzzy Grid Cliques

    by Tao Zhou, Lizhen Wang, Dongsheng Wang, Vanha Tran

    Due to the heterogeneity of data distribution in real life and the spatial autocorrelation among spatial instances, traditional spatial co-location pattern mining methods tend to ignore valuable information specific to local regions. To address the limitation, regional co-location pattern mining has been proposed to find patterns that may be hidden within local regions. In this paper, a fuzzy regional co-location pattern mining framework based on efficient density peak clustering and maximal fuzzy grid cliques is presented. By incorporating a grid-splitting method and fuzzy theory, an efficient density peak clustering algorithm is proposed to divide the global area into distinct local regions. Furthermore, we propose a method to materialize the neighbor relationships between instances based on the maximal fuzzy grid cliques and parallelize the clustering process to improve the algorithm efficiency. Experimental results show that the proposed algorithm can not only reduce the time consumption by about 40% but also mine meaningful patterns with tighter instance distributions. Received: 24 November 2023 | Revised: 25 January 2024 | Accepted: 7 February 2024 Conflicts of Interest Lizhen Wang is an Editorial Board Member for Journal of Data Science and Intelligent Systems and was not involved in the editorial review or the decision to publish this article. The authors declare that they have no conflicts of interest to this work. Data Availability Statement The data that support the findings of this study are openly available in GitHub at https://github.com/Vansank/DataSet.git. Author Contribution Statement Tao Zhou: Conceptualization, Methodology, Software, Formal analysis, Investigation, Data curation, Writing - original draft, Visualization. Lizhen Wang: Conceptualization, Methodology, Validation, Formal analysis, Resources, Writing - review & editing, Supervision, Project administration, Funding acquisition. Dongsheng Wang: Investigation, Visualization. Vanha Tran: Validation, Data curation, Writing - review & editing.


  • KCGS-Store: A Columnar Storage Based on Group Sorting of Key Columns

    by Tao Xu, Dongsheng Wang

    For the sake of capacity and cost, disks are currently considered as the main storage medium for the massive data. However, the I/O bandwidth of disks lags far behind the growing speed of data, which thus becomes the performance bottleneck of the big data management systems. Therefore, optimizing the storage structure to improve the efficiency of reading and writing has become one important challenge in the age of big data. In this paper, we present a columnar storage structure based on group sorting of the key columns called KCGS-Store. In KCGS-Store, each key column is divided into several groups using the partitioning function. According to the groups of all key columns, the table is split into a number of sub-tables in which the key columns of all records have the same ranges of values. We design a data structure named pool to keep the sub-table and store data by columns. For each key column, all pools belonging to the same group are combined, and arranged by the ordering of the ranges of values. In this way, irrelevant column values can be effectively filtered when executing SQL commands, so as to reduce the amount of data being read, consequently, the query performance can be improved. Meanwhile, using the pool matrix, we can reorganize the records at a little overhead of time and storage space. The evaluation results show that when compared with ORCFile and Parquet, KCGS-Store is superior in many aspects including storage space, data loading and SQL querying.