The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We present a new approach to multi-signal gesture recognition that attends to simultaneous body and hand movements. The system examines temporal sequences of dual-channel input signals obtained via statistical inference that indicate 3D body pose and hand pose. Learning gesture patterns from these signals can be quite challenging due to the existence of long-range temporal-dependencies and low signal-to-noise...
Classifier selection aims to reduce the size of an ensemble of classifiers in order to improve its efficiency and classification accuracy. Recently an information-theoretic view was presented for feature selection. It derives a space of possible selection criteria and show that several feature selection criteria in the literature are points within this continuous space. The contribution of this paper...
Transfer learning targets to leverage knowledge from one domain for tasks in a new domain. It finds abundant applications, such as text/sentiment classification. Many previous works are based on cluster analysis, which assume some common clusters shared by both domains. They mainly focus on the one-to-one cluster correspondence to bridge different domains. However, such a correspondence scheme might...
Restricted Bayesian network is an efficient classification model. However, so far some researchers still attempt to improve the performance by considering directions of edges, because traditional learning method merely takes into account log likelihood, which is not suitable for learning classifiers, when learning a tree topological structure. In this paper, we analyze the search spaces and the equivalent...
We present a tool that facilitates the efficient extension of morphological lexica. The tool exploits information from a morphological lexicon, a morphological grammar and a text corpus to guide the acquisition process. In particular, it employs statistical models to analyze out-of-vocabulary words and predict lexical information. These models do not require any additional labeled data for training...
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) methods have been successfully extended to such prediction problems. However, recent developments in large margin methods show that higher order information can be exploited for even better generalization. This article first...
This paper continues to explore the potential of newly introduced Fuzzy Gaussian Inference (FGI). It aims at constructing fuzzy membership functions by modelling hidden probability distributions underlying human motions. A fuzzy rule-based system has been employed to assist boxing motion classification from natural human Motion Capture data. In this experiment, FGI alone is able to recognise seven...
This paper addresses the novel problem of characterizing conversational group dynamics. It is well documented in social psychology that depending on the objectives a group, the dynamics are different. For example, a competitive meeting has a different objective from that of a collaborative meeting. We propose a method to characterize group dynamics based on the joint description of a group members'...
We recently proposed the Edgewise Greedy Algorithm (EGA) for learning a decomposable Markov network of treewidth k approximating a given joint probability distribution of n discrete random variables. The main ingredient of our algorithm is the stepwise forward selection algorithm (FSA) due to Deshpande, Garofalakis, and Jordan. EGA is an efficient alternative to the algorithm (HGA) by Malvestuto,...
In this article, we propose a steganalysis method for detecting the presence of information-hiding behavior in wav audios. We extract the neighboring joint distribution features and the Markov features of the second order derivative, and combine these features with the error response by randomly modifying the least significant bit, then apply learning machines to the features for distinguishing the...
Misclassiflcation cost is usually unequal for different class. Parameters estimation methods of Bayesian networks such as generative method based on log joint likelihood loss and discriminative method based on log conditional likelihood loss suppose that misclassification cost of every class is equal. Accordingly, this paper develops a cost-sensitive parameters estimation method so that Bayesian networks...
Multi-dimensional classification is a generalization of supervised classification that considers more than one class variable to classify. In this paper we review the existing multi-dimensional Bayesian classifiers and introduce a new one: the KDB multi-dimensional classifier. Then we define different classification rules for multi-dimensional scope. Finally, we introduce a structural learning approach...
We have investigated the use of boosting techniques for feature selection for microarray data analysis. We propose a novel algorithm for feature selection and have tested it on three datasets. The results clearly show that our boosting technique for feature selection outperformed the Wilcoxon-Mann-Whitney U-test commonly used in microarray data analysis, and produced more accurate boosting ensembles...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.