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.
Administrative procedures in various organizations produce numerous crucial records and data. These
records and data are also used in other processes like customer relationship management and accounting
operations.It is incredibly challenging to use and extract valuable and meaningful information from these data
and records because they are frequently enormous and continuously growing in size and complexity.Data
mining is the act of sorting through large data sets to find patterns and relationships that might aid in the data
analysis process of resolving business issues. Using data mining techniques, enterprises can forecast future
trends and make better business decisions.The Apriori algorithm has bee
In this study, several ionanofluids (INFs) were prepared in order to study their efficiency as a cooling medium at 25 °C. The two-step technique is used to prepare ionanofluid (INF) by dispersing multi-walled carbon nanotubes (MWCNTs) in two concentrations 0.5 and 1 wt% in ionic liquid (IL). Two types of ionic liquids (ILs) were used: hydrophilic represented by 1-ethyl-3-methylimidazolium tetrafluoroborate [EMIM][BF4] and hydrophobic represented by 1-hexyl-3-methylimidazolium hexafluorophosphate [HMIM][PF6]. The thermophysical properties of the prepared INFs including thermal conductivity (TC), density and viscosity were measured experimental
Face recognition and identity verification are now critical components of current security and verification technology. The main objective of this review is to identify the most important deep learning techniques that have contributed to the improvement in the accuracy and reliability of facial recognition systems, as well as highlighting existing problems and potential future research areas. An extensive literature review was conducted with the assistance of leading scientific databases such as IEEE Xplore, ScienceDirect, and SpringerLink and covered studies from the period 2015 to 2024. The studies of interest were related to the application of deep neural networks, i.e., CNN, Siamese, and Transformer-based models, in face recogni
... Show MoreLet be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... Show MoreThe Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.
We report the detail characterizations and
The notion of a Tˉ-pure sub-act and so Tˉ-pure sub-act relative to sub-act are introduced. Some properties of these concepts have been studied.