Loading menu…

Performanace of Improved Minimum Spanning Tree Based on Clustering Technique

§ Nova College of Engineering for Women/JNTUK

Send Message

To: Author

Performanace of Improved Minimum Spanning Tree Based on Clustering Technique

Article Fingerprint

ReserarchID

CSTSDEQD53J

Performanace of Improved Minimum Spanning Tree Based on Clustering Technique Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • 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
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Clustering technique is one of the most important and basic tool for data mining. Cluster algorithms have the ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice. In such clustering algorithms, the search for nearest objects in the construction of minimum spanning trees is the main source of computation

References

10 Cites in Article
  1. 1. Irit Katriel,Peter Sanders,Jesper Träff (2003). A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. Lecture Notes in Computer Science, 2832, 679-690.
  2. 2. C Zahn (1971). Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters. IEEE Trans. Computers, 20(1), 68-86.
  3. 3. Agnes Vathy-Fogarassy,Attila Kiss,Janos Abonyi (2006). Hybrid Minimal Spanning Tree and Mixture of Gaussians Based Clustering Algorithm. Lecture Notes in Computer Science, 313-330.
  4. 4. O Grygorash,Y Zhou,Z Jorgensen (2006). Minimum Spanning Tree-Based Clustering Algorithms. Proc. IEEE Int'l Conf. Tools with Artificial Intelligence, 73-81.
  5. 5. R Gonzalez,P Wintz (1987). Digital Image Processing. Digital Image Processing
  6. 6. Y Xu,V Olman,D Xu (2002). Clustering Gene Expression Data Using a Graph-Theoretic Approach: An Application of Minimum Spanning Trees. Bioinformatics, 18(4), 536-545.
  7. 7. J Kleinberg,E Tardos Algorithm Design. Algorithm Design, 142-149.
  8. 8. Amol Ghoting,Srinivasan Parthasarathy,Matthew Otey (2006). Fast mining of distance-based outliers in high-dimensional datasets. Data Mining and Knowledge Discovery, 16(3), 349-364.
  9. 9. Irit Katriel,Peter Sanders,Jesper Träff (2003). A Practical Minimum Spanning Tree Algorithm Using the Cycle Property. Lecture Notes in Computer Science, 2832, 679-690.
  10. 10. Jiaxiang Lin,Dongyi Ye,Chongcheng Chen,Miaoxian Gao (2008). Minimum Spanning Tree Based Spatial Outlier Mining and Its Applications.

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

Dr. P.Sampurnima. 2012. "Performanace of Improved Minimum Spanning Tree Based on Clustering Technique". Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 12 (GJCST Volume 12 Issue C13).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification E.1
Version of record
v1.2

Issue date
September 6, 2012

Language
English
Order Article Reprint
Experience 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: 2.3K
Total Downloads: 168
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.

Performanace of Improved Minimum Spanning Tree Based on Clustering Technique

Dr. P.Sampurnima
Dr. P.Sampurnima Nova College of Engineering for Women/JNTUK