Search Results - (( java implementation mining algorithm ) OR ( based complex tree algorithm ))

Refine Results
  1. 1

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

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

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

    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
  5. 5
  6. 6

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

    A lower complexity k best algorithm for multiple input and multiple output detection by Jabir, Amjad N., Sabira, Khatun, Noordin, N. K., Ali, B. M.

    Published 2011
    “…This low complexity algorithm is based on probabilistic approach of sphere decoding with self adjustable capability depending on the levels (root, branch, leaf etc.) of a tree. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    A lower complexity K best algorithm for multiple input and multiple output detection by Jabir, Amjad Najim, Khatun, Sabira, Noordin, Nor Kamariah, Mohd Ali, Borhanuddin

    Published 2011
    “…This low complexity algorithm is based on probabilistic approach of sphere decoding with self adjustable capability depending on the levels (root, branch, leaf etc.) of a tree. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

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

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

    Published 2010
    “…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. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image by Zainal Azali, Muhammad Nazmi

    Published 2024
    “…This thesis presents a local-based stereo matching algorithm to increase the accuracy on complex regions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13
  14. 14

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

    E2IDS: an enhanced intelligent intrusion detection system based on decision tree algorithm by Bouke, Mohamed Aly, Abdullah, Azizol, ALshatebi, Sameer Hamoud, Abdullah, Mohd Taufik

    Published 2022
    “…The model design is Decision Tree (DT) algorithm-based, with an approach to data balancing since the data set used is highly unbalanced and one more approach for feature selection. …”
    Get full text
    Get full text
    Article
  16. 16

    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

    Published 2013
    “…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    An extended ID3 decision tree algorithm for spatial data by Sitanggang, Imas Sukaesih, Yaakob, Razali, Mustapha, Norwati, Nuruddin, Ahmad Ainuddin

    Published 2011
    “…The objective of this paper is to propose a new spatial decision tree algorithm based on the ID3 algorithm for discrete features represented in points, lines and polygons. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    An algorithm for the selection of planting lining technique towards optimizing land area: an algorithm for planting lining technique selection by Md Badarudin, Ismadi, Md Sultan, Abu Bakar, Sulaiman, Md. Nasir, Mamat, Ali, Tengku Muda Mohamed, Mahmud

    Published 2012
    “…The algorithm is designed based on two basic works in which to calculate number of trees and divide an area into blocks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

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

    Published 2011
    “…In this study we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20