Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (4)
  • Open Access

    ARTICLE

    Density Clustering Algorithm Based on KD-Tree and Voting Rules

    Hui Du, Zhiyuan Hu*, Depeng Lu, Jingrui Liu

    CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 3239-3259, 2024, DOI:10.32604/cmc.2024.046314 - 15 May 2024

    Abstract Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets with uneven density. Additionally, they incur substantial computational costs when applied to high-dimensional data due to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset and compute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similarity matrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a vote for the point with the highest density among its KNN. By utilizing the vote counts More >

  • Open Access

    ARTICLE

    A Health State Prediction Model Based on Belief Rule Base and LSTM for Complex Systems

    Yu Zhao, Zhijie Zhou*, Hongdong Fan, Xiaoxia Han, Jie Wang, Manlin Chen

    Intelligent Automation & Soft Computing, Vol.39, No.1, pp. 73-91, 2024, DOI:10.32604/iasc.2024.042285 - 29 March 2024

    Abstract In industrial production and engineering operations, the health state of complex systems is critical, and predicting it can ensure normal operation. Complex systems have many monitoring indicators, complex coupling structures, non-linear and time-varying characteristics, so it is a challenge to establish a reliable prediction model. The belief rule base (BRB) can fuse observed data and expert knowledge to establish a nonlinear relationship between input and output and has well modeling capabilities. Since each indicator of the complex system can reflect the health state to some extent, the BRB is built based on the causal relationship… More >

  • Open Access

    ARTICLE

    Improved Density Peaking Algorithm for Community Detection Based on Graph Representation Learning

    Jiaming Wang2, Xiaolan Xie1,2,*, Xiaochun Cheng3, Yuhan Wang2

    Computer Systems Science and Engineering, Vol.43, No.3, pp. 997-1008, 2022, DOI:10.32604/csse.2022.027005 - 09 May 2022

    Abstract

    There is a large amount of information in the network data that we can exploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of network data is usually paired with clustering algorithms to solve the community detection problem. Meanwhile, there is always an unpredictable distribution of class clusters output by graph representation learning. Therefore, we propose an improved density peak clustering algorithm (ILDPC) for the community detection problem, which improves the local density mechanism in the original algorithm and can better accommodate class clusters of different

    More >

  • Open Access

    ARTICLE

    Hyperspectral Mineral Target Detection Based on Density Peak

    Yani Hou, Wenzhong Zhu, Erli Wang

    Intelligent Automation & Soft Computing, Vol.25, No.4, pp. 805-814, 2019, DOI:10.31209/2019.100000084

    Abstract Hyperspectral remote sensing, with its narrow band imaging, provides the potential for fine identification of ground objects, and has unique advantages in mineral detection. However, the image is nonlinear and the pure pixel is scarce, so using standard spectrum detection will lead to an increase of the number of false alarm and missed detection. The density peak algorithm performs well in high-dimensional space and data clustering with irregular category shape. This paper used the density peak clustering to determine the cluster centers of various categories of images, and took it as the target spectrum, and More >

Displaying 1-10 on page 1 of 4. Per Page