865 resultados para Associative classifier
Resumo:
Frequency of exposure to very low- and high-frequency words was manipulated in a three-phase (familiarisation, study, and test) design. During familiarisation, words were presented with their definition (once, four times, or not presented). One week (Experiment 1) or one day (Experiment 2) later, participants studied a list of homogeneous pairs (i.e., pair members were matched on background and familiarisation frequency). Item and associative recognition of high- and very low-frequency words presented in intact, rearranged, old-new, or new-new pairs were tested in Experiment 1. Associative recognition of very low-frequency words was tested in Experiment 2. Results showed that prior familiaris ation improved associative recognition of very low-frequency pairs, but had no effect on high-frequency pairs. The role of meaning in the formation of item-to-item and item-to-context associations and the implications for current models of memory are discussed.
Resumo:
The indefinite determiner yi 'one'+ classifier' is the most approximate to an indefinite article, like the English a, in Chinese. It serves all the functions characteristic of representative stages of grammaticalization from a numeral to a generalized indefinite determiner as elaborated in the literature. It is established in this paper that the Chinese indefinite determiner has developed a special use with definite expressions, serving as a backgrounding device marking entities as of low thematic importance and unlikely to receive subsequent mentions in ensuing discourse. 'yi+ classifier' in the special use with definite expressions displays striking similarities in terms of semantic bleaching and phonological reduction with the same determiner at the advanced stage of grammaticalization characterized by uses with generics, nonspecifics and nonreferentials. An explanation is offered in terms of an implicational relation between nonreferentiality and low thematic importance which characterize the two uses of the indefinite determiner. While providing another piece of evidence in support of the claim that semantically nonreferentials and entities of low thematic importance tend to be encoded in terms of same linguistic devices in language, findings in this paper have shown how an indefinite determiner can undergo a higher degree of grammaticalization than has been reported in the literature-it expands its scope to mark not only indefinite but also definite expressions as semantically nonreferential and/or thematically unimportant. (C) 2003 Elsevier B.V. All rights reserved.
Resumo:
Merkel cell carcinoma (MCC) is a rare aggressive skin tumor which shares histopathological and genetic features with small-cell lung carcinoma (SCLC), both are of neuroendocrine origin. Comparable to SCLC, MCC cell lines are classified into two different biochemical subgroups designated as 'Classic' and 'Variant'. With the aim to identify typical gene-expression signatures associated with these phenotypically different MCC cell lines subgroups and to search for differentially expressed genes between MCC and SCLC, we used cDNA arrays to pro. le 10 MCC cell lines and four SCLC cell lines. Using significance analysis of microarrays, we defined a set of 76 differentially expressed genes that allowed unequivocal identification of Classic and Variant MCC subgroups. We assume that the differential expression levels of some of these genes reflect, analogous to SCLC, the different biological and clinical properties of Classic and Variant MCC phenotypes. Therefore, they may serve as useful prognostic markers and potential targets for the development of new therapeutic interventions specific for each subgroup. Moreover, our analysis identified 17 powerful classifier genes capable of discriminating MCC from SCLC. Real-time quantitative RT-PCR analysis of these genes on 26 additional MCC and SCLC samples confirmed their diagnostic classification potential, opening opportunities for new investigations into these aggressive cancers.
Resumo:
The first part of this research assessed the longitudinal relationships between alcohol- related associative strength and alcohol use measured at two time- points, 6 months apart. Cross-lagged results support the utility of alcohol- related associative strength to predict drinking behaviours prospectively and vice versa. These results remained after competing explanations of previous use, autocorrelations between memory measures, sensation seeking and background variables of age and gender were accounted for. Findings offer further evidence for an implicit cognitions approach to drinking processes. In the second part of our study, cross-sectional analysis investigated potential mediating mechanisms in the relation of associative strength to quantity and frequency dimensions of drinking. Mediational models provide preliminary evidence that implicit memory processes may have differential effects on quantity and frequency dimensions of drinking behaviours. The results point to the possibility that increasing awareness of implicit alcohol-related associations may have utility in interventions for young adults.
Resumo:
Tobacco use is prevalent in adolescents, and understanding factors that contribute to its uptake and early development remains a critical public health priority. Implicit drug-related memory associations (DMAs) are predictive of drug use in older samples, but such models have little application to adolescent tobacco use. Moreover, extant research on memory associations yields little information on contextual factors that may be instrumental in the development of DMAs. The present study examined (a) the degree to which tobacco-related memory associations (TMAs) were associated with concurrent tobacco use and (b) the extent to which TMAs mediated the association of peer and self-use. A sample of 210 Australian high school students was recruited. Participants completed TMA tasks and behavioral checklists designed to obscure the tobacco-related focus of the study. Results showed that TMAs were associated with peer use, and TMAs predicted self-use. We found no evidence that TMAs mediated the association of peer and self-use. Future research might examine the emotive valence of implicit nodes and drinking behavior. The results have implications for testing the efficacy of consciousness-raising interventions for adolescents at risk of tobacco experimentation or regular use.
Resumo:
The Tree Augmented Naïve Bayes (TAN) classifier relaxes the sweeping independence assumptions of the Naïve Bayes approach by taking account of conditional probabilities. It does this in a limited sense, by incorporating the conditional probability of each attribute given the class and (at most) one other attribute. The method of boosting has previously proven very effective in improving the performance of Naïve Bayes classifiers and in this paper, we investigate its effectiveness on application to the TAN classifier.
Resumo:
Support vector machines (SVMs) have recently emerged as a powerful technique for solving problems in pattern classification and regression. Best performance is obtained from the SVM its parameters have their values optimally set. In practice, good parameter settings are usually obtained by a lengthy process of trial and error. This paper describes the use of genetic algorithm to evolve these parameter settings for an application in mobile robotics.
Resumo:
The n-tuple pattern recognition method has been tested using a selection of 11 large data sets from the European Community StatLog project, so that the results could be compared with those reported for the 23 other algorithms the project tested. The results indicate that this ultra-fast memory-based method is a viable competitor with the others, which include optimisation-based neural network algorithms, even though the theory of memory-based neural computing is less highly developed in terms of statistical theory.
Resumo:
The n-tuple recognition method was tested on 11 large real-world data sets and its performance compared to 23 other classification algorithms. On 7 of these, the results show no systematic performance gap between the n-tuple method and the others. Evidence was found to support a possible explanation for why the n-tuple method yields poor results for certain datasets. Preliminary empirical results of a study of the confidence interval (the difference between the two highest scores) are also reported. These suggest a counter-intuitive correlation between the confidence interval distribution and the overall classification performance of the system.
Resumo:
We present results concerning the application of the Good-Turing (GT) estimation method to the frequentist n-tuple system. We show that the Good-Turing method can, to a certain extent rectify the Zero Frequency Problem by providing, within a formal framework, improved estimates of small tallies. We also show that it leads to better tuple system performance than Maximum Likelihood estimation (MLE). However, preliminary experimental results suggest that replacing zero tallies with an arbitrary constant close to zero before MLE yields better performance than that of GT system.
Resumo:
The n-tuple recognition method is briefly reviewed, summarizing the main theoretical results. Large-scale experiments carried out on Stat-Log project datasets confirm this method as a viable competitor to more popular methods due to its speed, simplicity, and accuracy on the majority of a wide variety of classification problems. A further investigation into the failure of the method on certain datasets finds the problem to be largely due to a mismatch between the scales which describe generalization and data sparseness.
Resumo:
According to some models of visual selective attention, objects in a scene activate corresponding neural representations, which compete for perceptual awareness and motor behavior. During a visual search for a target object, top-down control exerted by working memory representations of the target's defining properties resolves competition in favor of the target. These models, however, ignore the existence of associative links among object representations. Here we show that such associations can strongly influence deployment of attention in humans. In the context of visual search, objects associated with the target were both recalled more often and recognized more accurately than unrelated distractors. Notably, both target and associated objects competitively weakened recognition of unrelated distractors and slowed responses to a luminance probe. Moreover, in a speeded search protocol, associated objects rendered search both slower and less accurate. Finally, the first saccades after onset of the stimulus array were more often directed toward associated than control items.
Resumo:
Background Abnormalities in incentive decision making, typically assessed using the Iowa Gambling Task (IGT), have been reported in both schizophrenia (SZ) and bipolar disorder (BD). We applied the Expectancy-Valence (E-V) model to determine whether motivational, cognitive and response selection component processes of IGT performance are differentially affected in SZ and BD. Method Performance on the IGT was assessed in 280 individuals comprising 70 remitted patients with SZ, 70 remitted patients with BD and 140 age-, sex-and IQ-matched healthy individuals. Based on the E-V model, we extracted three parameters, 'attention to gains or loses', 'expectancy learning' and 'response consistency', that respectively reflect motivational, cognitive and response selection influences on IGT performance. Results Both patient groups underperformed in the IGT compared to healthy individuals. However, the source of these deficits was diagnosis specific. Associative learning underlying the representation of expectancies was disrupted in SZ whereas BD was associated with increased incentive salience of gains. These findings were not attributable to non-specific effects of sex, IQ, psychopathology or medication. Conclusions Our results point to dissociable processes underlying abnormal incentive decision making in BD and SZ that could potentially be mapped to different neural circuits. © 2012 Cambridge University Press.