International Journal of Science and Research (IJSR)

ISSN (Online): 2319-7064

Impact Factor (2012): 3.358

Mining Spatial Data & Enhancing Classification

Using Bio - Inspired Approaches
Poonam Kataria1, Navpreet Rupal2
1, 2

Department of CSE, SUSCET, Tangori, Distt. Mohali, Punjab, India

Abstract: Data-Mining (DM) has become one of the most valuable tools for extracting and manipulating data and for establishing
patterns in order to produce useful information for decision-making. It is a generic term that is used to find hidden patterns of
data(tabular, spatial, temporal, spatio-temporal etc.) Spatial data mining is the process of discovering interesting and previously
unknown, but potentially useful patterns from spatial databases Extracting interesting and useful patterns from spatial datasets is more
difficult than extracting the corresponding patterns from traditional numeric and categorical data due to the complexity of spatial data
types, spatial relationship and spatial autocorrelation. Spatial data are the data related to objects that occupy space. A spatial database
stores spatial objects represented by spatial data types and spatial relationship among such objects. Clustering is the process of
partitioning a set of data objects into subsets such that the data elements in a cluster are similar to one another and different from the
element of other cluster The set of cluster resulting from a cluster analysis can be referred to as a clustering. Spatial clustering is a
process of grouping a set of spatial objects into clusters so that objects within a cluster have high similarity in comparison to one
another, but are dissimilar to objects in other clusters. In this paper, enhancement of classification scheme is done using various Honey
bee Optimization and Firefly Optimization. There are number of artificial intelligence techniques which helps in data mining to get the
optimized result of the query. Hybrid of K-Mean & Wards Method, Honeybee Optimization and Firefly Optimization will be compared
on the basis of performance parameters of classification (precision, recall, cohesion, variance, F-Measure, H-Measure) and therefore
enhancement will be done.
Keywords: Spatial Data Mining; Clustering; FFO ; HBO; Hybrid K-Mean; Ward Method.

1. Introduction
Recent development in science and technology has given a
big rise to the data in the data warehouse, so it becomes a
cumbersome task to the information required. To solve this
problem, various data mining techniques has been proposed.
Data mining simply means to extract the data from the
database, but to improve the result of query these data
mining techniques have to be more efficient in order to get
the optimized result of a query. Thus data mining is a
process through which data is discovered with respect to its
pattern and interrelationship because of which it has become
a powerful tool. The process of data mining is shown in the
figure 1

manage large collections of multimedia objects,

including image data, video data, audio data.
c) Web Mining: It is the application of data mining
techniques to discover patterns, structures and
knowledge from web.
d) Spatial data mining: Spatial data mining is the process
of discovering interesting and previously unknown, but
potentially useful patterns from spatial databases [13].
Extracting interesting and useful patterns from spatial
datasets is more difficult than extracting the
corresponding patterns from traditional numeric and
categorical data due to the complexity of spatial data
types, spatial relationship and spatial autocorrelation[24].
Spatial data are the data related to objects that occupy
space. A spatial database stores spatial objects
represented by spatial data types and spatial relationship
among such objects.

2. Proposed Methodology

Figure 1: Process of data mining

The various forms of data mining are as below:a) Spatiotemporal Data Mining: Spatiotemporal data are
data that relate to both space and time. It refers to the
process of discovering patterns and knowledge from
spatiotemporal data.
b) Multimedia Data Mining: It is discovery of interesting
patterns from multimedia databases that store and

Paper ID: OCT14187

As discussed earlier, the development in computer

technology has advanced the generation and consumption of
data in our daily life. As a consequence, challenges such as
growing data in data warehouse, it becomes a cumbersome
task to extract the relevant information and to do so data
mining techniques are used. Data Mining has a become a
powerful tool to extract hidden patterns of data and is
gaining importance as it helps in decision making in all
spheres of life.
There are number of artificial intelligence techniques which
helps in data mining to get the optimized result of the query.
Hybrid of K-Mean & Wards Method, Honeybee
Optimization and Firefly Optimization will be compared on
the basis of performance parameters of classification

Volume 3 Issue 10, October 2014

www.ijsr.net

Licensed Under Creative Commons Attribution CC BY

1473

International Journal of Science and Research (IJSR)

ISSN (Online): 2319-7064
Impact Factor (2012): 3.358

(precision, recall, cohesion, variance, F-Measure, HMeasure) and therefore enhancement will be done. The
objective of the work carried out in this paper can be stated
in following points
To create Hybrid algorithm of K-Mean and Wards
Method
Optimization using Honey-Bee and firefly algorithm
To make enhancement through various performance
parameters for evaluation of classification scheme.

Figure 2: Basic Flow of Work

3. Hybrid Approach Based On K-Mean and

Wards Algorithm
Hybrid approach works as: first we select no. of cluster and
generate K- homogenous cluster. After getting K cluster by
applying k-mean, now find maximum value in the cluster by
taking random threshold value. Check approaching value of
cluster selected is nearby to maximum value or not. Now
make clusters according to nearby value to maximum value
of the cluster. Cluster are allocated within the range of max
and min value of the previous cluster and in the end after
repeating this at Last efficient and optimum cluster obtain.

K-mean and Wards method, Honey Bee optimization and

Firefly Optimization then we compare the results of
clustering and find the best optimization algorithm with high
percentage of accuracy.
4.1 Honey Bee Optimization
The Bees Algorithm is a new population-based search
algorithm, first developed in 2005 by Pham DT and
Karaboga. D independently. The bees algorithm is a
population-based search algorithm The Bees Algorithm is
an optimisation algorithm inspired by the natural foraging
behaviour of honey bees to find the optimal solution [6]. A
honey-bee colony consists of queen(s) (best solution),
drones (incumbent solutions), worker(s) (heuristic), and
broods (trial solutions). A colony of honey bees can extend
itself over long distances in multiple directions (more than
10 km) .Flower patches with plentiful amounts of nectar or
pollen that can be collected with less effort should be visited
by more bees, whereas patches with less nectar or pollen
should receive fewer bees .The bees who return to the hive,
evaluate the different patches depending on certain quality
threshold (measured as a combination of some elements,
such as sugar content). They deposit their nectar or pollen
go to the dance floor to perform a waggle dance. Bees
communicate through this waggle dance which contains the
following information: The direction of flower patches
(angle between the sun and the patch), the distance from the
hive (duration of the dance) and the quality rating (fitness)
(frequency of the dance). This information helps the colony
to send its bees precisely. Follower bees go after the dancer
bee to the patch to gather food efficiently and quickly. The
algorithm requires a number of parameters to be set:
1
2
3
4
5

Number of scout bees n,

Number of sites selected m out of n visited sites,
Number of best sites e out of m selected sites,
Number of bees recruited for best e sites nep or (n2),
Number of bees recruited for the other (m-e) selected
sites which is nsp or (n1),
6 Initial size of patches ngh which includes site and its
neighbourhood and stopping criterion,
7 Number of algorithm steps repetitions imax
4.2 Firefly Optimization
The firefly algorithm (FA) is a metaheuristic algorithm,
inspired by the flashing behaviour of fireflies[30]. The
primary purpose for a firefly's flash is to act as a signal
system to attract other fireflies. Xin-She Yang formulated
this firefly algorithm by assuming:

4. Optimization Based Clustering

This work deals with the implementation of the clustering
by using different optimization algorithms that are Hybrid of

Paper ID: OCT14187

All fireflies are unisexual, so that one firefly will be

attracted to all other fireflies; Attractiveness is proportional
to their brightness, and for any two fireflies, the less bright
one will be attracted by (and thus move to) the brighter one;
however, the brightness can decrease as their distance
increases; If there are no fireflies brighter than a given
firefly, it will move randomly. The brightness should be
associated with the objective function. Firefly algorithm is a
nature-inspired metaheuristic optimization algorithm.
Firefly Algorithm (FA) was first developed by Xin-She
Yang in late 2007 and 2008 at Cambridge University, which

Volume 3 Issue 10, October 2014

www.ijsr.net

Licensed Under Creative Commons Attribution CC BY

1474

International Journal of Science and Research (IJSR)

ISSN (Online): 2319-7064
Impact Factor (2012): 3.358

was based on the flashing patterns and behaviour of fireflies.

In essence, FA uses the following three idealized rules:
Fireflies are unisex so that one firefly will be attracted to
other fireflies regardless of their sex.
The attractiveness is proportional to the brightness, and
they both decrease as their distance increases. Thus for
any two flashing fireflies, the less brighter one will move
towards the brighter one. If there is no brighter one than a
particular firefly, it will move randomly.
The brightness of a firefly is determined by the landscape
of the objective function.

5. Experimental Work

Figure 5: Selecting spatial dataset

iii) On clicking on the button HYBRID K-MEAN AND
WARDS ALGORITHM, a new window will be opened
as shown in Figure 6

The interface used for regionalization of spatial object is

shown in Figure 3 GUI works as follows:
i) The main central GUI is linked to three windows.
a. Select A Dataset
b. Hybrid K-Mean And Wards Algorithm
c. Optimization Techniques
ii) On clicking on the button SELECT DATASET as shown
in Figure 3.2 a new pop-up window will be opened as
shown in Figure 3.3. User can select different spatial
dataset according to the choice.

Figure 6: GUI used for Applying Hybrid K-mean and

Wards Algorithm for Regionalization
iv) First we enter the no. of k-cluster in the box which is in
front of label ENTER THE VALUE OF K as shown in
Figure 7

Figure 3: GUI used for Regionalization based on Hybrid kmean and Wards clustering algorithm using different
optimization techniques
Figure 7: Window for Applying Hybrid K-mean and
Wards Algorithm for Regionalization

Figure 4: GUI used for selecting different spatial dataset

After selecting dataset, the selected dataset is shown in front
of SELECT DATASET Button

Figure 8: Snapshot of window for Entering value of k

cluster
v) User when press the button HYBRID the results after
applying Hybrid K-mean and Wards algorithm for
solving regionalization issue in spatial clustering on
different parameters i.e. Cohesion, Variance, Precision,
Recall, F-measure and H-measure are shown.

Paper ID: OCT14187

Volume 3 Issue 10, October 2014

www.ijsr.net

Licensed Under Creative Commons Attribution CC BY

1475

International Journal of Science and Research (IJSR)

ISSN (Online): 2319-7064
Impact Factor (2012): 3.358

Figure 9: Showing result of hybrid algorithm

After calculating the value for hybrid algorithm, click on
BACK button. When we click on BACK Button ,it shows
main window.

Figure 12: Window of OPTIMIZATION TECHNIQUES

viii)When
we
press
the
button
HONEYBEE
OPTIMIZATION the results for solving regionalization
issue in spatial clustering on different parameters i.e.
Cohesion, Variance, Precision, Recall, F-measure and Hmeasure are shown and also figure of Honeybee
optimization and clusters comes after optimizing data.

Figure 10: GUI for selecting BACK Button

vi)
After applying Hybrid K-mean and Wards
algorithm for solving regionalization problem, now we
apply different optimization techniques on the result of
hybrid algorithm to improve the efficient of clustering
spatial objects in Figure 11

Figure 13: Results of Honeybee Optimization algorithm for

doing Regionalization on different Parameters
viii) When we press the button FIREFLY OPTIMIZATION
the results for solving regionalization issue in spatial
clustering on different parameters i.e. Cohesion,
Variance, Precision, Recall, F-measure and H-measure
are shown and also figure of Honeybee optimization
and clusters comes after optimizing data.

Figure 11: Selecting of OPTIMIZATION TECHNIQUES

Button
vii)
After opening OPTIMIZATION TECHNIQUES
window we have two options to get efficient and
homogenous cluster for Regionalization i.e. using HBO
Algorithm or FIREFLY Algorithm as shown in Figure 12.
When we click on OPTIMIZATION TECHNIQUES the
window shown in the Figure 13 is Open

Figure 14: GUI showing the results of Firefly Optimization

algorithm for doing Regionalization on different Parameter
B. Performance Parameters for Classification
Performance metric measures how well your data mining
algorithm is performing on a given dataset. For example, if
we apply a classification algorithm on a dataset, we first
check to see how many of the data points were classified
correctly. The various parameters taken for performance
evaluation are as follows:

Paper ID: OCT14187

Volume 3 Issue 10, October 2014

www.ijsr.net

Licensed Under Creative Commons Attribution CC BY

1476

International Journal of Science and Research (IJSR)

ISSN (Online): 2319-7064
Impact Factor (2012): 3.358

1) Precision:- It is also known as positive predictive value

which is fraction of retrieved instances that are relevant
2) Recall :- It is defined as a set of relevant documents (e.g.
the list of all documents on the internet that are relevant
for a certain topic)
3) Cohesion:- It measures how closely objects in the same
cluster are related
4) Variance:- Variance measures how distinct or well
separated are clusters from each other

6. Results
Cohesion
The figure 15 indicate that FFO is highly cohesive as
compared to Hybrid K- Means and Honey bee Optimization.
Figure 17: Graph showing values of Precision
Recall
The value of recall in Hybrid K-mean & Ward method is
0.55, in HBO is 0.64 and is high in FFO i.e. 0.73.

Figure 15: Graph showing values of Cohesion

Variance
As per the definition the variance should be close to 0, in
the figure 4.2, FFO has less variance value i.e. 0.41 as
compared to HBO and Hybrid K-means and Ward with
value of 0.51 and 0.66 respectively

Figure 16: Graph showing values of Variance

Precision
The below graph show that Firefly Optimization and Honey
Bee Optimization has high precision value i.e. 0.68 whereas
Hybrid K-means and Ward Method has 0.60.

Paper ID: OCT14187

Figure 18: Graph showing values of Recall

F-Measure
The graph below in figure 19 shows the value of f-measure
obtained using various techniques. In Hybrid K-mean &
Ward method , HBO and FFO the value of F-Measure is
0.57, 0.65 and 0.70 respectively.

Figure 19: Graph showing values of F-Measure

H-Measure
The graph below shows the value of h-measure obtained
using various techniques. In Hybrid K-mean & Ward
method, HBO and FFO the value of F-Measure is 0.57, 0.65
and 0.71 respectively.

Volume 3 Issue 10, October 2014

www.ijsr.net

Licensed Under Creative Commons Attribution CC BY

1477

International Journal of Science and Research (IJSR)

ISSN (Online): 2319-7064
Impact Factor (2012): 3.358

References
[1]

[2]

Figure 20: Graph showing values of h-Measure

[3]

Comparison of Evaluation Parameters

For the purpose of analysis, the comparison of different
parameters such as cohesion, variance, precision, recall, HMeasure and F-Measure on spatial dataset has been
calculated using Hybrid K-Means & Wards Method, HBO
and FFO are tabulated
Table 1: Comparison of Hybrid K-Mean & Wards method,
HBO, FFO on the basis of Evaluation parameters
S.No Parameters Hybrid K-Mean & Honey Bee
Wards method
Optimization
1 Cohesion
0.51
0.55
2 Variance
0.66
0.51
3 Precision
0.60
0.68
4
Recall
0.55
0.64
5 F-Measure
0.573
0.65
6 H-Measure
0.57
0.65

Firefly
optimization
0.62
0.41
0.68
0.73
0.70
0.71

7. Conclusion
The paper presents regionalization based on Hybrid KMeans and Wards Clustering algorithm using different
optimization technique i.e Honey Bee Optimization and
Firefly algorithm. In the paper, three algorithms Hybrid KMean and Wards Method, HBO and FFO are implemented
on a spatial dataset taken from UCI Machine Learning
Repository. Using each algorithm, some performance
parameters such as Cohesion, Variance, Precision, Recall,
F-Measure and H-Measure are calculated. It can be
concluded that, H-Measure, F-Measure, Cohesion, Recall,
Precision on dataset is more in Firefly Algorithm as
compared to HK-Mean ward method and Honey Bee
Optimization, while Variance is less in FFO. As seen in this
paper work, FFO has been implemented successfully over
Hybrid K-Mean& Ward Algorithm and HBO.

[4]

[5]
[6]

[7]
[8]

[9]

[10]

[11]
[12]

8. Future Work
In the present work we have implemented FFO based
classification successfully using spatial data set taken from
UCI Repository of Machine Learning Databases. For future
work, we can combine some other artificial intelligence
algorithm to get more optimized result and can make
enhancement using some other parameters also

[13]
[14]

[15]

Paper ID: OCT14187

Assuno, Renato M., Marcos Corra Neves, Gilberto

Cmara, and Corina da Costa Freitas(2006). "Efficient
regionalization techniques for socioeconomic
geographical units using minimum spanning trees."
International Journal of Geographical Information
Science 20, no. 7 , 797-811.
Berry, Michael J. A.(1997) Data-Mining Techniques
for Marketing, Sales and Customer Support. U.S.A:
John Wiley and Sons.
Cheu, Eng Yeow, Chee Keongg, and Zonglin
Zhou(2004) "On the two-level hybrid clustering
algorithm." in International conference on artificial
intelligence in science and technology, pp. 138-142.
Christina, J., and K. Komathy(2013) "Analysis of hard
clustering algorithms applicable to regionalization."
in Information & Communication Technologies (ICT),
2013 IEEE Conference on, pp. 606-610.." IEEE
Intelligent Systems 11, no. 5 pp. 20-25.
Fayyad, Usama M(1996). "Data mining and
knowledge discovery: Making sense out of geographic
information systems, pp. 35-39. ACM.
Haddad, Omid Bozorg, Abbas Afshar, and Miguel A.
Mario(2006) "Honey-bees mating optimization
(HBMO) algorithm: a new heuristic approach for
water resources optimization." Water Resources
Management 20, no. 5: 661-680.
Jafar, OA Mohamed, and R. Sivakumar. (2013). "A
Comparative Study of Hard and Fuzzy Data
Clustering Algorithms with Cluster Validity Indices."
Kang, In-Soo, Tae-wan Kim, and Ki-Joune Li.(1997)
"A spatial data mining method by Delaunay
triangulation." in Proceedings of the 5th ACM
international workshop on Advances in geographic
information systems, pp. 35-39. ACM.
Kiran, P. Premchand, and T. Venu Gopal. "Mining of
spatial co-location pattern from spatial datasets."
International Journal of Computer Applications 42, no.
21 25-30.
Lan, Rongqin, Wenzhong Shi, Xiaomei Yang, and
Guangyuan
Lin.(2005)"Mining
fuzzy
spatial
configuration rules: methods and applications." in
IPRS Workshop on Service and Application of Spatial
Data Infrastructure, pp. 319-324.
Lee, Sang Jun, and Keng Siau. (2001)"A review of
data mining techniques." Industrial Management &
Data Systems 101, no. 1 41-46.
Li, Sheng-Tun, Shih-Wei Chou, and Jeng-Jong
Pan.(2000) "Multi-resolution spatio-temporal data
mining for the study of air pollutant regionalization."
in System Sciences. Proceedings of the 33rd Annual
Hawaii International Conference on, pp. 7-pp. IEEE.
Lyman, P., and Hal R. Varian(2003), "How much
storage is enough?" Storage, 1:4.
Mennis, Jeremy, and Diansheng Guo(2000). "Spatial
data mining and geographic knowledge discoveryAn
introduction." Computers, Environment and Urban
Systems 33, no. 6 403-408.
Osama Abu Abbas(2008) Comparison between Data
Clustering Algorithm, The International Arab Journal
Of Information Technology, Vol. 3, No. 3.

Volume 3 Issue 10, October 2014

www.ijsr.net

Licensed Under Creative Commons Attribution CC BY

1478

International Journal of Science and Research (IJSR)

ISSN (Online): 2319-7064
Impact Factor (2012): 3.358

[16] Pelczer, Ildiko, Judith Ramos, Ramn Domnguez, and

Fernando Gonzlez(2007)."Establishment of regional
homogeneous zones in a watershed using clustering
algorithms." Harmonizing the Demands of Art and
Nature in Hydraulics, IAHR, Venice .
[17] Pham, D. T., A. Ghanbarzadeh, E. Koc, S. Otri, S.
Rahim, and M. Zaidi.(2006) "The bees algorithm-a
novel tool for complex optimisation problems." in
Proceedings of the 2nd Virtual International
Conference on Intelligent Production Machines and
Systems (IPROMS 2006), pp. 454-459.
[18] Sabar, Nasser R., Masri Ayob, Graham Kendall, and
Rong Qu.(2012) "A honey-bee mating optimization
algorithm for educational timetabling problems."
European Journal of Operational Research 216, no. 3
533-543.
[19] Saini,
Geetinder,
and
Kamaljit
Kaur.
(2014)"Regionalization as spatial data mining
problem based on clustering: review."
[20] Sharma, Lokesh Kumar, Simon Scheider, Willy
Kloesgen, and Om Prakash Vyas.(2008) "Efficient
clustering technique for regionalisation of a spatial
database."International
Journal
of
Business
Intelligence and Data Mining 3, no. 1 66-81.
[21] Shekhar, Shashi, Pusheng Zhang, Yan Huang, and
Ranga Raju Vatsavai.(2003) "Trends in spatial data
mining." Data mining: Next generation challenges and
future directions 357-380.[13]
[22] Shumway, Robert H., and David S. Stoffer.(2010)
Time series analysis and its applications: with R
examples. Springer,[24]
[23] Srinivas, P. V. V. S., Susanta K. Satpathy, Lokesh K.
Sharma,
and
Ajaya
K.
Akasapu.
(2011)"Regionalisation as Spatial Data Mining
Problem: A Comparative Study." Proc. International
Journal of Computer Trends and Technology 18, no. 5:
577-589.
[24] Sumathi, N., R. Geetha, and S. Sathiya Bama.(2014)
"Spatial Data Mining-Techniques Trends and Its
Applications." Journal of Computer Applications 1,
no. 4 28.
[25] Sundararajan, S., and S. Karthikeyan. (2013)"A Study
On Spatial Data Clustering Algorithms In Data
Mining."
[26] Teknomo, Kardi, K-Means Clustering (2000)
http:\\people.revoledu.com\kardi\ tutorial\kMean\
[27] Teodorovi, Duan, and Mauro DellOrco. (2005)"Bee
colony optimizationa cooperative learning approach
to complex transportation problems." in Advanced OR
and AI Methods in Transportation: Proceedings of
16th MiniEURO Conference and 10th Meeting of
EWGT (13-16 September 2005).Poznan: Publishing
House of the Polish Operational and System Research,
pp. 51-60.
[28] Wang, Xin, and Howard Hamilton(2008). "Using
clustering methods in geospatial information systems."
in Geoinformatics and Joint Conference on GIS and
Built environment: Advanced Spatial Data Models and
Analyses, pp. 71461N-71461N.
[29] Xie, Caixiang, Shilin Chen, Fengmei Suo, Dan Yang,
and Chengzhong Sun.(2010) "Regionalization of
Chinese medicinal plants based on spatial data
mining." in Fuzzy Systems and Knowledge Discovery

Paper ID: OCT14187

(FSKD), Seventh International Conference on, vol. 4,

pp. 1647-1651. IEEE, 2010.
[30] Xin Wang, Jing Wang,(2009) Using Clustering
methods in geospatial information systems,
International Society for Optics and Photonics.
[31] Yang, XinShe, and Xingshi He.(2013) "Firefly
algorithm: recent advances and applications."
International Journal of Swarm Intelligence 1, no. 1
36-50.

Volume 3 Issue 10, October 2014

www.ijsr.net

Licensed Under Creative Commons Attribution CC BY

1479