+ All Categories
Home > Documents > Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue

Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue

Date post: 04-Feb-2022
Category:
Upload: others
View: 2 times
Download: 0 times
Share this document with a friend
6
Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue Mosquito Vector María Beatríz Bernábe-Loranca 1 , Marco Antonio Rodríguez-Flores 2 , Ruth Aralí Martínez-Vega 3 , José Ramos- Castañeda 4 , Elias Olivares- Benitez 5 1,2 Benemérita Universidad Autónoma de Puebla BUAP, Facultad de Ciencias de la Computación 1,5 Universidad Popular Autónoma del Estado de Puebla UPAEP 3,4 Instituto Nacional de Salud Pública (INSP) Abstract—The efforts to locate the ovitraps in an homogenous way in a determined community must be redouble still, the reality is that the location of these depends too much of the will of the community and of the use that is given to the piece of land where the ovitrap should be located. Given that around the spot of the dengue cases the transmission is more probable (infected mosquitos) and that it’s been documented that vertical transmission exists (adult mosquito to eggs), to the viral and entomological vigilance of endemic communities is important to know and to monitor, through the research of the material obtained by the ovitraps, the strains of Dengue virus that circulate between the human population and the mosquito populations. If the ovitraps were located according to a random representative design and homogenous in the community of study, the vigilance system described above would consist in studying the ovitraps in the range of flight of the mosquito (200 meters approximately). However, in reality this is not the case, therefore a probabilistic approximation is required to establish which ovitraps should be evaluated by the system of sanitary vigilance to have a higher probability of success in the diagnosis, making the process cost-efficient. In this scenery, in accordance to the mobility of the mosquito, a clustering algorithm has been associated and adapted based in P-means that promises to construct groups where the center of each group is a case and the closest ovitraps are associated to establish a systematic and homogenous configuration of the relationship between a registered case and the ovitraps. Keywords-Cluster, Cases, Dengue, Mosquito, Ovitraps I. INTRODUCTION The system of entomological vigilance that is carried out by the authorities of national health is based in the called ovitraps; these are the units were the Aedes mosquito females lay eggs after feeding with human blood. In this point, it is assumed that the number of eggs in said devices is proportional to the number of vectors that transmit Dengue virus. All Vector control programs, which have focused mainly on the patient house and peridomestic areas around dengue cases, have not produced the expected impact on transmission. To evaluate the assumption that the endemic/epidemic transmission of dengue begins around peridomestic vicinities of the index dengue cases, a prospective cohort study was conducted (in Tepalcingo and Axochiapan, in the state of Morelos, Mexico), using the state surveillance system for the detection of incident cases. Paired blood specimens were collected from both the individuals who live with the incident cases and a sample of subjects residing within a 25- meter radius of such cases (exposed cohort), in order to measure dengue-specific antibodies. Other subjects were selected from areas which have not presented any incident cases within 200 meters, during the two months preceding the sampling (non-exposed cohort) [1]. Symptomatic/asymptomatic incident infection was detected. In the analysis it will be considered as the dependent variable, the exposure to confirmed dengue cases as the main independent variable, and the estimated Ae. Aegypti abundance and their infection with DENV, also socio-demographic and socio-cultural conditions of the subjects will be considered as additional explanatory variables [1]. As it was impossible to monitor and ascertain vector density in the domiciles of the participating subjects prior to and during follow up, we want to estimate this variable based in the data from the ovitrap-based surveillance program. Also, due to the difficult logistics involved in the capture of adult Aedes, the mosquito infection will be analyzed in the individuals that emerge from the eggs collected through the ovitraps closest to the subjects’ dwellings, but we don’t know how to select these ovitraps because their location into the endemic area is not homogeneous. To answer to this situation, we propose configuring a structure of the ovitraps under schemes of clustering algorithms analogue to the swarms of mosquitos and in particular to the sample of the behavior of the dengue mosquito. The study in this work starts with the introduction as section 1. In the section 2 we expose the way of life of the swarms of mosquitos as a bioinspired algorithm. We continue the section 3 with a brief state of the art of the problem of the Dengue mosquito giving place to describe in section 4, a proposal of algorithmic solution of clustering with analogy to the life of swarms of mosquitos and finally in section 5 we present a discussion of the results and lastly the conclusions. II. MOSQUITO SWARM ALGORITHM We can see on the literature a new propose classification of meta-heuristics algorithms not based on swarm intelligence theory but rather on grouping of animals: swarm algorithms, schools algorithms, flocks algorithms and herds 108
Transcript
Page 1: Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue
Page 2: Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue
Page 3: Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue
Page 4: Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue
Page 5: Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue

We have done 29 groupings, from 1 element to 29. Some groups only contain the centroid, that is, one registered case. These groups must be analyzed in accordance to the geographical zone to know the situation of the Dengue mosquito appearance. For illustrative effects, we show the results for 12 groups. Due to the fact that the algorithm has been built as an algorithm that optimizes the objective function of distances minimization between ovitraps and registered cases (centroid), we have calculated the cost function, the computing time, the centroids and the objects that belong to the group. When the size of the group is 1, the centroid (case) is the only element:

C. Ovitraps grouping for 12 groups Number of Groups: 12, Cost: 201.5455, Time: 573. Cluster 1: Size 1, Centroid 101 Cluster 2: Size 1, Centroid 102 Cluster 3: Size 1, Centroid 103 Cluster 4: Size 1, Centroid 104 Cluster 5: Size 9, Centroid 105, Elements 85, 86, 87, 88, 89, 90, 91, 92, Cluster 6: Size 1, Centroid 106 Cluster 7: Size 7, Centroid 107, Elements 73, 74, 93, 94, 95, 96, Cluster 8: Size 7, Centroid 108, Elements 72, 75, 76, 97, 99, 100 Cluster 9: Size 14, Centroid 109, Elements 53, 61, 62, 63, 64, 67, 68, 77, 81, 82, 83, 84, 129 Cluster 10: Size 12, Centroid 110, Elements 1, 2, 3, 45, 46, 69, 70, 71, 78, 79, 80 Cluster 11: Size 34, Centroid 111, Elements 4, 5, 6, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 47, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 65, 66, 98, 124, 123, 114, 115, Cluster 12: Size 41, Centroid 112, Elements 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 128, 127, 126, 125, 122, 121, 120, 119, 118, 113, 116, 117. In the remaining groupings, the groups with centroids 101, 102, 103, 104 y 106, only contain as element the centroid itself. Now the challenge consists in placing the ovitraps in accordance to a chosen grouping and observing the results.

V. CONCLUSIONS In this work we have achieved adapting a well-known

partitioning algorithm to the behavior of the Dengue mosquito with the end of reassigning ovitraps in correct places where a case of dengue has been registered. The grouping algorithm it’s been supported by the works where bioinspired algorithms of mosquitos swarms have been proposed. The results of our algorithm produce adequate configurations to place the ovitraps in correct coordinates and thus continue with the study of the Dengue mosquito.

On the other hand, the importance of adapting the behavior of the mosquito to a real problem, has given place to propose a bioinspired clustering algorithm to solve the

problem of practical configurations for the Dengue mosquito problem that has been described in this work.

ACKNOWLEDGMENT The first author acknowledges support from CONACyT

(network of mathematical and computational models) for development this work.

REFERENCES [1] R.A Martínez-Vega, R Danis-Lozano, J. Velasco-Hernández, F.A

Díaz-Quijano, M. González-Fernández, R.Santos, BMC Public Health, 2012, pp. 12-262.

[2] J. A. Ruiz-Vanoye, O. Díaz-Parra, F. Cocón, A. Soto, M. A. Buenabad-Arias, G. Verduzco-Reyes, R. Alberto-Lira, “Meta-Heuristics Algorithms based on the Grouping of Animals by Social Behavior for the Traveling Salesman Problem”, International Journal of Combinatorial Optimization Problems and Informaticsvol. 3, no. 3, September 2011, pp. 104-123, , ISSN: 2007-1558.

[3] A. Okubo, “Dynamical aspects of animal grouping: Swarms, schools, flocks, and herds”, Advances in Biophysics, vol. 22, pp. 1-94, 1986.

[4] M. Dorigo, “Optimization, Learning and Natural Algorithms”, Ph.D. Thesis, Politecnico di Milano, Italy, 1992.

[5] X. S Yang, “Firefly Algorithm”, chapter 8, Nature-inspired Metaheuristic Algorithms, Luniver Press, 2008.

[6] H. A Abbass, “MBO: Marriage in Honey Bees Optimization-a Haplometrosis polygynous Swarming Approach”, Proceedings of the 2001 Congress on Evolutionary Computation, vol.1, 2001, pp. 207-214.

[7] D. Karaboga, “An idea based on Honey Bee Swarm for Numerical Optimization”, Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005.

[8] P. C. Pinto, T. A Runkler, T.A and J. M Sousa, “Wasp Swarm Algorithm for Dynamic MAX-SAT Problems”, in Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007).

[9] L. Xueyan and Z. Yongquan,: “A Novel Global Convergence Algorithm: Bee Collecting Pollen Algorithm. Advanced Intelligent Computing Theories and Applications”. With Aspects of Artificial Intelligence, Lecture Notes in Computer Science , Vol. 5227, 2008, pp. 518-525.

[10] M. Roth, “Termite: A Swarm Intelligent Routing Algorithm For Mobile Wireless Ad-Hoc Networks”, Theses and Dissertations, Cornell University Graduate School, 2005.

[11] J. A. Ruiz-Vanoye O. and Díaz-Parra, “A Mosquito Swarms Algorithm for the Traveling Salesman Problem”, unpublished manuscript.

[12] J. A. Ruiz-Vanoye and O. Díaz-Parra, “A zooplankton Swarms Algorithm for the Traveling Salesman Problem”, unpublished manuscript.

[13] J. A. Ruiz-Vanoye and O. Díaz-Parra, “A Bumblebees Swarms Algorithm for the Traveling Salesman Problem”, unpublished manuscript.

[14] D. T. Mourya, Gokhale, A. Basu, P. V. Barde, G. N. Sapkal, V. S. Padbidri, M. M. Gore, “Horizontal and vertical transmission of dengue virus type 2 in highly and lowly susceptible strains of Aedes aegypti mosquitoes”, Acta Virol, 2001, vol. 45, pp. 67-71.

[15] V. Joshi, D. T. Mourya, R. C. Sharma, “Persistence of dengue-3 virus through transovarial transmission passage in successive generations of Aedes aegypti mosquitoes”. Am J Trop Med Hyg. 2002, vol. 67, pp. 158-61.

[16] N. Arunachalam, S. C. Tewari, V. Thenmozhi, R. Rajendran, R. Paramasivan, R. Manavalan, “Natural vertical transmission of dengue viruses by Aedes aegypti in Chennai”, Tamil Nadu, India, Indian J. Med Res, 2008, vol. 127, pp. 395-7.

112

Trends in Innovative Computing 2012 - Nature Inspired Computing

Page 6: Adaptation of a Clustering Algorithm and Mosquito Swarm to a problem of ovitraps for the Dengue

[17] G. Le Goff, J. Revollo, M. Guerra Cruz, Z. Barja Simon, Y. Roca, "Natural vertical transmission of dengue viruses by Aedes aegypti in Bolivia”, 2011, vol. 18, pp. 277-80.

[18] J. Günther, J. P. Martínez-Muñoz, D. G. Pérez-Ishiwara, Salas-Benito J.Evidence of vertical transmission of dengue virus in two endemic localities in the state of Oaxaca, Mexico Intervirology, 2007, vol. 50, pp. 347-52.

[19] A. B. Cecílio, E. S. Campanelli, K. P. Souza, L. B. Figueiredo, M. C. Resende, “Natural vertical transmission by Stegomyia albopicta as dengue vector in Brazil”, Braz J. Biol, 2009, vol. 69, pp.123-7.

[20] A. P. Vilela, L. B. Figueiredo, J. R. Dos Santos, A. E. Eiras, C. A. Bonjardim, P. C. Ferreira, E. G. Kroon, “Dengue virus 3 genotype I in Aedes aegypti mosquitoes and eggs” Brazil, 2005-2006. Emerg Infect Dis. 2010, vol. 16, pp. 989-92.

[21] WHO, TDR. Dengue guidelines for diagnosis, treatment, prevention and control, 2009.

[22] N. A. Honório, C. T. Codeço, F. C. Alves, M. A. Magalhães, R. Lourenço-De-Oliveira, “Temporal distribution of Aedes aegypti in different districts of Rio de Janeiro, Brazil, measured by two types of traps”, J. Med Entomol, 2009, vol. 46, pp. 1001-14.

[23] C. C. Marques, G. R. Marques, M. de Brito, L. G. dos Santos Neto, , V. de C. Ishibashi, F. de A. Gomes, “Comparative study of larval and ovitrap efficacy for surveillance of dengue and yellow fever vectors”, Rev Saude Publica, 1993, vol. 27, pp. 237-41.

[24] E. L. Estallo, F. F. Ludueña-Almeida, A. M. Visintin, C. M. Scavuzzo, M. V. Introini, M. Zaidenberg, W. R. Almirón, “Prevention of dengue outbreaks through Aedes aegypti oviposition activity forecasting method”, Vector Borne Zoonotic Dis. 2011, vol. 11, pp. 543-9.

[25] L. Regis, A. M. Monteiro, M. A. Melo-Santos, J. C. SilveiraJr, A. F. Furtado, R. V. Acioli, “Developing new approaches for detecting and preventing Aedes aegypti population outbreaks: basis for surveillance, alert and control system”, Mem Inst Oswaldo Cruz. 2008, vol. 103, pp. 50-9

[26] M. S. Dasking, “ Network Discrete Location, Models, Algorithms, and Applications”, John Wiley & Sons, Inc., 1985, pp. 198-208.

[27] R. L. Church, “COBRA: A New Formulation of the Classic p-Median Location Problem”, Annals of Operations Research 122, 2003, pp. 103–120.

[28] J. Reese, “Solution methods for the p-median problem: An annotated bibliography”, Networks, october 2006, vol. 48, no. 3, pp. 125-142.

[29] R. L. Church, “COBRA: A New Formulation of the Classic p-Median Location Problem”, Annals of Operations Research 122, 2003, pp. 103–120.

[30] O. Alp and E. Erkut, “An Efficient Genetic Algorithm for the p-Median Problem”, Annals of Operations Research, 2003, 122, pp. 21–42.

113

Trends in Innovative Computing 2012 - Nature Inspired Computing


Recommended