Spatial-temporal analysis on bird habitat discovery in China

Exploring migration patterns through uncovering migratory birds' habitat information is very important in biology, which has scientific significance in animal habitat conservation and avian influenza control. In this paper, we convert the traditional biology problem into a computational study and use data mining techniques to analyze the spatial and temporal distribution of bird-watching data in China. First, we present an improved hierarchical clustering algorithm (IHDBSCAN) to identify the habitats/stopovers of migrant birds. Then, we use a kernel smoothing method to fit the temporal distribution of bird observation in each spatial cluster. A hierarchical cluster tree is generated where the leaf nodes indicate different bird habitats/stopovers. Finally, the results is visualized on the map of China. Experimental results show that the proposed algorithm can effectively find the spatial and temporal distribution of Anseriformes' habitats.

[1]  David M. Aanensen,et al.  EpiCollect: Linking Smartphones to Web Applications for Epidemiology, Ecology and Community Data Collection , 2009, PloS one.

[2]  Jinyan Li,et al.  Discovery of Migration Habitats and Routes of Wild Bird Species by Clustering and Association Analysis , 2009, ADMA.

[3]  Jinyan Li,et al.  Exploring the wild birds’ migration data for the disease spread study of H5N1: a clustering and association approach , 2011, Knowledge and Information Systems.

[4]  Sean Hughes,et al.  Clustering by Fast Search and Find of Density Peaks , 2016 .

[5]  Zhenhui Li.  Spatiotemporal Pattern Mining: Algorithms and Applications , 2014, Frequent Pattern Mining.

[6]  Jiawei Han,et al.  Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[7]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[8]  Yang Liu,et al.  Combining Spatial-Temporal and Phylogenetic Analysis Approaches for Improved Understanding on Global H5N1 Transmission , 2010, PloS one.

[9]  Andrew W. Moore,et al.  Rapid detection of significant spatial clusters , 2004, KDD.

[10]  Desire L. Massart,et al.  Looking for Natural Patterns in Analytical Data, 2. Tracing Local Density with OPTICS , 2002, J. Chem. Inf. Comput. Sci..

[11]  Sudipto Guha,et al.  CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.

[12]  BieRongfang,et al.  Clustering by fast search and find of density peaks via heat diffusion , 2016 .

[13]  D. Massart,et al.  Looking for natural patterns in data: Part 1. Density-based approach , 2001 .

[14]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[15]  Thomas G. Dietterich,et al.  Collective Graphical Models , 2011, NIPS.

[16]  Ronnie Johansson,et al.  Choosing DBSCAN Parameters Automatically using Differential Evolution , 2014 .

[17]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[18]  Dexter Kozen,et al.  Collective Inference on Markov Models for Modeling Bird Migration , 2007, NIPS.

[19]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[20]  Hans-Peter Kriegel,et al.  Incremental Clustering for Mining in a Data Warehousing Environment , 1998, VLDB.

[21]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.