يعرض 1 - 20 نتائج من 327 نتيجة بحث عن '(( element data algorithm ) OR ((( data processing algorithm ) OR ( local clustering algorithm ))))', وقت الاستعلام: 0.14s تنقيح النتائج
  1. 1

    Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing حسب Al Sadawi, Alia

    منشور في 2016
    "…A Master of Science thesis in Engineering Systems Management by Alia Al Sadawi entitled, "Efficient Dynamic Cost Scheduling Algorithm for Data Batch Process," submitted in May 2016. …"
    احصل على النص الكامل
    doctoralThesis
  2. 2

    Correlation Clustering with Overlaps حسب Fakhereldine, Amin

    منشور في 2020
    "…Moreover, we allow the new vertex splitting operation, which allows the resulting clusters to overlap. In other words, data elements (or vertices) will be allowed to be members in more than one cluster instead of limiting them to only one single cluster, as in classical clustering methods. …"
    احصل على النص الكامل
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  3. 3

    Efficient Dynamic Cost Scheduling Algorithm for Financial Data Supply Chain حسب Al Sadawi, Alia

    منشور في 2021
    "…An iterative dynamic scheduling algorithm (DCSDBP) was developed to address the data batching process. …"
    احصل على النص الكامل
    article
  4. 4
  5. 5

    On the steiner walk problem. (c2009) حسب Maarouf, Amina

    منشور في 2009
    الموضوعات: "…Euclidean algorithm -- Data processing…"
    احصل على النص الكامل
    احصل على النص الكامل
    masterThesis
  6. 6
  7. 7
  8. 8

    Multi Self-Organizing Map (SOM) Pipeline Architecture for Multi-View Clustering حسب Saadia Jamil (22045946)

    منشور في 2024
    "…A self-organizing map is one of the well-known unsupervised neural network algorithms used for preserving typologies during mapping from the input space (high-dimensional) to the display (low-dimensional).An algorithm called Local Adaptive Receptive Field Dimension Selective Self-Organizing Map 2 is a modified form of a self-organizing Map to cater different data types in the dataset. …"
  9. 9
  10. 10

    A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM حسب Selim, S.Z.

    منشور في 2020
    "…The Fuzzy clustering (FC) problem is a non-convex mathematical program which usually possesses several local minima. …"
    احصل على النص الكامل
    article
  11. 11

    A SIMULATED ANNEALING ALGORITHM FOR THE CLUSTERING PROBLEM حسب Selim, S.Z.

    منشور في 2020
    "…In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. …"
    احصل على النص الكامل
    article
  12. 12
  13. 13
  14. 14
  15. 15

    Computational Experience On Four Algorithms For The Hard Clustering Problem حسب AlSultan, K.S.

    منشور في 2020
    "…The problem is a difficult optimization problem due to the fact that: it posseses many local minima. Several algorithms have been developed to solve this problem which include the k-means algorithm, the simulated annealing algorithm, the tabu search algorithm, and the genetic algorithm. …"
    احصل على النص الكامل
    article
  16. 16
  17. 17
  18. 18
  19. 19

    A Tabu Search-Based Algorithm For The Fuzzy Clustering Problem حسب AlSultan, K.S.

    منشور في 2020
    "…The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. …"
    احصل على النص الكامل
    article
  20. 20