Suchergebnisse - minimum spanning tree algorithm clustering

  1. 1

    Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm, Minimum Spanning Tree, and Hierarchical Clustering in an Applied Study von Doostfatemeh, Marziyeh, Rahimi, Amir, Basirat, Atefeh, Pourahmad, Saeedeh

    ISSN: 1748-670X, 1748-6718, 1748-6718
    Veröffentlicht: Cairo, Egypt Hindawi Publishing Corporation 2020
    “… algorithm, minimum spanning tree, and hierarchical clustering method. Although these three hybrid methods have received more attention in previous researches, fewer studies have compared their results …”
    Volltext
    Journal Article
  2. 2

    Minimum spanning tree hierarchical clustering algorithm: A new Pythagorean fuzzy similarity measure for the analysis of functional brain networks von Habib, Amna, Akram, Muhammad, Kahraman, Cengiz

    ISSN: 0957-4174, 1873-6793
    Veröffentlicht: New York Elsevier Ltd 01.09.2022
    Veröffentlicht in Expert systems with applications (01.09.2022)
    “… Clustering structures are one of the most important aspects of complex networks. Minimum spanning tree (MST …”
    Volltext
    Journal Article
  3. 3

    Fast approximate minimum spanning tree based clustering algorithm von Jothi, R., Mohanty, Sraban Kumar, Ojha, Aparajita

    ISSN: 0925-2312, 1872-8286
    Veröffentlicht: Elsevier B.V 10.01.2018
    Veröffentlicht in Neurocomputing (Amsterdam) (10.01.2018)
    “… out.•Quality of clusters from the approximate MST is maintained. Minimum Spanning Tree (MST) based clustering algorithms have been employed successfully to detect clusters of heterogeneous nature …”
    Volltext
    Journal Article
  4. 4

    A Novel Minimum Spanning Tree Clustering Algorithm Based on Density Core von Gao, Qiang, Gao, Qin-Qin, Xiong, Zhong-Yang, Zhang, Yu-Fang, Zhang, Min

    ISSN: 1687-5265, 1687-5273, 1687-5273
    Veröffentlicht: New York Hindawi 05.10.2022
    Veröffentlicht in Computational intelligence and neuroscience (05.10.2022)
    “… Firstly, we employ the reverse nearest neighbors to extract core objects. Secondly, we use the minimum spanning tree algorithm to cluster the core objects …”
    Volltext
    Journal Article
  5. 5

    A Novel Fuzzy Distance-Based Minimum Spanning Tree Clustering Algorithm for Face Detection von Li, Yang, Zhou, Wenju

    ISSN: 1866-9956, 1866-9964
    Veröffentlicht: New York Springer US 01.07.2022
    Veröffentlicht in Cognitive computation (01.07.2022)
    “… However, the minimum spanning tree has the shortcoming of the distance between neighbours because of which the minimum spanning tree algorithm cannot cluster unbalanced data …”
    Volltext
    Journal Article
  6. 6

    Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm von Kandasamy Ilanthenral

    ISSN: 0334-1860, 2191-026X
    Veröffentlicht: De Gruyter 01.04.2018
    Veröffentlicht in Journal of intelligent systems (01.04.2018)
    “… An important role is played by clustering in several fields of research in the form …”
    Volltext
    Journal Article
  7. 7

    CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers von Huang, Hui, He, Xiaofu, Ma, Yan, Lv, Xiaobo, Yang, Jie

    ISSN: 1024-123X, 1563-5147
    Veröffentlicht: Cairo, Egypt Hindawi Publishing Corporation 01.01.2018
    Veröffentlicht in Mathematical problems in engineering (01.01.2018)
    “… The minimum spanning tree- (MST-) based clustering method can identify clusters of arbitrary shape by removing inconsistent edges …”
    Volltext
    Journal Article
  8. 8

    An Anti-Noise Process Mining Algorithm Based on Minimum Spanning Tree Clustering von Li, Weimin, Zhu, Heng, Liu, Wei, Chen, Dehua, Jiang, Jiulei, Jin, Qun

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 01.01.2018
    Veröffentlicht in IEEE Access (01.01.2018)
    “… The current process mining algorithms are inadequate in dealing with log noise. The family of alpha-algorithms ignores the impact of noise, which is unrealistic in real-life logs …”
    Volltext
    Journal Article
  9. 9

    A Novel Hybrid Clustering Algorithm Based on Minimum Spanning Tree of Natural Core Points von Huang, Jinlong, Xu, Ru, Cheng, Dongdong, Zhang, Sulan, Shang, Keke

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2019
    Veröffentlicht in IEEE access (2019)
    “… It is a great challenge for most existing clustering algorithms to discover clusters with complex manifolds or great density variation …”
    Volltext
    Journal Article
  10. 10

    A Clustering Algorithm Based on Minimum Spanning Tree and Density von Chen, Jiayao, Lu, Jing

    Veröffentlicht: IEEE 01.03.2019
    “… A Minimum spanning tree (MST) clustering algorithm based on density is proposed under the background of no effective support on the dataset with noises …”
    Volltext
    Tagungsbericht
  11. 11

    A Space Efficient Minimum Spanning Tree Approach to the Fuzzy Joint Points Clustering Algorithm von Atilgan, Can, Nasibov, Efendi N.

    ISSN: 1063-6706, 1941-0034
    Veröffentlicht: New York IEEE 01.06.2019
    Veröffentlicht in IEEE transactions on fuzzy systems (01.06.2019)
    “… In this study, a minimum spanning tree based reduced space FJP algorithm is proposed. The computational experiments show that the reduced space algorithm enables the method …”
    Volltext
    Journal Article
  12. 12

    A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem von Zhang, Shufan, Mao, Jianlin, Wang, Niya, Li, Dayan, Ju, Chengan

    ISSN: 1099-4300, 1099-4300
    Veröffentlicht: Switzerland MDPI AG 31.12.2022
    Veröffentlicht in Entropy (Basel, Switzerland) (31.12.2022)
    “… The quadratic minimum spanning tree problem (QMSTP) is a spanning tree optimization problem that considers the interaction cost between pairs of edges arising from a number of practical scenarios …”
    Volltext
    Journal Article
  13. 13

    A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering von Xiaochun Wang, Xiali Wang, Wilkes, D.M.

    ISSN: 1041-4347, 1558-2191
    Veröffentlicht: New York, NY IEEE 01.07.2009
    Veröffentlicht in IEEE transactions on knowledge and data engineering (01.07.2009)
    “… Due to their ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice …”
    Volltext
    Journal Article
  14. 14

    Low-level feature image retrieval using representative images from minimum spanning tree clustering von Khunsongkiet, Piyavach, Bootkrajang, Jakramate, Techawut, Churee

    ISSN: 1380-7501, 1573-7721
    Veröffentlicht: New York Springer US 01.01.2024
    Veröffentlicht in Multimedia tools and applications (01.01.2024)
    “… Nonetheless, comparing images based on those two descriptors is computationally expensive. Therefore, this research proposes a clustering method that dynamically groups database images using the Minimum Spanning Tree Clustering algorithm (MSTC …”
    Volltext
    Journal Article
  15. 15

    Functional grouping of similar genes using eigenanalysis on minimum spanning tree based neighborhood graph von Jothi, R., Mohanty, Sraban Kumar, Ojha, Aparajita

    ISSN: 0010-4825, 1879-0534, 1879-0534
    Veröffentlicht: United States Elsevier Ltd 01.04.2016
    Veröffentlicht in Computers in biology and medicine (01.04.2016)
    “… Minimum Spanning Tree (MST) based clustering algorithms have been successfully employed to detect clusters of varying shapes and sizes …”
    Volltext
    Journal Article
  16. 16

    Density-based O-Means clustering algorithm using minimum spanning tree von Peter, S. John

    ISSN: 0972-0529, 2169-0065
    Veröffentlicht: Taylor & Francis Group 01.08.2012
    “… Minimum Spanning Tree clustering algorithm is capable of detecting clusters with irregular boundaries …”
    Volltext
    Journal Article
  17. 17

    A two-stage minimum spanning tree (MST) based clustering algorithm for 2D deformable registration of time sequenced images von Saha, Baidya Nath, Ray, Nilanjan, McArdle, Sara, Ley, Klaus

    ISSN: 2381-8549
    Veröffentlicht: IEEE 01.09.2017
    “… )-based clustering method for image sequence registration that first constructs a minimum spanning tree for the input image sequence …”
    Volltext
    Tagungsbericht
  18. 18

    Enhancing minimum spanning tree-based clustering by removing density-based outliers von Wang, Xiaochun, Wang, Xia Li, Chen, Cong, Wilkes, D. Mitchell

    ISSN: 1051-2004, 1095-4333
    Veröffentlicht: Elsevier Inc 01.09.2013
    Veröffentlicht in Digital signal processing (01.09.2013)
    “… Traditional minimum spanning tree-based clustering algorithms only make use of information about edges contained in the tree to partition a data set …”
    Volltext
    Journal Article
  19. 19

    Dendrograms, minimum spanning trees and feature selection von Labbé, Martine, Landete, Mercedes, Leal, Marina

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 16.07.2023
    Veröffentlicht in European journal of operational research (16.07.2023)
    “… Dendrograms are graphical representations of hierarchical clustering algorithms that for single linkage clustering can be interpreted as minimum spanning trees in the complete network defined by the database …”
    Volltext
    Journal Article
  20. 20

    Measure of Knowledge in Students at Uniandes, Ecuador, on the Manifestations of Oral Cancer von Lopez, Fanny del Rocio Lozada, Medina, Mary Elena Villacreses, Lascano, Esthela Cleofe Villacis

    ISSN: 2331-6055, 2331-608X
    Veröffentlicht: Neutrosophic Sets and Systems 15.12.2020
    Veröffentlicht in Neutrosophic sets and systems (15.12.2020)
    “… Oral cancer is a disease that deserves as much attention as possible from specialists. It is vitally important that specialists know the manifestations of this …”
    Volltext
    Journal Article