Search Results - (( pattern mining algorithm ) OR ((( patterns growth algorithm ) OR ( patterns among algorithm ))))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    Detecting Critical Least Association Rules In Medical Databases

    Detecting Critical Least Association Rules In Medical Databases by Herawan, Tutut

    Published 2010
    “…We also employed our scalable algorithm called Significant Least Pattern Growth algorithm (SLP-Growth) to mine the respective association rules. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    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
    “…Therefore, in this paper we introduce an efficient algorithm called Dynamic Frequent Pattern Growth (DFP-Growth) to mine the frequent patterns from dynamic database. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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
    “…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
    Save to List
    Saved in:
  6. 6
    An Integrated Principal Component Analysis And Weighted Apriori-T Algorithm For Imbalanced Data Root Cause Analysis

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

    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
    Save to List
    Saved in:
  10. 10
    Discovering Pattern in Medical Audiology Data with FP-Growth Algorithm

    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
    Save to List
    Saved in:
  11. 11
    Exploratory analysis with association rule mining algorithms in the retail industry / Alaa Amin Hashad ... [et al.]

    Exploratory analysis with association rule mining algorithms in the retail industry / Alaa Amin Hashad ... [et al.] by Hashad, Alaa Amin, Khaw, Khai Wah, Alnoor, Alhamzah, Chew, Xin Ying

    Published 2024
    “…The proposed method is based on comparing two algorithms: Apriori and Frequent Pattern Growth (FP- Growth). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    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:
  13. 13
    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:
  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
    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:
  16. 16
    The application of neural network data mining algorithm into mixed pixel classification in geographic information system environment

    The application of neural network data mining algorithm into mixed pixel classification in geographic information system environment by Nanna Suryana, Herman

    Published 2007
    “…This , paper discusses the development of data mining and pattern recognition algorithm to handle the complexity of hyperspectral remote sensing images in Geographical Information Systems environment. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    EFP-M2: Efficient model for mining frequent patterns in transactional database

    EFP-M2: Efficient model for mining frequent patterns in transactional database by Herawan, Tutut, Noraziah, Ahmad, Zailani, Abdullah, Mustafa, Mat Deris, H. Abawajyd, Jemal

    Published 2012
    “…Therefore, we propose an Efficient Frequent Pattern Mining Model (EFP-M2) to mine the frequent patterns in timely manner. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    A partition based feature selection approach for mixed data clustering / Ashish Dutt

    A partition based feature selection approach for mixed data clustering / Ashish Dutt by Ashish , Dutt

    Published 2020
    “…One such pre-processing algorithm in EDM is clustering. It is a widely used method in data mining to discover unique patterns in underlying data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Mining Sequential Patterns Using I-PrefixSpan

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…Most of the previous works explore Apriori approach which is not efficient in mining plentiful and long patterns. In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: