Search results for "Complexity"
showing 10 items of 1094 documents
A local complexity based combination method for decision forests trained with high-dimensional data
2012
Accurate machine learning with high-dimensional data is affected by phenomena known as the “curse” of dimensionality. One of the main strategies explored in the last decade to deal with this problem is the use of multi-classifier systems. Several of such approaches are inspired by the Random Subspace Method for the construction of decision forests. Furthermore, other studies rely on estimations of the individual classifiers' competence, to enhance the combination in the multi-classifier and improve the accuracy. We propose a competence estimate which is based on local complexity measurements, to perform a weighted average combination of the decision forest. Experimental results show how thi…
Calcification is not the Achilles' heel of cold-water corals in an acidifying ocean
2015
Ocean acidification is thought to be a major threat to coral reefs: laboratory evidence and CO2 seep research has shown adverse effects on many coral species, although a few are resilient. There are concerns that cold-water corals are even more vulnerable as they live in areas where aragonite saturation (?ara) is lower than in the tropics and is falling rapidly due to CO2 emissions. Here, we provide laboratory evidence that net (gross calcification minus dissolution) and gross calcification rates of three common cold-water corals, Caryophyllia smithii, Dendrophyllia cornigera, and Desmophyllum dianthus, are not affected by pCO2 levels expected for 2100 (pCO2 1058 ?atm, ?ara 1.29), and nor a…
More Support for More-Support
2009
This book provides the most comprehensive account so far of novel and hitherto unexplained factors operative in the choice between synthetic ( prouder ) and analytic ( more proud ) comparatives. It argues that the underlying motivation in using the analytic variant is to mitigate processing demands – a compensatory strategy referred to as more -support. The analytic variant is claimed to be better suited to environments of increased processing complexity – presumably owing to its ability to facilitate early phrase structure recognition, the more transparent one-to-one relation between form and function and possibly because the degree marker more can serve as a structural signal foreshadowin…
Overt and hidden complexity – Two types of complexity and their implications
2014
AbstractLinguistic complexity is the result of the two motivations of explicitness and economy. Most approaches focus on the exlpicitness side of complexity (overt complexity) but there is also an explicitness-oriented side to complexity (hidden complexity). The aim of the paper is to introduce hidden complexity as the neglected side of complexity and to discuss the issues of trade-offs, global complexity and equal complexity from a more encompassing perspective that integrates overt and hidden complexity.
MINIMALIST THEORY OF FICTION AND THE ICTHINKING® METHOD AS A BACKGROUND FOR NEW INSIGHTS TO AUTISM
2021
The standard approach to conceptual understanding in the case of autism uses the distinction of abstract versus concrete thinking. This approach has its benefits but fails to explain all features of language use. For example, some concepts change their meaning in different contexts in contrast to concepts that are more rigid in their uses, such as mathematical concepts. This idea has its background in Minimalist theory of fiction (MTF), a theory that considers ‘skills to use words’ essential for understanding fiction, contrasting with theories that require pretending or make believe to understand fiction. From this background, the theory of Integrative Complexity (IC), and the method animat…
Swarming Models for Facilitating Collaborative Decisions
2010
The paper highlights the computational power of swarming models (i.e., stigmergic mechanisms) to build collaborative support systems for complex cognitive tasks such as facilitation of group decision processes (GDP) in e-meetings. Unlike traditional approaches that minimize the cognitive complexity by incorporating the facilitation knowledge into the system, stigmergic coordination mechanisms minimize the complexity by providing the system with emergent functionalities that are shaped by the environment itself through the possibility to structure it in terms of high-level cognitive artefacts. This is illustrated by conducting a socio-simulation experiment for an envisioned collaborative sof…
Modelling complex dynamics and distributed generation of knowledge with bacterial-based algorithms
2014
Este estudio tuvo como objetivo demostrar que las sociedades conectadas y heterogéneas con intercambios entre pares (P2P) son más resilientes que las centralizadas y homogéneas. En el modelado basado en agentes, se modelizan agentes con racionalidad limitada que interactúan en un entorno común guiado por reglas locales, lo que lleva a Sistemas Adaptativos Complejos (CAS) que se denominan 'sociedades artificiales'. Estos modelos simplificados de sociedades humanas crecen de abajo hacia arriba en entornos computacionales y pueden utilizarse como un laboratorio para probar algunas hipótesis. Hemos demostrado que en un modelo basado en interacciones libres entre agentes autónomos, los resultado…
Exceptional Configurations of Quantum Walks with Grover’s Coin
2016
We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation -- Grover's diffusion transformation -- has a wide class of exceptional configurations of marked locations, for which the probability of finding any of the marked locations does not grow over time. This extends the class of known exceptional configurations; until now the only known such configuration was the "diagonal construction" by [AR08].
"Indexing structures for approximate string matching
2003
In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up to a certain distance, is proportional on average to |x| + |occ(x)|, under an additional but realistic hypothesis.
Tighter Relations between Sensitivity and Other Complexity Measures
2014
The sensitivity conjecture of Nisan and Szegedy [12] asks whether the maximum sensitivity of a Boolean function is polynomially related to the other major complexity measures of Boolean functions. Despite major advances in analysis of Boolean functions in the past decade, the problem remains wide open with no positive result toward the conjecture since the work of Kenyon and Kutin from 2004 [11].