Article Fingerprint
ReserarchID
CSTSDE6DVPK
Spatial data mining techniques and for the most part conveyed clustering are broadly utilized as a part of the most recent decade since they manage huge and differing datasets which can’t be assembled midway. Current disseminated clustering approaches are typically producing universal models by amassing neighborhood outcomes that are acquired on every region. While this approach mines the data collections on their areas the accumulation stage is more perplexing, which may deliver inaccurate, and equivocal all universal clusters and in this manner mistaken learning. In this paper we propose an Extended Linked clustering approach for each huge spatial data collections that are assorted and appropriated. The approach in view of K-means algorithm yet it produces the quantity of all universal clusters progressively. In addition this approach utilizes an explained collection stage. The conglomerations stage is outlined in such way that the general procedure is proficient in time and memory assignment .Preliminary outcomes demonstrate that the proposed approach delivers excellent outcomes and scales up well. We likewise contrasted it with two prominent clustering algorithms and demonstrate that this approach is substantially more proficient.
K Lakshmaiah. 2018. \u201cAn Extended Linked Clustering Algorithms for Spatial Data Sets\u201d. Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 18 (GJCST Volume 18 Issue C3): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
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.
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.
Total Score: 102
Country: India
Subject: Global Journal of Computer Science and Technology - C: Software & Data Engineering
Authors: K Lakshmaiah ,Research Scholar. (PhD/Dr. count: 0)
View Count (all-time): 274
Total Views (Real + Logic): 5959
Total Downloads (simulated): 1508
Publish Date: 2018 07, Fri
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
Spatial data mining techniques and for the most part conveyed clustering are broadly utilized as a part of the most recent decade since they manage huge and differing datasets which can’t be assembled midway. Current disseminated clustering approaches are typically producing universal models by amassing neighborhood outcomes that are acquired on every region. While this approach mines the data collections on their areas the accumulation stage is more perplexing, which may deliver inaccurate, and equivocal all universal clusters and in this manner mistaken learning. In this paper we propose an Extended Linked clustering approach for each huge spatial data collections that are assorted and appropriated. The approach in view of K-means algorithm yet it produces the quantity of all universal clusters progressively. In addition this approach utilizes an explained collection stage. The conglomerations stage is outlined in such way that the general procedure is proficient in time and memory assignment .Preliminary outcomes demonstrate that the proposed approach delivers excellent outcomes and scales up well. We likewise contrasted it with two prominent clustering algorithms and demonstrate that this approach is substantially more proficient.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.