Search Results - (( java segmentation method algorithm ) OR ( pattern solution clustering algorithm ))

Refine Results
  1. 1

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…Moreover, experiments demonstrate that final clustering solution generated by the proposed incremental genetic-based clustering ensemble algorithm using the pattern ensemble learning method possess comparative or better clustering accuracy than clustering solutions generated by the incremental genetic-based clustering ensemble algorithms using other recombination operators. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3
  4. 4

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

    Published 2010
    “…Finally, the algorithm found, which would solve the image segmentation problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

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

    A partition based feature selection approach for mixed data clustering / Ashish Dutt by Ashish , Dutt

    Published 2020
    “…One such pre-processing algorithm in EDM is clustering. It is a widely used method in data mining to discover unique patterns in underlying data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Minimizing the number of stunting prevalence using the euclid algorithm clustering approach by Zarlis, Muhammad, Oktavia, Tanty, Buaton, Relita, Ernawan, Ferda, Andrian, Kevin

    Published 2023
    “…The algorithm used is Euclid. The Euclid algorithm can cluster stunting prevalence data into 4 clusters with the very little category at 79%, the little category at 67%, the many categories at 51%, and the very much category at 21%. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    A modified π rough k-means algorithm for web page recommendation system by Zidane, Khaled Ali Othman

    Published 2018
    “…Hence, this study carried out several objectives to augment the support of modified clustering algorithm. Firstly, an extended K-Means clustering algorithm (called X-Means algorithm) is proposed to filter/remove the noise from user session data to eliminate outliers or irrelevant pages. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    A comprehensive 3-phase framework for determining the customer’s product usage in a food supply chain by Mad Ali, Mohd Fahmi, Mohd Ariffin, Mohd Khairol Anuar, Delgoshaei, Aidin, Mustapha, Faizal, Supeni, Eris Elianddy

    Published 2022
    “…Moreover, the efficiency of the outcomes is evaluated using the Silhouette Coefficient, indicating that the proposed algorithm could provide solutions with a 68% score. …”
    Get full text
    Get full text
    Article
  11. 11

    A numerical method for frequent pattern mining by Mustapha, Norwati, Nadimi-Shahraki, Mohammad-Hossein, Mamat, Ali, Sulaiman, Md. Nasir

    Published 2009
    “…A reasonable solution is identifying maximal frequent patterns which form the smallest representative set of patterns to generate all frequent patterns. …”
    Get full text
    Get full text
    Article
  12. 12

    Application of Optimization Methods for Solving Clustering and Classification Problems by Shabanzadeh, Parvaneh

    Published 2011
    “…Next the problem of data classification is studied as a problem of global, non-smooth and non-convex optimization; this approach consists of describing clusters for the given training sets. The data vectors are assigned to the closest cluster and correspondingly to the set, which contains this cluster and an algorithm based on a derivative-free method is applied to the solution of this problem. …”
    Get full text
    Get full text
    Thesis
  13. 13

    A derivative-free optimization method for solving classification problem by Shabanzadeh, Parvaneh, Abu Hassan, Malik, Leong, Wah June

    Published 2010
    “…Approach: The problem of data classification was studied as a problem of global, nonsmooth and nonconvex optimization; this approach consists of describing clusters for the given training sets. The data vectors are assigned to the closest cluster and correspondingly to the set, which contains this cluster and an algorithm based on a derivative-free method is applied to the solution of this problem. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Spatial-temporal analysis using two-stage clustering and GIS-based MCDM to identify potential market regions by Ernawati, Kamal Baharin, Safiza Suhana, Kasmin, Fauziah

    Published 2021
    “…Subsequently, the origin schools' regencies/cities were clustered using the k- prototypes algorithm based on their time-series pattern category, the consistency in sending students, average cumulative grade point average (CGPA), and dropout (DO) rate. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    A guided hybrid k-means and genetic algorithm models for children handwriting legibility performance assessment / Norzehan Sakamat by Sakamat, Norzehan

    Published 2021
    “…K-Means algorithm a popular efficient clustering techniques and genetic algorithm a widely used evolutionary algorithm and known for its adaptive nature were combined to determine the level of handwriting legibility for each child. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Profiling network traffic of Sultan Idris Shah building (BSIS) using data mining technique / Rusmawati Ishak by Ishak, Rusmawati

    Published 2018
    “…Orange is a tool that being used in implementing K-Means Clustering Algorithm that could be seen as the most suitable solution to find a network trend pattern of user accessing the Internet and to produce with profiling network. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Case study : an effect of noise in character recognition system using neural network by Mohamad, Esmawaty

    Published 2003
    “…These problems may be characterized as mapping(including pattern association and pattern classification), clustering and constrained optimization. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Filtering of Background DNA Sequences Improves DNA Motif Prediction Using Clustering Techniques by Lee, Nung Kion, Chieng, Allen Hoon Choong

    Published 2013
    “…Noisy objects have been known to affect negatively on the performance of clustering algorithms. This paper addresses the problem of high false positive rates in using self-organizing map (SOM) for DNA motif prediction due to the noisy background sequences in the input dataset. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Anomaly detection of intrusion based on integration of rough sets and fuzzy c-means by Chimphlee, Witcha, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan, Chimphlee, Siriporn

    Published 2005
    “…Fuzzy c-Means allow objects to belong to several clusters simultaneously, with different degrees of membership. …”
    Get full text
    Get full text
    Get full text
    Article