Birds bring flues? Mining frequent and high weighted cliques from birds migration networks

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recent advances in satellite tracking technologies can provide huge amount of data for biologists to understand continuous long movement patterns of wild bird species. In particular, highly correlated habitat areas are of great biological interests. Biologists can use this information to strive potential ways for controlling highly pathogenic avian influenza. We convert these biological problems into graph mining problems. Traditional models for frequent graph mining assign each vertex label with equal weight. However, the weight difference between vertexes can make strong impact on decision making by biologists. In this paper, by considering different weights of individual vertex in the graph, we develop a new algorithm, Helen, which focuses on identifying cliques with high weights. We introduce "graph-weighted support framework" to reduce clique candidates, and then filter out the low weighted cliques. We evaluate our algorithm on real life birds' migration data sets, and show that graph mining can be very helpful for ecologists to discover unanticipated bird migration relationships. © Springer-Verlag Berlin Heidelberg 2010.

Cite

CITATION STYLE

APA

Tang, M. J., Wang, W., Jiang, Y., Zhou, Y., Li, J., Cui, P., … Yan, B. (2010). Birds bring flues? Mining frequent and high weighted cliques from birds migration networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5982 LNCS, pp. 359–369). https://doi.org/10.1007/978-3-642-12098-5_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free