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
Population Size", "Private co-funding of Public R&D expenditures". A clustering with k Means algorithm optimized by the Silhouette coefficient was then performed and four clusters were found
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
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
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
make the mining process more efficient. The preprocessed data is clustered using clustering algorithms like K-means to cluster relevant data in database. Maximal Frequent Itemset Algorithm (MAFIA) is used
speed of clustering and accuracy, reducing the computational complexity of the traditional algorithms (K-Means, SOM and HAC). This paper includes Advanced Clustering Algorithm (ACA) and its experimental results through
techniques k-means clustering algorithm is a vital role to group the objects. In this algorithm user can give the number of clusters in priori as k value. The k
splitted into numeric dataset and categorical dataset and clustered using both traditional clustering algorithms (K-Means and K-Modes) and fuzzy clustering algorithms (Fuzzy C-Means and Fuzzy C-Modes
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…
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…
Method, Market Basket Analysis, APRIORI algorithms and randomized algorithms, Decision Tree induction method, K- means clustering algorithms, Drill down analysis. The optimization in data mining techniques helps…
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…
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.