Search Results - (( developing representation clustering algorithm ) OR ( java implication tree algorithm ))

  • Showing 1 - 8 results of 8
Refine Results
  1. 1
  2. 2

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…To address the noise problem in multi-view data, this study enhances the gbs method and develops a new self-weighted graph multi-view clustering algorithm (swmcan). …”
    Get full text
    Get full text
    Thesis
  3. 3

    Optimized feature construction methods for data summarizations of relational data by Sze, Florence Sia Fui

    Published 2014
    “…DARA transforms the data relational representation into a vector space representation and a clustering process is applied to group the data based on their characteristics similarity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning by Safa, Soodabeh

    Published 2016
    “…Beside that, classic bag of visual words algorithm (BoVW) is based on kmeans clustering and every SIFT feature belongs to one cluster and it leads to decreasing classification results. …”
    Get full text
    Get full text
    Thesis
  5. 5

    k-nearest neighbour using ensemble clustering based on feature selection approach to learning relational data by Alfred, Rayner, Shin, Kung Ke, Sainin, Mohd Shamrie, On, Chin Kim, Pandiyan, Paulraj Murugesa, Ag Ibrahim, Ag Asri

    Published 2016
    “…However, DARA suffers a major drawback when the cardinalities of attributes are very high because the size of the vector space representation depends on the number of unique values that exist for all attributes in the dataset.A feature selection process can be introduced to overcome this problem.These selected features can be further optimized to achieve a good classification result.Several clustering runs can be performed for different values of k to yield an ensemble of clustering results. …”
    Get full text
    Get full text
    Book Section
  6. 6

    A Social- And Knowledge-Based Coalition Formation Using Modified Combinatorial Particle Swarm Optimization by Kassim, Azleena Mohd

    Published 2017
    “…The related sub-objectives are: 1) to define coalition and social factors to form a coalition formation model, 2) to develop a knowledge representation scheme to store knowledge of formed coalitions, and 3) to develop an effective algorithm to optimize the coalition which can also be treated as a clustering problem. …”
    Get full text
    Get full text
    Thesis
  7. 7

    A Multi-Criteria Decision-Making Approach for Targeted Distribution of Smart Indonesia Card (KIP) Scholarships by Komang, Aryasa

    Published 2025
    “…Sensitivity analysis showed that Hybrid+VIKOR had the lowest change (1.20%) compared to AHP+VIKOR (5.06%) and Entropy+VIKOR (53.71%), confirming its superior stability against weight variations. In the clustering stage, the combination of PCA+KMedoids with two initial medoids produced stable clusters in all iterations, suggesting that K-Medoids provided a better representation of data variation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Unsupervised classification of multi-class chart images: A comparison of customized CNNs and transfer learning techniques by Hassan Zaidi, Syed Muhammad, Jamil Alsayaydeh, Jamil Abedalrahim, Khan, Abdul Hafeez, Khan, Abdullah Ayub, AlZubi, Ahmad Ali, Ogunshola, Benny, Herawan, Safarudin Gazali

    Published 2025
    “…To achieve this, a pre-trained Visual Geometry Group 16 (VGG16) model is employed for feature extraction, followed by principal component analysis (PCA) for dimensionality reduction. The k-means clustering algorithm is then applied to group visually similar chart images. …”
    Get full text
    Get full text
    Get full text
    Article