Performanace of Improved Minimum Spanning Tree Based on Clustering Technique

1
Dr. P.Sampurnima
Dr. P.Sampurnima
2
J Srinivas
J Srinivas
3
Harikrishna
Harikrishna
1 Nova College of Engineering for Women/JNTUK

Send Message

To: Author

GJCST Volume 12 Issue C13

Article Fingerprint

ReserarchID

CSTSDEQD53J

Performanace of Improved Minimum Spanning Tree Based on Clustering Technique Banner
  • 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

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

10 Cites in Articles

References

  1. Irit Katriel,Peter Sanders,Jesper Träff (2003). A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.
  2. C Zahn (1971). Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters.
  3. Agnes Vathy-Fogarassy,Attila Kiss,Janos Abonyi (2006). Hybrid Minimal Spanning Tree and Mixture of Gaussians Based Clustering Algorithm.
  4. O Grygorash,Y Zhou,Z Jorgensen (2006). Minimum Spanning Tree-Based Clustering Algorithms.
  5. R Gonzalez,P Wintz (1987). Digital Image Processing.
  6. Y Xu,V Olman,D Xu (2002). Clustering Gene Expression Data Using a Graph-Theoretic Approach: An Application of Minimum Spanning Trees.
  7. J Kleinberg,E Tardos Algorithm Design.
  8. Amol Ghoting,Srinivasan Parthasarathy,Matthew Otey (2006). Fast mining of distance-based outliers in high-dimensional datasets.
  9. Irit Katriel,Peter Sanders,Jesper Träff (2003). A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.
  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.

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

Download Citation

Issue Cover
GJCST Volume 12 Issue C13
Pg. 27- 32
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

September 6, 2012

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 10159
Total Downloads: 2560
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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
J Srinivas
J Srinivas
Harikrishna
Harikrishna

Research Journals