Search Results - (( program solution mining algorithm ) OR ( java applications mining algorithm ))

Search alternatives:

  • Showing 1 - 16 results of 16
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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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
    “…Attached sensors generate data and send these data to the Java Servlet application through a WIFI module. These data are processed and stored in appropriate formats in a MySQL server database. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Mining Sequential Patterns Using I-PrefixSpan

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

    Published 2007
    “…Sequential pattern mining is a relatively new data-mining problem with many areas of application. …”
    Get full text
    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
    Mining Sequential Patterns using I-PrefixSpan

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

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  7. 7
    Measuring GPU-accelerated parallel SVM performance using large datasets for multi-class machine learning problem

    Measuring GPU-accelerated parallel SVM performance using large datasets for multi-class machine learning problem by Sulaiman M.A.H.B., Suliman A., Ahmad A.R.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  8. 8
    Talent classification using support vector machine technique / Hamidah Jantan, Norazmah Mat Yusof and Mohd Hanapi Abdul Latif

    Talent classification using support vector machine technique / Hamidah Jantan, Norazmah Mat Yusof and Mohd Hanapi Abdul Latif by Jantan, Hamidah, Mat Yusof, Norazmah, Abdul Latif, Mohd Hanapi

    Published 2014
    Subjects: Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  9. 9
    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
    “…The simulation will be carried on WEKA tool, which allows us to call some data mining methods under JAVA environment. The proposed model will be tested and evaluated on both NSL-KDD and KDD-CUP 99 using several performance metrics.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Towards a better feature subset selection approach

    Towards a better feature subset selection approach by Shiba, Omar A. A.

    Published 2010
    “…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli

    Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

    Published 2018
    “…To assess the applicability and accuracy of the proposed method for long-term electrical energy consumption, its estimates are compared with those obtained from artificial neural network (ANN), support vector regression (SVR), adaptive neuro-fuzzy inference system (ANFIS), rule-based data mining algorithm, GEP, linear, quadratic and exponential models optimized by particle swarm optimization (PSO), cuckoo search algorithm (CSA), artificial cooperative search (ACS) algorithm and backtracking search algorithm (BSA). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Problem restructuring in interger programming for reduct searching

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…In effect, they are very useful in generating rules when solving the classification problem that is inherent in data mining. The thesis emphasizes mainly on the improvement of the original SIP/DRIP algorithm in term of performance. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Web page design for electronic commerce / Lee Fong Wai

    Web page design for electronic commerce / Lee Fong Wai by Lee , Fong Wai

    Published 2003
    “…The sixth part covers the system implementation that involved the transformation of modules and algorithm into implementable commands by using the specified programming languages. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Classification models for higher learning scholarship award decisions

    Classification models for higher learning scholarship award decisions by Wirawati Dewi Ahmad, Azuraliza Abu Bakar

    Published 2018
    “…In this study, a data mining approach was used to propose a classification model of scholarship award result determination. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Dynamic and adaptive execution models for data stream mining applications in mobile edge cloud computing systems / Muhammad Habib Ur Rehman

    Dynamic and adaptive execution models for data stream mining applications in mobile edge cloud computing systems / Muhammad Habib Ur Rehman by Muhammad Habib , Ur Rehman

    Published 2016
    “…At application level, the program components need to handle continuously streaming data in order to perform knowledge discovery operations. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata

    K Nearest Neighbor Joins And Mapreduce Process Enforcement For The Cluster Of Data Sets In Bigdata by Md Shah, Wahidah, Othman, Mohd Fairuz Iskandar, Hussian Hassan, Ali Abdul, Talib, Mohammed Saad, Mohammed, Ali Abdul Jabbar

    Published 2018
    “…K Nearest Neighbor Joins (KNN join) are regarded as highly primitive and expensive operations in the data mining.The efficient use of KNN join has proven good results in finding the objects from two data sets prevailed in the huge databases.This has been achieved with the combination of K-Nearest Neighbor query and join operation to find the distinct objects from different data sets.MapReduce is a newly introduced program with the combination of Map Procedure method and Reduce Method widely used in BigData.MapReduce is enriched with parallel distributed algorithm to find the results on a cluster of data sets in BigData.In this paper,the combination of KNN join and MapReduce methods are utilized on the cluster of data sets in BigData for knowledge discovery.Exploring the pinpoint data from huge data sets stored in Big Data demands the distributed large scale data processing.The present research paper is focusing on generic steps for KNN joins exploration operations on MapReduce.The operations of KNN Join are targeted to perform the data partitioning and data pre-processing and necessary calculations.By utilizing the combination of KNN joins with MapReduce methods on BigData data sets will demonstrate a solution for complex computational analysis. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: