Results 231 to 240 of about 942,452 (277)
Efficient Image Retrieval Using Hierarchical K-Means Clustering. [PDF]
Park D, Hwang Y.
europepmc +1 more source
K-Means Clustering of Hyperpolarised 13C-MRI Identifies Intratumoral Perfusion/Metabolism Mismatch in Renal Cell Carcinoma as the Best Predictor of the Highest Grade. [PDF]
Horvat-Menih I +14 more
europepmc +1 more source
K-Means Clustering Reveals Long-Term Thyrotropin Receptor Antibody Patterns in Graves' Disease: Insights from a 10-Year Study with Implications for Graves' Orbitopathy. [PDF]
Park J +5 more
europepmc +1 more source
Research on Using K-Means Clustering to Explore High-Risk Products with Ethylene Oxide Residues and Their Manufacturers in Taiwan. [PDF]
Wu LY +5 more
europepmc +1 more source
A method for mining condition-specific co-expressed genes in Camellia sinensis based on k-means clustering. [PDF]
Zheng X, Lim PK, Mutwil M, Wang Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2011 IEEE 11th International Conference on Data Mining Workshops, 2011
The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered ...
Giuseppe Di Fatta +3 more
openaire +2 more sources
The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered ...
Giuseppe Di Fatta +3 more
openaire +2 more sources
Behavior Research Methods, 2013
To achieve an insightful clustering of multivariate data, we propose subspace K-means. Its central idea is to model the centroids and cluster residuals in reduced spaces, which allows for dealing with a wide range of cluster types and yields rich interpretations of the clusters. We review the existing related clustering methods, including deterministic,
Timmerman, Marieke E. +3 more
openaire +2 more sources
To achieve an insightful clustering of multivariate data, we propose subspace K-means. Its central idea is to model the centroids and cluster residuals in reduced spaces, which allows for dealing with a wide range of cluster types and yields rich interpretations of the clusters. We review the existing related clustering methods, including deterministic,
Timmerman, Marieke E. +3 more
openaire +2 more sources
K-means clustering with manifold
2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery, 2010K-means clustering is a popular conventional clustering algorithm. As it does not use the structure information of data sets, sometime the clustering result will be dissatisfied. Manifold learning algorithms can reveal the low-dimensional geometry structure of the data sets.
Lai Wei, Weiming Zeng, Hong Wang
openaire +1 more source

