Applying Associative Classifier PGN for Digitised Cultural Heritage Resource Discovery

Resource discovery is one of the key services in digitised cultural heritage collections. It requires intelligent mining in heterogeneous digital content as well as capabilities in large scale performance; this explains the recent advances in classification methods. Associative classifiers are convenient data mining tools used in the field of cultural heritage, by applying their possibilities to taking into account the specific combinations of the attribute values. Usually, the associative classifiers prioritize the support over the confidence. The proposed classifier PGN questions this common approach and focuses on confidence first by retaining only 100% confidence rules. The classification tasks in the field of cultural heritage usually deal with data sets with many class labels. This variety is caused by the richness of accumulated culture during the centuries. Comparisons of classifier PGN with other classifiers, such as OneR, JRip and J48, show the competitiveness of PGN in recognizing multi-class datasets on collections of masterpieces from different West and East European Fine Art authors and movements.

Análise de desempenho dos algoritmos Apriori e Fuzzy Apriori na extração de regras de associação aplicados a um Sistema de Detecção de Intrusos.

A extração de regras de associação (ARM - Association Rule Mining) de dados quantitativos tem sido pesquisa de grande interesse na área de mineração de dados. Com o crescente aumento das bases de dados, há um grande investimento na área de pesquisa na criação de algoritmos para melhorar o desempenho relacionado a quantidade de regras, sua relevância e a performance computacional. O algoritmo APRIORI, tradicionalmente usado na extração de regras de associação, foi criado originalmente para trabalhar com atributos categóricos. Geralmente, para usá-lo com atributos contínuos, ou quantitativos, é necessário transformar os atributos contínuos, discretizando-os e, portanto, criando categorias a partir dos intervalos discretos. Os métodos mais tradicionais de discretização produzem intervalos com fronteiras sharp, que podem subestimar ou superestimar elementos próximos dos limites das partições, e portanto levar a uma representação imprecisa de semântica. Uma maneira de tratar este problema é criar partições soft, com limites suavizados. Neste trabalho é utilizada uma partição fuzzy das variáveis contínuas, que baseia-se na teoria dos conjuntos fuzzy e transforma os atributos quantitativos em partições de termos linguísticos. Os algoritmos de mineração de regras de associação fuzzy (FARM - Fuzzy Association Rule Mining) trabalham com este princípio e, neste trabalho, o algoritmo FUZZYAPRIORI, que pertence a esta categoria, é utilizado. As regras extraídas são expressas em termos linguísticos, o que é mais natural e interpretável pelo raciocício humano. Os algoritmos APRIORI tradicional e FUZZYAPRIORI são comparado, através de classificadores associativos, baseados em regras extraídas por estes algoritmos. Estes classificadores foram aplicados em uma base de dados relativa a registros de conexões TCP/IP que destina-se à criação de um Sistema de Detecção de Intrusos.

MPGN – An Approach for Discovering Class Association Rules

his article presents some of the results of the Ph.D. thesis Class Association Rule Mining Using MultiDimensional Numbered Information Spaces by Iliya Mitov (Institute of Mathematics and Informatics, BAS), successfully defended at Hasselt University, Faculty of Science on 15 November 2011 in Belgium

Classifier PGN: Classification with High Confidence Rules

ACM Computing Classification System (1998): H.2.8, H.3.3.

Three-dimensional hydrogen-bonded structures in the 1:1 proton-transfer compounds of L-tartaric acid with the associative-group monosubstituted pyridines 3-minopyridine, 3-carboxypyridine (nicotinic acid) and 2-carboxypyridine (picolinic acid).

The 1:1 proton-transfer compounds of L-tartaric acid with 3-aminopyridine [3-aminopyridinium hydrogen (2R,3R)-tartrate dihydrate, C5H7N2+·C4H5O6-·2H2O, (I)], pyridine-3-carboxylic acid (nicotinic acid) [anhydrous 3-carboxypyridinium hydrogen (2R,3R)-tartrate, C6H6NO2+·C4H5O6-, (II)] and pyridine-2-carboxylic acid [2-carboxypyridinium hydrogen (2R,3R)-tartrate monohydrate, C6H6NO2+·C4H5O6-·H2O, (III)] have been determined. In (I) and (II), there is a direct pyridinium-carboxyl N+-HO hydrogen-bonding interaction, four-centred in (II), giving conjoint cyclic R12(5) associations. In contrast, the N-HO association in (III) is with a water O-atom acceptor, which provides links to separate tartrate anions through Ohydroxy acceptors. All three compounds have the head-to-tail C(7) hydrogen-bonded chain substructures commonly associated with 1:1 proton-transfer hydrogen tartrate salts. These chains are extended into two-dimensional sheets which, in hydrates (I) and (III) additionally involve the solvent water molecules. Three-dimensional hydrogen-bonded structures are generated via crosslinking through the associative functional groups of the substituted pyridinium cations. In the sheet struture of (I), both water molecules act as donors and acceptors in interactions with separate carboxyl and hydroxy O-atom acceptors of the primary tartrate chains, closing conjoint cyclic R44(8), R34(11) and R33(12) associations. Also, in (II) and (III) there are strong cation carboxyl-carboxyl O-HO hydrogen bonds [OO = 2.5387 (17) Å in (II) and 2.441 (3) Å in (III)], which in (II) form part of a cyclic R22(6) inter-sheet association. This series of heteroaromatic Lewis base-hydrogen L-tartrate salts provides further examples of molecular assembly facilitated by the presence of the classical two-dimensional hydrogen-bonded hydrogen tartrate or hydrogen tartrate-water sheet substructures which are expanded into three-dimensional frameworks via peripheral cation bifunctional substituent-group crosslinking interactions.

Fuzzy associative memory for humanoid robot joint control

Traditional approaches to joint control required accurate modelling of the system dynamic of the plant in question. Fuzzy Associative Memory (FAM) control schemes allow adequate control without a model of the system to be controlled. This paper presents a FAM based joint controller implemented on a humanoid robot. An empirically tuned PI velocity control loop is augmented with this feed forward FAM, with considerable reduction in joint position error achieved online and with minimal additional computational overhead.

Applying incremental EM to Bayesian classifiers in the learning of hyperspectral remote sensing data

In this paper, we apply the incremental EM method to Bayesian Network Classifiers to learn and interpret hyperspectral sensor data in robotic planetary missions. Hyperspectral image spectroscopy is an emerging technique for geological investigations from airborne or orbital sensors. Many spacecraft carry spectroscopic equipment as wavelengths outside the visible light in the electromagnetic spectrum give much greater information about an object. The algorithm used is an extension to the standard Expectation Maximisation (EM). The incremental method allows us to learn and interpret the data as they become available. Two Bayesian network classifiers were tested: the Naive Bayes, and the Tree-Augmented-Naive Bayes structures. Our preliminary experiments show that incremental learning with unlabelled data can improve the accuracy of the classifier.

Associative Pavlovian conditioning leads to an increase in spinophilin-immunoreactive dendritic spines in the lateral amygdala

Changes in dendritic spine number and shape are believed to reflect structural plasticity consequent to learning. Previous studies have strongly suggested that the dorsal subnucleus of the lateral amygdala is an important site of physiological plasticity in Pavlovian fear conditioning. In the present study, we examined the effect of auditory fear conditioning on dendritic spine numbers in the dorsal subnucleus of the lateral amygdala using an immunolabelling procedure to visualize the spine-associated protein spinophilin. Associatively conditioned rats that received paired tone and shock presentations had 35% more total spinophilin-immunoreactive spines than animals that had unpaired stimulation, consistent with the idea that changes in the number of dendritic spines occur during learning and account in part for memory.

Support for an auto-associative model of spoken cued recall: Evidence from fMRI

Cued recall and item recognition are considered the standard episodic memory retrieval tasks. However, only the neural correlates of the latter have been studied in detail with fMRI. Using an event-related fMRI experimental design that permits spoken responses, we tested hypotheses from an auto-associative model of cued recall and item recognition [Chappell, M., & Humphreys, M. S. (1994). An auto-associative neural network for sparse representations: Analysis and application to models of recognition and cued recall. Psychological Review, 101, 103-128]. In brief, the model assumes that cues elicit a network of phonological short term memory (STM) and semantic long term memory (LTM) representations distributed throughout the neocortex as patterns of sparse activations. This information is transferred to the hippocampus which converges upon the item closest to a stored pattern and outputs a response. Word pairs were learned from a study list, with one member of the pair serving as the cue at test. Unstudied words were also intermingled at test in order to provide an analogue of yes/no recognition tasks. Compared to incorrectly rejected studied items (misses) and correctly rejected (CR) unstudied items, correctly recalled items (hits) elicited increased responses in the left hippocampus and neocortical regions including the left inferior prefrontal cortex (LIPC), left mid lateral temporal cortex and inferior parietal cortex, consistent with predictions from the model. This network was very similar to that observed in yes/no recognition studies, supporting proposals that cued recall and item recognition involve common rather than separate mechanisms.

Complex symbolic sequence clustering and multiple classifiers for predictive process monitoring

This paper addresses the following predictive business process monitoring problem: Given the execution trace of an ongoing case,and given a set of traces of historical (completed) cases, predict the most likely outcome of the ongoing case. In this context, a trace refers to a sequence of events with corresponding payloads, where a payload consists of a set of attribute-value pairs. Meanwhile, an outcome refers to a label associated to completed cases, like, for example, a label indicating that a given case completed “on time” (with respect to a given desired duration) or “late”, or a label indicating that a given case led to a customer complaint or not. The paper tackles this problem via a two-phased approach. In the first phase, prefixes of historical cases are encoded using complex symbolic sequences and clustered. In the second phase, a classifier is built for each of the clusters. To predict the outcome of an ongoing case at runtime given its (uncompleted) trace, we select the closest cluster(s) to the trace in question and apply the respective classifier(s), taking into account the Euclidean distance of the trace from the center of the clusters. We consider two families of clustering algorithms – hierarchical clustering and k-medoids – and use random forests for classification. The approach was evaluated on four real-life datasets.