Keywords
|
| GIS, Spatial co-location, plant prediction, iteration less k-means |
INTRODUCTION
|
| Data mining has wide applications in areas like medical, statistical, satellite and other related databases. In recent times, mining of geographical information from spatial databases for extraction of useful patterns has been an area of keen consideration for researchers. Hence, Data mining methods are applied to the spatial related data leads to the development of many spatial analysis and spatial feature prediction applications. We propose a plant predictions system which suggests the best possible location [1] for a plant to survive and the plant species which are having the highest probability of existing with the concerned plant species. |
| Merging of Geographical Information System attributes with the data mining technologies created new advancement in the agricultural researches. [2]Processing of agricultural datasets with the GIS system and advanced clustering methods of data mining has led to new ideas in prediction system. Many data clustering algorithm have been developed in the field of data mining. In recent time like DBSCAN, K-Median and K- Medoid algorithms and other variants are popularly used. In our proposed approach we have used theK-Means algorithm in a modified way to cluster the location information from GIS and the plant species information from a database. |
| Traditional methods involve clustering of data items that have closely related attributes to the concerned data item into the prescribed cluster size and prediction of higher probable items within the threshold level.i.e., for a given plant species, clustering is done completely at both location dataset and the plant dataset to find its cluster of groups[1]. This method consumes more time when the database grows large and time needed to produce cluster become high. Our approach involves Land suitability measures to categorize the location into three types and also categorize the plant species by nature of growth area into the same three types of categories. Prediction is done with reference to those three types of clusters. K-means algorithm is used for the clustering process of the location datasets and the plant species datasets initially. A combined algorithm is used to mine the closely related data items in the prediction phase where the possible co-locations and the possible plant species are mined. Experimental results confirm the increased efficiency in the computation time of clustering and the increased accuracy in the predicted data items. Computation time efficiency is achieved as during the dynamic update of database, prediction process is limited to the clustered datasets rather than the complete dataset. |
| Section II of this paper describes the problem definition. Section III presents the related works of the paper. Section IV explains the proposed technique and its methods. Results and performance analysis is discussed in section V.Section VI shows the output screen shots of the proposed prediction system and conclusion is summarized as section VII. |
PROBLEM DEFINITION
|
| Prediction of co-existence of plant species in spatially located areas seems to be a vital measure for the agricultural researchers [3]. The common problem that is associated with the traditional prediction system of any database is the time efficiency of computation. Likewise, in plant database time taken for clustering increases along with the growth of the database by the addition of newer plant species causes the whole clustering process to be recomputed. Thus minimising the computation of the co-location areas and the [1] prediction of the plant species must be taken into account for efficient computations in larger databases. Design of such system should ensure that it should be able to overcome these problems. |
RELATED WORKS
|
| Recent papers of many researchers presents various works regarding the clustering process. Some of the significant clustering procedures are highlighted in this section. |
| Land Suitability Evaluation Method Based on GIS Technology Liquan Qu1,2, Yuanzheng Shao2, Lianpeng Zhang1 [2].The paper shows the method of land suitability evaluation based on GIS technology. This paper studies the method of examining the evaluation results and improving its application value. The important facts that are discusssd in this paper are the Collection and collation of basic data in research area. To improve the evaluation results while evaluating the application value, it is necessary to mine spatial data with reference to the evaluation results and other materials. In order to achieve that they get some thematic maps for their computation such as arable land potential area, and returning many types of land to their respective areas according to their suitability.GIS plays an important role in this process. These evaluation results can be used to provide land planning without any further modification. |
| CHEN Guang-xue, LI Xiao-zhou ,LI Xiao-zhou[14] they have studied clustering algorithms of area geographical entities based on geometric shape similarity. They have presented three important facts that is to be considered. Firstly, a similarity criterion of line segments shape. Secondly,a criterion of area geographical entities comprehensively utilizing distance and finally, geometric shape similarity. For clustering analysis of spatial area and geographical locations. Clustering algorithms which is based on these requirements are found to be more efficient |
| R. Agarwal and R. Srikant explains that approaches that are based on the apriori framework apply three steps to discover co-location patterns [3]. The first step of their method was to generate candidate patterns. The second step was to determine instances of candidate patterns, and then finally the last step is to calculate the prevalence of each pattern. The major differences betweenresearches in this aspect are the algorithms that they used to generate instances of patterns and also the method they used to measure the prevalence (as an interestingness measure) of patterns. |
PROPOSED SYSTEM
|
The Input Section
|
| Input consists of the databases. There are two databases used in the system. Location database which comprised of the data about the various spatial locations. [2]GIS(Geographical Information System) measures each geographical area by means of various attributes the major characteristic attributes include latitude and longitude of location, prevailing temperature, rainfall, soil type, soil fertility, ground water level, and pH value of the soil. |
GIS Categorization
|
| Survey of statistical and climatic features in a particular land constitutes the GIS attributes of the concerned land. With reference to these attributes the land locations are categorized into the following three types namely, dry region, plain region and Mountain region [2].Thus every particular location is characterised by itsspatio-regional characteristics. The range of the attributes falling in this region are summarised in a table as follows. The same criteria can be inversely applied to the plant input which results in categorising the plant species by means of determining which type of area will suit for the existence of the plant species |
Algorithm-Initial Clustering
|
| Iteration less K-means algorithm is used in the initial clustering of the land and plant databases. Traditional KMeans involves the idea of assigning the mean values as the number of clusters to be created. Repeated iterations are done and each time the mean value gets updated to the centre of the cluster and algorithm iterates itself till it gets the optimal cluster of datasets and there is no more possibility of assigning new cluster centres. In our case the mean values will be the values of the point of convergence of the three types of locations that is characterised by the various GIS attributes[3] that stated before and there will not be any repeated iterations and updating the mean values. |
| Input: D-Set of data items, |
| {F}Set of Spatial feature(attribute) |
| Min_t-minimum threshold(Colocation size), |
| Output:CAT-Initial Spatial Cluster(Identified inner cluster by iteration-less k-means algorithm) |
| Steps |
| While (i) |
| Foreach item i€ D, and i≠last |
| Do |
| For Spatial feature Fxin {F} |
| Clust[i]=Iteration-less_k-means(Fx(i)) |
| Add next iteration value to the array |
| WhileFx≠last |
| Endforeach |
| CAT=Mine frequent_item inset{clust[]} |
| Add ithdata item to the cluster CAT |
| End while |
| Assigning a data item to a cluster involves determining the distance between the data item and the cluster centres and grouping it with the nearest cluster centre. The distance is calculated using the following equation. |
| Where, |
| μi- Cluster centre |
| xj- jth data item of instance x |
| k-no of clusters |
| This algorithm gives the possible categorization of both location and plant species [1] under three categories namely drained, plain areas and hill region. The attributes taken into consideration are the temperature, rainfall, soil type, soil fertility, water level, pH, slope of the area. |
| The above figure shows the snapshot of one of the iteration of the traditional k-means algorithm, where the cluster centre is reassigned at the end of each iteration. As we use a single iteration in k-means algorithm, the cluster centre is fixed for each attribute and the possible clusters at the end of clustering of data items with reference to all attributes will produce a much more accurate cluster as shown below. |
Colocation prediction algorithm
|
| After the clustering process, prediction process starts by examining the input value and comparing the values with the initial clusters and determining the inner cluster. Then the following combinatorial spatial co-location algorithm is used to mine the possible co-location |
| Input: I- Input data type to prediction algorithm, |
| {F}Set of Spatial feature for the data i(attribute) |
| Min_t-minimum threshold(Colocation size), |
| Output: A set of co-locations and a set of possible plant species which suits the plant existence and the co existence of other plant respectively. |
| Steps |
| Read input(i) |
| Do |
| For Every Spatial feature Fxfor i |
| Clust[i]=Assign CAT |
| Add next iteration value to thearray |
| WhileFx≠last |
| Add ithdata item to the cluster CAT which occurs more |
| Foreachitem x in CAT(i) |
| If i is a location |
| {Co-location}= Minenearestneighbourhood(i,min_t) |
| Else if i is a plant species |
| If (prob>min_t) |
| Add plant species to {co-species} |
| Endif |
| End |
| The above algorithm is used to mine the co-locations and the co-existing plant species in a supportive environment. This algorithms efficiency depends upon the initial clustering algorithm, the k-means which is modified to have limited iterative capacity. |
PERFORMANCE AND RESULTS
|
| The proposed iteration less k-means algorithm for clustering the plant and location databases is tested with various datasets for the clustering efficiency. Apart from the prediction algorithm, the modified clustering algorithm itself shows slight improvement in the clustering process. When compared with the traditional k-means algorithm, the proposed algorithm has producedmore desired results. Weka explorer tool is used to analyse the performance of the traditional and the iteration-less k-means algorithm and the results are shown below. |
| Similar run of various datasets proved the efficiency of clustering. The results of various runs of a plant dataset with 567 items and 7 GIS attributes is summarised as follows. |
| These results are achieved under normal system conditions and the standard tool environment for the weka data mining tool. |
CONCLUSION AND FUTURE WORKS
|
| This paper studies the problem of pulling out the co-locations in a spatially uncertain datasets. It takes the plant and the location input as per the GIS measures of land categorisation. Then we use iteration-less k means algorithm to determine the initial clusters of the land and plant species. A combinatorial co-location algorithm is then used to mine the colocations. Experimental results have proved the increased accuracy in prediction and reduced computation overhead due to the reduction in cluster size. As future work in this area, mining of co-location in a efficient way will be researched. It also opens door for the possibility of mining the co-locations in various data models like fuzzy models and colour composition of an image and graphical models. |
| |
Tables at a glance
|
 |
|
|
|
| Table 1 |
Table 2 |
Table 3 |
Table 4 |
|
| |
Figures at a glance
|
 |
 |
 |
 |
 |
| Figure 1 |
Figure 2 |
Figure 3 |
Figure 4 |
Figure 5 |
|
| |
References
|
- Y. Huang, S. Shekhar, and H. Xiong, “Discovering Co-Location Patterns from Spatial Data Sets: A General Approach,” IEEE Trans.BKnowledge and Data Eng., vol. 16, no. 12, pp. 1472-1485, Dec. 2004
- Liquan Qu1,2, Yuanzheng Shao2, Lianpeng Zhang1,” Land Suitability Evaluation Method Based on GIS Technology”
- A. Meenakshi, Dr. V. Mohan,” Localized Matching Model for Plant Prediction Using Incremental Clustering” IEEE- Fourth International Conference on Advanced Computing, ICoAC 2012
- .C.C. Aggarwal and P.S. Yu, “A Survey of Uncertain Data Algorithms and Applications,” IEEE Trans. Knowledge and Data Eng. (TKDE), vol.21, no. 5, pp. 609-623, May 2009.
- T. Bernecker, H-P Kriegel, M. Renz, F. Verhein, and A. Zuefle, “Probabilistic Frequent Itemset Mining in Uncertain Databases,” Proc. 15th ACM SIGKDD Conf. Knowledge Discovery and Data Mining (KDD ’09), pp. 119-127, 2009.
- R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. Int’l Conf. Very Large Data Ba ses (VLDB), pp. 487-499, 1994.
- P. Agrawal, O. Benjelloun, A. Das Sarma, C. Hayworth, S. Nabar, T. Sugihara, and J. Widom, “Trio: A System for Data, Uncertainty, and Lineage,” Proc. Int’l Conf. Very Large Data Bases (VLDB), pp. 1151-1154, 2006.
- M. Ester, H.-P. Kriegel, and J. Sander, “Knowledge Discovery in Spatial Databases,” Proc. 23rd German Conf. Artificial Intelligence (KI ’99), (Invited Paper), vol. 1701, pp. 61-74, 1999.
- Y. Huang, H. Xiong, S. Shekhar, and J. Pei, “Mining Confident Co- Location Rules without a Support Threshold,” Proc. ACM Symp. Applied Computing, pp. 497-501, 2003.
- C.C. Aggarwal et al., “Frequent Pattern Mining with Uncertain Data,” Proc. 15th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining, pp. 29-37, 2009.
- Y. Huang, J. Pei, and H. Xiong, “Mining Co-Location Patterns with Rare Events from Spatial Data Sets,” Geoinformatica, vol. 10, no. 3,pp. 239-260, 2006.
- Jie Wang, Hongpingshu, Guangsong Yan, "Clustering analysis of manipulate errors for railway transport based on DBSCAN", International
- Conference on Computer Science and Service System (CSSS), pp.3080-3082, 2011.
- CHEN Guang-xue, LI Xiao-zhou ,LI Xiao-zhou “Clustering Algorithms for Area Geographical Entities in Spatial Data Mining”2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2010)
|
Menu