Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    A Cyber-Attack Detection System Using Late Fusion Aggregation Enabled Cyber-Net

    P. Shanmuga Prabha*, S. Magesh Kumar

    Intelligent Automation & Soft Computing, Vol.36, No.3, pp. 3101-3119, 2023, DOI:10.32604/iasc.2023.034885

    Abstract Today, securing devices connected to the internet is challenging as security threats are generated through various sources. The protection of cyber-physical systems from external attacks is a primary task. The presented method is planned on the prime motive of detecting cybersecurity attacks and their impacted parameters. The proposed architecture employs the LYSIS dataset and formulates Multi Variant Exploratory Data Analysis (MEDA) through Principle Component Analysis (PCA) and Singular Value Decomposition (SVD) for the extraction of unique parameters. The feature mappings are analyzed with Recurrent 2 Convolutional Neural Network (R2CNN) and Gradient Boost Regression (GBR) to identify the maximum correlation. Novel… More >

  • Open Access

    ARTICLE

    Trade-Off between Efficiency and Effectiveness: A Late Fusion Multi-View Clustering Algorithm

    Yunping Zhao1, Weixuan Liang1, Jianzhuang Lu1,*, Xiaowen Chen1, Nijiwa Kong2

    CMC-Computers, Materials & Continua, Vol.66, No.3, pp. 2709-2722, 2021, DOI:10.32604/cmc.2021.013389

    Abstract Late fusion multi-view clustering (LFMVC) algorithms aim to integrate the base partition of each single view into a consensus partition. Base partitions can be obtained by performing kernel k-means clustering on all views. This type of method is not only computationally efficient, but also more accurate than multiple kernel k-means, and is thus widely used in the multi-view clustering context. LFMVC improves computational efficiency to the extent that the computational complexity of each iteration is reduced from O(n3) to O(n) (where n is the number of samples). However, LFMVC also limits the search space of the optimal solution, meaning that… More >

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