Výsledky vyhledávání - "partitional clustering algorithm"
-
1
Fast and stable clustering analysis based on Grid-mapping K-means algorithm and new clustering validity index
ISSN: 0925-2312, 1872-8286Vydáno: Elsevier B.V 21.10.2019Vydáno v Neurocomputing (Amsterdam) (21.10.2019)“…•Proposes the Grid-K-means clustering algorithm.•Designs a new clustering validity index (BCVI).•Shortens the length of interval of K in finding the Kopt. As a…”
Získat plný text
Journal Article -
2
A New Fuzzy Clustering Validity Index With a Median Factor for Centroid-Based Clustering
ISSN: 1063-6706, 1941-0034Vydáno: IEEE 01.06.2015Vydáno v IEEE transactions on fuzzy systems (01.06.2015)“…Determining the number of clusters, which is usually approved by domain experts or evaluated by clustering validity indexes, is an important issue in…”
Získat plný text
Journal Article -
3
Improving the Initial Centroids of k-means Clustering Algorithm to Generalize its Applicability
ISSN: 2250-2106, 2250-2114Vydáno: India Springer India 01.12.2014Vydáno v Journal of the Institution of Engineers (India). Series B, Electrical Engineering, Electronics and telecommunication engineering, Computer engineering (01.12.2014)“…k-means is one of the most widely used partition based clustering algorithm. But the initial centroids generated randomly by the k-means algorithm cause the…”
Získat plný text
Journal Article -
4
An Optimal and Stable Algorithm for Clustering Numerical Data
ISSN: 1999-4893, 1999-4893Vydáno: Basel MDPI AG 01.07.2021Vydáno v Algorithms (01.07.2021)“…In the conventional k-means framework, seeding is the first step toward optimization before the objects are clustered. In random seeding, two main issues…”
Získat plný text
Journal Article -
5
Effective and Optimal Clustering Based on New Clustering Validity Index
Vydáno: IEEE 01.05.2018Vydáno v 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design ((CSCWD)) (01.05.2018)“…As an important tool, clustering validity index (CVI) is usually used to evaluate the validity of the clustering results and determine the optimal clustering…”
Získat plný text
Konferenční příspěvek -
6
A New Approach to Define the Number of Clusters for Partitional Clustering Algorithms
ISSN: 2821-0131Vydáno: Islamic Azad University, Bandar Abbas Branch 01.05.2024Vydáno v Transactions on fuzzy sets and systems (01.05.2024)“…Data clustering consists of grouping similar objects according to some characteristic. In the literature, there are several clustering algorithms, among…”
Získat plný text
Journal Article -
7
EXTENSIONS TO THE K-AMH ALGORITHM FOR NUMERICAL CLUSTERING
ISSN: 1675-414X, 2180-3862Vydáno: 01.10.2018Vydáno v Journal of ICT (01.10.2018)Získat plný text
Journal Article -
8
Geometric double-entity model for recognizing far-near relations of clusters
ISSN: 1674-733X, 1869-1919Vydáno: Heidelberg SP Science China Press 01.10.2011Vydáno v Science China. Information sciences (01.10.2011)“…When solving many practical problems, we not only need sample labels given by a clustering algorithm, but also rely on the recognition of far-near relations of…”
Získat plný text
Journal Article -
9
Color image segmentation by partitional clustering algorithms
ISBN: 9781424452255, 1424452252ISSN: 1553-572XVydáno: IEEE 01.11.2010Vydáno v IECON 2010 - 36th Annual Conference on IEEE Industrial Electronics Society (01.11.2010)“…This paper presents the results of some partitional clustering algorithms applied to the segmentation of color images in the RGB space. As more information is…”
Získat plný text
Konferenční příspěvek

