Positive Judgment on Future Prospects". Furthermore, we apply a clusterization with the k-Means algorithm optimized with the Silhouette Coefficient and we find the presence of two clusters in terms
powerful new systems for efficient cancer research. Subsequently the study presents image segmentation algorithms K-means and Q-means and further discusses the need for further research on the combination
Technology Products” and “Human Resources”. Furthermore, we perform a cluster analysis with the k-Means algorithm either with the Silhouette Coefficient and the Elbow Method. We find that the Elbow
organisational innovators", "Linkages". A clustering was then carried out using the unsupervised k-Means algorithm optimized with the Silhouette coefficient which shows the presence of 2 clusters per value
Innovation Index", "Sales Impacts" and "Total Entrepreneurial Activity". Then a clusterization with k-Means algorithm was made with the Elbow method. The results show the presence of 3 clusters
Human Resources” and “Government Procurement of Advanced Technology Products”. We use the k-Means algorithm with either the Silhouette Coefficient and the Elbow Method in a confrontation with the network
Average annual GDP growth” and “Innovation Index”. A clusterization is realized using the k-Means algorithm with a confrontation between the Elbow Method and the Silhouette Coefficient. Subsequently, a Network
commission income. Furthermore, we apply a cluster analysis with the k-Means algorithm, and we find the presence of two clusters. A comparison was then made between eight different machine
selected criteria set. It makes further contributions by implementing a machine learning algorithm (k-means) to cluster the quantitative data built from the assessment. Furthermore, it implements a website that
Marketing or Organizational Innovators”. Secondly, we perform a cluster analysis with the k-Means algorithm optimized with the Silhouette Coefficient and we found the presence of four different clusters. Finally
Marketing or Organizational Innovators”. In adjunct a cluster analysis is performed by using k-Means algorithm optimized with the Silhouette Coefficient and we find the presence of four clusters. Finally
Assets”. In adjunct we perform a cluster analysis with the application of the k-Means algorithm optimized with the Silhouette Coefficient and we found three different clusters. Finally, we confront
large-scale DNA datasets on the DNA clustering application by means of the K-means algorithm. The experimental results showed that the WFV model outperformed the other models in terms
rapid manner by using the Triple Dexel model from STL model, and the K-means algorithm to optimize the calculation time in the simulation of material removal for the prediction
input brain image and the region of interest is identified using kernel k-means algorithm. A support vector machine (SVM) a supervised learning process is used for classification
VARCHA approach. This is a bottom up hierarchical agglomerative approach relies on popular K-MEANS algorithm. A top down method VARCLUS is also used .Choosing right number of cluster
segment optic disc and optic cup using Simple Linear Iterative Clustering (SLIC) algorithm, K-Means clustering for glaucoma detection are proposed in this work. This method of segmentation
concept extraction and concept weight calculation based on the identity and synonymy relations. K-means algorithm is used for clustering the documents depending on the semantic similarity. Experiments are conducted
identify the coding region of a DNA sequence. We propose a distinct K-Means algorithm added with Non Linear Cellular Automata for designing a simple, efficient and produces more accurate
like k-means, Fuzzy c-means, or probabilistic c-means depend on typical approach which is based on the distance majority between each point (pixel) and its mean. Our work ... this paper feature our results have been…
detecting the outliers in data streams. In this research work, two clustering algorithms namely CURE with K-Means and CURE with CLARANS are used for finding the outliers in data ... CURE with CLARANS clustering…
Clustering is also referred to as unsupervised learning or segmentation.In this clustering techniques k-means clustering algorithm is a vital role to group the objects. In this algorithm user
several points in the phase diagram. Methodology & Theoretical Orientation: We propose a K-means clustering unwrapping algorithm for the error reduction. Based on "bad points" to avoid the path integral ... error has…
several points in the phase diagram. Methodology & Theoretical Orientation: We propose a K-means clustering unwrapping algorithm for the error reduction. Based on "bad points" to avoid the path integral ... error has…
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.