Výsledky vyhľadávania - Minimum spanning tree-based clustering algorithms

  1. 1

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

    ISSN: 0925-2312, 1872-8286
    Vydavateľské údaje: Elsevier B.V 10.01.2018
    Vydané v 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…”
    Získať plný text
    Journal Article
  2. 2

    Minimum Spanning Tree Based Clustering Algorithms Autor Grygorash, O., Yan Zhou, Jorgensen, Z.

    ISBN: 0769527280, 9780769527284
    ISSN: 1082-3409
    Vydavateľské údaje: IEEE 01.11.2006
    “… In this paper, we propose two minimum spanning tree based clustering algorithms. The first algorithm produces a k-partition of a set of points for any given k…”
    Získať plný text
    Konferenčný príspevok..
  3. 3

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

    ISSN: 1051-2004, 1095-4333
    Vydavateľské údaje: Elsevier Inc 01.09.2013
    Vydané v 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…”
    Získať plný text
    Journal Article
  4. 4

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

    ISSN: 1041-4347, 1558-2191
    Vydavateľské údaje: New York, NY IEEE 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…”
    Získať plný text
    Journal Article
  5. 5

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

    ISSN: 0010-4825, 1879-0534, 1879-0534
    Vydavateľské údaje: United States Elsevier Ltd 01.04.2016
    Vydané v 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…”
    Získať plný text
    Journal Article
  6. 6

    Minimum spanning treebased cluster analysis: A new algorithm for determining inconsistent edges Autor Şaar, Fadi, Topcu, Ahmet E.

    ISSN: 1532-0626, 1532-0634
    Vydavateľské údaje: Hoboken, USA John Wiley & Sons, Inc 25.04.2022
    Vydané v Concurrency and computation (25.04.2022)
    “…‐based rather than centroid‐based partitioning. Methods related to minimum spanning tree (MST…”
    Získať plný text
    Journal Article
  7. 7

    Graph-based biomedical text summarization: An itemset mining and sentence clustering approach Autor Nasr Azadani, Mozhgan, Ghadiri, Nasser, Davoodijam, Ensieh

    ISSN: 1532-0464, 1532-0480, 1532-0480
    Vydavateľské údaje: United States Elsevier Inc 01.08.2018
    Vydané v Journal of biomedical informatics (01.08.2018)
    “…•Frequent itemset mining is combined with graph structure.•Main subtopics are identified using sentence clustering…”
    Získať plný text
    Journal Article
  8. 8

    Minimum spanning tree based clustering for outlier detection Autor Peter, S. John

    ISSN: 0972-0529, 2169-0065
    Vydavateľské údaje: Taylor & Francis Group 01.01.2011
    “… Minimum spanning tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
    Získať plný text
    Journal Article
  9. 9

    An efficient minimum spanning tree based clustering algorithm Autor Jana, P.K., Naik, A.

    ISBN: 1424450519, 9781424450510
    Vydavateľské údaje: IEEE 01.12.2009
    “… In this paper, we present a clustering algorithm that is inspired by minimum spanning tree. To automate and evaluate our algorithm, we incorporate the concept of ratio between the intra-cluster distance…”
    Získať plný text
    Konferenčný príspevok..
  10. 10

    A minimum spanning tree based clustering algorithm for high throughput biological data Autor Pirim, Harun

    ISBN: 1124589023, 9781124589022
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2011
    “…A new minimum spanning tree (MST) based heuristic for clustering biological data is proposed…”
    Získať plný text
    Dissertation
  11. 11

    An improved parallel minimum spanning tree based clustering algorithm for microarrays data analysis Autor Elsayad, D., Khalifa, A., Khalifs, Mohammed Essam, El-Horbaty, El-Saved

    ISBN: 9781467308281, 1467308285
    Vydavateľské údaje: IEEE 01.05.2012
    “… So, parallel algorithms are needed. One of the attempts is a parallel minimum spanning tree (MST)-based clustering technique, called CLUMP, which identifies dense clusters in a noisy background…”
    Získať plný text
    Konferenčný príspevok..
  12. 12

    A fast hybrid clustering technique based on local nearest neighbor using minimum spanning tree Autor Mishra, Gaurav, Mohanty, Sraban Kumar

    ISSN: 0957-4174, 1873-6793
    Vydavateľské údaje: New York Elsevier Ltd 15.10.2019
    Vydané v Expert systems with applications (15.10.2019)
    “…•The computational complexity of the proposed hybrid technique is sub-quadratic.•Minimum spanning tree is used to identify the nearest neighbor of each data points…”
    Získať plný text
    Journal Article
  13. 13

    Meta clusters through minimum spanning tree based clustering for performance analysis of students Autor Karthikeyan, T., Peter, S. John, Chidambaranathan, S.

    ISSN: 0972-0529, 2169-0065
    Vydavateľské údaje: Taylor & Francis Group 01.08.2011
    “… Minimum Spanning Tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
    Získať plný text
    Journal Article
  14. 14

    A novel dynamic minimum spanning tree based clustering method for image mining Autor Peter, S. John

    ISSN: 0972-0529, 2169-0065
    Vydavateľské údaje: Taylor & Francis Group 01.10.2011
    “… We present a novel Minimum Spanning Tree based approach to image segmentation which can be applied to either greyscale or color image…”
    Získať plný text
    Journal Article
  15. 15

    A minimum spanning tree based partitioning and merging technique for clustering heterogeneous data sets Autor Mishra, Gaurav, Mohanty, Sraban Kumar

    ISSN: 0925-9902, 1573-7675
    Vydavateľské údaje: New York Springer US 01.12.2020
    “…Clustering being an unsupervised learning technique, has been used extensively for knowledge discovery due to its less dependency on domain knowledge…”
    Získať plný text
    Journal Article
  16. 16

    Structural similarity clustering for detection of outliers and hubs using minimum spanning tree Autor Peter, S. John

    ISSN: 0972-0529, 2169-0065
    Vydavateľské údaje: Taylor & Francis Group 01.01.2011
    “… A number of clustering algorithms exist that can solve the problem of clustering. Minimum spanning tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
    Získať plný text
    Journal Article
  17. 17

    A Comparative Analysis on Performance of Minimum Spanning Tree and K-Means Clustering Based Vertical Fragmentation Algorithm Autor Dahal, Abhishesh, Joshi, Shashidhar Ram

    Vydavateľské údaje: IEEE 01.11.2019
    “… Two partitioning algorithms namely Minimum Spanning Tree based vertical fragmentation algorithm and K-Means clustering based vertical fragmentation algorithm are employed to generate variety…”
    Získať plný text
    Konferenčný príspevok..
  18. 18

    MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters Autor Şenol, Ali

    ISSN: 0941-0643, 1433-3058
    Vydavateľské údaje: London Springer London 01.06.2023
    Vydané v Neural computing & applications (01.06.2023)
    “… In this study, we proposed a novel clustering algorithm named as MCMSTClustering (Defining Non-Spherical Clusters by using Minimum Spanning Tree over KD-Tree-based Micro-Clusters…”
    Získať plný text
    Journal Article
  19. 19

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

    ISSN: 1687-5265, 1687-5273, 1687-5273
    Vydavateľské údaje: New York Hindawi 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…”
    Získať plný text
    Journal Article
  20. 20

    A scaled-MST-based clustering algorithm and application on image segmentation Autor Li, Jia, Wang, Xiaochun, Wang, Xiali

    ISSN: 0925-9902, 1573-7675
    Vydavateľské údaje: New York Springer US 01.06.2020
    “…Minimum spanning tree (MST)-based clustering is one of the most important clustering techniques in the field of data mining…”
    Získať plný text
    Journal Article