Search Results - (( java implementation mining algorithm ) OR ( based representation based algorithm ))

Search alternatives:

Refine Results
  1. 1
    Direct approach for mining association rules from structured XML data

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

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Scalable approach for mining association rules from structured XML data

    Scalable approach for mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

    Published 2009
    “…Many techniques have been proposed to tackle the problem of mining XML data we study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Mining association rules from structured XML data

    Mining association rules from structured XML data by Abazeed, Ashraf Riad, Mamat, Ali, Sulaiman, Md. Nasir, Ibrahim, Hamidah

    Published 2009
    “…Many techniques have been proposed to tackle the problem of mining XML data. We study the various techniques to mine XML data and yet We presented a java based implementation of FLEX algorithm for mining XML data.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  4. 4
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    A web-based implementation of k-means algorithms

    A web-based implementation of k-means algorithms by Lee, Quan

    Published 2022
    “…This stinginess of proximity measures in data mining tools is stifling the performance of the algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  6. 6
    Multi-base number representation in application to scalar multiplication and pairing computation

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    A comparative representation approach to modern heuristic search methods in a job shop

    A comparative representation approach to modern heuristic search methods in a job shop by Dominic P, Dhanapal Durai, Ahmad, Kamil, Parthiban, P, Lenny Koh, SC

    Published 2008
    “…This research article addresses the problem of static job shop scheduling on the job-based representation and the rule-based representations. …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  8. 8
    Image clustering comparison of two color segmentation techniques

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…The clustering research is regarding the area of data mining and implementation of the clustering algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING

    USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING by MUFLIKHAH, LAILIL

    Published 2010
    “…Based on the new representation, the documents are then subjected to the clustering algorithm itself, which is Fuzzy c-Means algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Development of intelligent 3D solid modeler based on artificial intelligent technique

    Development of intelligent 3D solid modeler based on artificial intelligent technique by Mohd. Zain, Azlan, Talib, Mohamad Shukor, Harun, Habibollah, Matondang, Muhammad Zaini, Mardzuki, Samihah

    Published 2008
    “…The framework consists of neural network models for the reconstruction and the hybrid computing algorithm as representation scheme of the reconstructed solid. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  11. 11
    Features selection for intrusion detection system using hybridize PSO-SVM

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Map navigation for mobile tourist / Rohana Abd Jalil

    Map navigation for mobile tourist / Rohana Abd Jalil by Abd Jalil, Rohana

    Published 2007
    “…This system is used an rule base algorithm to get an output. The result of this system is come out with the prototype system that adapts the rule base algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Bilinear pairings computation using the extended double-base chains algorithm

    Bilinear pairings computation using the extended double-base chains algorithm by Mohammed Ismail, Abdulwahed, Md. Said, Mohamad Rushdan, Mohd Atan, Kamel Ariffin, Rakhimov, Isamiddin Sattarovich

    Published 2010
    “…The computation efficiency of the Weil and Tate pairings mainly depends on the efficiency of the EC scalar multplications algorithms used. In this paper, we compute the Tate pairing using multi-base number representation(MBNR) system in scalar multiplication instead of using binary representation as used in Miller’s algorithm and in the double-base (DB) chain used by Changan Zhao et al. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Algorithms for extracting adjacency matrix based on Formal Concept Analysis (FCA)

    Algorithms for extracting adjacency matrix based on Formal Concept Analysis (FCA) by Hasni, Hassan, Aznida Hayati, Zakaria@Mohamad, Mohd Isa, Awang, Mokhairi, Makhtar, Rohana, Ismail, Fadhilah, Ahmad

    Published 2017
    “…The desire to achieve a holistic representation of Information Retrieval (IR) with the aim for a human-oriented form of representation has spurred the growth of concept-based IR search techniques such as the Semantic Web technology. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern

    VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern by Angeline Teoh, Szu Fern

    Published 2012
    “…GA is a widely used optimization algorithm based on the concept of survival of the fittest. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Conflict-free automated guided vehicles routing using multi-objective genetic algorithm

    Conflict-free automated guided vehicles routing using multi-objective genetic algorithm by Umar, Ali Umar, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah, Tang, Sai Hong

    Published 2013
    “…The problem is represented using one sub-chromosome for dispatching represented with random keys and the remaining sub-chromosomes for routing represented with priority-based encoding. The algorithm used weight mapping crossover (WMX) and Insertion Mutation (IM) for priority-based representation and parameterized uniform crossover (PUX) for random-key based representation. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation

    Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation by Karim, Sharmila, Ibrahim, Haslinda

    Published 2021
    “…Previously starter sets are generated by using their permutation under exchange-based and cycling based. However, in the new algorithm, this process is replaced by factorial numbers. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Depth Image Layers Separation (DILS) algorithm of image view synthesis based on stereo vision

    Depth Image Layers Separation (DILS) algorithm of image view synthesis based on stereo vision by Abd Manap, Nurulfajar, Soraghan, John J., Petropoulakis, Lykourgos

    Published 2013
    “…A new Depth Image Layers Separation (DILS) algorithm for synthesizing inter-view images based on disparity depth map layers representation is presented. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Switching algorithm to avoid attitude representation singularity

    Switching algorithm to avoid attitude representation singularity by Okasha, Mohamed Elsayed Aly Abd Elaziz, Newman, Brett

    Published 2009
    “…In this paper, the singularity associated with a minimal attitude parameterization using Euler angles is avoided by a switching algorithm. This algorithm is based on describing the attitude as a function of time with two sets of Euler angle sequences that possess nonconjunctive singularities. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  20. 20
    Ball surface representations using partial differential equations

    Ball surface representations using partial differential equations by Kherd, Ahmad Saleh Abdullah

    Published 2015
    “…The numerical results obtained on well-known example of data points show that the proposed generalised Ball surfaces algorithm performs better than BCzier surface representation in terms of computation time and minimal surface area. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: