A Novel Analysis of Clustering for Minimum Spanning Tree using Divide & Conquer Technique

§ Mallareddy Institute of Engineering and Technology

Send Message

To: Author

A Novel Analysis of Clustering for Minimum Spanning Tree using Divide & Conquer Technique

Article Fingerprint

ReserarchID

CST97MP1

A Novel Analysis of Clustering for Minimum Spanning Tree using Divide & Conquer Technique Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Font Type
Font Size
Font Size
Bedground

Abstract

Because of their capability to distinguish groups with sporadic limits, least spanning treebased grouping calculations have been generally utilized within practice. Be that as it may, in such bunching calculations, the quest for closest neighbour in the development of least spanning trees is the primary wellspring of processing and the standard results take O(N 2) time. In this paper, we exhibit a quick least spanning tree-motivated grouping calculation, which, by utilizing a proficient execution of the cut and the cycle property of the least spanning trees, can have much preferable execution than O(N 2 ).

References

11 Cites in Article
  1. J Lin,D Ye,C Chen,M Gao (2008). Minimum Spanning Tree Based Spatial Outlier Mining and Its Applications.
  2. R Prim (1957). Shortest Connection Networks and Some Generalization.
  3. J (1956). On the shortest spanning subtree of a graph and the traveling salesman problem.
  4. L Caccetta,S Hill (2001). A Branch and Cut Method for the Degree-Constrained Minimum Spanning Tree Problem.
  5. H Gabow,T Spencer,R Tarjan (1986). Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs.
  6. David Karger,Philip Klein,Robert Tarjan (1995). A randomized linear-time algorithm to find minimum spanning trees.
  7. P Fra ¨nti,O Virmajoki,V Hautama (2003). Fast PNN-Based Clustering Using K-Nearest Neighbor Graph.
  8. Amol Ghoting,Srinivasan Parthasarathy,Matthew Otey (2006). Fast mining of distance-based outliers in high-dimensional datasets.
  9. R Duda,P Hart (1973). Pattern Classification and Scene Analysis.
  10. Nirmalya Chowdhury,C Murthy (1997). Minimal spanning tree based clustering technique: Relationship with Bayes Classifier.
  11. A Vathy-Fogarassy,J Kiss,Abonyi (2006). Hybrid Minimal Spanning Tree and Mixture of Gaussians Based Clustering Algorithm.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Velicheti Bharath. 2013. "A Novel Analysis of Clustering for Minimum Spanning Tree using Divide & Conquer Technique". Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 13 (GJCST Volume 13 Issue E14).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-E Classification C.2.4
Version of record

v1.2

Issue date
October 19, 2013

Language
English
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 3.1K
Total Downloads: 194
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

A Novel Analysis of Clustering for Minimum Spanning Tree using Divide & Conquer Technique

Velicheti Bharath
Velicheti Bharath Mallareddy Institute of Engineering and Technology