Search results for "RECOGNITION"
showing 10 items of 3607 documents
Review of Non-English Corpora Annotated for Emotion Classification in Text
2020
In this paper we try to systematize the information about the available corpora for emotion classification in text for languages other than English with the goal to find what approaches could be used for low-resource languages with close to no existing works in the field. We analyze the corresponding volume, emotion classification schema, language of each corresponding corpus and methods employed for data preparation and annotation automation. We’ve systematized twenty-four papers representing the corpora and found that corpora were mostly for the most spoken world languages: Hindi, Chinese, Turkish, Arabic, Japanese etc. A typical corpus contained several thousand of manually-annotated ent…
The computation of word associations
2002
It is shown that basic language processes such as the production of free word associations and the generation of synonyms can be simulated using statistical models that analyze the distribution of words in large text corpora. According to the law of association by contiguity, the acquisition of word associations can be explained by Hebbian learning. The free word associations as produced by subjects on presentation of single stimulus words can thus be predicted by applying first-order statistics to the frequencies of word co-occurrences as observed in texts. The generation of synonyms can also be conducted on co-occurrence data but requires second-order statistics. The reason is that synony…
Development of an Automatic Pollen Classification System Using Shape, Texture and Aperture Features
2015
International audience; Automatic detection and classification of pollen species has value for use inside of palynologic allergen studies. Traditional labeling of different pollen species requires an expert biologist to classify particles by sight, and is therefore time-consuming and expensive. Here, an automatic process is developed which segments the particle contour and uses the extracted features for the classification process. We consider shape features, texture features and aperture features and analyze which are useful. The texture features analyzed include: Gabor Filters, Fast Fourier Transform, Local Binary Patterns, Histogram of Oriented Gradients, and Haralick features. We have s…
La scoperta, sistemazione e conservazione della grande Iscrizione di Gortina, nell'isola di Creta (1884-1921): la protezione delle testimonianze e le…
2013
La scoperta e la conservazione della Grande Iscrizione di Gortina a Creta, da parte degli studiosi italiani, fra la fine del XIX sec. e i primi decenni del XX sec., rappresentò un grande riconoscimento scientifico-culturale per la giovane nazione italiana. Nel passato, l’isola di Creta era stata legata alla Repubblica di Venezia e anche questo rapporto favorì l’invio a Creta del giovane epigrafista F. Halbherr, il quale fra notevoli peripezie rinvenne, assieme all’epigrafista tedesco E. Fabricius, la famosa l’iscrizione nell’antica città di Gortina. L’iscrizione, fra le più antiche e complete finora conosciute in tutta Europa, conteneva le norme sulla famiglia, l’eredità e in generale i dir…
A solution to the stochastic point location problem in metalevel nonstationary environments.
2008
This paper reports the first known solution to the stochastic point location (SPL) problem when the environment is nonstationary. The SPL problem involves a general learning problem in which the learning mechanism (which could be a robot, a learning automaton, or, in general, an algorithm) attempts to learn a "parameter," for example, lambda*, within a closed interval. However, unlike the earlier reported results, we consider the scenario when the learning is to be done in a nonstationary setting. For each guess, the environment essentially informs the mechanism, possibly erroneously (i.e., with probability p), which way it should move to reach the unknown point. Unlike the results availabl…
Increasing the Inference and Learning Speed of Tsetlin Machines with Clause Indexing
2020
The Tsetlin Machine (TM) is a machine learning algorithm founded on the classical Tsetlin Automaton (TA) and game theory. It further leverages frequent pattern mining and resource allocation principles to extract common patterns in the data, rather than relying on minimizing output error, which is prone to overfitting. Unlike the intertwined nature of pattern representation in neural networks, a TM decomposes problems into self-contained patterns, represented as conjunctive clauses. The clause outputs, in turn, are combined into a classification decision through summation and thresholding, akin to a logistic regression function, however, with binary weights and a unit step output function. …
Projector operators in clustering
2016
In a recent paper, the notion of quantum perceptron has been introduced in connection with projection operators. Here, we extend this idea, using these kind of operators to produce a clustering machine, that is, a framework that generates different clusters from a set of input data. Also, we consider what happens when the orthonormal bases first used in the definition of the projectors are replaced by frames and how these can be useful when trying to connect some noised signal to a given cluster. Copyright © 2016 John Wiley & Sons, Ltd.
Kolmogorov superposition theorem for image compression
2012
International audience; The authors present a novel approach for image compression based on an unconventional representation of images. The proposed approach is different from most of the existing techniques in the literature because the compression is not directly performed on the image pixels, but is rather applied to an equivalent monovariate representation of the wavelet-transformed image. More precisely, the authors have considered an adaptation of Kolmogorov superposition theorem proposed by Igelnik and known as the Kolmogorov spline network (KSN), in which the image is approximated by sums and compositions of specific monovariate functions. Using this representation, the authors trad…
LeSSS: Learned Shared Semantic Spaces for Relating Multi-Modal Representations of 3D Shapes
2015
In this paper, we propose a new method for structuring multi-modal representations of shapes according to semantic relations. We learn a metric that links semantically similar objects represented in different modalities. First, 3D-shapes are associated with textual labels by learning how textual attributes are related to the observed geometry. Correlations between similar labels are captured by simultaneously embedding labels and shape descriptors into a common latent space in which an inner product corresponds to similarity. The mapping is learned robustly by optimizing a rank-based loss function under a sparseness prior for the spectrum of the matrix of all classifiers. Second, we extend …
On the use of neighbourhood-based non-parametric classifiers
1997
Alternative non-parametric classification schemes, which come from the use of different definitions of neighbourhood, are introduced. In particular, the Nearest Centroid Neighbourhood along with the neighbourhood relation derived from the Gabriel Graph and the Relative Neighbourhood Graph are used to define the corresponding (k-)Nearest Neighbour-like classifiers. Experimental results are reported to compare the performance of the approaches proposed here to the one obtained with the k-Nearest Neighbours rule.