The rapid growth of data in Spatio-temporal datasets collected from several domains such as climate science, Health Science, Sensor networks and telecommunication systems has created a need for Spatio-Temporal clustering methods to extract and analyse the dynamic clusters. Detecting dynamic clusters based on spatial dependence of objects with heterogeneous properties over space and time is a challenging task in clustering spatio temporal datasets. Spatio-Temporal Graph Clustering Algorithm is proposed for detecting communities in Health dataset. The people infected by H1N1 flu virus (Swine Flu) in India is considered as the study area and dataset for the analysis. Mobility of an infected individual in epidemiology plays a key role in modeling of disease spread. The climatic condition of the location is considered as the attributes and mobility rate between the locations are treated as the edge weight. The change in transition of each spatial node is analysed statistically using Local Spatial Autocorrelation test to find the dependency of spatial node dynamically for each time period. Four communities are detected and ranked based on the structural and attribute similarity that is achieved using neighbourhood of the spatial node and similarity score of each node. Performance of the algorithm is validated with the existing algorithm. This study helps the administrative officials to take rapid preventive measures like vaccination strategies to control the spread of disease.
ParimalaM., LopezD. and SenthilkumarN.C., A survey on density based clustering algorithms for mining large spatial databases, International Journal of Advanced Science and Technology31(1) (2011).
2.
JainA.K., MurtyM.N. and FlynnP.J., Data clustering: A review, ACM Computing Surveys (CSUR)31(3) (1999), 264-323.
3.
YangH., ParthasarathyS. and MehtaS., A generalized framework for mining spatio-temporal patterns in scientific data, in: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining (2008), 716-721.
4.
HuangY., ZhangL. and ZhangP., A framework for mining sequential patterns from spatio-temporal event data sets, Knowledge and Data Engineering, IEEE Transactions on20(4) (2008), 433-448.
5.
NewmanM.E.J., The structure and function of complex networks, SIAM Review45 (2003), 167-256.
6.
MalliarosF.D., Michalis vazirgiannis clustering and community detection in directed networks: A survey, Physics Reports533(4) (2013), 95-142.
7.
EnrightA.J., Van DongenS. and OuzounisC.A., An efficient algorithm for large-scale detection of protein families, Nucleic Acids Research30(7) (2002), 1575-1584.
8.
AsurS., UcarD. and ParthasarathyS., An ensemble framework for clustering protein-protein interaction networks, Bioinformatics23 (2007), 129-140.
9.
HandlJ., KnowlesJ. and KellD.B., Computational cluster validation in post-genomic data analysis, Bioinformatics21(15) (2005), 3201-3212.
10.
ZhaoP., ZhangC.-Q., WanD. and ZhangX., A multidimensional and multimembership clustering method for social networks and its application in customer relationship management, Mathematical Problems in Engineering (2013), http://dx.doi.org/101155/2013/323750.
11.
ZagerL.A. and VergheseG.C., Graph similarity scoring and matching, Applied Mathematics Letters21 (2008), 86-94.
12.
NawazW., LeeY.-K. and LeeS., Collaborative similarity measure for intra graph clustering, DASFAA Workshops, LNCS 7240 (2012), 204-215.
13.
SardanaD. and BhatnagarR., Graph clustering using mutual K-nearest neighbours, in: Active Media Technology, Springer International Publishing, (2014), 35-48.
14.
GalluccioL., MichelO., ComonP. and HeroA.O., Graph based k-means clustering, Signal Processing92(9) (2012), 1970-1984.
15.
RuanY., FuhryD. and ParthasarathyS., Efficient community detection in large networks using content and links, in: Proceedings of the 22nd International Conference on World Wide Web (2013), 1089-1098.
16.
ChengH., ZhouY. and YuJ.X., Clustering large attributed graphs: A balance between structural and attribute similarities, ACM Transactions on Knowledge Discovery From Data (TKDD)5(2) (2011), 12.
17.
XuX., YurukN., FengZ. and SchweigerT.A., Scan: A structural clustering algorithm for networks, in: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2007), 824-833.
18.
FortunatoS., Community detection in graphs, Physics Reports486(3) (2010), 75-174.
19.
AggarwalC.C. and WangH., A survey of clustering algorithms for graph data, in: Managing and Mining Graph Data, Springer US, (2010), 275-301,
20.
BlondelV.D., GajardoA., HeymansM., SenellartP. and Van DoorenP., A measure of similarity between graph vertices: Applications to synonym extraction and web searching, SIAM Rev46(4) (2004), 647-666.
21.
van DongenS., A cluster algorithm for graphs technical report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands (2000).
22.
SatuluriV. and ParthasarathyS., Scalable graph clustering using stochastic flows, applications to community discovery, in: Proc 15th ACM SIGKDD Int Knowledge Discovery and Data Mining (2009), 737-746.
23.
WeiY., QiuJ., KarimiH.R. and WangM., Model reduction for continuous-time Markovian jump systems with incomplete statistics of mode information, International Journal of Systems Science45(7) (2014), 1496-1507.
24.
WeiY., QiuJ., KarimiH.R. and WangM., Filtering design for two-dimensional Markovian jump systems with state-delays and deficient mode information, Information Sciences269 (2014), 316-331.
25.
QiuJ., WeiY. and KarimiH.R., New approach to delay-dependent H_∞ control for continuous-time Markovian jump systems with time-varying delay and deficient transition descriptions, Journal of the Franklin Institute352(1) (2015), 189-215.
26.
BaderG.D. and HogueC.W.V., An automated method for finding molecular complexes in large protein interaction networks, BMC Bioinformatics4(2) (2003).
27.
FräntiP., VirmajokiO. and HautamäkiV., Fast PNN-based clustering using K-nearest neighbour graph, Proceedings of the Third IEEE International Conference on Data Mining (ICDM) (2003), 525-528.
28.
ZhangH. and SunS., A graph clustering algorithm based on shared neighbours and connectivity, 8th International Conference on Computer Science and Education (ICCSE) (2013), 26-28.
29.
BrandesU., DellingD., GaertlerM., GorkeR., HoeferM., NikoloskiZ. and WagnerD., On modularity clustering, IEEE Transactions on Knowledge and Data Engineering20(2) (2008), 72-188.
30.
NewmanM.E.J. and GirvanM., Finding and evaluating community structure in networks, Physics Review69 (2004), 026113.
31.
GeorgeB. and ShekharS., Time-aggregated graphs for modeling spatio-temporal networks, in: Advances in Conceptual Modeling-Theory and Practice, Springer Berlin Heidelberg, (2006), 85-99.
32.
GeorgeB., KangJ.M. and ShekharS., Spatio-temporal sensor graphs (STSG): A data model for the discovery of spatio-temporal patterns, Intell Data Anal13(3) (2009), 457-475.
33.
McGuireM.P., JanejaV.P. and GangopadhyayA., Spatiotemporal neighbourhood discovery for sensor data, in: knowledge Discovery From Sensor Data, Springer Berlin Heidelberg, (2010), 203-225.
34.
KitamotoA., Spatio-temporal data mining for typhoon image collection, Journal of Intelligent Information Systems19(1) (2002), 25-41.
35.
RosswogJ. and GhoseK., Detecting and tracking spatio-temporal clusters with adaptive history filtering, in: Data Mining Workshops, ICDMW'08, IEEE International Conference on (2008), 448-457.
36.
LinF., XieK., SongG. and WuT., A novel spatio-temporal clustering approach by process similarity, Sixth International Conference on Fuzzy Systems and Knowledge Discovery5 (2009), 150-154.
37.
SteinhaeuserK., GangulyA.R. and ChawlaN.V., Multivariate and multiscale dependence in the global climate system revealed through complex networks, Climate Dynamics39(3-4) (2012), 889-895.
38.
LiL., DingS.X., QiuJ., YangY. and ZhangY., Weighted fuzzy observer-based fault detection approach for discrete-time nonlinear systems via piecewise - fuzzy lyapunov functions, IEEE Transactions on Fuzzy Systems, Doi: 10.1109/TFUZZ.2016.2514371.
39.
McGuireM.P., JanejaV.P. and GangopadhyayA., Mining trajectories of moving dynamic spatio-temporal regions in sensor datasets, Data Mining Knowledge Discovery28 (2014), 961-1003.
40.
MoranP.A., The interpretation of statistical maps, Journal of the Royal Statistical Society, Series B (Methodological)10(2) (1948), 243-251.
41.
GearyR.C., The contiguity ratio and statistical mapping, The Incorporated Statistician (1954), 115-146.
42.
AnselinL., Local indicators of spatial association-LISA, Geographical Analysis27(2) (1995), 93-115.
43.
JanejaV.P. and AtluriV., Random walks to identify anomalous free-form spatial scan windows, Knowledge and Data Engineering, IEEE Transactions on20(10) (2008), 1378-1392.
44.
ParimalaM. and LopezD., A novel graph clustering algorithm based on structural attribute neighborhood similarity (SANS), in: Proceedings of 3rd International Conference on Advanced Computing, Networking and Informatics, Springer India, (2016), 467-474.
45.
IzakianH., PedryczW. and JamalI., Clustering spatiotemporal data: An augmented fuzzy c-means, Fuzzy Systems, IEEE Transactions on21(5) (2013), 855-868.
46.
BirantD. and KutA., ST-DBSCAN: An algorithm for clustering spatial - temporal data, Data and Knowledge Engineering60(1) (2007), 208-221.
47.
NewmanM.E.J. and GirvanM., Finding and evaluating community structure in networks, Physics Review69 (2004), 026113.
48.
ShiokawaH., FujiwaraY. and OnizukaM., Fast algorithm for modularity-based graph clustering, in: AAAI (Jul 2013).
49.
HuangA., Similarity measures for text document clustering, in: Proceedings of the Sixth New Zealand Computer Science Research Student Conference (NZCSRSC2008), ChriSThurch, New Zealand, (Apr 2008), 49-56.
50.
ParimalaM. and LopezD., K-neighbourhood structural similarity approach for spatial clustering, Indian Journal of Science and Technology8(23) (2015), 1-11.
