Results 311 to 320 of about 30,970,765 (331)
Some of the next articles are maybe not open access.
Computational Statistics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bottazzi Schenone, Mariaelena +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bottazzi Schenone, Mariaelena +2 more
openaire +3 more sources
An Effective and Adaptable K-means Algorithm for Big Data Cluster Analysis
Pattern Recognition, 2023Hai-Ze Hu +3 more
semanticscholar +1 more source
Data clustering: 50 years beyond K-means
Pattern Recognition Letters, 2008Anil K. Jain
semanticscholar +1 more source
-Means: A new generalized k-means clustering algorithm
Pattern Recognition Letters, 2003Summary: This paper presents a generalized version of the conventional \(k\)-means clustering algorithm. Not only is this new one applicable to ellipse-shaped data clusters without dead-unit problem, but also performs correct clustering without pre-assigning the exact cluster number.
openaire +1 more source
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002T. Kanungo +5 more
semanticscholar +1 more source
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Data mining and knowledge discovery, 1998Zhe-Xue Huang
semanticscholar +1 more source
Spherical k-Means++ Clustering
2015k-means clustering (KM) algorithm, also called hard c-means clustering (HCM) algorithm, is a very powerful clustering algorithm [1, 2], but it has a serious problem of strong initial value dependence. To decrease the dependence, Arthur and Vassilvitskii proposed an algorithm of k-means++ clustering (KM++) algorithm on 2007 [3].
Yasunori Endo, Sadaaki Miyamoto
openaire +2 more sources
Genetic algorithm to optimize the SVM and K-means algorithms for mapping of mineral prospectivity
Neural computing & applications (Print), 2022R. Ghezelbash +4 more
semanticscholar +1 more source

