CFP last date
20 January 2025
Reseach Article

Application of Spatial Data mining for Agriculture

by D.Rajesh
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 15 - Number 2
Year of Publication: 2011
Authors: D.Rajesh
10.5120/1922-2566

D.Rajesh . Application of Spatial Data mining for Agriculture. International Journal of Computer Applications. 15, 2 ( February 2011), 7-9. DOI=10.5120/1922-2566

@article{ 10.5120/1922-2566,
author = { D.Rajesh },
title = { Application of Spatial Data mining for Agriculture },
journal = { International Journal of Computer Applications },
issue_date = { February 2011 },
volume = { 15 },
number = { 2 },
month = { February },
year = { 2011 },
issn = { 0975-8887 },
pages = { 7-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume15/number2/1922-2566/ },
doi = { 10.5120/1922-2566 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:03:40.688440+05:30
%A D.Rajesh
%T Application of Spatial Data mining for Agriculture
%J International Journal of Computer Applications
%@ 0975-8887
%V 15
%N 2
%P 7-9
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The research of spatial data is in its infancy stage and there is a need for an accurate method for rule mining. Association rule mining searches for interesting relationships among items in a given data set. This paper enables us to extract pattern from spatial database using k-means algorithm which refers to patterns not explicitly stored in spatial databases. Since spatial association mining needs to evaluate multiple spatial relationships among a large number of spatial objects, the process could be quite costly. An interesting mining optimization method called progressive refinement can be adopted in spatial association analysis. The method first mines large data sets roughly using a fast algorithm and then improves the quality of mining in a pruned data set. The k-means algorithm randomly selects k number of objects, each of which initially represents a cluster mean or center. For each of the remaining objects, an object is assigned to the cluster to which it is most similar, based on the distance between the object and the cluster mean. Then it computes new mean for each cluster. This process iterates until the criterion function converges. The above concept is applied in the area of agriculture where giving the temperature and the rainfall as the initial spatial data and then by analyzing the agricultural meteorology for the enhancement of crop yields and also reduce the crop losses.

References
  1. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li,. “New algorithms for fast discovery of association rules”, Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, page283, 1997.
  2. Jiawei Han, Member and Yongjian Fu, Member, “Mining Multiple-Level Association Rules in Large Databases” , ieee transactions on knowledge and data engineering, vol 11, no.5, September/October, 2000.
  3. Sam Y. Sung, Member, IEEE Computer Society, Zhao Li, Chew L. Tan, and Peter A. Ng, “Forecasting Association Rules Using Existing Data Sets”, ieee transactions on knowledge and data engineering, vol 15, no.6, November/December 2003.
  4. Chi-Farn Chen; Ching-Yueh Chang; Jiun-Bin Chen “Spatiial knowledge discovery using spatial datamining method”,Geoscience and Remote Sensing Symposium, ieee International Volume 8, Issue 25, Page(s): 5602 - 5605 July 2005
  5. Eun-Jeong Son, In-Soo Kang, Tae-Wan Kim, Ki-Joune Li, “A Spatial Data Mining Method by Clustering Analysis”, Proceedings of the 6th International Symposium on Advances in Geographic Information Systems, 1998.
Index Terms

Computer Science
Information Sciences

Keywords

Spatial Mining K-means agriculture