Search Results - parallel computing ((mining algorithm) OR (clustering algorithm))*

Refine Results
  1. 1

    The Parallel Fuzzy C-Median Clustering Algorithm Using Spark for the Big Data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Siddiqui, Sumrana, Sarkar, Rashel

    Published 2024
    “…Therefore, we develop a Parallel Fuzzy C-Median Clustering Algorithm Using Spark for Big Data that can handle large datasets while maintaining high accuracy and scalability. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    A spark-based parallel fuzzy C median algorithm for web log big data by Mallik, Moksud Alam, Zulkurnain, Nurul Fariza, Nizamuddin, Mohammed Khaja, Sarkar, Rashal, Chalil, Aboosalih Kakkat

    Published 2022
    “…Based on the Rand Index and SSE (sum of squared error), the parallel Fuzzy C median algorithm's performance is evaluated in the PySpark platform. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5
  6. 6

    Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

    Published 2009
    “…The sequential algorithm is then converted into a parallel algorithm by integrating it with the Message Passing Interface (MPI) libraries so that it can be executed on a cluster computer. …”
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Parallel matrix-multiplication algorithm on network of workstations by Md. Aminuddin, Rusdi, Abdullah, Rosni, Hassan, Suhaidi

    Published 2004
    “…We present the comparison in terms of speed between serial algorithm and the parallel algorithm when we run them on our cluster. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Random sampling method of large-scale graph data classification by Rashed Mustafa, Mohammad Sultan Mahmud, Mahir Shadid

    Published 2024
    “…Since the data blocks in this model are much smaller than the entire data set, it is more efficient to analyze them on a standalone small machine, and multiple data blocks can be analyzed on multiple nodes of the cluster in parallel. Finally, we classified the graphs of data blocks using the SVM algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

    Parallel Processing of RSAAlgorithm Using MPI Library by Wan Dagang, Wan Rahaya

    Published 2006
    “…This parallel system is going to be embedded on grid or cluster computing environment. …”
    Get full text
    Get full text
    Final Year Project
  16. 16

    K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

    Published 2018
    “…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S., Al-Jumaily A.

    Published 2025
    “…Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout's distributed machine-learning environment. …”
    Article
  18. 18

    The parallelization of the Keller box method on heterogeneous cluster of workstations by Hamzah, Norhafizah, Alias, Norma, Saidina Amin, Norsarahaida

    Published 2008
    “…High performance computing is the branch of parallel computing dealing with very large problems and large parallel computers that can solve those problems in a reasonable amount of time. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20