Showing 41 - 60 results of 380 for search '(((( develop research algorithm ) OR ( element data algorithm ))) OR ( data finding algorithm ))', query time: 0.13s Refine Results
  1. 41
  2. 42
  3. 43
  4. 44
  5. 45

    Indexing Arabic texts using association rule data mining by Haraty, Ramzi A.

    Published 2019
    “…The model denotes extracting new relevant words by relating those chosen by previous classical methods to new words using data mining rules. Design/methodology/approach The proposed model uses an association rule algorithm for extracting frequent sets containing related items – to extract relationships between words in the texts to be indexed with words from texts that belong to the same category. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  6. 46

    A fast exact sequential algorithm for the partial digest problem by Mostafa M. Abbas (17058093)

    Published 2016
    “…Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. …”
  7. 47
  8. 48
  9. 49
  10. 50
  11. 51

    Use of Data Mining Techniques to Detect Fraud in Procurement Sector by AL HAMMADI, SUMAYYA ABDULLA

    Published 2022
    “…The method used in this research is a classification of models and algorithms used in data mining. All techniques also will be studied; they include clustering, tracking patterns, classifications and outlier detection. …”
    Get full text
  12. 52
  13. 53

    The buffered work-pool approach for search-tree based optimization algorithms by Abu-Khzam, Faisal N.

    Published 2017
    “…Department of Energy (Office of Advanced Scientific Computing Research, Office of Science). The work of N. F. Samatova was also sponsored by the Laboratory Directed Research and Development Program of Oak Ridge National Laboratory. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  14. 54
  15. 55

    A Novel Hybrid Genetic-Whale Optimization Model for Ontology Learning from Arabic Text by M. Ghoniem , Rania

    Published 2019
    “…The previously published research on Arabic ontology learning from text falls into three categories: developing manually hand-crafted rules, using ordinary supervised/unsupervised machine learning algorithms, or a hybrid of these two approaches. …”
    Get full text
    Get full text
  16. 56
  17. 57

    XBeGene: Scalable XML Documents Generator by Example Based on Real Data by Harazaki, Manami

    Published 2012
    “…Inspired by the query-by-example paradigm in information retrieval, Our generator system i)allows the user to provide her own sample XML documents as input, ii) analyzes the structure, occurrence frequencies, and content distributions for each XML element in the user input documents, and iii) produces synthetic XML documents which closely concur, in both structural and content features, to the user's input data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  18. 58

    UAV Trajectory Planning for Data Collection from Time-Constrained IoT Devices by Samir, Moataz

    Published 2019
    “…To solve it, we first propose the high-complexity branch, reduce and bound (BRB) algorithm to find the global optimal solution for relatively small scale scenarios. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 59

    The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of HQNNs by Muhammad Kashif (3923483)

    Published 2023
    “…One of the prominent challenges lies in the presence of barren plateaus (BP) in QML algorithms, particularly in quantum neural networks (QNNs). …”
  20. 60

    A data envelopment analysis model for opinion leaders’ identification in social networks by Hamed Baziyad (19273738)

    Published 2024
    “…The graph-based methods are one of the most important approaches for finding OLs in OSNs. Social Network Analysis (SNA)-based OLs finding methods deal with a considerable amount of data due to using entire relationships between all of the users in a network, which makes the algorithms time-consuming. …”