Search Results - (( java implication tree algorithm ) OR ( problem representation clustering algorithm ))
Search alternatives:
- representation clustering »
- problem representation »
- java implication »
- implication tree »
- tree algorithm »
-
1
USING LATENT SEMANTIC INDEXING FOR DOCUMENT CLUSTERING
Published 2010“…Based on the new representation, the documents are then subjected to the clustering algorithm itself, which is Fuzzy c-Means algorithm. …”
Get full text
Get full text
Thesis -
2
Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering
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
Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning
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 -
4
k-nearest neighbour using ensemble clustering based on feature selection approach to learning relational data
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 -
5
Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling
Published 2022“…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
A Social- And Knowledge-Based Coalition Formation Using Modified Combinatorial Particle Swarm Optimization
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
The importance of data classification using machine learning methods in microarray data
Published 2021“…One of these challenges involves high dimensional data that are redundant, irrelevant, and noisy. To alleviate this problem, this representation should be simplified. …”
Get full text
Get full text
Get full text
Article -
8
An integrated model of automated elementary programming feedback using assisted and recommendation approach
Published 2017“…The results showed that not only a rank cluster representation was achieved, but the purity value was also increased by 1%. …”
Get full text
Get full text
Get full text
Get full text
Thesis
