Using self organizing maps on compositional data

Self-organizing maps (Kohonen 1997) is a type of artificial neural network developedto explore patterns in high-dimensional multivariate data. The conventional versionof the algorithm involves the use of Euclidean metric in the process of adaptation ofthe model vectors, thus rendering in theory a whole methodology incompatible withnon-Euclidean geometries.In this contribution we explore the two main aspects of the problem:1. Whether the conventional approach using Euclidean metric can shed valid resultswith compositional data.2. If a modification of the conventional approach replacing vectorial sum and scalarmultiplication by the canonical operators in the simplex (i.e. perturbation andpowering) can converge to an adequate solution.Preliminary tests showed that both methodologies can be used on compositional data.However, the modified version of the algorithm performs poorer than the conventionalversion, in particular, when the data is pathological. Moreover, the conventional ap-proach converges faster to a solution, when data is \well-behaved".Key words: Self Organizing Map; Artificial Neural networks; Compositional data

Weighted Logratio Biplots, Correspondence Analysis and Spectral Maps

Starting with logratio biplots for compositional data, which are based on the principle of subcompositional coherence, and then adding weights, as in correspondence analysis, we rediscover Lewi's spectral map and many connections to analyses of two-way tables of non-negative data. Thanks to the weighting, the method also achieves the property of distributional equivalence

Identificació de paisatges funcionals mitjançant anàlisi cluster

El terme paisatge i les seves aplicacions són cada dia més utilitzats per les administracions i altres entitats com a eina de gestió del territori. Aprofitant la gran quantitat de dades en bases compatibles amb SIG (Sistemes d’Informació Geogràfica) existents a Catalunya s’ha desenvolupat una síntesi cartogràfica on s’identifiquen els Paisatges Funcionals (PF) de Catalunya, concepte que fa referència al comportament fisico-ecològic del terreny a partir de variables topogràfiques i climàtiques convenientment transformades i agregades. S’ha utilitzat un mètode semiautomàtic i iteratiu de classificació no supervisada (clustering) que permet la creació d’una llegenda jeràrquica o nivells de generalització. S’ha obtingut com a resultat el Mapa de Paisatges Funcionals de Catalunya (MPFC) amb una llegenda de 26 categories de paisatges i 5 nivells de generalització amb una resolució espacial de 180 m. Paral·lelament, s’han realitzat validacions indirectes sobre el mapa obtingut a partir dels coneixements naturalistes i la cartografia existent, així com també d’un mapa d’incertesa (aplicant lògica difusa) que aporten informació de la fiabilitat de la classificació realitzada. Els Paisatges Funcionals obtinguts permeten relacionar zones de condicions topo-climàtiques homogènies i dividir el territori en zones caracteritzades ambientalment i no políticament amb la intenció que sigui d’utilitat a l’hora de millorar la gestió dels recursos naturals i la planificació d’actuacions humanes.

Holomorphic maps between moduli spaces

We prove that every non-constant holomorphic map&em&M&/em&&sub&g,p&/sub&→ &em&M&/em&&sub& g',p'&/sub& between moduli spaces of Riemann surfaces is a forgetful map, provided that g ≥ 6 and g' ≤ 2g-2.

Integración de Google Maps y TSP Solvers para la definición y resolución del TSP

Este trabajo final de carrera presenta la arquitectura e implementación de un entorno web para la descripción y visualización de instancias reales del TSP (Travelling Salesman Problem), a través de Google Maps, y su posterior resoluación mediante tècnicas de optimización combinatoria.

Using a Parameterization of a Radiative Transfer Model to Build High-Resolution Maps of Typical Clear-Sky UV Index in Catalonia, Spain

To perform a climatic analysis of the annual UV index (UVI) variations in Catalonia, Spain (northeast of the Iberian Peninsula), a new simple parameterization scheme is presented based on a multilayer radiative transfer model. The parameterization performs fast UVI calculations for a wide range of cloudless and snow-free situations and can be applied anywhere. The following parameters are considered: solar zenith angle, total ozone column, altitude, aerosol optical depth, and single-scattering albedo. A sensitivity analysis is presented to justify this choice with special attention to aerosol information. Comparisons with the base model show good agreement, most of all for the most common cases, giving an absolute error within 0.2 in the UVI for a wide range of cases considered. Two tests are done to show the performance of the parameterization against UVI measurements. One uses data from a high-quality spectroradiometer from Lauder, New Zealand [45.04°S, 169.684°E, 370 m above mean sea level (MSL)], where there is a low presence of aerosols. The other uses data from a Robertson–Berger-type meter from Girona, Spain (41.97°N, 2.82°E, 100 m MSL), where there is more aerosol load and where it has been possible to study the effect of aerosol information on the model versus measurement comparison. The parameterization is applied to a climatic analysis of the annual UVI variation in Catalonia, showing the contributions of solar zenith angle, ozone, and aerosols. High-resolution seasonal maps of typical UV index values in Catalonia are presented

Ratio maps and correspondence analysis

We compare two methods for visualising contingency tables and developa method called the ratio map which combines the good properties of both.The first is a biplot based on the logratio approach to compositional dataanalysis. This approach is founded on the principle of subcompositionalcoherence, which assures that results are invariant to considering subsetsof the composition. The second approach, correspondence analysis, isbased on the chi-square approach to contingency table analysis. Acornerstone of correspondence analysis is the principle of distributionalequivalence, which assures invariance in the results when rows or columnswith identical conditional proportions are merged. Both methods may bedescribed as singular value decompositions of appropriately transformedmatrices. Correspondence analysis includes a weighting of the rows andcolumns proportional to the margins of the table. If this idea of row andcolumn weights is introduced into the logratio biplot, we obtain a methodwhich obeys both principles of subcompositional coherence and distributionalequivalence.

Regions of rationality: Maps for bounded agents

An important problem in descriptive and prescriptive research in decision making is to identify regions of rationality, i.e., the areas for which heuristics are and are not effective. To map the contours of such regions, we derive probabilities that heuristics identify the best of m alternatives (m > 2) characterized by k attributes or cues (k > 1). The heuristics include a single variable (lexicographic), variations of elimination-by-aspects, equal weighting, hybrids of the preceding, and models exploiting dominance. We use twenty simulated and four empirical datasets for illustration. We further provide an overview by regressing heuristic performance on factors characterizing environments. Overall, sensible heuristics generally yield similar choices in many environments. However, selection of the appropriate heuristic can be important in some regions (e.g., if there is low inter-correlation among attributes/cues). Since our work assumes a hit or miss decision criterion, we conclude by outlining extensions for exploring the effects of different loss functions.

Extensions of maps defined on many fibres

Let S be a fibred surface. We prove that the existence of morphisms from non countably many fibres to curves implies, up to base change, the existence of a rational map from S to another surface fibred over the same base reflecting the properties of the original morphisms. Under some conditions of unicity base change is not needed and one recovers exactly the initial maps.

Gas identification with tin oxide sensor array and self-organizing maps: adaptive correction of sensor drifts

Low-cost tin oxide gas sensors are inherently nonspecific. In addition, they have several undesirable characteristics such as slow response, nonlinearities, and long-term drifts. This paper shows that the combination of a gas-sensor array together with self-organizing maps (SOM's) permit success in gas classification problems. The system is able to determine the gas present in an atmosphere with error rates lower than 3%. Correction of the sensor's drift with an adaptive SOM has also been investigated

Strange nonchaotic attractors in Harper maps

We study the existence of strange nonchaotic attractors (SNA) in the family of Harper maps. We prove that for a set of parameters of positive measure, the map possesses a SNA. However, the set is nowhere dense. By changing the parameter arbitrarily small amounts, the attractor is a smooth curve and not a SNA.

Periodic points of holomorphic maps via Lefschetz numbers

In this paper we study the set of periods of holomorphic maps on compact manifolds, using the periodic Lefschetz numbers introduced by Dold and Llibre, which can be computed from the homology class of the map. We show that these numbers contain information about the existence of periodic points of a given period; and, if we assume the map to be transversal, then they give us the exact number of such periodic orbits. We apply this result to the complex projective space of dimension n and to some special type of Hopf surfaces, partially characterizing their set of periods. In the first case we also show that any holomorphic map of CP(n) of degree greater than one has infinitely many distinct periodic orbits, hence generalizing a theorem of Fornaess and Sibony. We then characterize the set of periods of a holomorphic map on the Riemann sphere, hence giving an alternative proof of Baker's theorem.

Let's K-Map Play: Juego de aprendizaje de Karnagh Maps para móvil

En este informe se describe el trabajo de fin de máster, centrado en el estudio de la gamificación como herramienta de aprendizaje aplicada a dispositivos móviles. Se ha realizado una revisión de los artículos científicos que tratan sobre el tema de la gamificación como herramienta educativa,para terminar el trabajo desarrollando un prototipo de juego para el aprendizaje de mapas de Karnaugh. Se ha optado por un desarrollo multiplataforma y se han revisado los frameworks de desarrollo más populares para desarrollo móvil multiplataforma así como los motores de juegos aplicables a este caso. Tras la implementación, se ha probado el prototipo en dos sistemas operativos móviles libres: Android y Firefox OS.