Search Results - (( based computer window algorithm ) OR ( java implementation mining 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
    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:
  3. 3
    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:
  4. 4
    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:
  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
    Date store management in sliding window based on-line identification algorithms

    Date store management in sliding window based on-line identification algorithms by Asirvadam , Vijanth Sagayan, McLoone, Sean, Irwin, George W

    Published 2001
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Windows-Based bandwidth allocation on optical networks

    Windows-Based bandwidth allocation on optical networks by Mahadevan, V., Yu, W., Zhou, J.

    Published 2009
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    Window based personalized time management system

    Window based personalized time management system by Siew Ann, Lilian Tong

    Published 2012
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  9. 9
    An enhancement of sliding window algorithm for rainfall forecasting

    An enhancement of sliding window algorithm for rainfall forecasting by Azahar, Siti Nor Fathihah, Othman, Mahmod, Saian, Rizauddin

    Published 2017
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model

    Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model by Raja Wahab, Raja Azhan Syah

    Published 2024
    “…Current research on tackling uncertainty revolves around creating specifically tailored algorithms that can operate in the presence of value uncertainty using both a count-based and a time-based approach. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm

    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

    Published 2016
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction

    Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

    Published 2024
    “…Lately, a fully online buffer-based clustering algorithm for handling evolving data streams (BOCEDS) was developed. …”
    Article
    Save to List
    Saved in:
  14. 14
    Enhanced local disparity map algorithm segment-side window-based cost aggregation and refinement

    Enhanced local disparity map algorithm segment-side window-based cost aggregation and refinement by Kadmin, Ahmad Fauzan, Al-Asbahi, Monther Yousef Abdulwasea Mohammed, Hamzah, Rostam Affendi, A Aziz, Khairul Azha, Zainal, Nasharuddin, Jazlan, Nabil Jazli

    Published 2025
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm

    Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

    Published 2014
    “…Detection is provided by using statistical analysis in each window, then the appropriate replacement for the noisy pixel is conducted from given values inside the current window or adjacent reconstructed pixels based on mean calculation and also, for very high density of noise which density of noise is bigger than 80%, the reconstruction is based on a recursive approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

    Published 2017
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities

    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…We also have a driver rest period.The problem is solved heuristically.A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows. A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Line clipping based on parallelism approach and midpoint intersection

    Line clipping based on parallelism approach and midpoint intersection by Hattab, Adel Salem Abdullah, Yusof, Yuhanis

    Published 2014
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Simulation for dynamic patients scheduling based on many objective optimization and coordinator

    Simulation for dynamic patients scheduling based on many objective optimization and coordinator by Mahmed, Ali Nader, Mohd Nizam, Mohmad Kahar

    Published 2024
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Development Of Stereo-Matching Algorithm Based On Adaptive Weighted Prediction

    Development Of Stereo-Matching Algorithm Based On Adaptive Weighted Prediction by Abd Razak, Siti Safwana

    Published 2019
    “…Comparison of this framework continue in some of the state-of-the-arts algorithm in the literature and the results is outperformed based on the proposed algorithm experimental result.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: