Search Results - (( pattern mining algorithm ) OR ( patterns ((among algorithm) OR (_ algorithm)) ))*

Refine Results
  1. 1

    Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset by Julaily Aida, Jusoh, Wan Aezwani, Wan Abu Bakar, Mustafa, Man

    Published 2018
    “…The multiple variants in the R-Eclat algorithm generate varied performances in infrequent mining patterns. …”
    Get full text
    Get full text
    Article
  2. 2

    Frequent Lexicographic Algorithm for Mining Association Rules by Mustapha, Norwati

    Published 2005
    “…An algorithm called Flex (Frequent lexicographic patterns) has been proposed in obtaining a good performance of searching li-equent patterns. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Mining least relational patterns from multi relational tables by Selamat, Siti Hairulnita, Mat Deris, Mustafa, Mamat, Rabiei, Bakar, Zuriana Abu

    Published 2005
    “…In this paper, we propose an algorithm called Extraction Least Pattern (ELP) algorithm that using a couple of predefined minimum support thresholds. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Sequential pattern mining using PrefixSpan with pseudoprojection and separator database by Saputra, D., Rambli, D.R.A., Foong, Oi Mean

    Published 2008
    “…Sequential pattern mining is a new branch of data mining science that solves inter-transaction pattern mining problems. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

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

    Published 2011
    “…Finding such frequent patterns plays an essential role in mining associations, correlations and many other interesting relationships among data. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

    Published 2008
    “…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
    Get full text
    Thesis
  7. 7

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…A comprehensive performance study has been reported that PrefixSpan, one of the sequential pattern mining algorithms, outperforms GSP, SPADE, as well as FreeSpan in most cases, and PrefixSpan integrated with pseudoprojection technique is the fastest among those tested algorithms. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Modifying iEclat algorithm for infrequent patterns mining by Julaily Aida, J., Mustafa, M.

    Published 2018
    “…This paper proposes an enhancement algorithm based on iEclat algorithms for mining infrequent pattern.…”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The proposed method, XiFLEX has been implemented using two different techniques (java based & XQuery) and compared with the original FLEX algorithm in its basic implementation and the Apriori algorithm for frequent patterns generation. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Analysis of K-Mean and X-Mean Clustering Algorithms Using Ontology-Based Dataset Filtering by Rahmah, Mokhtar, Raza, Muhammad Ahsan, Fauziah, Zainuddin, Nor Azhar, Ahmad, Raza, Muhammad Fahad, Raza, Binish

    Published 2021
    “…In the field of computer science, data mining facilitates the extraction of useful knowledge and patterns from a huge amount of data. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Modifying iEclat algo ithm for infrequent patterns mining by Julaily Aida, Jusoh, Mustafa, Man

    Published 2018
    “…This paper proposes an enhancement algorithm based on iEclat algorithms for mining infrequent pattern.…”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12
  13. 13
  14. 14
  15. 15

    DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database by Zailani, Abdullah, Herawan, Tutut, Noraziah, Ahmad, Mustafa, Mat Deris

    Published 2012
    “…Nowadays, FP-Growth is one of the famous and benchmarked algorithms to mine the frequent patterns from FP-Tree data structure. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2011
    “…Since rerunning mining algorithms from scratch is very costly and time-consuming, researchers have introduced interactive mining of frequent patterns. …”
    Get full text
    Get full text
    Article
  17. 17

    Algorithms for frequent itemset mining: a literature review by Chee, C.-H., Jaafar, J., Aziz, I.A., Hasan, M.H., Yeoh, W.

    Published 2018
    “…This paper reviews and presents a comparison of different algorithms for Frequent Pattern Mining (FPM) so that a more efficient FPM algorithm can be developed. …”
    Get full text
    Get full text
    Article
  18. 18

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

    Published 2009
    “…Frequent pattern mining is one of the active research themes in data mining. …”
    Get full text
    Get full text
    Article
  19. 19

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

    Published 2010
    “…Our algorithm works based on prime factorization, and is called Frequent Pattern-Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

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

    Published 2010
    “…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.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.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item