Clustering trajectory-based objects in spatio networks Online publication date: Sun, 24-Jun-2018
by Midde Ranjit Reddy; K.G. Srinivasa; B. Eswara Reddy
International Journal of Autonomic Computing (IJAC), Vol. 3, No. 1, 2018
Abstract: Clustering is a proficient approach to breaking down and locate the enormous, concealed, obscure and fascinating information in expansive scale dataset, which encourages the fast improvement of information mining innovation in late decades. With the advancement of area-based administration, moving article clustering turns into a blossoming subject in related fields as a key some portion of information mining innovation. It is a moderately new subfield of information mining which increased high notoriety. This paper considers the issue of proficiently keeping up a clustering of an active arrangement of information focuses that move persistently in 2D Euclidean space. This paper recommends an improved k-means (i-kmeans) algorithm which is done in four stages, which uses segmentation cluster as part of improved k-means. To describe the effectiveness of the obtained cluster we use Silhouette Coefficient metric. Experimental results reveal that improved i-kmeans technique gives better results in terms of accuracy and quality than the traditional one.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Autonomic Computing (IJAC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook