Search Results - (( pattern mining algorithm ) OR ((( patterns path algorithm ) OR ( patterns search algorithm ))))*

Refine Results
  1. 1

    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
  2. 2

    An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP by Saputra, Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2007
    “…Sequential pattern mining is a relatively new data-mining problem with many areas of applications. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

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

    Published 2002
    “…Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2002
    “…Frequent pattern mining is a key problem in important data mining applications, such as the discovery of association rules, strong rules and episodes. …”
    Get full text
    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
    “…The construction of FP-Tree is very important prior to frequent patterns mining. However, there have been too limited efforts specifically focused on constructing FP-Tree data structure beyond from its original database. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Simulation performance comparison of A*, GLS, RRT and PRM path planning algorithms by Muhammad, Aisha, Nor Rul Hasma, Abdullah, Mohammad A.H., Ali, Shanono, Ibrahim Haruna, Rosdiyana, Samad

    Published 2022
    “…In this study, four robust path planning algorithms, namely: Probabilistic Roadmaps (PRMs), A-star, the Rapidly Exploring Random Trees (RRTs), and Generalized Laser Simulator (GLS), were simulated and their performance was measured and compared according to the total path distance covered, search time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

    Published 2015
    “…Even the smart people are unable to report an email as a spam when the spammer tries to defraud them. The aim of data mining is to search and find undetermined patterns in huge databases. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Frequent itemset mining in high dimensional data: a review by Md. Zaki, Fatimah Audah, Zulkurnain, Nurul Fariza

    Published 2019
    “…Finally, the paper reviews on the latest algorithms of colossal frequent itemset/pattern which currently is the most relevant to mining highdimensional dataset.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  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

    Automatic document clustering and indexing of multiple documents using KNMF for feature extraction through Hadoop and lucene on big data by Laxmi Lydia E., Sharmili N., Nguyen P.T., Hashim W., Maseleno A.

    Published 2023
    “…Automatic indexing; Big data; Cluster analysis; Extraction; Factorization; Indexing (of information); Information retrieval; K-means clustering; Natural language processing systems; Open source software; Open systems; Pattern matching; Software quality; Software testing; Text mining; Hadoop; Key phrase extractions; Map-reduce; Pattern-matching technique; Porters; Pre-processing algorithms; Software environments; Unlabeled; Matrix algebra…”
    Article
  11. 11

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  12. 12

    Using Pattern Search Methods for Minimizing Clustering Problems by Shabanzadeh, Parvaneh, Abu Hassan, Malik, Leong, Wah June, Mohagheghtabar, Maryam

    Published 2010
    “…In this study we show how to apply a particular class of optimization methods known as pattern search methods to address these challenges. …”
    Get full text
    Article
  13. 13

    Using language-based search in mining large software repositories by Awang Abu Bakar, Normi Sham

    Published 2011
    “…For the purpose of automating the data retrieval from the repository, a parser was written using the Python programming language, and based on the pattern matching algorithm. The retrieved data were later used to estimate the quality of the open source software.…”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  14. 14

    Using language-based search in mining large software repositories by Awang Abu Bakar, Normi Sham

    Published 2011
    “…For the purpose of automating the data retrieval from the repository, a parser was written using the Python programming language, and based on the pattern matching algorithm. The retrieved data were later used to estimate the quality of the open source software.…”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    An analysis of text mining factors enhancing the identification of relevant studies by Khashfeh M., Mahmoud M.A., Ahmad M.S.

    Published 2023
    “…In addition, it provides an input tool for user�s search preferences. The second component is the search process that is operated by a pattern matching. …”
    Article
  16. 16
  17. 17

    An improved ACS algorithm for data clustering by Mohammed Jabbar, Ayad, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

    Published 2020
    “…Data clustering is a data mining technique that discovers hidden patterns by creating groups (clusters) of objects. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Lexicon-based and immune system based learning methods in Twitter sentiment analysis by Jantan, Hamidah, Drahman, Fatimatul Zahrah, Alhadi, Nazirah, Mamat, Fatimah

    Published 2016
    “…In future work, the accuracy of proposed model can be strengthened by comparative study with other heuristic based searching algorithms such as genetic algorithm, ant colony optimization, swam algorithms and etc.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Development of behavior-based reactive navigation system for mobile robot by Mohd Hamami, Mohd Ghazali

    Published 2013
    “…The repeatability tests shown that the developed navigation algorithm able the robot to reach the target with the similar navigation path pattern outcome in each simulation tests. …”
    Get full text
    Get full text
    Thesis
  20. 20

    New perturb and observe algorithm based on trapezoidal rule: uniform and partial shading conditions by Mahmod Mohammad Altwallbah, Neda, Mohd Radzi, Mohd Amran, Azis, Norhafiz, Shafie, Suhaidi, Mohd Zainuri, Muhammad Ammirrul Atiqi

    Published 2022
    “…For the first time, Trapezoidal rule concept is employed in P&O approach as a new consideration in the tracking process to calculate the best path for precisely tracking the GMPP. The new algorithm allows the search to continue until the extremum maximum is identified among numerous local maximums, rather than being imprisoned at one of the local maximums as is the case with the standard algorithm. …”
    Get full text
    Get full text
    Article