Search Results - (( pattern mining algorithm ) OR ( ((pattern mining) OR (between working)) algorithm ))

Search alternatives:

Refine Results
  1. 1
    Modifying iEclat algorithm for infrequent patterns mining

    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
    Save to List
    Saved in:
  2. 2
    Modifying iEclat algo ithm for infrequent patterns mining

    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
    Save to List
    Saved in:
  3. 3
    Performance of IF-Postdiffset and R-Eclat Variants in Large Dataset

    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
    Save to List
    Saved in:
  4. 4
    Efficient prime-based method for interactive mining of frequent patterns.

    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
    Save to List
    Saved in:
  5. 5
    Web user navigation pattern mining approach based on graph partitioning algorithm.

    Web user navigation pattern mining approach based on graph partitioning algorithm. by Jalali, Mehrdad, Mustapha, Norwati, Mamat, Ali, Sulaiman, Md. Nasir

    Published 2008
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Prime-based method for interactive mining of frequent patterns

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…Over the past decade, an increasing number of efficient mining algorithms have been proposed to mine the frequent patterns by satisfying a user specified threshold called minimum support (minsup). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database

    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
    Save to List
    Saved in:
  8. 8
    Algorithms for frequent itemset mining: a literature review

    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
    Save to List
    Saved in:
  9. 9
    Frequent Lexicographic Algorithm for Mining Association Rules

    Frequent Lexicographic Algorithm for Mining Association Rules by Mustapha, Norwati

    Published 2005
    “…The mined frequent patterns are then used in generating association rules. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    A numerical method for frequent pattern mining

    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
    Save to List
    Saved in:
  11. 11
    Mining dense data: Association rule discovery on benchmark case study

    Mining dense data: Association rule discovery on benchmark case study by Bakar, W.A.W.A., Saman, M.D.M., Abdullah, Z., Jalil, M.A., Herawan, T.

    Published 2016
    “…In this article, we present comparison result between Apriori and FP-Growth algorithm in generating association rules based on a benchmark data from frequent itemset mining data repository. …”
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A frequent pattern mining algorithm based on FP-growth without generating tree

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, 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. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    A frequent pattern mining algorithm based on FP-growth without generating tree

    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
    Save to List
    Saved in:
  14. 14
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

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

    Published 2008
    “…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Sequential pattern mining using PrefixSpan with pseudoprojection and separator database

    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
    Save to List
    Saved in:
  16. 16
    Mining least relational patterns from multi relational tables

    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
    Save to List
    Saved in:
  17. 17
    Using unique-prime-factorization theorem to mine frequent patterns without generating tree

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

    Published 2011
    “…An interest solution is to design an approach that without generating candidate is able to mine frequent patterns. Results: 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. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Expectation maximization clustering algorithm for user modeling in web usage mining system

    Expectation maximization clustering algorithm for user modeling in web usage mining system by Mustapha, Norwati, Jalali, Manijeh, Jalali, Mehrdad

    Published 2009
    “…The results also indicate that kind of behavior given by EM clustering algorithm has improved the visit-coherence (accuracy) of navigation pattern mining.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository

    ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository by Zailani, Abdullah, Amir, Ngah, Herawan, Tutut, Noraziah, Ahmad, Siti Zaharah, Mohamad, Abdul Razak, Hamdan

    Published 2017
    “…Therefore, in this paper we proposed a complete model for mining least patterns known as Efficient Least Pattern Mining Model (ELP-M2) with LP-Tree data structure and LP-Growth algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  20. 20
    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection

    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
    “…Sequential pattern mining is a new branch of data, mining science that solves inter-transaction pattern mining problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: