Mining minimal non-redundant association rules using frequent closed itemsets

The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies. Using the closure of the Galois connection, we define two new bases for association rules which union is a generating set for all valid association rules with support and confidence. These bases are characterized using frequent closed itemsets and their generators; they consist of the non-redundant exact and approximate association rules having minimal antecedents and maximal consequences, i.e. the most relevant association rules. Algorithms for extracting these bases are presented and results of experiments carried out on real-life databases show that the proposed bases are useful, and that their generation is not time consuming.

Intelligent structuring and reducing of association rules with formal concept analysis

Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.

Mining association rules in folksonomies

Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. These systems provide currently relatively few structure. We discuss in this paper, how association rule mining can be adopted to analyze and structure folksonomies, and how the results can be used for ontology learning and supporting emergent semantics. We demonstrate our approach on a large scale dataset stemming from an online system.

Efficient mining of association rules based on formal concept analysis

Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to Formal Concept Analysis (FCA). In this survey, we will first introduce some basic ideas of this connection along a specific algorithm, TITANIC, and show how FCA helps in reducing the number of resulting rules without loss of information, before giving a general overview over the history and state of the art of applying FCA for association rule mining.

Un análisis comparativo del papel del bucle fonológico versus la agenda visoespacial en el cálculo en niños de 7-8 años = A comparative analysis of the phonological loop versus the visuo-spatial sketchpad in mental arithmetic tasks in 7-8 y.o. children

En esta investigación se ha estudiado la relación entre dos subsistemas de la memoria de trabajo (bucle fonológico y agenda viso-espacial) y el rendimiento en cálculo con una muestra de 94 niños españoles de 7-8 años. Hemos administrado dos pruebas de cálculo diseñadas para este estudio y seis medidas simples de memoria de trabajo (de contenido verbal, numérico y espacial) de la «Batería de Tests de Memoria de Treball» de Pickering, Baqués y Gathercole (1999), y dos pruebas visuales complementarias. Los resultados muestran una correlación importante entre las medidas de contenido verbal y numérico y el rendimiento en cálculo. En cambio, no hemos encontrado ninguna relación con las medidas espaciales. Se concluye, por lo tanto, que en escolares españoles existe una relación importante entre el bucle fonológico y el rendimiento en tareas de cálculo. En cambio, el rol de la agenda viso-espacial es nulo

Drug Administration: rules and regulations for health care practitioners

These narrated slides explain the roles, responsibilites and practicalities in administering drugs. Although it has been developed with student nurses and midwives in mind it will be of use to students of all health care professions.

Rules

SPIN Jena Rules SWRL - Semantic Web Rule Language

Allocation rules on networks

When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a transfer from the source to the agent. Given the supplies at each source, the claims of citizens, and the network, the question is how to allocate the available resources among the citizens. We consider a simple allocation problem that is free of network constraints, where the total amount can be freely distributed. The simple allocation problem is a claims problem where the total amount of claims is greater than what is available. We focus on consistent and resource monotonic rules in claims problems that satisfy equal treatment of equals. We call these rules fairness principles and we extend fairness principles to allocation rules on networks. We require that for each pair of citizens in the network, the extension is robust with respect to the fairness principle. We call this condition pairwise robustness with respect to the fairness principle. We provide an algorithm and show that each fairness principle has a unique extension which is pairwise robust with respect to the fairness principle. We give applications of the algorithm for three fairness principles: egalitarianism, proportionality and equal sacrifice.

Asymmetrically fair rules for an indivisible good problem with a budget constraint

We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other. There is also a maximum amount of money available for the compensation. We characterize a family of asymmetrically fair rules that are immune to strategic behavior, guarantee minimal welfare levels for the agents, and satisfy the budget constraint.

Phonological short term memory in deaf children fitted with a cochlear implant : effects of phonological similarity, word lenght and lipreading cues. 'La memoria fonológica a corto plazo en niños sordos con implante coclear : efectos de la similitud fonológica, la longitud de la palabra y la lectura labial'.

Resumen basado en el de la publicación. Resumen en español

Following rules.

La publicación forma parte de una colección que tiene como objetivo dar a los menores conocimientos y habilidades para ser buenos ciudadanos. En este trabajo los niños ven las diversas situaciones que demuestran la importancia de respetar las normas; trata principios como compartir, tomar turnos y seguir las reglas. Antes de la lectura hablarles acerca de las reglas. Después de la lectura se recomienda dialogar con ellos acerca de las normas que hacen la vida más cómoda para el profesor y la clase. El texto, sencillo, ayuda a los lectores a tomar decisiones y entender cómo sus acciones afectan a otras personas. Las ilustraciones se utilizan para reforzar la comprensión de este concepto.