\n \n \n
\n
\n\n \n \n \n \n \n \n Optimización con 100 millones de variables reales sobre múltiples unidades de procesamiento gráfico.\n \n \n \n \n\n\n \n Cano, A.; and García-Martínez, C.\n\n\n \n\n\n\n In
Congreso de Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB'16), pages 377–386, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Cano2016,\r\n Title = {{Optimizaci{\\'{o}}n con 100 millones de variables reales sobre m{\\'{u}}ltiples unidades de procesamiento gr{\\'{a}}fico}},\r\n Author = {Cano, Alberto and García-Martínez, C.},\r\n Booktitle = {Congreso de Metaheur{\\'{i}}sticas, Algoritmos Evolutivos y Bioinspirados (MAEB'16)},\r\n Year = {2016},\r\n Pages = {377--386},\r\n Keywords = {Metaheuristics,Bioinspired algorithms,Evolutionary Algorithms,Genetic Algorithms,Scalability},\r\n URL = {www.uco.es/{~}i52caroa/pdf/CAEPIA-2016.pdf}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n ur-CAIM: improved CAIM discretization for unbalanced and balanced data.\n \n \n \n \n\n\n \n Cano, A.; Nguyen, D.; Ventura, S.; and Cios, K.\n\n\n \n\n\n\n
Soft Computing, 20(1): 173-188. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Cano-2016-SOCO,\r\n Title = {ur-CAIM: improved CAIM discretization for unbalanced and balanced data},\r\n Author = {Cano, A. and Nguyen, D.T. and Ventura, S. and Cios, K.J.},\r\n Journal = {Soft Computing},\r\n Year = {2016},\r\n Number = {1},\r\n Pages = {173-188},\r\n Volume = {20},\r\n DOI = {10.1007/s00500-014-1488-1},\r\n Keywords = {Supervised Learning, Classification},\r\n URL = {http://dx.doi.org/10.1007/s00500-014-1488-1}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n 100 Million Dimensions Large-Scale Global Optimization Using Distributed GPU Computing.\n \n \n \n\n\n \n Cano, A.; and García-Martínez, C.\n\n\n \n\n\n\n In
Proceedings of the IEEE World Congress on Computational Intelligence, of
IEEE WCCI 2016, Vancouver, Canada, 2016. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Cano-WCCI-2016,\r\n Title = {100 Million Dimensions Large-Scale Global Optimization Using Distributed GPU Computing},\r\n Author = {Cano, A. and García-Martínez, C.},\r\n Booktitle = {Proceedings of the IEEE World Congress on Computational Intelligence},\r\n Year = {2016},\r\n Address = {Vancouver, Canada},\r\n Series = {IEEE WCCI 2016},\r\n Keywords = {GP-GPU, Scalability}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Early dropout prediction using data mining: a case study with high school students.\n \n \n \n \n\n\n \n Márquez-Vera, C.; Cano, A.; Romero, C.; Noaman, A. Y.; Fardoun, H. M.; and Ventura, S.\n\n\n \n\n\n\n
Expert Systems, 33(1): 107–124. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@Article{DBLP:journals/es/Marquez-Vera0RN16,\r\n Title = {Early dropout prediction using data mining: a case study with high school students},\r\n Author = {Carlos M{\\'{a}}rquez{-}Vera and A. Cano and C. Romero and Amin Y. Noaman and Habib M. Fardoun and S. Ventura},\r\n Journal = {Expert Systems},\r\n Year = {2016},\r\n Number = {1},\r\n Pages = {107--124},\r\n Volume = {33},\r\n DOI = {10.1111/exsy.12135},\r\n Keywords = {Educational Data Mining, Predicting Student Performance},\r\n URL = {http://dx.doi.org/10.1111/exsy.12135}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n An alternative artificial bee colony algorithm with destructive–constructive neighbourhood operator for the problem of composing medical crews.\n \n \n \n \n\n\n \n Delgado-Osuna, J. a.; Lozano, M.; and García-Martínez, C.\n\n\n \n\n\n\n
Information Sciences, 326: 215–226. jan 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Delgado-Osuna2016,\r\n Title = {{An alternative artificial bee colony algorithm with destructive–constructive neighbourhood operator for the problem of composing medical crews}},\r\n Author = {Delgado-Osuna, Jos{\\'{e}} a. and Lozano, Manuel and García-Martínez, C.},\r\n Journal = {Information Sciences},\r\n Year = {2016},\r\n Month = {jan},\r\n Pages = {215--226},\r\n Volume = {326},\r\n DOI = {10.1016/j.ins.2015.07.051},\r\n ISSN = {00200255},\r\n Keywords = {Metaheuristics,Bioinspired algorithms},\r\n URL = {http://linkinghub.elsevier.com/retrieve/pii/S0020025515005599}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Predicción de la aceptación o rechazo de las calificaciones finales propuestas por el alumnado usando técnicas de Minería de Datos.\n \n \n \n \n\n\n \n Fuentes-Alventosa, J.; Romero, C.; García-Martínez, C.; and Ventura, S.\n\n\n \n\n\n\n In
Actas de las XXII Jornadas sobre la Enseñanza Universitaria de la Informática (JENUI 2016), pages 201–208, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Fuentes-Alventosa2016,\r\n Title = {{Predicci{\\'{o}}n de la aceptaci{\\'{o}}n o rechazo de las calificaciones finales propuestas por el alumnado usando t{\\'{e}}cnicas de Miner{\\'{i}}a de Datos}},\r\n Author = {Fuentes-Alventosa, Javier and Romero, Crist{\\'{o}}bal and García-Martínez, C. and Ventura, Sebasti{\\'{a}}n},\r\n Booktitle = {Actas de las XXII Jornadas sobre la Ense{\\~{n}}anza Universitaria de la Inform{\\'{a}}tica (JENUI 2016)},\r\n Year = {2016},\r\n Pages = {201--208},\r\n ISBN = {9788416642304},\r\n Keywords = {Supervised Learning,Classification,Educational Data Mining,Predicting Student Performance},\r\n URL = {http://www.aenui.net/ojs/index.php?journal=actas{\\_}jenui{\\&}page=article{\\&}op=view{\\&}path{\\%}5B{\\%}5D=252}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n An Algorithm Evaluation for Discovering Classification Rules with Gene Expression Programming.\n \n \n \n \n\n\n \n Guerrero-Enamorado, A.; Morell, C.; Noaman, A.; and Ventura, S.\n\n\n \n\n\n\n
International Journal of Computational Intelligence Systems, 9(2): 263-280. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Guerrero-Enamorado-2016-IJCIS,\r\n Title = {{An Algorithm Evaluation for Discovering Classification Rules with Gene Expression Programming}},\r\n Author = {Guerrero-Enamorado, A. and Morell, C. and Noaman, A.Y. and Ventura, S.},\r\n Journal = {International Journal of Computational Intelligence Systems},\r\n Year = {2016},\r\n Number = {2},\r\n Pages = {263-280},\r\n Volume = {9},\r\n DOI = {10.1080/18756891.2016.1150000},\r\n URL = {http://dx.doi.org/10.1109/10.1080/18756891.2016.1150000}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Multiple instance learning: Foundations and algorithms.\n \n \n \n \n\n\n \n Herrera, F.; Ventura, S.; Bello, R.; Cornelis, C.; Zafra, A.; Sánchez-Tarragó, D.; and Vluymans, S.\n\n\n \n\n\n\n 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Book{Herrera-2016-MIL,\r\n Title = {Multiple instance learning: Foundations and algorithms},\r\n Author = {Herrera, F. and Ventura, S. and Bello, R. and Cornelis, C. and Zafra, A. and Sánchez-Tarragó, D. and Vluymans, S.},\r\n Year = {2016},\r\n DOI = {10.1007/978-3-319-47759-6},\r\n Journal = {Multiple Instance Learning: Foundations and Algorithms},\r\n Pages = {1-233},\r\n URL = {http://dx.doi.org/10.1007/978-3-319-47759-6}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Randomized greedy multi-start algorithm for the minimum common integer partition problem.\n \n \n \n \n\n\n \n Lozano, M.; Rodriguez, F. J.; Peralta, D.; and García-Martínez, C.\n\n\n \n\n\n\n
Engineering Applications of Artificial Intelligence, 50: 226–235. apr 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@Article{Lozano2016,\r\n Title = {{Randomized greedy multi-start algorithm for the minimum common integer partition problem}},\r\n Author = {Lozano, Manuel and Rodriguez, Francisco J. and Peralta, Daniel and García-Martínez, C.},\r\n Journal = {Engineering Applications of Artificial Intelligence},\r\n Year = {2016},\r\n Month = {apr},\r\n Pages = {226--235},\r\n Volume = {50},\r\n Abstract = {In this paper, we propose a randomized greedy multi-start algorithm for the minimum common integer partition problem. Given k multisets S1,{\\ldots},Sk of positive integers (Si={\\{}si1,{\\ldots},sij,{\\ldots},simi{\\}}), the goal is to find the common integer partition T with minimal cardinality, i.e., a unique and reduced multiset T that, for each Si, it can be partitioned into mi multisets Tj so that the elements in Tj sum to sij. This mathematical problem is reported to appear in computational molecular biology, when assigning orthologs on a genome scale or assembling DNA fingerprints in particular. Our proposed metaheuristic approach constitutes the construction of multiple solutions by a new greedy method that embeds a diversification agent to allow diverse and promising solutions to be reached. Furthermore, we formulate an integer programming model for this problem and show that the CPLEX solver can only solve small instances of the problem. However, computational results for problem instances involving up to 1000 multisets (each one with up to 1000 elements) show that our innovative metaheuristic produces very good feasible solutions in reasonable computing times, arising as a very attractive alternative to the existing approaches.},\r\n DOI = {10.1016/j.engappai.2016.01.037},\r\n ISSN = {09521976},\r\n Keywords = {Metaheuristics},\r\n URL = {http://linkinghub.elsevier.com/retrieve/pii/S0952197616000415}\r\n}\r\n\r\n
\n
\n\n\n
\n In this paper, we propose a randomized greedy multi-start algorithm for the minimum common integer partition problem. Given k multisets S1,…,Sk of positive integers (Si=\\si1,…,sij,…,simi\\), the goal is to find the common integer partition T with minimal cardinality, i.e., a unique and reduced multiset T that, for each Si, it can be partitioned into mi multisets Tj so that the elements in Tj sum to sij. This mathematical problem is reported to appear in computational molecular biology, when assigning orthologs on a genome scale or assembling DNA fingerprints in particular. Our proposed metaheuristic approach constitutes the construction of multiple solutions by a new greedy method that embeds a diversification agent to allow diverse and promising solutions to be reached. Furthermore, we formulate an integer programming model for this problem and show that the CPLEX solver can only solve small instances of the problem. However, computational results for problem instances involving up to 1000 multisets (each one with up to 1000 elements) show that our innovative metaheuristic produces very good feasible solutions in reasonable computing times, arising as a very attractive alternative to the existing approaches.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n A genetic algorithm for the minimum generating set problem.\n \n \n \n \n\n\n \n Lozano, M.; Laguna, M.; Martí, R.; Rodríguez, F. J.; and García-Martínez, C.\n\n\n \n\n\n\n
Applied Soft Computing, 48: 254–264. nov 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Lozano2016a,\r\n Title = {{A genetic algorithm for the minimum generating set problem}},\r\n Author = {Lozano, Manuel and Laguna, Manuel and Mart{\\'{i}}, Rafael and Rodr{\\'{i}}guez, Francisco J. and García-Martínez, C.},\r\n Journal = {Applied Soft Computing},\r\n Year = {2016},\r\n Month = {nov},\r\n Pages = {254--264},\r\n Volume = {48},\r\n Abstract = {Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinatorial number theory and is related to some real-world problems, such as planning radiation therapies. We present a new formulation to this problem (based on the terminology for the multiple knapsack problem) that is used to design an evolutionary approach whose performance is driven by three search strategies; a novel random greedy heuristic scheme that is employed to construct initial solutions, a specialized crossover operator inspired by real-parameter crossovers and a restart mechanism that is incorporated to avoid premature convergence. Computational results for problem instances involving up to 100,000 elements show that our innovative genetic algorithm is a very attractive alternative to the existing approaches.},\r\n DOI = {10.1016/j.asoc.2016.07.020},\r\n ISSN = {15684946},\r\n Keywords = {Metaheuristics,Bioinspired algorithms,Evolutionary Algorithms,Genetic Algorithms},\r\n URL = {http://linkinghub.elsevier.com/retrieve/pii/S1568494616303465}\r\n}\r\n\r\n
\n
\n\n\n
\n Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinatorial number theory and is related to some real-world problems, such as planning radiation therapies. We present a new formulation to this problem (based on the terminology for the multiple knapsack problem) that is used to design an evolutionary approach whose performance is driven by three search strategies; a novel random greedy heuristic scheme that is employed to construct initial solutions, a specialized crossover operator inspired by real-parameter crossovers and a restart mechanism that is incorporated to avoid premature convergence. Computational results for problem instances involving up to 100,000 elements show that our innovative genetic algorithm is a very attractive alternative to the existing approaches.\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Optimizing Network Attacks by Artificial Bee Colony.\n \n \n \n \n\n\n \n Lozano, M.; García-Martínez, C.; Rodríguez, F. J.; and Trujillo, H. M.\n\n\n \n\n\n\n
Information Sciences, 377: 30–50. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Lozano2016b,\r\n Title = {{Optimizing Network Attacks by Artificial Bee Colony}},\r\n Author = {Lozano, Manuel and García-Martínez, C. and Rodr{\\'{i}}guez, Francisco J. and Trujillo, Humberto M.},\r\n Journal = {Information Sciences},\r\n Year = {2016},\r\n Pages = {30--50},\r\n Volume = {377},\r\n DOI = {10.1016/j.ins.2016.10.014},\r\n ISSN = {00200255},\r\n Keywords = {Metaheuristics,Bioinspired algorithms},\r\n Publisher = {Elsevier Inc.},\r\n URL = {http://linkinghub.elsevier.com/retrieve/pii/S0020025516312075}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n\n\n \n\n\n
\n
\n\n \n \n \n \n \n \n Discovering useful patterns from multiple instance data.\n \n \n \n \n\n\n \n Luna, J. M.; Cano, A.; Sakalauskas, V.; and Ventura, S.\n\n\n \n\n\n\n
Information Science, 357: 23–38. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Luna0SV16,\r\n Title = {Discovering useful patterns from multiple instance data},\r\n Author = {J. M. Luna and A. Cano and V. Sakalauskas and S. Ventura},\r\n Journal = {Information Science},\r\n Year = {2016},\r\n Pages = {23--38},\r\n Volume = {357},\r\n DOI = {10.1016/j.ins.2016.04.007},\r\n Keywords = {Pattern Mining, Multi-instance Learning, Association Rule Mining, Unsupervised Learning, Unsupervised Learning},\r\n URL = {http://dx.doi.org/10.1016/j.ins.2016.04.007}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Pattern mining: current status and emerging topics.\n \n \n \n \n\n\n \n Luna, J. M.\n\n\n \n\n\n\n
Progress in Artificial Intelligence, 5(3): 165–170. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@Article{LunaPRAI16,\r\n Title = {Pattern mining: current status and emerging topics},\r\n Author = {J. M. Luna},\r\n Journal = {Progress in Artificial Intelligence},\r\n Year = {2016},\r\n Number = {3},\r\n Pages = {165--170},\r\n Volume = {5},\r\n DOI = {10.1007/s13748-016-0090-4},\r\n Keywords = {Pattern Mining, Unsupervised Learning},\r\n URL = {http://dx.doi.org/10.1007/s13748-016-0090-4}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Mining exceptional relationships with grammar-guided genetic programming.\n \n \n \n \n\n\n \n Luna, J. M.; Pechenizkiy, M.; and Ventura, S.\n\n\n \n\n\n\n
Knowledge and Information Systems, 47(3): 571–594. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{LunaPV16,\r\n Title = {Mining exceptional relationships with grammar-guided genetic programming},\r\n Author = {J. M. Luna and M. Pechenizkiy and S. Ventura},\r\n Journal = {Knowledge and Information Systems},\r\n Year = {2016},\r\n Number = {3},\r\n Pages = {571--594},\r\n Volume = {47},\r\n DOI = {10.1007/s10115-015-0859-y},\r\n Keywords = {Pattern Mining, Association Rule Mining, Genetic Programming, Grammar-Based Genetic Programming, Unsupervised Learning, Evolutionary Algorithms},\r\n URL = {http://dx.doi.org/10.1007/s10115-015-0859-y}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Speeding-Up Association Rule Mining With Inverted Index Compression.\n \n \n \n \n\n\n \n Luna, J. M.; Cano, A.; Pechenizkiy, M.; and Ventura, S.\n\n\n \n\n\n\n
IEEE Transactions on Cybernetics, Online first(-): -. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{LunaSpeedingUp,\r\n Title = {Speeding-Up Association Rule Mining With Inverted Index Compression},\r\n Author = {J. M. Luna and A. Cano and M. Pechenizkiy and S. Ventura},\r\n Journal = {{IEEE} Transactions on Cybernetics},\r\n Year = {2016},\r\n Number = {-},\r\n Pages = {-},\r\n Volume = {Online first},\r\n DOI = {10.1109/TCYB.2015.2496175},\r\n Keywords = {Pattern Mining, Big Data Mining, Association Rule Mining, Unsupervised Learning},\r\n URL = {http://dx.doi.org/ 10.1109/TCYB.2015.2496175}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n RKEEL: Using KEEL in R Code.\n \n \n \n \n\n\n \n Moyano, J. M.; and Sánchez, L.\n\n\n \n\n\n\n In
2016 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2016, Vancouver, Canada, July 24-29, 2016, pages 257–264, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@InProceedings{Moyano2016a_WCCI,\r\n Title = {RKEEL: Using KEEL in R Code},\r\n Author = {J. M. Moyano and L. S{\\'{a}}nchez},\r\n Booktitle = {2016 {IEEE} International Conference on Fuzzy Systems, {FUZZ-IEEE} 2016, Vancouver, Canada, July 24-29, 2016},\r\n Year = {2016},\r\n Pages = {257--264},\r\n Keywords = {Software Design \\& Development},\r\n URL = {http://www.uco.es/~i02momuj/pdf/wcci16.pdf}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Una herramienta para analizar conjuntos de datos multi-etiqueta.\n \n \n \n \n\n\n \n Moyano, J. M.; Gibaja, E.; and Ventura, S.\n\n\n \n\n\n\n In
XVII Conferencia de la Asociación Española para la Inteligencia Artificial, CAEPIA '16, pages 857–866, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Moyano2016b_CAEPIA,\r\n Title = {Una herramienta para analizar conjuntos de datos multi-etiqueta},\r\n Author = {J. M. Moyano and E. Gibaja and S. Ventura},\r\n Booktitle = {XVII Conferencia de la Asociaci{\\'{o}}n Espa\\~{n}ola para la Inteligencia Artificial, CAEPIA '16},\r\n Year = {2016},\r\n Pages = {857--866},\r\n ISBN = {978-84-9012-632-5},\r\n Keywords = {Multi-label Learning, Multi-view Learning, Feature Selection, Instance Selection, Data Preprocessing, Software Design \\& Development},\r\n URL = {http://www.uco.es/~i02momuj/pdf/caepia16.pdf}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Recommending degree studies according to students attitudes in high school by means of subgroup discovery.\n \n \n \n \n\n\n \n Noaman, A.; Luna, J.; Ragab, A.; and Ventura, S.\n\n\n \n\n\n\n
International Journal of Computational Intelligence Systems, 9(6): 1101-1117. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@Article{Noaman-2016-IJCIS,\r\n Title = {Recommending degree studies according to students attitudes in high school by means of subgroup discovery},\r\n Author = {Noaman, A.Y. and Luna, J.M. and Ragab, A.H.M. and Ventura, S.},\r\n Journal = {International Journal of Computational Intelligence Systems},\r\n Year = {2016},\r\n Number = {6},\r\n Pages = {1101-1117},\r\n Volume = {9},\r\n DOI = {10.1080/18756891.2016.1256573},\r\n URL = {http://dx.doi.org/10.1080/18756891.2016.1256573}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Subgroup discovery on Big Data: exhaustive methodologies using Map-Reduce.\n \n \n \n \n\n\n \n Padillo, F.; Luna, J. M.; and Ventura, S.\n\n\n \n\n\n\n In
Proceedings of the 2016 IEEE Trustcom/BigDataSE/ISPA, pages 1684–1691, Tianjin, China, Aug 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Padillo:BigDataSE16:16,\r\n Title = {Subgroup discovery on Big Data: exhaustive methodologies using Map-Reduce},\r\n Author = {Padillo, F. and Luna, J. M. and Ventura, S.},\r\n Booktitle = {Proceedings of the 2016 {IEEE} Trustcom/BigDataSE/ISPA},\r\n Year = {2016},\r\n Address = {Tianjin, China},\r\n Month = {Aug},\r\n Pages = {1684--1691},\r\n DOI = {10.1109/TrustCom/BigDataSE/ISPA.2016.256},\r\n Keywords = {Spark, Subgroup Discovery, Scalability, Pattern Mining, Big Data Mining},\r\n URL = {http://dx.doi.org/10.1109/TrustCom/BigDataSE/ISPA.2016.256}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n A Data Structure to Speed-Up Machine Learning Algorithms on Massive Datasets.\n \n \n \n \n\n\n \n Padillo, F.; Luna, J. M.; Cano, A.; and Ventura, S.\n\n\n \n\n\n\n In
Proceedings of the 11th International Conference on Hybrid Artificial Intelligence Systems, of
HAIS 2016, pages 365-376, Seville, Spain, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Padillo:HAIS16:2016,\r\n Title = {A Data Structure to Speed-Up Machine Learning Algorithms on Massive Datasets},\r\n Author = {Padillo, F. and Luna, J. M. and Cano, A. and Ventura, S.},\r\n Booktitle = {Proceedings of the 11th International Conference on Hybrid Artificial Intelligence Systems},\r\n Year = {2016},\r\n Address = {Seville, Spain},\r\n Pages = {365-376},\r\n Series = {HAIS 2016},\r\n DOI = {10.1007/978-3-319-32034-2_31},\r\n Keywords = {Big Data Mining, Scalability},\r\n URL = {http://dx.doi.org/10.1007/978-3-319-32034-2_31}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Algoritmo de programación genética gramatical para la extracción de reglas de asociación en Big Data usando el paradigma MapReduce.\n \n \n \n\n\n \n Padillo, F.; Luna, J. M.; Ventura, S.; and Herrera, F.\n\n\n \n\n\n\n In
XI Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB'16), pages 137-148, 2016. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Padillo:MAEB16:16,\r\n Title = {Algoritmo de programaci\\'on gen\\'etica gramatical para la extracci\\'on de reglas de asociaci\\'on en {B}ig {D}ata usando el paradigma {M}ap{R}educe},\r\n Author = {Padillo, F. and Luna, J. M. and Ventura, S. and Herrera, F.},\r\n Booktitle = {{XI} Congreso Espa\\~nol sobre Metaheur\\'isticas, Algoritmos Evolutivos y Bioinspirados (MAEB'16)},\r\n Year = {2016},\r\n Pages = {137-148},\r\n ISBN = {978-84-9012-632-5},\r\n Keywords = {Pattern Mining, Big Data Mining, Scalability, Unsupervised Learning, Association Rule Mining, Spark, Hadoop, Evolutionary Algorithms, Grammar-Based Genetic Programming}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Búsquedas exhaustivas de subgrupos con MapReduce en Big Data.\n \n \n \n\n\n \n Padillo, F.; Luna, J. M.; and Ventura, S.\n\n\n \n\n\n\n In
VIII Simposio Teoría y Aplicaciones de Minería de Datos (TAMIDA'16), pages 779-788, 2016. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Padillo:TAMIDA16_SD:16,\r\n Title = {B\\'usquedas exhaustivas de subgrupos con {M}ap{R}educe en {B}ig {D}ata},\r\n Author = {Padillo, F. and Luna, J. M. and Ventura, S.},\r\n Booktitle = {{VIII} Simposio {T}eor\\'ia y {A}plicaciones de Miner\\'ia de Datos ({TAMIDA}'16)},\r\n Year = {2016},\r\n Pages = {779-788},\r\n ISBN = {978-84-9012-632-5},\r\n Keywords = {Pattern Mining, Big Data Mining, Scalability, Spark}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Minería de patrones en Big Data.\n \n \n \n\n\n \n Padillo, F.; Luna, J. M.; and Ventura, S.\n\n\n \n\n\n\n In
VIII Simposio Teoría y Aplicaciones de Minería de Datos (TAMIDA'16), pages 769-778, 2016. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Padillo:TAMIDA16:16,\r\n Title = {Miner\\'ia de patrones en {B}ig {D}ata},\r\n Author = {Padillo, F. and Luna, J. M. and Ventura, S.},\r\n Booktitle = {{VIII} Simposio {T}eor\\'ia y {A}plicaciones de Miner\\'ia de Datos ({TAMIDA}'16)},\r\n Year = {2016},\r\n Pages = {769-778},\r\n ISBN = {978-84-9012-632-5},\r\n Keywords = {Pattern Mining, Big Data Mining, Scalability, Unsupervised Learning, Association Rule Mining, Hadoop}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n A comparative study of many-objective evolutionary algorithms for the discovery of software architectures.\n \n \n \n \n\n\n \n Ramírez, A.; Romero, J. R.; and Ventura, S.\n\n\n \n\n\n\n
Empirical Software Engineering, 21: 2546–2600. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{Ramirez-2016-EMSE,\r\n Title = {A comparative study of many-objective evolutionary algorithms for the discovery of software architectures},\r\n Author = {Ramírez, A. and Romero, J. R. and Ventura, S.},\r\n Journal = {Empirical Software Engineering},\r\n Year = {2016},\r\n Pages = {2546--2600},\r\n Volume = {21},\r\n DOI = {10.1007/s10664-015-9399-z},\r\n ISSN = {1573-7616},\r\n Issue = {6},\r\n Keywords = {Search-based Software Engineering, Multi-objective Optimization, Metaheuristics, Bioinspired algorithms, Evolutionary algorithms},\r\n URL = {http://dx.doi.org/10.1007/s10664-015-9399-z}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Memetic Algorithms for the Automatic Discovery of Software Architectures.\n \n \n \n \n\n\n \n Ramírez, A.; Barbudo, R.; Romero, J. R.; and Ventura, S.\n\n\n \n\n\n\n In
16th International Conference on Intelligent Systems Design and Applications (ISDA'16), 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Ramirez-2016-ISDA,\r\n Title = {{Memetic Algorithms for the Automatic Discovery of Software Architectures}},\r\n Author = {Ramírez, A. and Barbudo, R. and Romero, J. R. and Ventura, S.},\r\n Booktitle = {16th International Conference on Intelligent Systems Design and Applications (ISDA'16)},\r\n Year = {2016},\r\n DOI = {10.1007/978-3-319-53480-0_43},\r\n Keywords = {Search-based Software Engineering, Metaheuristics, Bioinspired algorithms, Evolutionary algorithms},\r\n URL = {http://dx.doi.org/10.1007/978-3-319-53480-0_43}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Estudio de mecanismos de hibridación para el descubrimiento evolutivo de arquitecturas.\n \n \n \n \n\n\n \n Ramírez, A.; Molina, J.; Romero, J. R.; and Ventura, S.\n\n\n \n\n\n\n In
XXI Jornadas en Ingeniería del Software y Bases de Datos (JISBD'16), pages 481-494, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Ramirez-2016-JISBD-1,\r\n Title = {Estudio de mecanismos de hibridaci\\'on para el descubrimiento evolutivo de arquitecturas},\r\n Author = {Ramírez, A. and Molina, J.A. and Romero, J. R. and Ventura, S.},\r\n Booktitle = {XXI Jornadas en Ingeniería del Software y Bases de Datos (JISBD'16)},\r\n Year = {2016},\r\n Pages = {481-494},\r\n ISBN = {978-84-9012-627-1},\r\n Keywords = {Search-based Software Engineering, Metaheuristics, Bioinspired algorithms, Evolutionary algorithms},\r\n URL = {http://hdl.handle.net/11705/JISBD/2016/043}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Configuración guiada por búsqueda de aplicaciones basadas en microservicios en la nube.\n \n \n \n \n\n\n \n Parejo, J.; Ramírez, A.; Romero, J. R.; Segura, S.; and Ruiz-Cortés, A.\n\n\n \n\n\n\n In
XXI Jornadas en Ingeniería del Software y Bases de Datos (JISBD'16), pages 499-502, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Ramirez-2016-JISBD-2,\r\n Title = {Configuraci\\'on guiada por b\\'usqueda de aplicaciones basadas en microservicios en la nube},\r\n Author = {Parejo, J.A. and Ramírez, A. and Romero, J. R. and Segura, S. and Ruiz-Cortés, A.},\r\n Booktitle = {XXI Jornadas en Ingenier\\'ia del Software y Bases de Datos (JISBD'16)},\r\n Year = {2016},\r\n Pages = {499-502},\r\n ISBN = {978-84-9012-627-1},\r\n Keywords = {Search-based Software Engineering, Multi-objective Optimization},\r\n URL = {http://hdl.handle.net/11705/JISBD/2016/045}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Herramienta basada en computación evolutiva interactiva para arquitectos software.\n \n \n \n\n\n \n Ramírez, A.; Barbudo, R.; Romero, J. R.; and Ventura, S.\n\n\n \n\n\n\n In
XI Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB'16), pages 387-396, 2016. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Ramirez-2016-MAEB,\r\n Title = {Herramienta basada en computaci\\'on evolutiva interactiva para arquitectos software},\r\n Author = {Ramírez, A. and Barbudo, R. and Romero, J. R. and Ventura, S.},\r\n Booktitle = {XI Congreso Espa\\~nol sobre Metaheur\\'isticas, Algoritmos Evolutivos y Bioinspirados (MAEB'16)},\r\n Year = {2016},\r\n Pages = {387-396},\r\n ISBN = {978-84-9012-632-5},\r\n Keywords = {Search-based Software Engineering, Multi-objective Optimization, Metaheuristics, Bioinspired algorithms, Evolutionary algorithms, Software Design \\& Development}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n JCLAL: a Java framework for active learning.\n \n \n \n \n\n\n \n Reyes, O.; Pérez, E.; Rodríguez-Hernández, María, d. C.; Fardoun, H. M.; and Ventura, S.\n\n\n \n\n\n\n
Journal of Machine Learning Research, 17(95): 1-5. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@Article{reyes2016jclal,\r\n Title = {JCLAL: a Java framework for active learning},\r\n Author = {Reyes, O. and P{\\'e}rez, Eduardo and del Carmen Rodr{\\'i}guez-Hern{\\'a}ndez, Mar{\\'i}a and Fardoun, Habib M. and Ventura, S.},\r\n Journal = {Journal of Machine Learning Research},\r\n Year = {2016},\r\n Number = {95},\r\n Pages = {1-5},\r\n Volume = {17},\r\n Keywords = {Active Learning,Software Design \\& Development},\r\n URL = {http://jmlr.org/papers/v17/15-347.html}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Estrategia efectiva para el aprendizaje activo multi-etiqueta.\n \n \n \n\n\n \n Reyes, O.; and Ventura, S.\n\n\n \n\n\n\n In
XVII Conferencia de la Asociación Española para la Inteligencia Artificial, pages 835-844, 2016. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{reyesMLAL,\r\n Title = {Estrategia efectiva para el aprendizaje activo multi-etiqueta},\r\n Author = {Reyes, O. and Ventura, S.},\r\n Booktitle = {XVII Conferencia de la Asociación Española para la Inteligencia Artificial},\r\n Year = {2016},\r\n Pages = {835-844},\r\n Keywords = {Multi-label Learning,Active Learning}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Educational process mining: A tutorial and case study using moodle data sets.\n \n \n \n \n\n\n \n Romero, C.; Cerezo, R.; Bogarín, A.; and Sánchez-Santillán, M.\n\n\n \n\n\n\n In pages 1-28. 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@InCollection{Romero-2016-DMLA,\r\n Title = {Educational process mining: A tutorial and case study using moodle data sets},\r\n Author = {Romero, C. and Cerezo, R. and Bogarín, A. and Sánchez-Santillán, M.},\r\n Year = {2016},\r\n Pages = {1-28},\r\n DOI = {10.1002/9781118998205.ch1},\r\n Journal = {Data Mining And Learning Analytics: Applications in Educational Research},\r\n URL = {http://dx.doi.org/10.1016/10.1002/9781118998205.ch1}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Using Android Wear for Avoiding Procrastination Behaviours in MOOCs.\n \n \n \n \n\n\n \n Romero, C.; Cerezo, R.; Espino, J. A.; and Bermudez, M.\n\n\n \n\n\n\n In
Proceedings of the Third ACM Conference on Learning @ Scale, L@S 2016, Edinburgh, Scotland, UK, April 25 - 26, 2016, pages 193–196, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Romero-2016-LS,\r\n Title = {Using Android Wear for Avoiding Procrastination Behaviours in MOOCs},\r\n Author = {C. Romero and Rebeca Cerezo and Jose Antonio Espino and Manuel Bermudez},\r\n Booktitle = {Proceedings of the Third {ACM} Conference on Learning @ Scale, L@S 2016, Edinburgh, Scotland, UK, April 25 - 26, 2016},\r\n Year = {2016},\r\n Pages = {193--196},\r\n Bibsource = {dblp computer science bibliography, http://dblp.org},\r\n Biburl = {http://dblp.uni-trier.de/rec/bib/conf/lats/RomeroCEB16},\r\n DOI = {10.1145/2876034.2893412},\r\n Keywords = {Educational Data Mining,Educational Recommender Systems},\r\n Timestamp = {Mon, 09 May 2016 17:18:48 +0200},\r\n URL = {http://doi.acm.org/10.1145/2876034.2893412}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n Enabling the definition and reuse of multi-domain workflow-based data analysis.\n \n \n \n\n\n \n Salado-Cid, R.; and Romero, J. R.\n\n\n \n\n\n\n In
16th International Conference on Intelligent Systems Design and Applications (ISDA'16), 2016. \n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Salado-Cid2016-ISDA,\r\n Title = {Enabling the definition and reuse of multi-domain workflow-based data analysis},\r\n Author = {Salado-Cid, R. and Romero, J. R.},\r\n Booktitle = {16th International Conference on Intelligent Systems Design and Applications (ISDA'16)},\r\n Year = {2016},\r\n Keywords = {Scientific workflows, Data Science}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Lenguaje específico para el modelado de flujos de trabajo aplicados a ciencia de datos.\n \n \n \n \n\n\n \n Salado-Cid, R.; and Romero, J. R.\n\n\n \n\n\n\n In
XXI Jornadas en Ingeniería del Software y Bases de Datos (JISBD'16), pages 227-240, 2016. \n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{Salado-Cid2016-JISBD,\r\n Title = {Lenguaje espec\\'ifico para el modelado de flujos de trabajo aplicados a ciencia de datos},\r\n Author = {Salado-Cid, R. and Romero, J. R.},\r\n Booktitle = {XXI Jornadas en Ingenier\\'ia del Software y Bases de Datos (JISBD'16)},\r\n Year = {2016},\r\n Pages = {227-240},\r\n ISBN = {978-84-9012-627-1},\r\n Keywords = {Scientific workflows, Data Science},\r\n URL = {http://congresocedi.es/actas/downloads/LIBRO7-JISBD.pdf}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Pattern Mining with Evolutionary Algorithms.\n \n \n \n \n\n\n \n Ventura, S.; and Luna, J. M.\n\n\n \n\n\n\n Springer, 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Book{VenturaL16,\r\n Title = {Pattern Mining with Evolutionary Algorithms},\r\n Author = {S. Ventura and J. M. Luna},\r\n Publisher = {Springer},\r\n Year = {2016},\r\n DOI = {10.1007/978-3-319-33858-3},\r\n ISBN = {978-3-319-33857-6},\r\n Keywords = {Pattern Mining, Association Rule Mining, Genetic Programming, Grammar-Based Genetic Programming, Evolutionary Algorithms, Subgroup Discovery, Unsupervised Learning, Multi-objective Optimization, Bioinspired algorithms, Genetic Algorithms, Ant Programming, Unsupervised Learning},\r\n URL = {http://dx.doi.org/10.1007/978-3-319-33858-3}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n
\n\n \n \n \n \n \n \n Big Data on Real-World Applications.\n \n \n \n \n\n\n \n Ventura, S.; Luna, J. M.; and Cano, A.\n\n\n \n\n\n\n InTech, 1st edition, 2016.\n
\n\n
\n\n
\n\n
\n\n \n \n Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n \n \n\n\n\n
\n
@Book{VenturaLC16,\r\n Title = {Big Data on Real-World Applications},\r\n Author = {Ventura, S. and Luna, J. M. and Cano, A.},\r\n Publisher = {InTech},\r\n Year = {2016},\r\n Edition = {1st},\r\n DOI = {10.5772/61396},\r\n ISBN = {978-953-51-2490-0},\r\n Keywords = {Big Data Mining},\r\n URL = {http://www.intechopen.com/books/big-data-on-real-world-applications}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n\n\n\n\n\n