Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Identification of High-Risk Scenarios for Cascading Failures in New Energy Power Grids Based on Deep Embedding Clustering Algorithms

    Xueting Cheng1, Ziqi Zhang2,*, Yueshuang Bao1, Huiping Zheng1

    Energy Engineering, Vol.120, No.11, pp. 2517-2529, 2023, DOI:10.32604/ee.2023.042633

    Abstract At present, the proportion of new energy in the power grid is increasing, and the random fluctuations in power output increase the risk of cascading failures in the power grid. In this paper, we propose a method for identifying high-risk scenarios of interlocking faults in new energy power grids based on a deep embedding clustering (DEC) algorithm and apply it in a risk assessment of cascading failures in different operating scenarios for new energy power grids. First, considering the real-time operation status and system structure of new energy power grids, the scenario cascading failure risk indicator is established. Based on… More >

  • Open Access

    ARTICLE

    Energy-Efficient Cluster in Wireless Sensor Network Using Life Time Delay Clustering Algorithms

    V. Kumar1,*, N. Jayapandian2, P. Balasubramanie3

    Computer Systems Science and Engineering, Vol.43, No.1, pp. 77-86, 2022, DOI:10.32604/csse.2022.023481

    Abstract Through Wireless Sensor Networks (WSN) formation, industrial and academic communities have seen remarkable development in recent decades. One of the most common techniques to derive the best out of wireless sensor networks is to upgrade the operating group. The most important problem is the arrangement of optimal number of sensor nodes as clusters to discuss clustering method. In this method, new client nodes and dynamic methods are used to determine the optimal number of clusters and cluster heads which are to be better organized and proposed to classify each round. Parameters of effective energy use and the ability to decide… More >

  • Open Access

    ARTICLE

    Spectrum Prediction in Cognitive Radio Network Using Machine Learning Techniques

    D. Arivudainambi1, S. Mangairkarasi1,*, K. A. Varun Kumar2

    Intelligent Automation & Soft Computing, Vol.32, No.3, pp. 1525-1540, 2022, DOI:10.32604/iasc.2022.020463

    Abstract Cognitive Radio (CR) aims to achieve efficient utilization of scarcely available radio spectrum. Spectrum sensing in CR is a basic process for identifying the existence or absence of primary users. In spectrum sensing, CR users suffer from deep fading effects and it requires additional sensing time to identify the primary user. To overcome these challenges, we frame Spectrum Prediction-Channel Allocation (SP-CA) algorithm which consists of three phases. First, clustering mechanisms to select the spectrum coordinator. Second, Eigenvalue based detection method to expand the sensing accuracy of the secondary user. Third, Bayesian inference approach to reduce the performance degradation of the… More >

  • Open Access

    ARTICLE

    Clustering Algorithms: Taxonomy, Comparison, and Empirical Analysis in 2D Datasets

    Samih M. Mostafa1,2,*

    Journal on Artificial Intelligence, Vol.2, No.4, pp. 189-215, 2020, DOI:10.32604/jai.2020.014944

    Abstract Because of the abundance of clustering methods, comparing between methods and determining which method is proper for a given dataset is crucial. Especially, the availability of huge experimental datasets and transactional and the emerging requirements for data mining and the like needs badly for clustering algorithms that can be applied in various domains. This paper presents essential notions of clustering and offers an overview of the significant features of the most common representative clustering algorithms of clustering categories presented in a comparative way. More specifically the study is based on the numerical type of the data that the algorithm supports,… More >

  • Open Access

    ARTICLE

    Hybridization of Fuzzy and Hard Semi-Supervised Clustering Algorithms Tuned with Ant Lion Optimizer Applied to Higgs Boson Search

    Soukaina Mjahed1,*, Khadija Bouzaachane1, Ahmad Taher Azar2,3, Salah El Hadaj1, Said Raghay1

    CMES-Computer Modeling in Engineering & Sciences, Vol.125, No.2, pp. 459-494, 2020, DOI:10.32604/cmes.2020.010791

    Abstract This paper focuses on the unsupervised detection of the Higgs boson particle using the most informative features and variables which characterize the “Higgs machine learning challenge 2014” data set. This unsupervised detection goes in this paper analysis through 4 steps: (1) selection of the most informative features from the considered data; (2) definition of the number of clusters based on the elbow criterion. The experimental results showed that the optimal number of clusters that group the considered data in an unsupervised manner corresponds to 2 clusters; (3) proposition of a new approach for hybridization of both hard and fuzzy clustering… More >

  • Open Access

    ARTICLE

    Hybrid Clustering Algorithms with GRASP to Construct an Initial Solution for the MVPPDP

    Abeer I. Alhujaylan1, 2, *, Manar I. Hosny1

    CMC-Computers, Materials & Continua, Vol.62, No.3, pp. 1025-1051, 2020, DOI:10.32604/cmc.2020.08742

    Abstract Mobile commerce (m-commerce) contributes to increasing the popularity of electronic commerce (e-commerce), allowing anybody to sell or buy goods using a mobile device or tablet anywhere and at any time. As demand for e-commerce increases tremendously, the pressure on delivery companies increases to organise their transportation plans to achieve profits and customer satisfaction. One important planning problem in this domain is the multi-vehicle profitable pickup and delivery problem (MVPPDP), where a selected set of pickup and delivery customers need to be served within certain allowed trip time. In this paper, we proposed hybrid clustering algorithms with the greedy randomised adaptive… More >

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