Search Results - (( pattern generation tree algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohid, Hossein, Ibrahim, Hamidah

    Published 2010
    “…An interesting method to frequent pattern mining without generating candidate pattern is called frequent-pattern growth, or simply FP-growth, which adopts a divide-and-conquer strategy as follows.First, it compresses the database representing frequent items into a frequent-pattern tree, or FP-tree, which retains the itemset association information. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2010
    “…In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2011
    “…In this study we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    A numerical method for frequent pattern mining by Mustapha, Norwati, Nadimi-Shahraki, Mohammad-Hossein, Mamat, Ali, Sulaiman, Md. Nasir

    Published 2009
    “…Identifying all frequent patterns is the most time consuming process due to a massive number of patterns generated. …”
    Get full text
    Get full text
    Article
  5. 5

    A Scalable Algorithm for Constructing Frequent Pattern Tree by Noraziah, Ahmad, Herawan, Tutut, Zailani, Abdullah, Mustafa, Mat Deris

    Published 2014
    “…Frequent Pattern Tree (FP-Tree) is a compact data structure of representing frequent itemsets. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Pattern generation through feature values modification and decision tree ensemble construction by Akhand, M. A. H, Rahman, M.M. Hafizur, Murase, K.

    Published 2013
    “…The method modifies feature values of some patterns with the values of other patterns to generate different patterns for different classifiers. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H.

    Published 2002
    “…Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Compact structure representation in discovering frequent patterns for association rules by Mustapha, Norwati, Sulaiman, Md. Nasir, Othman, Mohamed, Selamat, Mohd Hasan

    Published 2002
    “…Flex-tree structure is a lexicographic tree which finds frequent patterns by using depth first search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Discovering Pattern in Medical Audiology Data with FP-Growth Algorithm by G. Noma, Nasir, Mohd Khanapi, Abd Ghani

    Published 2012
    “…We use frequent pattern growth (FP-Growth) algorithm in the data processing step to build the FP-tree data structure and mine it for frequents itemsets. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Frequent Lexicographic Algorithm for Mining Association Rules by Mustapha, Norwati

    Published 2005
    “…The algorithm involved the construction of the nodes of a lexicographic tree that represent frequent patterns. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  15. 15

    An efficient model for indoor radio signal prediction and coverage estimation / Md. Sumon Sarker by Md. Sumon, Sarker

    Published 2011
    “…BFS is used to generate the search space tree and Branch-And- Bound terminology is to avoid the unnecessary generation of the sub-tree using proposed bounding functions. …”
    Get full text
    Get full text
    Thesis
  16. 16

    A hybrid interpretable deep structure based on adaptive neuro‑fuzzy inference system, decision tree, and K‑means for intrusion detection by Jia, Lu, Yin Chai, Wang, Chee Siong, Teh, Xinjin, Li, Liping, Zhao, Fengrui, Wei

    Published 2022
    “…For generating an interpretable deep architecture for identifying deep intrusion patterns, this study proposes an approach that combines ANFIS (Adaptive Network-based Fuzzy Inference System) and DT (Decision Tree) for interpreting the deep pattern of intrusion detection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image by Zainal Azali, Muhammad Nazmi

    Published 2024
    “…In computer vision technology, stereo matching algorithm plays an important role in generating disparity map or depth map through a correspondence process from stereo images. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  19. 19
  20. 20

    An Integrated Principal Component Analysis And Weighted Apriori-T Algorithm For Imbalanced Data Root Cause Analysis by Ong, Phaik Ling

    Published 2016
    “…However, frequent pattern mining (FPM) using Apriori-like algorithms and support-confidence framework suffers from the myth of rare item problem in nature. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis