Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) for classification purpose. The results obtained from the different groups are then fused using Naïve Bayes classifier to make the final decision regards the emotion class. Different tests were performed using Surrey Audio-Visual Expressed Emotion (SAVEE) database and the achieved results showed that the system gives the desired accuracy (100%) when fusion decisions of the facial groups. The achieved result outperforms state-of-the-art results on the same database.
Malicious software (malware) performs a malicious function that compromising a computer system’s security. Many methods have been developed to improve the security of the computer system resources, among them the use of firewall, encryption, and Intrusion Detection System (IDS). IDS can detect newly unrecognized attack attempt and raising an early alarm to inform the system about this suspicious intrusion attempt. This paper proposed a hybrid IDS for detection intrusion, especially malware, with considering network packet and host features. The hybrid IDS designed using Data Mining (DM) classification methods that for its ability to detect new, previously unseen intrusions accurately and automatically. It uses both anomaly and misuse dete
... Show MoreIn data mining, classification is a form of data analysis that can be used to extract models describing important data classes. Two of the well known algorithms used in data mining classification are Backpropagation Neural Network (BNN) and Naïve Bayesian (NB). This paper investigates the performance of these two classification methods using the Car Evaluation dataset. Two models were built for both algorithms and the results were compared. Our experimental results indicated that the BNN classifier yield higher accuracy as compared to the NB classifier but it is less efficient because it is time-consuming and difficult to analyze due to its black-box implementation.
PKE Sharquie MD, PDPAA Noaimi MD, DDV, FDSM Al-Ogaily MD, IOSR Journal of Dental and Medical Sciences (IOSR-JDMS), 2015
In a connected graph , the distance function between each pair of two vertices from a set vertex is the shortest distance between them and the vertex degree denoted by is the number of edges which are incident to the vertex The Schultz and modified Schultz polynomials of are have defined as:
respectively, where the summations are taken over all unordered pairs of distinct vertices in and is the distance between and in The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.
Seeds of five cultivars of oats (Avena sativa) were introduced from Italy in 2009. Seeds were propagated on the farm of the Dept. of Field Crops Sci. / Coll. of Agric. / Univ. of Baghdad in the season 2009 – 2010. The cultivars Anatolia, Alguda, Hamel, Pimula and Genzania were planted under 3 irrigation intervals; 3, 4 and 5 weeks to give water depth of 480, 400 and 320 mm, respectively . The depth of water was 80 mm each irrigation. A factorial experiment with RCBD of 4 replicates was conducted in 2 consecutive seasons in 2010 – 2011 and 2011 – 2012. The cultivar Alguda gave highest grain yield (8.07 t/ ha) under 480 mm, and 7.02 t / ha average of 3 water depths. This cultivar was characterized by high growth rate (13.2 g/m2/ d) that
... Show More