Search

Aim/Background: This research aims to develop an automated contextual classifier for scholarly papers by utilizing established algorithms and understanding the information retention of different parts of a scholarly article, such as the Abstract, Article Title, and Keywords. It also seeks to recommend a contextual classifier-based recommender system to help academics identify credible sources. Scholarly articles from various study fields often use similar terms in their titles and keywords. However, finding a publication venue can be challenging for researchers at the beginning of a scientific inquiry. Thus, it is crucial to classify information based on its context, especially when abstracts, keywords, and titles receive equal attention. Materials and Methods: An ensembled model was developed and trained using 114K instances from 38 classes of the Web of Science (WoS) dataset and 40 classes of the Dimensions dataset. The ensemble approach incorporated both machine learning and deep learning algorithms to build a diverse classifier. The model was evaluated by testing it with an 80:20 train-test split to assess performance. The classifier was further integrated into a recommender system designed to suggest probable publication sources based on given article information. Results: The ensemble classification approach demonstrated superior performance with faster inference and efficient training time. The balanced training model, tested on 114K instances, effectively categorized scholarly articles into one of 40 categories. The recommender system was capable of recommending up to 10 probable publication sources based on the article's Title, Keywords, and Abstract. Models utilizing abstractions yielded the best results and provided a better understanding of the context in every iteration of the experiment. Conclusion: This study successfully developed an ensemble-based contextual classifier for academic papers, which can also function as a recommender system. The system aids researchers in choosing the most appropriate sources to publish by categorizing articles into 40 categories and suggesting credible publication venues. This approach simplifies the decision-making process for academics, enabling them to identify relevant publications and suitable sources for their work more efficiently. [ABSTRACT FROM AUTHOR]

This study is concerned with the aperture of the mid vowel /E/ in nonfinal syllables in Quebec French. The hypothesis tested is that in underived disyllabic words, the aperture of /E/ would be determined via harmony with the following vowel. Based on predictions from a classifier trained on acoustic properties of word-final vowels, nonfinal vowels were labeled as mid-close or mid-open. Although distant coarticulatory effects were observed, the harmony hypothesis was not supported. The results revealed a bias toward a mid-open quality and a reduced acoustic distinction, which warrant further investigation. [ABSTRACT FROM AUTHOR]

The F-POD is designed for passive acoustic monitoring of odontocetes. The offline classifiers can identify and separate porpoise-like sounds from dolphin-like sounds. We show that these two classifiers are not working independently. Run together, virtually no detections of both species were reported within the same minute, whereas 10% of the detection positive minutes were reported positive for both species when the two classifiers were run sequentially. This has important implications for interpretation of data in areas containing both species groups, and we call for reporting all analysis details in such studies and for further description and analysis of the classifiers. [ABSTRACT FROM AUTHOR]

Most of the current day industries are suffering from nonlinear processes. Thus, both the stability and the process performance of high-degree nonlinear systems with dominating delay might be difficult to achieve. Adaptive and intelligent fuzzy classifiers and controllers have been more popular in recent years as a means of overcoming a significant number of difficulties faced by the industrial sector. A large number of dynamic process plants with a variety of orders and kinds have been represented heuristically and recognized. Fuzzy structures have also been employed for these interactive systems by making use of fuzzy and linguistic techniques. In view of all these initiatives, the purpose of this paper is to conduct an experimental investigation into the performance of a LabVIEW-based Type-1 Adaptive Mamdani Fuzzy Controller (AMFC) that has been designed and applied over a lag-dominant and a second-order nonlinear Dual Input Tank System (DITS) and Single Input Tank System (SITS). Compared to other type-1 approaches that were previously experimented with and are now in existence, the adaptability of AMFC demonstrates that it is quite effective. Performance indices such as the Integrated/Summated Absolute Error (IAE) and the Integrated/Summated Squared Error (ISE) are also computed for several variable set point profiles of DITS. These indices measure errors in integrated absolute value and integrated squared value, respectively. Adaptive Type-1 Intelligent Fuzzy Controller's response and error reduction efficiency have been found for several flow configurations of DITS, namely Multiple Input Multiple Output (MIMO) and Single Input Single Output (SISO). From the results, it can be concluded that the proposed experimental validation may be used for a wide variety of process challenges that are experienced in industrial systems to achieve robust and low error controller performances. [ABSTRACT FROM AUTHOR]

Deep learning has received a growing interest in recent years for detecting different types of pavement distresses and automating pavement condition assessment. A proper choice of deep learning models is key for successful pavement assessment applications. In this study, we first present a comprehensive experimental comparison of state-of-the-art image classification models to evaluate their performances on 11 pavement objects classification. Our experiments are conducted in different dimensions of comparison, including deep classifier architecture, effects of network depth, and computational costs. Five convolutional neural network (CNN) classifiers widely used in transportation applications, including VGG16, VGG19, ResNet50, DenseNet121, and a generic CNN (as the control model), are tested with a comprehensive pixel-level annotated dataset for 11 different distress and non-distress classes (UCF-PAVE 2017). In addition, we investigate a simple yet effective approach of encoding contextual information with multi-scale input tiles to classify highly random pavement objects in size, shape, intensity, texture, and direction. Our comparison results show that the multi-scale approach significantly improves the classification accuracy for all compared deep classifiers at a negligible extra computational cost. Finally, we provide recommendations of how to improve the classification performance of deep CNNs for automated pavement condition assessment based on the comparison results. [ABSTRACT FROM AUTHOR]

An important cue to the meaning of a new noun is its accompanying classifier. For example, in English, X in "a sheet of X" should refer to a broad, flat object. A classifier is required in Chinese to quantify nouns. Using children's overt responses in an object/picture selection task, past research found reliable semantic knowledge of classifiers in Mandarin-reared children at around age three. However, it is unclear how children's semantic knowledge differs across different types of classifiers and how this difference develops with age. Here we use an arguably more sensitive measure of children's language knowledge (the intermodal preferential-looking paradigm) to examine Mandarin-reared three-, four-, and five-year-olds' semantic knowledge of four types of classifiers indicating animacy (human vs. animal distinction), configuration (how objects are arrayed), object shape, and vehicle function. Multiple factors were matched across classifier types: the number of classifiers, perceived familiarity and perceived typicality of the target, and the visual similarity of the two images paired together. Children's performances differed across classifier types, as they were better with animacy classifiers than with configuration and vehicle function classifiers. Their comprehension was reliable for animacy, object shape, and vehicle function classifiers but not for configuration classifiers. Furthermore, we did not find conclusive evidence for an age-dependent improvement in the child's performance. The analysis, including the oldest (five-year-olds) and youngest (three-year-olds) children, revealed a marginally significant age effect. [ABSTRACT FROM AUTHOR]

The scope of the Internet of Things (IoT) becomes inevitable in the communication and information-sharing routines of human life, similar to any technological architecture. The IoT is also not exempted from vulnerability to security issues and is even more vulnerable as the networks of IoT are built of non-smart devices. Though the few contributions endeavored to defend against the botnet's attacks on IoT, they partially or poorly performed to defend against the flash crowd or attacks by botnets on IoT networks. In this context, the method “Flash Attack Prognosis by Ensemble Supervised Learning for IoT Networks” derived in this manuscript is centric on defending the flash attacks by botnets. Unlike contemporary models, the proposed method uses the fusion of traditional network features and temporal features as input to train the classifiers. Also, the curse of dimensionality in the training corpus, which is often, appears in the corpus of flash attack transactions by a botnet, has addressed by the ensemble classification strategy. The comparative analysis of the statistics obtained from the experimental study has displayed the significance and robustness of the proposed model compared to contemporary models. [ABSTRACT FROM AUTHOR]

This dataset provides detailed metadata on ca. 10.2 million works of fiction and nonfiction written after 1799 in 521 different languages available in the HathiTrust Digital Library. The dataset bolsters the May 2022 Hathifile by supplying missing predicted fiction tags with a bespoke BERT-based multilingual classifier. Our classifier completes the catalogue with an additional 400,000 non-English volumes predicted to be works of fiction, capturing 95% of all works presently provided by HathiTrust. We provide each work with metadata including the work's genre at the level of fiction or nonfiction, length in pages, original language, and the year the work was published. With a total page count of ca. 1.4 billion pages, our dataset provides researchers with a substantial source of non-English modern literature. We also present insight into how multilingual classifiers can be trained with monolingual data, itself a discovery with implications for the study of lower resource languages. We hope our provisions will accelerate empirical research into non-English prose and literature. [ABSTRACT FROM AUTHOR]

Vegetation mapping is an active research area in the domain of remote sensing. This study proposes a methodology for the mapping of vegetation by integrating several vegetation indices along with original spectral bands. The Land Use Land Cover classification was performed by two powerful Machine Learning techniques, namely Random Forest and AdaBoost. The Random Forest algorithm works on the concept of building multiple decision trees for the final prediction. The other Machine Learning technique selected for the classification is AdaBoost (adaptive boosting), converts a set of weak learners into strong learners. Here, multispectral satellite data of Dehradun, India, was utilised. The results demonstrate an increase of 3.87% and 4.32% after inclusion of selected vegetation indices by Random Forest and AdaBoost respectively. An Overall Accuracy (OA) of 91.23% (kappa value of 0.89) and 88.59% (kappa value of 0.86) was obtained by means of the Random Forest and AdaBoost classifi- ers respectively. Although Random Forest achieved greater OA as compared to AdaBoost, interestingly AdaBoost provided better class-specific accuracy for the Shrubland class compared to Random Forest. Furthermore, this study also evaluated the importance of each individual feature used in the classifi- cation. Results demonstrated that the NDRE, GNDVI, and RTVIcore vegetation indices, and spectral bands (NIR, and Red-Edge), obtained higher importance scores. [ABSTRACT FROM AUTHOR]

Despite achieving accuracies higher than 90% on recognizing upper-limb movements through sEMG (surface Electromyography) signal with the state of art classifiers in the laboratory environment, there are still issues to be addressed for a myo-controlled prosthesis achieve similar performance in real environment conditions. Thereby, the main goal of this review is to expose the latest researches in terms of strategies in each block of the system, giving a global view of the current state of academic research. A systematic review was conducted, and the retrieved papers were organized according to the system step related to the proposed method. Then, for each stage of the upper limb motion recognition system, the works were described and compared in terms of strategy, methodology and issue addressed. An additional section was destined for the description of works related to signal contamination that is often neglected in reviews focused on sEMG based motion classifiers. Therefore, this section is the main contribution of this paper. Deep learning methods are a current trend for classification stage, providing strategies based on time-series and transfer learning to address the issues related to limb position, temporal/inter-subject variation, and electrode displacement. Despite the promising strategies presented for contaminant detection, identification, and removal, there are still some factors to be considered, such as the occurrence of simultaneous contaminants. This review exposes the current scenario of the movement classification system, providing valuable information for new researchers and guiding future works towards myo-controlled devices. [ABSTRACT FROM AUTHOR]

COVID-19 is a novel coronavirus that spread around the globe with the initial reports coming from Wuhan, China, turned into a pandemic and caused enormous casualties. Various countries have faced multiple COVID spikes which put the medical infrastructure of these countries under immense pressure with third-world countries being hit the hardest. It can be thus concluded that determining the likeliness of death of a patient helps in avoiding fatalities which inspired the authors to research the topic. There are various ways to approach the problem such as past medical records, chest X-rays, CT scans, and blood biomarkers. Since blood biomarkers are most easily available in emergency scenarios, blood biomarkers were used as the features for the model. The data was first imputed and the training data was oversampled to avoid class imbalance in the model training. The model is composed of a voting classifier that takes in outputs from multiple classifiers. The model was then compared to base models such as Random Forest, XGBoost, and Extra Trees Classifier on multiple evaluation criteria. The F1 score was the concerned evaluation criterion as it maximizes the use of the medical infrastructure with the minimum possible casualties by maximizing true positives and minimizing false negatives. [ABSTRACT FROM AUTHOR]

In recent years, the relationship between network graph parameters and the existence of specific H-factor has attracted the attention of researchers. The latest research has found that for factor deleted graphs and factor critical graphs, the tight bounds of graph parameters are changing as the low bound of connectivity changes. This work studies the existence of {K1,1,K1,2,C1}-factor from high-dimensional space perspective. Several surfaces reveal that the dynamic changing of tight parameter (toughness, isolated toughness, sun toughness, binding number) bounds are defined. The precise expression of these surfaces are presented. [ABSTRACT FROM AUTHOR]

Static authentication methods, like passwords, grow increasingly weak with advancements in technology and attack strategies. Continuous authentication has been proposed as a solution, in which users who have gained access to an account are still monitored in order to continuously verify that the user is not an imposter who had access to the user credentials. Mouse dynamics is the behavior of a user's mouse movements and is a biometric that has shown great promise for continuous authentication schemes. This article builds upon our previous published work by evaluating our dataset of 40 users using three machine learning and three deep learning algorithms. Two evaluation scenarios are considered: binary classifiers are used for user authentication, with the top performer being a 1-dimensional convolutional neural network (1D-CNN) with a peak average test accuracy of 85.73% across the top-10 users. Multi-class classification is also examined using an artificial neural network (ANN) which reaches an astounding peak accuracy of 92.48%, the highest accuracy we have seen for any classifier on this dataset. [ABSTRACT FROM AUTHOR]

The embedded, computational and cloud elements of industrial cyber physical systems (CPS) generate large volumes of data at high velocity to support the operations and functions of corresponding time-critical and mission-critical physical entities. Given the non-deterministic nature of these entities, the generated data streams are susceptible to dynamic and abrupt changes. Such changes, which are formally defined as concept drifts, leads to a decline in the accuracy and robustness of predicted CPS behaviors. Most existing work in concept drift detection are classifier dependent and require labeled data. However, CPS data streams are unlabeled, unstructured and change over time. In this paper, we propose an unsupervised machine learning algorithm for continuous concept drift detection in industrial CPS. This algorithm demonstrates three types of unsupervised learning, online, incremental and decremental. Furthermore, it distinguishes between abrupt and reoccurring drifts. We conducted experiments on SEA, a widely cited synthetic dataset of concept drift detection, and two industrial applications of CPS, task tracking in factory settings and smart energy consumption. The results of these experiments successfully validate the key features of the proposed algorithm and its utility of detecting change in non-deterministic CPS environments. [ABSTRACT FROM AUTHOR]

An information retrieval (IR) system is the core of many applications, including digital library management systems (DLMS). The IR-based DLMS depends on either the title with keywords or content as symbolic strings. In contrast, it ignores the meaning of the content or what it indicates. Many researchers tried to improve IR systems either using the named entity recognition (NER) technique or the words’ meaning (word sense) and implemented the improvements with a specific language. However, they did not test the IR system using NER and word sense disambiguation together to study the behavior of this system in the presence of these techniques. This paper aims to improve the information retrieval system used by the DLMS by adding the NER and word sense disambiguation (WSD) together for the English and Arabic languages. For NER, a voting technique was used among three completely different classifiers: rules-based, conditional random field (CRF), and bidirectional LSTM-CNN. For WSD, an examples-based method was used to implement it for the first time with the English language. For the IR system, a vector space model (VSM) was used to test the information retrieval system, and it was tested on samples from the library of the University of Kufa for the Arabic and English languages. The overall system results show that the precision, recall, and F-measures were increased from 70.9%, 74.2%, and 72.5% to 89.7%, 91.5%, and 90.6% for the English language and from 66.3%, 69.7%, and 68.0% to 89.3%, 87.1%, and 88.2% for the Arabic language. [ABSTRACT FROM AUTHOR]

Fusion techniques with the aim to leverage the discriminative power of different appearance features for person representation have been widely applied in person re-identification. They are performed by concatenating all feature vectors (known as early fusion) or by combining matching scores of different classifiers (known as late fusion). Previous studies have proved that late fusion techniques achieve better results than early fusion ones. However, majority of the studies focus on determining the suitable weighting schemes that can reflect the role of each feature. The determined weights are then integrated in conventional similarity functions, such as Cosine [L. Zheng, S. Wang, L. Tian, F. He, Z. Liu and Q. Tian, Queryadaptive late fusion for image search and person reidentification, in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2015, pp. 1741–1750]. The contribution of this paper is two-fold. First, a robust person re-identification method by combining the metric learning with late fusion techniques is proposed. The metric learning method Cross-view Quadratic Discriminant Analysis (XQDA) is employed to learn a discriminant low dimensional subspace to minimize the intra-person distance while maximize the inter-person distance. Moreover, product rule-based and sum rule-based late fusion techniques are applied on these distances. Second, concerning feature engineering, the ResNet extraction process has been modified in order to extract local features of different stripes in person images. To show the effectiveness of the proposed method, both single-shot and multi-shot scenarios are considered. Three state-of-the-art features that are Gaussians of Gaussians (GOG), Local Maximal Occurrence (LOMO) and deep-learned features extracted through a Residual network (ResNet) are extracted from person images. The experimental results on three benchmark datasets that are iLIDS-VID, PRID-2011 and VIPeR show that the proposed method obtains + 1 1. 8 6 % , + 3. 4 8 % and + 2. 2 2 % of improvement over the best results obtained with the single feature. The proposed method that achieves the accuracy of 85.73%, 93.82% and 50.85% at rank-1 for iLIDS-VID, PRID-2011 and VIPeR, respectively, outperforms different SOTA methods including deep learning ones. Source code is publicly available to facilitate the development of person re-ID system. [ABSTRACT FROM AUTHOR]

Copyright of International Journal of Chinese Language Teaching is the property of Clifford Publishing and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Polarization-sensitive optical coherence tomography (PS-OCT) is a high-resolution label-free optical biomedical imaging modality that is sensitive to the microstructural architecture in tissue that gives rise to form birefringence, such as collagen or muscle fibers. To enable polarization sensitivity in an OCT system, however, requires additional hardware and complexity. We developed a deep-learning method to synthesize PS-OCT images by training a generative adversarial network (GAN) on OCT intensity and PS-OCT images. The synthesis accuracy was first evaluated by the structural similarity index (SSIM) between the synthetic and real PS-OCT images. Furthermore, the effectiveness of the computational PS-OCT images was validated by separately training two image classifiers using the real and synthetic PS-OCT images for cancer/normal classification. The similar classification results of the two trained classifiers demonstrate that the predicted PS-OCT images can be potentially used interchangeably in cancer diagnosis applications. In addition, we applied the trained GAN models on OCT images collected from a separate OCT imaging system, and the synthetic PS-OCT images correlate well with the real PS-OCT image collected from the same sample sites using the PS-OCT imaging system. This computational PS-OCT imaging method has the potential to reduce the cost, complexity, and need for hardware-based PS-OCT imaging systems. [ABSTRACT FROM AUTHOR]

Dependency parsing is a complex process in natural language text processing, text to semantic transformation. The efficiency improvement of dependency parsing is a current and an active research area in the NLP community. The paper presents four transitionbased dependency parser models with implementation using DL4J classifiers. The efficiency of the proposed models were tested with Hungarian language corpora. The parsing model uses a data representation form based on lightweight embedding and a novel morphological-description-vector format is proposed for the input layer. Based on the test experiments on parsing Hungarian text documents, the proposed list-based transitions parsers outperform the widespread stack-based variants. [ABSTRACT FROM AUTHOR]

Prostate cancer can be viewed as the second most dangerous and diagnosed cancer of men all over the world. In the past decade, machine and deep learning methods play a significant role in improving the accuracy of classification for both binary and multi classifications. This review is aimed at providing a comprehensive survey of the state of the art in the past 5 years from 2015 to 2020, focusing on different datasets and machine learning techniques. Moreover, a comparison between studies and a discussion about the potential future researches is described. First, an investigation about the datasets used by the researchers and the number of samples associated with each patient is performed. Then, the accurate detection of each research study based on various machine learning methods is given. Finally, an evaluation of five techniques based on the receiver operating characteristic curve has been presented to show the accuracy of the best technique according to the area under curve (AUC) value. Conducted results indicate that the inception-v3 classifier has the highest score for AUC, which is 0.91. [ABSTRACT FROM AUTHOR]

This paper provides a detailed description of how Vietnamese encodes definiteness in the nominal phrase in the context of the crosslinguistic debate about the existence of lexical articles in classifier languages. We first show that so-called lexical determiners in Vietnamese are not genuine articles in the technical sense. We then scrutinize six different referring expressions in Vietnamese including bare nouns, classifier - nouns, numeral - classifier - nouns, plural - classifier - nouns, focus cái - classifier - nouns while pointing out how Vietnamese differs from other better-studied classifier languages. Based on this thorough investigation, we posit that Vietnamese systematically differentiates six levels of the givenness hierarchy in the sense of Gundel et al. (1993); therefore, Vietnamese contributes to a better understanding of the nature of definiteness and the structure of the nominal phrase. [ABSTRACT FROM AUTHOR]

We are in the shoes of a practitioner who uses previous project releases' data to predict which classes of the current release are defect-prone. In this scenario, the practitioner would like to use the most accurate classifier among the many available ones. A validation technique, hereinafter "technique", defines how to measure the prediction accuracy of a classifier. Several previous research efforts analyzed several techniques. However, no previous study compared validation techniques in the within-project across-release class-level context or considered techniques that preserve the order of data. In this paper, we investigate which technique recommends the most accurate classifier. We use the last release of a project as the ground truth to evaluate the classifier's accuracy and hence the ability of a technique to recommend an accurate classifier. We consider nine classifiers, two industry and 13 open projects, and three validation techniques: namely 10-fold cross-validation (i.e., the most used technique), bootstrap (i.e., the recommended technique), and walk-forward (i.e., a technique preserving the order of data). Our results show that: 1) classifiers differ in accuracy in all datasets regardless of their entity per value, 2) walk-forward outperforms both 10-fold cross-validation and bootstrap statistically in all three accuracy metrics: AUC of the selected classifier, bias and absolute bias, 3) surprisingly, all techniques resulted to be more prone to overestimate than to underestimate the performances of classifiers, and 3) the defect rate resulted in changing between the second and first half in both industry projects and 83% of open-source datasets. This study recommends the use of techniques that preserve the order of data such as walk-forward over 10-fold cross-validation and bootstrap in the within-project across-release class-level context given the above empirical results and that walk-forward is by nature more simple, inexpensive, and stable than the other two techniques. [ABSTRACT FROM AUTHOR]

Existing classification studies use two non-parametric classifiers- k-nearest neighbours (kNN) and decision trees, and one parametric classifier-logistic regression, generating high accuracies. Previous research work has compared the results of these classifiers with training patterns of different sizes to study alcohol tests. In this paper, the Improved Version of the kNN (IVkNN) algorithm is presented which overcomes the limitation of the conventional kNN algorithm to classify wine quality. The proposed method typically identifies the same number of nearest neighbours for each test example. Results indicate a higher Overall Accuracy (OA) that oscillates between 67% and 76%. Among the three classifiers, the least sensitive to the training sample size was the kNN and produced the unrivalled OA, followed by sequential decision trees and logistic regression. Based on the sample size, the proposed IVkNN model presented 80% accuracy and 0.375 root mean square error (RMSE). [ABSTRACT FROM AUTHOR]

An imbalanced dataset is commonly found in at least one class, which are typically exceeded by the other ones. A machine learning algorithm (classifier) trained with an imbalanced dataset predicts the majority class (frequently occurring) more than the other minority classes (rarely occurring). Training with an imbalanced dataset poses challenges for classifiers; however, applying suitable techniques for reducing class imbalance issues can enhance classifiers' performance. In this study, we consider an imbalanced dataset from an educational context. Initially, we examine all shortcomings regarding the classification of an imbalanced dataset. Then, we apply data-level algorithms for class balancing and compare the performance of classifiers. The performance of the classifiers is measured using the underlying information in their confusion matrices, such as accuracy, precision, recall, and F measure. The results show that classification with an imbalanced dataset may produce high accuracy but low precision and recall for the minority class. The analysis confirms that undersampling and oversampling are effective for balancing datasets, but the latter dominates. [ABSTRACT FROM AUTHOR]

Fuzzy classification is the task of partitioning a feature space into fuzzy classes. A Neuro fuzzy classifier with linguistic hedges is proposed for noisy and clean speech classification. The linguistic Hedges are used to improve the meaning of fuzzy rules up to secondary level. Fuzzy entropy is applied to select optimal features of MFCC for framing the rules for designing the fuzzy inference system. Results obtained from the proposed classifier is compared over conventional and Neuro Fuzzy Classifier. The classification rates of the proposed model is better than other traditional and conventional fuzzy classifiers. 0.22 to 5% improved classification accuracy is observed for the FSDD dataset. And 5% to 11% of improved classification accuracy is observed for Kannada dataset. From this study it is identified that LH plays a major role in classifying the overlapped classes of data. [ABSTRACT FROM AUTHOR]

Automatic speech-based severity level classification of Parkinson's disease (PD) enables objective assessment and earlier diagnosis. While many studies have been conducted on the binary classification task to distinguish speakers in PD from healthy controls (HCs), clearly fewer studies have addressed multi-class PD severity level classification problems. Furthermore, in studying the three main issues of speech-based classification systems – speaking tasks, features, and classifiers – previous investigations on the severity level classification have yielded inconclusive results due to the use of only a few, and sometimes just one, type of speaking task, feature, or classifier in each study. Hence, a systematic comparison is conducted in this study between different speaking tasks, features, and classifiers. Five speaking tasks (vowel task, sentence task, diadochokinetic (DDK) task, read text task, and monologue task), four features (phonation, articulation, prosody, and their fusion), and four classifier architectures (support vector machine (SVM), random forest (RF), multilayer perceptron (MLP), and AdaBoost) were compared. The classification task studied was a 3-class problem to classify PD severity level as healthy v s. mild v s. severe. Two MDS-UPDRS scales (MDS-UPDRS-III and MDS-UPDRS-S) were used for the ground truth severity level labels. The results showed that the use of the monologue task and the articulation and fusion of features improved classification accuracy significantly compared to the use of the other speaking tasks and features. The best classification systems resulted in a rate of accuracy of 58% (using the monologue task with the articulation features) for the MDS-UPDR-III scale and 56% (using the monologue task with fusion of features) for the MDS-UPDRS-S scale. • Speech-based classification of severity of Parkinson's disease was studied. • 5 speaking tasks, 4 feature sets, and 4 classifiers were compared. • Monologue task & articulation / fusion features improved classification accuracy. • Classifier had a minor effect on classification accuracy. • Classification differences between MDS-UPDRS-III and MDS-UPDRS-S were small. [ABSTRACT FROM AUTHOR]

• A novel voice conversion technique for body-conducted unvoiced speech is proposed based on Taylor-Boltzmann Machines. The proposed algorithm was the integration of Taylor Series with Boltzmann machine Deep Neural Networks. • A body conductive microphone referred as the non audible murmur (NAM) microphone is used to capture the non-audible murmur from the neck part behind the ear. • The classifier was trained with the features likes "pitch chroma, spectral centroid, and spectral skewness" that are derived from the incoming body conducted low voice verbal communication signal. • In the initial training phase, a Taylor series approximation DNN model is trained from a collection of stereo data which encompasses the NAM speech of same phonemes represented as log-power spectral features. • Moreover, in the recognition phase, a well trained Taylor-DNN model that is based on Boltzmann Machine intakes the speech features and generates the "log-power-spectra features" and it aids in recognizing the speech waveform. • The paper may gain high interest from the readers and experts of Speech processing, Voice Conversion Techniques, body-conducted unvoiced speech. Communication becomes effectual while the verbal communication signal reaches the destination with profound characteristics. An application based on human voice attracts the researcher's attention. It leads the researcher to proceed towards the speech conversion for low voice humans having murmured voices as their attitude. The researchers introduced a technique for improving the body-conducted unvoiced speech for silent speech communication using Taylor-Boltzmann machine-trained optimized Deep Neural Network (DNN). The projected model includes two main stages: the training stage as well as recognition stage. In the training stage, the following functionalities are undergone: (i) pre-processing, (ii) feature extraction, and (iii) deep learning-based speech enhancement. Initially, the collected input Non-Audible Murmur (NAM) speech signal is subjected to the pre-processing stage, wherein the improved wiener filtering is employed for suppressing the noise in the input signal. From the pre-processed speech signal, the most relevant characteristics such as "spectral skewness, spectral chroma, spectral centroid and improved Mel Frequency Cepstral Coefficients (MFCC)" are extracted, and they are fused together. Then, using these fused features, the Taylor series with optimized DNN and Boltzmann Machine (Taylor-DNN-BM) model is trained. The final enhanced speech is acquired from the Taylor- optimized DNN-BM. The recognition phase encapsulates the feature extraction and deep learning-based speech enhancement stage. The input speech data enters into the feature extraction phase, wherein the characteristics such as "spectral skewness, spectral chroma, spectral centroid and improved (MFCC)" are retrieved. After that, these features are fused and fed as input to the Taylor-optimized DNN-BM model. From Taylor- optimized DNN-BM, the enhanced speech signal is acquired. In DNN, the weight function is fine-tuned using the newly projected Self Improved Flower Pollination Algorithm (SI-FPA) algorithm. This SI-FPA model is the conceptual improvement of the Flower Pollination Algorithm (FPA). Finally, the projected model is compared with the existing models to validate its efficiency in terms of speech enhancement. [ABSTRACT FROM AUTHOR]

Highlights • Propose GMDKNN method. • Design categorical multi-generalized mean distances. • Design categorical nested generalized mean distance for classification. Abstract K -nearest neighbor (KNN) rule is a well-known non-parametric classifier that is widely used in pattern recognition. However, the sensitivity of the neighborhood size k always seriously degrades the KNN-based classification performance, especially in the case of the small sample size with the existing outliers. To overcome this issue, in this article we propose a generalized mean distance-based k -nearest neighbor classifier (GMDKNN) by introducing multi-generalized mean distances and the nested generalized mean distance that are based on the characteristic of the generalized mean. In the proposed method, multi-local mean vectors of the given query sample in each class are calculated by adopting its class-specific k nearest neighbors. Using the achieved k local mean vectors per class, the corresponding k generalized mean distances are calculated and then used to design the categorical nested generalized mean distance. In the classification phase, the categorical nested generalized mean distance is used as the classification decision rule and the query sample is classified into the class with the minimum nested generalized mean distance among all the classes. Extensive experiments on the UCI and KEEL data sets, synthetic data sets, the KEEL noise data sets and the UCR time series data sets are conducted by comparing the proposed method to the state-of-art KNN-based methods. The experimental results demonstrate that the proposed GMDKNN performs better and has the less sensitiveness to k. Thus, our proposed GMDKNN with the robust and effective classification performance could be a promising method for pattern recognition in some expert and intelligence systems. [ABSTRACT FROM AUTHOR]

Spatial relations along the IN-ON continuum are primarily expressed in Thai Sign Language (ThSL) through classifier constructions. In these constructions, the signer articulates the lexical sign for the ground and then its classifier using his non-dominant (left) hand. The classifier is held in place while the signer uses his dominant (right) hand to articulate the lexical sign and classifier for the figure. The classifier for the figure is then placed in proximity to the classifier for the ground in a way that mirrors the spatial relation between real-world objects. Parameters of this expression can be used to identify where the relation falls along the IN-ON continuum. These parameters arise from the iconic nature of how the relation is articulated in ThSL. In addition, this iconicity allows the relation to be encoded with greater precision than similar expressions in spoken languages. Additional semantic features of the figure and ground -- plurality and inherent movement -- are also encoded in these constructions. [ABSTRACT FROM AUTHOR]

Using classifiers--lexical items that depict perceptual and conceptual properties of objects-six cross--cultural experiments were conducted in the People's Republic of China, Hong Kong, Japan, and the United States to investigate how structural features of languages affect mental structures and, in turn, consumer behavior. Experiments 1-4 show how classifiers affect the perceived similarity between objects, attribute accessibility, and concept organization. Experiment 5 shows how classifier-based schemata result in inferences about product features. Experiment 6 provides evidence for the effect of classifiers on judgment and choice via assimilation and contrast processes and affect transfer. We discuss our findings in light of the Whorfian hypothesis and argue for the incorporation of structural components of languages into models of consumer behavior. [ABSTRACT FROM AUTHOR]

As one of the most prevalent cancers among women worldwide, breast cancer has attracted the most attention by researchers. It has been verified that an accurate and early detection of breast cancer can increase the chances for the patients to take the right treatment plan and survive for a long time. Nowadays, numerous classification methods have been utilized for breast cancer diagnosis. However, most of these classification models have concentrated on maximum the classification accuracy, failed to take into account the unequal misclassification costs for the breast cancer diagnosis. To the best of our knowledge, misclassifying the cancerous patient as non-cancerous has much higher cost compared to misclassifying the non-cancerous as cancerous. Consequently, in order to tackle this deficiency and further improve the classification accuracy of the breast cancer diagnosis, we propose an improved cost-sensitive support vector machine classifier (ICS-SVM) for the diagnosis of breast cancer. In the proposed approach, we take full account of unequal misclassification costs of breast cancer intelligent diagnosis and provide more reasonable results over previous works and conventional classification models. To evaluate the performance of the proposed approach, Wisconsin Breast Cancer (WBC) and Wisconsin Diagnostic Breast Cancer (WDBC) breast cancer datasets obtained from the University of California at Irvine (UCI) machine learning repository have been studied. The experimental results demonstrate that the proposed hybrid algorithm outperforms all the existing methods. Promisingly, the proposed method can be regarded as a useful clinical tool for breast cancer diagnosis and could also be applied to other illness diagnosis. [ABSTRACT FROM AUTHOR]

The efficiency of a binary support vector machine- (SVM-) based classifier depends on the combination and the number of input features extracted from raw signals. Sometimes, a combination of individual good features does not perform well in discriminating a class due to a high level of relevance to a second class also. Moreover, an increase in the dimensions of an input vector also degrades the performance of a classifier in most cases. To get efficient results, it is needed to input a combination of the lowest possible number of discriminating features to a classifier. In this paper, we propose a framework to improve the performance of an SVM-based classifier for sensor fault classification in two ways: firstly, by selecting the best combination of features for a target class from a feature pool and, secondly, by minimizing the dimensionality of input vectors. To obtain the best combination of features, we propose a novel feature selection algorithm that selects m out of M features having the maximum mutual information (or relevance) with a target class and the minimum mutual information with nontarget classes. This technique ensures to select the features sensitive to the target class exclusively. Furthermore, we propose a diversified-input SVM (DI-SVM) model for multiclass classification problems to achieve our second objective which is to reduce the dimensions of the input vector. In this model, the number of SVM-based classifiers is the same as the number of classes in the dataset. However, each classifier is fed with a unique combination of features selected by a feature selection scheme for a target class. The efficiency of the proposed feature selection algorithm is shown by comparing the results obtained from experiments performed with and without feature selection. Furthermore, the experimental results in terms of accuracy, receiver operating characteristics (ROC), and the area under the ROC curve (AUC-ROC) show that the proposed DI-SVM model outperforms the conventional model of SVM, the neural network, and the k-nearest neighbor algorithm for sensor fault detection and classification. [ABSTRACT FROM AUTHOR]

A classifier for two or more samples is proposed when the data are high-dimensional and the distributions may be non-normal. The classifier is constructed as a linear combination of two easily computable and interpretable components, the U -component and the P -component. The U -component is a linear combination of U -statistics of bilinear forms of pairwise distinct vectors from independent samples. The P -component, the discriminant score, is a function of the projection of the U -component on the observation to be classified. Together, the two components constitute an inherently bias-adjusted classifier valid for high-dimensional data. The classifier is linear but its linearity does not rest on the assumption of homoscedasticity. Properties of the classifier and its normal limit are given under mild conditions. Misclassification errors and asymptotic properties of their empirical counterparts are discussed. Simulation results are used to show the accuracy of the proposed classifier for small or moderate sample sizes and large dimensions. Applications involving real data sets are also included. [ABSTRACT FROM AUTHOR]

Highlights • Background: P300 automatic spelling is the most celebrated brain-computer interface application. • Results: The proposed P300 detection algorithm can speed up the automatic spelling process. • Conclusion: The automatic spelling can be improved by utilizing the sparsity of EEG signals. Abstract Background Brain–computer interface (BCI) refers to a direct communication between the brain and an object to be controlled by information embedded in various signals originated from the brain. Electroencephalogram (EEG) is the most common brain signal modality due to its noninvasiveness, ease-of-use, and high time-resolution. P300-based automatic spelling is the most celebrated EEG-based BCI system, which allows its user to relay a message by just staying focused on letters and numbers displayed on a screen. The objectives of this work are (1) to introduce a novel P300 detection algorithm and (2) to compare its performance against the best current practice algorithm for P300 detection. Results Four volunteers tried to spell letters, “PIRATES”, using our automatic spelling system after proper training. Our results indicate that the proposed P300 detection algorithm can speed up the automatic spelling process since it requires a smaller number of flashing sequences than the best current practice algorithm does to recognize target event-related potentials. While the proposed P300 detection algorithm performs better than the best current practice algorithm, it does not necessarily require a heavy computational burden. Conclusion We designed a novel P300 detection algorithm assuming that the sparsity of EEG signals could be effectively utilized to detect target event-related potentials such as P300. Our pilot study results indicate that utilizing the sparsity of EEG signals can improve the automatic spelling experience. [ABSTRACT FROM AUTHOR]

In this paper we introduce a new, high-quality, dataset of images containing fruits. We also present the results of some numerical experiment for training a neural network to detect fruits. We discuss the reason why we chose to use fruits in this project by proposing a few applications that could use such classifier. [ABSTRACT FROM AUTHOR]

Facebook is one of the most popular and leading social network services online. With the increasing amount of users on Facebook, the probability of broadcasting spam content on it is also escalating day by day. There are a few existing techniques to combat spam on Facebook. However, due to the public unavailability of critical pieces of Facebook information, like profiles, network information, an unlimited number of posts and more, the existing techniques do not work efficiently for detecting many spammers. In this paper, we propose an efficient spammer detection framework (we called as SpamSpotter) that distinguishes spammers from legitimate users on Facebook. Based on Facebook's recent characteristics, the framework introduces a novel feature set to facilitate spammer detection. We use a baseline dataset from Facebook that included 300 spammers and 700 legitimate user profiles. The baseline dataset contains a set of features for each profile, which are extracted using a novel dataset construction mechanism. In addition, an intelligent decision support system that uses eight different machine learning classifiers on the baseline dataset is designed to distinguish spammers from legitimate users. To evaluate the efficiency and accuracy of our proposed framework, we implemented and compared it with existing frameworks. The evaluation results demonstrate that our proposed framework is accurate and efficient to deliver first-rate performance. It attains a higher accuracy of 0.984 and Mathew correlation coefficient of 0.977. [ABSTRACT FROM AUTHOR]

Obesity, caused primarily by overeating, is a preventable chronic disease yielding staggering healthcare costs. To detect overeating passively, a machine learning framework was designed to detect and accurately count the number of feeding gestures during an eating episode to characterize each eating episode with a feeding gesture count using a 6-axis inertial wrist-worn sensor. Moreover, detecting feeding gestures is useful to aid in end-of-day dietary recalls. It has been shown that feeding gesture count correlates with caloric intake; the more one eats, the more calories one is likely consuming. Recent research has shown promise in passively detecting feeding gestures, but this effort focuses on bridging detection of feeding gesture count and identifying overeating episodes. This paper presents results on three experiments: highly structured (participants pretending to eat), in-lab structured with confounding activities (participants eating while performing other scripted activities), and unstructured overeating (participants induced to overeat while watching television and eating their favorite foods). Our experiment successfully induced overeating in 50% of the participants, showing a correlation between feeding gesture count and caloric intake in unstructured eating (r=.79, p-value=.007). Results provide an approximate upper bound on feeding gesture classification using exact segmentation techniques, and show improvement when compared to prior sliding window techniques. Results also suggest the importance of stressing the challenge of accurate segmentation over identifying the accurate classification technique in detection of feeding gestures. Since participant-dependent models provide optimal results, a motif-based time-point fusion classification (MTFC) framework is proposed using spectral energy density, K-Spectral Centroid Clustering, symbolic aggregate approximation (SAX), a Random Forest classifier (trained on segmented motifs) and a time-point classifier fusion technique to show reliable classification of feeding gestures (75% F-measure), and a 94% accuracy of feeding gesture count in the unstructured eating experiment, resulting in a root mean square error of 2.9 feeding gestures. Mapping feeding gesture count to caloric intake, we obtain a rough estimate of whether participants overate while watching television. [ABSTRACT FROM AUTHOR]

In recent years, many techniques have been proposed for automatic recognition of Activities of Daily Living from smart home sensor data. However, classifiers usually use features created ad hoc. In this work, the use of ontologies is proposed for the fully automatic generation of these features. The process consists of converting the original dataset into an ontology and then combine all the concepts and relations in that ontology to obtain relevant class expressions. The high formalization of ontologies allows us to reduce the search space by discarding many meaningless expressions, such as contradictory or unsatisfiable expressions. The relevant class expressions are then used as features by the classifiers to build the classification model. To validate our proposal, we have used as reference the results obtained by four different classification algorithms that use the most commonly used features. [ABSTRACT FROM AUTHOR]

Recently, multifeature learning in collaborative representation classification (CRC) for hyperspectral images has generated promising performance. In this paper, two novel multifeature learning algorithms that update dictionary directly and indirectly are proposed. In order to offer the complementarity of multifeature, four different types of features—global feature (i.e., Gabor feature), local feature (i.e., local binary pattern), shape feature (i.e., extended multiattribute profiles), and spectral feature—are adopted in this paper. Under the hypothesis that most of the features should share the same coding pattern in CRC, this paper proposes to learn proper dictionaries for each feature until obtaining stable codes in a linear classifier. Furthermore, to avoid the explicit mapping of infinite-dimensional dictionaries in a nonlinear kernelized classifier, an indirect approach to construct the transformation matrix from original dictionaries to learn new dictionaries is developed. Three real hyperspectral images acquired from different sensors are adopted for performance evaluation. The experimental results demonstrate that the proposed methods can provide superior performance compared with those of the state-of-the-art classifiers. [ABSTRACT FROM AUTHOR]

When building classifiers, it is natural to require that the classifier correctly estimates the event probability (Constraint 1), that it has equal sensitivity and specificity (Constraint 2) or that it has equal positive and negative predictive values (Constraint 3). We prove that in the balanced case, where there is equal proportion of events and non-events, any classifier that satisfies one of these constraints will always satisfy all. Such unbiasedness of events and non-events is much more difficult to achieve in the case of rare events, i.e. the situation in which the proportion of events is (much) smaller than 0.5. Here, we prove that it is impossible to meet all three constraints unless the classifier achieves perfect predictions. Any nonperfect classifier can only satisfy at most one constraint, and satisfying one constraint implies violating the other two constraints in a specific direction. Our results have implications for classifiers optimized using g-means or F1-measure, which tend to satisfy Constraints 2 and 1, respectively. Our results are derived from basic probability theory and illustrated with simulations based on some frequently used classifiers. [ABSTRACT FROM AUTHOR]

Abstract: Grammatical categories represent implicit knowledge, and it is not known if such abstract linguistic knowledge can be continuously grounded in real‐life experiences, nor is it known what types of mental states can be simulated. A former study showed that attention bias in peripersonal space (PPS) affects reaction times in grammatical congruency judgments of nominal classifiers, suggesting that simulated semantics may include reenactment of attention. In this study, we contrasted a Chinese nominal classifier used with nouns denoting pinch grip objects with a classifier for nouns with big object referents in a pupil dilation experiment. Twenty Chinese native speakers read grammatical and ungrammatical classifier‐noun combinations and made grammaticality judgment while their pupillary responses were measured. It was found that their pupils dilated significantly more to the pinch grip classifier than to the big object classifier, indicating attention simulation in PPS. Pupil dilations were also significantly larger with congruent trials on the whole than in incongruent trials, but crucially, congruency and classifier semantics were independent of each other. No such effects were found in controls. [ABSTRACT FROM AUTHOR]

In this paper, the process of selecting a classifier based on the properties of dataset is designed since it is very difficult to experiment the data on n—number of classifiers. As a case study speech emotion recognition is considered. Different combinations of spectral and prosodic features relevant to emotions are explored. The best subset of the chosen set of features is recommended for each of the classifiers based on the properties of chosen dataset. Various statistical tests have been used to estimate the properties of dataset. The nature of dataset gives an idea to select the relevant classifier. To make it more precise, three other clustering and classification techniques such as K-means clustering, vector quantization and artificial neural networks are used for experimentation and results are compared with the selected classifier. Prosodic features like pitch, intensity, jitter, shimmer, spectral features such as mel frequency cepstral coefficients (MFCCs) and formants are considered in this work. Statistical parameters of prosody such as minimum, maximum, mean (μ) and standard deviation (σ) are extracted from speech and combined with basic spectral (MFCCs) features to get better performance. Five basic emotions namely anger, fear, happiness, neutral and sadness are considered. For analysing the performance of different datasets on different classifiers, content and speaker independent emotional data is used, collected from Telugu movies. Mean opinion score of fifty users is collected to label the emotional data. To make it more accurate, one of the benchmark IIT-Kharagpur emotional database is used to generalize the conclusions. [ABSTRACT FROM AUTHOR]

Speech is an effective medium to express emotions and attitude through language. Finding the emotional content from a speech signal and identify the emotions from the speech utterances is an important task for the researchers. Speech emotion recognition has considered as an important research area over the last decade. Many researchers have been attracted due to the automated analysis of human affective behaviour. Therefore a number of systems, algorithms, and classifiers have been developed and outlined for the identification of emotional content of a speech from a person’s speech. In this study, available literature on various databases, different features and classifiers have been taken in to consideration for speech emotion recognition from assorted languages. [ABSTRACT FROM AUTHOR]

• A novel feature selection model is proposed for Parkinson's disease diagnosis. • Strongly relevant features are selected by the maximal information coefficient. • A dynamic feature selection strategy based on self-organizing map is proposed. • The model combines relevance, redundancy and complementarity to select features. • The effectiveness of the model is verified on two widely used datasets. Voice disorders are one of the incipient symptoms of Parkinson's disease (PD). The existing PD voice feature analysis methods generally reduce dimensionality by selecting features with high relevance and low redundancy, ignoring the complementarity between features. To fully explore the intrinsic connection between PD features, this paper proposes a local dynamic feature selection fusion method (LDFSF) for PD identification and symptom severity prediction. First, the maximal information coefficient is used to calculate the relevance between features and the target value, and removes low relevant features. Then, a dynamic feature selection strategy based on self-organizing map network clustering is designed. This strategy dynamically updates the feature subset in a forward manner, and combines the relevance, redundancy and complementarity for feature selection. Among them, self-organizing map network clustering reduces the computational cost by reducing the number of candidate features, and effectively improves the accuracy of the model. Finally, the selected features are fed into the appropriate classifier or regressor to achieve accurate PD identification and severity progress prediction. Experiments on public OPDD and PTDS datasets show that the classification accuracy, sensitivity and specificity of LDFSF method on OPDD are 98.20%, 92.00% and 99.50% respectively, and the mean absolute error of predicting PD severity (motor- and total-UPDRS) on PTDS are 1.62 and 1.99 respectively, which are better than the compared methods for the selection of five and eight features respectively, thus indicating that the proposed LDFSF method can be effectively used in PD voice diagnosis. [ABSTRACT FROM AUTHOR]

When applying data-mining techniques to real-world data, we often find ourselves facing observations that have no value recorded for some attributes. This can be caused by several phenomena, such as a machine’s incapability to record certain characteristics or a person refusing to answer a question in a poll. Depending on that motivation, values gone missing may follow one kind of pattern or another, or describe no regularity at all. One approach to palliate the effect of missing data on machine learning tasks is to replace the missing observations. Imputation algorithms attempt to calculate a value for a missing gap, using information associated with it, i.e., the attribute and/or other values in the same observation. While several imputation methods have been proposed in the literature, few works have addressed the question of the relationship between the type of missing data, the choice of the imputation method, and the effectiveness of classification algorithms that used the imputed data. In this paper we address the relationship among these three factors. By constructing a benchmark of hundreds of databases containing different types of missing data, and applying several imputation methods and classification algorithms, we empirically show that an interaction between imputation methods and supervised classification can be deduced. Besides, differences in terms of classification performance for the same imputation method in different missing data patterns have been found. This points to the convenience of considering the combined choice of the imputation method and the classifier algorithm according to the missing data type. [ABSTRACT FROM AUTHOR]

People typically learn through exposure to visual concepts associated with linguistic descriptions. For instance, teaching visual object categories to children is often accompanied by descriptions in text or speech. In a machine learning context, these observations motivates us to ask whether this learning process could be computationally modeled to learn visual classifiers. More specifically, the main question of this work is how to utilize purely textual description of visual classes with no training images, to learn explicit visual classifiers for them. We propose and investigate two baseline formulations, based on regression and domain transfer, that predict a linear classifier. Then, we propose a new constrained optimization formulation that combines a regression function and a knowledge transfer function with additional constraints to predict the parameters of a linear classifier. We also propose a generic kernelized models where a kernel classifier is predicted in the form defined by the representer theorem. The kernelized models allow defining and utilizing any two Reproducing Kernel Hilbert Space (RKHS) kernel functions in the visual space and text space, respectively. We finally propose a kernel function between unstructured text descriptions that builds on distributional semantics, which shows an advantage in our setting and could be useful for other applications. We applied all the studied models to predict visual classifiers on two fine-grained and challenging categorization datasets (CU Birds and Flower Datasets), and the results indicate successful predictions of our final model over several baselines that we designed. [ABSTRACT FROM PUBLISHER]

In recent years, ensemble learning has become a prolific area of study in pattern recognition, based on the assumption that using and combining different learning models in the same problem could lead to better performance results than using a single model. This idea of ensemble learning has traditionally been used for classification tasks, but has more recently been adapted to other machine learning tasks such as clustering and feature selection. We propose several feature selection ensemble configurations based on combining rankings of features from individual rankers according to the combination method and threshold value used. The performance of each proposed ensemble configuration was tested for synthetic datasets (to assess the adequacy of the selection), real classical datasets (with more samples than features), and DNA microarray datasets (with more features than samples). Five different classifiers were studied in order to test the suitability of the proposed ensemble configurations and assess the results. [ABSTRACT FROM AUTHOR]

We propose a paradigm to apply machine learning various databases which have emerged in the study of the string landscape. In particular, we establish neural networks as both classifiers and predictors and train them with a host of available data ranging from Calabi–Yau manifolds and vector bundles, to quiver representations for gauge theories, using a novel framework of recasting geometrical and physical data as pixelated images. We find that even a relatively simple neural network can learn many significant quantities to astounding accuracy in a matter of minutes and can also predict hithertofore unencountered results, whereby rendering the paradigm a valuable tool in physics as well as pure mathematics. [ABSTRACT FROM AUTHOR]

This paper presents a system to predict gender of individuals from offline handwriting samples. The technique relies on extracting a set of textural features from handwriting samples of male and female writers and training multiple classifiers to learn to discriminate between the two gender classes. The features include local binary patterns (LBP), histogram of oriented gradients (HOG), statistics computed from gray-level co-occurrence matrices (GLCM) and features extracted through segmentation-based fractal texture analysis (SFTA). For classification, we employ artificial neural networks (ANN), support vector machine (SVM), nearest neighbor classifier (NN), decision trees (DT) and random forests (RF). Classifiers are then combined using bagging, voting and stacking techniques to enhance the overall system performance. The realized classification rates are significantly better than those of the state-of-the-art systems on this problem validating the ideas put forward in this study. [ABSTRACT FROM AUTHOR]