Bide-hautaketa problema, optimizazio problema: zenbait ebaspide

Lan honen helburua, irakurlea bide-hautaketa problemen garrantziaz ohartarazi eta horiek ebazteko erabil daitezkeen metodo desberdinak aipatzea da. Bide-hautaketa problema zehatz bat deskribatzeaz gain, hau ebazteko bibliografian topa daitezkeen aukerak azaltzen dira bertan

Characterization of e-Government adoption in Europe

The digital divide in Europe has not yet been bridged and thus more contributions towards understanding the factors affecting the different dimensions involved are required. This research offers some insights into the topic by analyzing the e-Government adoption or practical use of e-Government across Europe (26 EU countries). Based on the data provided by the statistical office of the European Union (Eurostat), we defined two indexes, the E-Government Use Index (EGUI) and an extreme version of it taking into account only null or complete use (EGUI+), and characterized the use/non use of e-Government tools using supervised learning procedures in a selection of countries with different e-Government adoption levels. These procedures achieved an average accuracy of 73% and determined the main factors related to the practical use of e-Government in each of the countries, e.g. the frequency of buying goods over the Internet or the education level. In addition, we compared the proposed indexes to other indexes measuring the level of e-readiness of a country such as the E-Government Development Index (EGDI) its Online Service Index (OSI) component, the Networked Readiness Index (NRI) and its Government usage component (GU). The ranking comparison found that EGUI+ is correlated with the four indexes mentioned at 0.05 significance level, as the majority of countries were ranked in similar positions. The outcomes contribute to gaining understanding about the factors influencing the use of e-Government in Europe and the different adoption levels

J48Consolidated: an implementation of CTC algorithm for WEKA

The CTC algorithm, Consolidated Tree Construction algorithm, is a machine learning paradigm that was designed to solve a class imbalance problem, a fraud detection problem in the area of car insurance [1] where, besides, an explanation about the classification made was required. The algorithm is based on a decision tree construction algorithm, in this case the well-known C4.5, but it extracts knowledge from data using a set of samples instead of a single one as C4.5 does. In contrast to other methodologies based on several samples to build a classifier, such as bagging, the CTC builds a single tree and as a consequence, it obtains comprehensible classifiers. The main motivation of this implementation is to make public and available an implementation of the CTC algorithm. With this purpose we have implemented the algorithm within the well-known WEKA data mining environment http://www.cs.waikato.ac.nz/ml/weka/). WEKA is an open source project that contains a collection of machine learning algorithms written in Java for data mining tasks. J48 is the implementation of C4.5 algorithm within the WEKA package. We called J48Consolidated to the implementation of CTC algorithm based on the J48 Java class

An update of the J48Consolidated WEKA’s class: CTC algorithm enhanced with the notion of coverage

This document aims to describe an update of the implementation of the J48Consolidated class within WEKA platform. The J48Consolidated class implements the CTC algorithm [2][3] which builds a unique decision tree based on a set of samples. The J48Consolidated class extends WEKA’s J48 class which implements the well-known C4.5 algorithm. This implementation was described in the technical report "J48Consolidated: An implementation of CTC algorithm for WEKA". The main, but not only, change in this update is the integration of the notion of coverage in order to determine the number of samples to be generated to build a consolidated tree. We define coverage as the percentage of examples of the training sample present in –or covered by– the set of generated subsamples. So, depending on the type of samples that we use, we will need more or less samples in order to achieve a specific value of coverage

JolasMATIKA: An Experience for Teaching and Learning Computing Topics From University to Primary Education

Contribution: A learning-by-teaching methodology through games can be used to promote informatics (computer science) in primary and secondary education. Applying the proposed activities can change students' perception of informatics from seeing it as merely using computers to seeing its relationship with mathematics. The experience can also help students acquire competences in teaching. Background: Although students, specifically in primary and secondary education, are increasingly competent in terms of technology use, it has been found that in many cases informatics, as a science, has been relegated to a secondary status; it is usually considered only as a tool or additional resource, and not as an object of study. Intended Outcomes: To refine the application of the learning-to-teach-to-learn (L2T2L) methodology, a learning-by-teaching methodology that has students learn and then, in turn, teach that learning to younger students, in cascade from university to secondary to primary students. To analyze its effects on students' attitudes toward informatics. Application Design: The model incorporates a learning-by-teaching approach in a multistage sequence across different kinds of learners and teachers, using fun, game-like materials. Findings: The use of the action research methodology allowed adjustment of the educational methodology, providing more reliable data and enough experience to suggest how to extend the project to a broader audience. Although the results obtained were less significant than expected, the experience did give students a more realistic view of informatics.This work was supported in part by the Faculty of Informatics of the University of the Basque Country (UPV/EHU), in part by the Gipuzkoako Foru Aldundia (Etorkizuna Eraikiz 2019 Program), in part by UPV/EHU under Grant HBT-Adituak2018-19/6, in part by the Ministry of Economy and Competitiveness of the Spanish Government and the European Regional Development Fund under Project TIN2017-85409-P, and in part by the Basque Government under ADIAN Grant IT980-16. (All authors contributed equally to this work.

Programazio Paraleloa: MPI

Duración (en horas): Más de 50 horas Destinatario: Estudiante y DocenteProgramazio paraleloko arloan proiektu bat garatu beharko dute ikasleek. Horretarako, memoria banatuko sistema bat erabiliko dute, kalkuluko cluster bat, hain zuzen ere. Proiektuaren bidez, balizko enkargu profesional bat ebatzi beharko dute (proiektu honetan, beroaren difusioa simulatzen duen algoritmo paralelo bat programatu beharko dute). Programa paraleloa garatzeko, MPI estandarra erabiliko da. Ikasleak taldetan banatuko dira. Hasteko, memoria banatuko makinetan programa paraleloak sortzeko ageri diren arazo nagusiak landuko dituzte puzzle motako jarduera erabiliz: (a) komunikazio kolektiboak, (b) datu-mota deribatuak eta komunikatzaileak, eta (c) lan-kargaren banaketa dinamikoa (manager-worker eredua), eta mugen arazoa datuak banatzerakoan. Ondoren, aplikazioa paralelizatzeari ekingo diote, eta lortutako errendimendua aztertu. Proiektua bukatzeko, talde bakoitzak egindako lana eta lortutako emaitzak aurkeztuko ditu

PCTBagging: From inner ensembles to ensembles. A trade-off between discriminating capacity and interpretability

[EN] The use of decision trees considerably improves the discriminating capacity of ensemble classifiers. However, this process results in the classifiers no longer being interpretable, although comprehensibility is a desired trait of decision trees. Consolidation (consolidated tree construction algorithm, CTC) was introduced to improve the discriminating capacity of decision trees, whereby a set of samples is used to build the consolidated tree without sacrificing transparency. In this work, PCTBagging is presented as a hybrid approach between bagging and a consolidated tree such that part of the comprehensibility of the consolidated tree is maintained while also improving the discriminating capacity. The consolidated tree is first developed up to a certain point and then typical bagging is performed for each sample. The part of the consolidated tree to be initially developed is configured by setting a consolidation percentage. In this work, 11 different consolidation percentages are considered for PCTBagging to effectively analyse the trade-off between comprehensibility and discriminating capacity. The results of PCTBagging are compared to those of bagging, CTC and C4.5, which serves as the base for all other algorithms. PCTBagging, with a low consolidation percentage, achieves a discriminating capacity similar to that of bagging while maintaining part of the interpretable structure of the consolidated tree. PCTBagging with a consolidation percentage of 100% offers the same comprehensibility as CTC, but achieves a significantly greater discriminating capacity.This work was funded by the Department of Education, Universities and Research of the Basque Government (ADIAN, IT980-16); and by the Ministry of Economy and Competitiveness of the Spanish Government and the European Regional Development Fund -ERDF (PhysComp, TIN2017-85409-P). We would also like to thank our former undergraduate student Ander Otsoa de Alda, who participated in the implementation of the PCTBagging algorithm for the WEKA platform

Datuetatik ezagutzara. Web orrietan nabigatzean utzitako aztarna abiapuntu

Teknologia berriak direla medio informazio asko metatzen da gaur egun eta gainera, gehiena formatu digitalean. Askotan, informazio hori kontzienteki gordetzen da eta beste hainbatetan berriz, gure ekintzen albo ondorio gisa. Metatutako informazio hori guztia, zergatik ez erabili datuetan bertan ez dagoen ezagutza sortzeko? Hauxe da datu-meatzaritza eta ikasketa automatikoko tekniken helburua. Webguneetan nabigatzen dugunean uzten dugun aztarna izan liteke datu-meatzaritzak zukua atera diezaiokeen datu multzoetako bat. Lortutako ezagutzak erabilera anitz di tu: baliabideak egokitzea edo webgunea pertsona1izatzea, gomendio sistema baten oinarri izatea edo zerbitzu-emaileari bere webgunean nabigatzen duten erabiltzaile moten berri ematea. Ezagutza hori lortzeko erabil litezkeen tresnak eta prozesua deskribatzea da artikulu honen helburua

Diplomatie Ja, Militär Nein: Deutschland sollte einer Mission am Golf fernbleiben

Die deutsche Regierung erwägt, sich an einer Mission in der Straße von Hormus zur Beobachtung und Sicherung der freien Seefahrt zu beteiligen. Ohne ein Kooperationsgesuch von Staaten im Golf birgt eine solche Entsendung hohe Risiken für eine weitere Eskalation. Frankreichs diplomatischer Vorstoß beim G7-Gipfel in Biarritz ist ein wichtiger Schritt, den Konflikt mit Iran zu entschärfen. Auch Deutschland sollte neue diplomatische Wege einschlagen und einen Gegenpol zur US-Politik bilden