Classification of Printed Moroccan Town and Village Names

2014 ◽  
Vol 7 (4) ◽  
pp. 1-11 ◽  
Author(s):  
Said Nouri ◽  
Mohamed Fakir
Keyword(s):  
New Method ◽  
Second Step ◽  
Linear Kernel ◽  
Data Set ◽  
Matrix Size ◽  
Perfect Score

This paper presents a new method called density weight and zigzag sequence to recognize printed Arabic names. This technique was performed on two steps, the first aims to reduce matrix size of 96x96 into 12x12 using density weight techniques, in the second step the last matrix (12x12) was used to extract 144 sequences following path zigzag technique. 144 features found are used for representing each name in data set. This proposed technique was tested on Morocco town and village names using KNN with consensus rule and SVM classifiers. The perfect score was obtained with KNN (k=9) and SVM (linear kernel).

Roman Urdu Headline News Text Classification Using RNN, LSTM and CNN

2020 ◽  
pp. 2050008
Author(s):  
Irfan Ali Kandhro ◽  
Sahar Zafar Jumani ◽  
Kamlash Kumar ◽  
Abdul Hafeez ◽  
Fayyaz Ali
Keyword(s):  
Text Classification ◽  
Research Work ◽  
Second Step ◽  
Text Documents ◽  
Data Set ◽  
News Websites ◽  
Testing Accuracy ◽  
Headline News ◽  
Automated Tool

This paper presents the automated tool for the classification of text with respect to predefined categories. It has always been considered as a vital method to manage and process a huge number of documents in digital forms which are widespread and continuously increasing. Most of the research work in text classification has been done in Urdu, English and other languages. But limited research work has been carried out on roman data. Technically, the process of the text classification follows two steps: the first step consists of choosing the main features from all the available features of the text documents with the usage of feature extraction techniques. The second step applies classification algorithms on those chosen features. The data set is collected through scraping tools from the most popular news websites Awaji Awaze and Daily Jhoongar. Furthermore, the data set splits in training and testing 70%, 30%, respectively. In this paper, the deep learning models, such as RNN, LSTM, and CNN, are used for classification of roman Urdu headline news. The testing accuracy of RNN (81%), LSTM (82%), and CNN (79%), and the experimental results demonstrate that the performance of the LSTM method is state-of-art method compared to CNN and RNN.

scholarly journals New parameterisation method for three-dimensional otolith surface images

2016 ◽  
Vol 67 (7) ◽  
pp. 1059 ◽  
Author(s):  
P. Marti-Puig ◽  
J. Danés ◽  
A. Manjabacas ◽  
A. Lombarte
Keyword(s):  
Three Dimensional ◽  
New Method ◽  
Second Step ◽  
Information Compression ◽  
Closed Curves ◽  
Automatic Retrieval ◽  
Set Of Points ◽  
Very High ◽  
High Information

The three-dimensional (3-D) otolith shapes recently included in the Anàlisi de FORmes d’Otòlits (AFORO) database are defined by means of clouds of points across their surfaces. Automatic retrieval and classification of natural objects from 3-D databases becomes a difficult and time-consuming task when the number of elements in the database becomes large. In order to simplify that task we propose a new method for compacting data from 3-D shapes. The new method has two main steps. The first is a subsampling process, the result of which can always be interpreted as a closed curve in the 3-D space by considering the retained points in an appropriate order. The subsampling preserves morphological information, but greatly reduces the number of points required to represent the shape. The second step treats the coordinates of the 3-D closed curves as periodic functions. Therefore, Fourier expansions can be applied to each coordinate, producing more information compression into a reduced set of points. The method can reach very high information compression factors. It also allows reconstruction of the 3-D points resulting from the subsampling process in the first step. This parameterisation method is able to capture 3-D information relevant to classification of fish species from their otoliths, providing a greater percentage of correctly classified specimens compared with the previous two-dimensional analysis.

An Experimental Validation of a New Method for Multimodel Identification

2017 ◽  
Vol 140 (2) ◽  
Author(s):  
Anis Messaoud ◽  
Ridha Ben Abdennour
Keyword(s):  
Nonlinear System ◽  
Experimental Validation ◽  
Chemical Reactor ◽  
New Method ◽  
Data Set ◽  
Weighting Functions ◽  
Systematic Determination

In this paper, we propose a new method for an optimal systematic determination of models' base for multimodel identification. This method is based on the neural classification of data set picked out on a considered nonlinear system. The obtained cluster centers are exploited to provide the weighting functions and to deduce the corresponding dispersions and their models' base. A simulation example and an experimental validation on a chemical reactor are presented to evaluate the effectiveness of the proposed method.

Machine Learning Verdict of EEG Signals in Brain Computer Interface

2018 ◽  
pp. 429-441
Author(s):  
M. Jeyanthi ◽  
C. Velayutham
Keyword(s):  
Nearest Neighbor ◽  
Technology Development ◽  
Vital Role ◽  
Svm Classifier ◽  
K Nearest Neighbor ◽  
Data Mining Technique ◽  
Data Set ◽  
Eeg Data ◽  
Irrelevant Attributes

In Science and Technology Development BCI plays a vital role in the field of Research. Classification is a data mining technique used to predict group membership for data instances. Analyses of BCI data are challenging because feature extraction and classification of these data are more difficult as compared with those applied to raw data. In this paper, We extracted features using statistical Haralick features from the raw EEG data . Then the features are Normalized, Binning is used to improve the accuracy of the predictive models by reducing noise and eliminate some irrelevant attributes and then the classification is performed using different classification techniques such as Naïve Bayes, k-nearest neighbor classifier, SVM classifier using BCI dataset. Finally we propose the SVM classification algorithm for the BCI data set.

A New Approach for the Analysis of Mixture Toxicity Data

1992 ◽  
Vol 26 (9-11) ◽  
pp. 2345-2348 ◽  
Author(s):  
C. N. Haas
Keyword(s):  
Quantitative Analysis ◽  
Mixture Toxicity ◽  
New Method ◽  
Metal Exposure ◽  
Positive Interactions ◽  
Toxicity Data ◽  
Data Set ◽  
New Approach ◽  
Negative Interactions

A new method for the quantitative analysis of multiple toxicity data is described and illustrated using a data set on metal exposure to copepods. Positive interactions are observed for Ni-Pb and Pb-Cr, with weak negative interactions observed for Ni-Cr.

scholarly journals Classification of jujube defects in small data sets based on transfer learning

2021 ◽  
Author(s):  
Jianping Ju ◽  
Hong Zheng ◽  
Xiaohang Xu ◽  
Zhongyuan Guo ◽  
Zhaohui Zheng ◽  
...  
Keyword(s):  
Transfer Learning ◽  
Loss Function ◽  
Training Model ◽  
Parameter Distribution ◽  
Test Accuracy ◽  
Small Data ◽  
Data Sets ◽  
Data Set ◽  
Small Data Sets

AbstractAlthough convolutional neural networks have achieved success in the field of image classification, there are still challenges in the field of agricultural product quality sorting such as machine vision-based jujube defects detection. The performance of jujube defect detection mainly depends on the feature extraction and the classifier used. Due to the diversity of the jujube materials and the variability of the testing environment, the traditional method of manually extracting the features often fails to meet the requirements of practical application. In this paper, a jujube sorting model in small data sets based on convolutional neural network and transfer learning is proposed to meet the actual demand of jujube defects detection. Firstly, the original images collected from the actual jujube sorting production line were pre-processed, and the data were augmented to establish a data set of five categories of jujube defects. The original CNN model is then improved by embedding the SE module and using the triplet loss function and the center loss function to replace the softmax loss function. Finally, the depth pre-training model on the ImageNet image data set was used to conduct training on the jujube defects data set, so that the parameters of the pre-training model could fit the parameter distribution of the jujube defects image, and the parameter distribution was transferred to the jujube defects data set to complete the transfer of the model and realize the detection and classification of the jujube defects. The classification results are visualized by heatmap through the analysis of classification accuracy and confusion matrix compared with the comparison models. The experimental results show that the SE-ResNet50-CL model optimizes the fine-grained classification problem of jujube defect recognition, and the test accuracy reaches 94.15%. The model has good stability and high recognition accuracy in complex environments.

scholarly journals A New Method for Landmark-Based Studies of the Dynamic Stability of Growth, with Implications for Evolutionary Analyses

2021 ◽  
Author(s):  
Fred L. Bookstein
Keyword(s):  
Growth Regulation ◽  
Pattern Analysis ◽  
Developmental Time ◽  
Dynamical Stability ◽  
New Method ◽  
Data Sets ◽  
Data Set ◽  
Landmark Data ◽  
Study Designs ◽  
Changes Over Time

AbstractA matrix manipulation new to the quantitative study of develomental stability reveals unexpected morphometric patterns in a classic data set of landmark-based calvarial growth. There are implications for evolutionary studies. Among organismal biology’s fundamental postulates is the assumption that most aspects of any higher animal’s growth trajectories are dynamically stable, resilient against the types of small but functionally pertinent transient perturbations that may have originated in genotype, morphogenesis, or ecophenotypy. We need an operationalization of this axiom for landmark data sets arising from longitudinal data designs. The present paper introduces a multivariate approach toward that goal: a method for identification and interpretation of patterns of dynamical stability in longitudinally collected landmark data. The new method is based in an application of eigenanalysis unfamiliar to most organismal biologists: analysis of a covariance matrix of Boas coordinates (Procrustes coordinates without the size standardization) against their changes over time. These eigenanalyses may yield complex eigenvalues and eigenvectors (terms involving $$i=\sqrt{-1}$$ i = - 1 ); the paper carefully explains how these are to be scattered, gridded, and interpreted by their real and imaginary canonical vectors. For the Vilmann neurocranial octagons, the classic morphometric data set used as the running example here, there result new empirical findings that offer a pattern analysis of the ways perturbations of growth are attenuated or otherwise modified over the course of developmental time. The main finding, dominance of a generalized version of dynamical stability (negative autoregressions, as announced by the negative real parts of their eigenvalues, often combined with shearing and rotation in a helpful canonical plane), is surprising in its strength and consistency. A closing discussion explores some implications of this novel pattern analysis of growth regulation. It differs in many respects from the usual way covariance matrices are wielded in geometric morphometrics, differences relevant to a variety of study designs for comparisons of development across species.

scholarly journals ResCaps: an improved capsule network and its application in ultrasonic image classification of thyroid papillary carcinoma

2021 ◽  
Author(s):  
Xiongzhi Ai ◽  
Jiawei Zhuang ◽  
Yonghua Wang ◽  
Pin Wan ◽  
Yu Fu
Keyword(s):  
Papillary Carcinoma ◽  
Network Model ◽  
Reliability And Validity ◽  
Thyroid Papillary Carcinoma ◽  
Data Set ◽  
Ultrasonic Image ◽  
First Choice ◽  
Thyroid Papillary ◽  
Ultrasonic Images

AbstractUltrasonic image examination is the first choice for the diagnosis of thyroid papillary carcinoma. However, there are some problems in the ultrasonic image of thyroid papillary carcinoma, such as poor definition, tissue overlap and low resolution, which make the ultrasonic image difficult to be diagnosed. Capsule network (CapsNet) can effectively address tissue overlap and other problems. This paper investigates a new network model based on capsule network, which is named as ResCaps network. ResCaps network uses residual modules and enhances the abstract expression of the model. The experimental results reveal that the characteristic classification accuracy of ResCaps3 network model for self-made data set of thyroid papillary carcinoma was $$81.06\%$$ 81.06 % . Furthermore, Fashion-MNIST data set is also tested to show the reliability and validity of ResCaps network model. Notably, the ResCaps network model not only improves the accuracy of CapsNet significantly, but also provides an effective method for the classification of lesion characteristics of thyroid papillary carcinoma ultrasonic images.

A Novel K-Harmonic Means Clustering Based on Multiple Initial Centers

2013 ◽  
Vol 321-324 ◽  
pp. 1947-1950
Author(s):  
Lei Gu ◽  
Xian Ling Lu
Keyword(s):  
New Method ◽  
Final Solution ◽  
Data Set ◽  
Number Of Clusters ◽  
Multiple Groups ◽  
Harmonic Means

In the initialization of the traditional k-harmonic means clustering, the initial centers are generated randomly and its number is equal to the number of clusters. Although the k-harmonic means clustering is insensitive to the initial centers, this initialization method cannot improve clustering performance. In this paper, a novel k-harmonic means clustering based on multiple initial centers is proposed. The number of the initial centers is more than the number of clusters in this new method. The new method with multiple initial centers can divide the whole data set into multiple groups and combine these groups into the final solution. Experiments show that the presented algorithm can increase the better clustering accuracies than the traditional k-means and k-harmonic methods.

Sign in / Sign up

Export Citation Format

Share Document