intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Optimal cluster number

Xem 1-12 trên 12 kết quả Optimal cluster number
  • Single-cell RNA sequencing (scRNA-seq) provides new opportunities to characterize cell populations, typically accomplished through some type of clustering analysis. Estimation of the optimal cluster number (K) is a crucial step but often ignored.

    pdf21p viarchimedes 26-01-2022 15 0   Download

  • This paper focuses on the accuracy of forecasting with various numbers of variables to optimize the data held. The initial stage of this research is the division of clusters using the hierarchical clustering method to divide 24 administrative regions into 6 clusters, and to increase the accuracy of forecasting using principal component regression. Based on the results obtained, it can be seen that the MAPE values vary in each cluster.

    pdf6p caygaocaolon11 18-04-2021 12 1   Download

  • Presently, with the increasing number and complexity of available gene expression datasets, the combination of data from multiple microarray studies addressing a similar biological question is gaining importance. The analysis and integration of multiple datasets are expected to yield more reliable and robust results since they are based on a larger number of samples and the effects of the individual study-specific biases are diminished.

    pdf16p vikentucky2711 26-11-2020 19 1   Download

  • Cluster analysis is the most common unsupervised method for finding hidden groups in data. Clustering presents two main challenges: (1) finding the optimal number of clusters, and (2) removing “outliers” among the objects being clustered.

    pdf15p viconnecticut2711 29-10-2020 16 2   Download

  • To ensure cancer patients are stratified towards treatments that are optimally beneficial, it is a priority to define robust molecular subtypes using clustering methods applied to high-dimensional biological data. If each of these methods produces different numbers of clusters for the same data, it is difficult to achieve an optimal solution.

    pdf11p viconnecticut2711 28-10-2020 16 1   Download

  • This paper deals with the problem of grouping a set of objects into clusters. The objective is to minimize the sum of squared distances between objects and centroids. This problem is important because of its applications in different areas. In prior literature on this problem, attributes of objects have often been assumed to be crisp numbers.

    pdf12p toritori 11-05-2020 23 0   Download

  • Character association and path analysis studies were investigated in 2016-2017 and 2017- 2018 in all physical and rhizome characters of ginger to find out the influence of characters among themselves on yield. Characters were investigated according to the DUS descriptors as described by Indian Institute of Spices Research, Kozhikode, Kerala. Number of leaves had the highest positive direct effect (1.759) on yield followed by number of shoots (1.053) and rhizome thickness (0.460).

    pdf11p kethamoi2 15-12-2019 26 1   Download

  • In this study using black hole algorithm (BHA), we determine the number and location of the cluster heads to the best optimization. Fitting the criterion will be based on the minimum consumed energy of each node in the network in every data transmission operation period that will be led to the creation of a balance in energy consumption of cluster heads and consequently longer life of network

    pdf5p byphasse043256 23-03-2019 16 0   Download

  • We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and coherent partition of coreference sets given a number of candidate pairs and their weights delivered by a pairwise classifier (used as reliable clustering seed pairs). In order to find out whether ILP optimization, which is NPcomplete, actually is the best we can do, we compared the first consistent solution generated by our adaptation of an efficient Zero-One algorithm with the optimal solution. ...

    pdf9p bunthai_1 06-05-2013 42 1   Download

  • This paper presents an unsupervised word sense learning algorithm, which induces senses of target word by grouping its occurrences into a “natural” number of clusters based on the similarity of their contexts. For removing noisy words in feature set, feature selection is conducted by optimizing a cluster validation criterion subject to some constraint in an unsupervised manner. Gaussian mixture model and Minimum Description Length criterion are used to estimate cluster structure and cluster number. ...

    pdf8p bunbo_1 17-04-2013 45 1   Download

  • The Greenplum Database parallel query optimizer (Figure 6) is responsible for converting SQL or MapReduce into a physical execution plan. It does this by using a cost-based optimization algorithm to evaluate a vast number of potential plans and select the one that it believes will lead to the most efficient query execution. Unlike a traditional query optimizer, Greenplum’s optimizer takes a global view of execution across the cluster, and factors in the cost of moving data between nodes in any candidate plan.

    pdf12p yasuyidol 02-04-2013 52 3   Download

  • 450 servers cluster witness file shares, 357 clusters, 355 failback, 357 failover, 357 failover clustering, 354-357 generic cluster resources, 357 LUNs (logical unit numbers), 357 nodes, 355 passive nodes, 356 service groups, 356 shared storage, 357 virtual cluster servers, 356 clusters adding storage to, 370-371 failover clusters, 363-382 consolidation, virtualization, 11-12 DHCP (Dynamic Host Configuration Protocol) servers, virtualization, 12 DNS (domain name system) servers, 351 functionality, checking, 187-188 host managers, managing, 206-207 host servers, 151-152 administering, 152-...

    pdf10p yukogaru14 30-11-2010 69 3   Download

CHỦ ĐỀ BẠN MUỐN TÌM

TOP DOWNLOAD
207 tài liệu
1446 lượt tải
ADSENSE

nocache searchPhinxDoc

 

Đồng bộ tài khoản
4=>1