Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Improved Data Stream Clustering Method: Incorporating KD-Tree for Typicality and Eccentricity-Based Approach

    Dayu Xu1,#, Jiaming Lü1,#, Xuyao Zhang2, Hongtao Zhang1,*

    CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2557-2573, 2024, DOI:10.32604/cmc.2024.045932 - 27 February 2024

    Abstract Data stream clustering is integral to contemporary big data applications. However, addressing the ongoing influx of data streams efficiently and accurately remains a primary challenge in current research. This paper aims to elevate the efficiency and precision of data stream clustering, leveraging the TEDA (Typicality and Eccentricity Data Analysis) algorithm as a foundation, we introduce improvements by integrating a nearest neighbor search algorithm to enhance both the efficiency and accuracy of the algorithm. The original TEDA algorithm, grounded in the concept of “Typicality and Eccentricity Data Analytics”, represents an evolving and recursive method that requires… More >

  • Open Access

    REVIEW

    Subspace Clustering in High-Dimensional Data Streams: A Systematic Literature Review

    Nur Laila Ab Ghani1,2,*, Izzatdin Abdul Aziz1,2, Said Jadid AbdulKadir1,2

    CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 4649-4668, 2023, DOI:10.32604/cmc.2023.035987 - 31 March 2023

    Abstract Clustering high dimensional data is challenging as data dimensionality increases the distance between data points, resulting in sparse regions that degrade clustering performance. Subspace clustering is a common approach for processing high-dimensional data by finding relevant features for each cluster in the data space. Subspace clustering methods extend traditional clustering to account for the constraints imposed by data streams. Data streams are not only high-dimensional, but also unbounded and evolving. This necessitates the development of subspace clustering algorithms that can handle high dimensionality and adapt to the unique characteristics of data streams. Although many articles… More >

  • Open Access

    ARTICLE

    Hierarchical Stream Clustering Based NEWS Summarization System

    M. Arun Manicka Raja1,*, S. Swamynathan2

    CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 1263-1280, 2022, DOI:10.32604/cmc.2022.019451 - 07 September 2021

    Abstract News feed is one of the potential information providing sources which give updates on various topics of different domains. These updates on various topics need to be collected since the domain specific interested users are in need of important updates in their domains with organized data from various sources. In this paper, the news summarization system is proposed for the news data streams from RSS feeds and Google news. Since news stream analysis requires live content, the news data are continuously collected for our experimentation. The major contributions of this work involve domain corpus based… More >

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