In this study, we used the multi-resolution graph-based clustering （MRGC） method for determining the electrofacies （EF） and lithofacies （LF） from well log data obtained from the intraplatform bank gas fields loc...In this study, we used the multi-resolution graph-based clustering （MRGC） method for determining the electrofacies （EF） and lithofacies （LF） from well log data obtained from the intraplatform bank gas fields located in the Amu Darya Basin. The MRGC could automatically determine the optimal number of clusters without prior knowledge about the structure or cluster numbers of the analyzed data set and allowed the users to control the level of detail actually needed to define the EF. Based on the LF identification and successful EF calibration using core data, an MRGC EF partition model including five clusters and a quantitative LF interpretation chart were constructed. The EF clusters 1 to 5 were interpreted as lagoon, anhydrite flat, interbank, low-energy bank, and high-energy bank, and the coincidence rate in the cored interval could reach 85%. We concluded that the MRGC could be accurately applied to predict the LF in non-cored but logged wells. Therefore, continuous EF clusters were partitioned and corresponding LF were characteristics ＆different LF were analyzed interpreted, and the distribution and petrophysical in the framework of sequence stratigraphy.展开更多
In order to effectively reduce the uncertainty error of mobile robot localization with a single sensor and improve the accuracy and robustness of robot localization and mapping,a mobile robot localization algorithm ba...In order to effectively reduce the uncertainty error of mobile robot localization with a single sensor and improve the accuracy and robustness of robot localization and mapping,a mobile robot localization algorithm based on multi-sensor information fusion(MSIF)was proposed.In this paper,simultaneous localization and mapping(SLAM)was realized on the basis of laser Rao-Blackwellized particle filter(RBPF)-SLAM algorithm and graph-based optimization theory was used to constrain and optimize the pose estimation results of Monte Carlo localization.The feature point extraction and quadrilateral closed loop matching algorithm based on oriented FAST and rotated BRIEF(ORB)were improved aiming at the problems of generous calculation and low tracking accuracy in visual information processing by means of the three-dimensional(3D)point feature in binocular visual reconstruction environment.Factor graph model was used for the information fusion under the maximum posterior probability criterion for laser RBPF-SLAM localization and binocular visual localization.The results of simulation and experiment indicate that localization accuracy of the above-mentioned method is higher than that of traditional RBPF-SLAM algorithm and general improved algorithms,and the effectiveness and usefulness of the proposed method are verified.展开更多
Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to bes...Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to best improve performance while limiting the number of new labels."Model Change"active learning quantifies the resulting change incurred in the classifier by introducing the additional label(s).We pair this idea with graph-based semi-supervised learning(SSL)methods,that use the spectrum of the graph Laplacian matrix,which can be truncated to avoid prohibitively large computational and storage costs.We consider a family of convex loss functions for which the acquisition function can be efficiently approximated using the Laplace approximation of the posterior distribution.We show a variety of multiclass examples that illustrate improved performance over prior state-of-art.展开更多
Two heuristic methods are proposed to find an effective and fast solution in modern power distribution networks.For solving the service restoration problem in distribution networks,switch selection indices based on an...Two heuristic methods are proposed to find an effective and fast solution in modern power distribution networks.For solving the service restoration problem in distribution networks,switch selection indices based on an analytic approach and a practicable heuristic graph-based method are given.The formulation of the problem includes four different objective functions:1)maximizing the total load restored;2)minimizing the number of switching operations;3)maximizing the top priority restored load;4)minimizing load shedding.A suitable evaluation of switch indices is used for all candidate tie switches(TSs)in the network to find the best solution and decrease the number of switching operations.A new graph-based approach is utilized for finding the best sectionalizes switch(SS)and minimizing the voltage drop.The accuracy and the validity of the approach are tested in two standard electrical distribution networks.The results of the approach are used for IEEE 69-bus and IEEE 119-bus test case.展开更多
Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrast...Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrastructures,the information technology platform is anticipating a completely new level of devel-opment.The following concepts are proposed in this research paper:1)A reliable authentication method Data replication that is optimised;graph-based data encryp-tion and packing colouring in Redundant Array of Independent Disks(RAID)sto-rage.At the data centre,data is encrypted using crypto keys called Key Streams.These keys are produced using the packing colouring method in the web graph’s jump graph.In order to achieve space efficiency,the replication is carried out on optimised many servers employing packing colours.It would be thought that more connections would provide better authentication.This study provides an innovative architecture with robust security,enhanced authentication,and low cost.展开更多
Graph-based semi-supervised learning is an important semi-supervised learning paradigm. Although graphbased semi-supervised learning methods have been shown to be helpful in various situations, they may adversely affe...Graph-based semi-supervised learning is an important semi-supervised learning paradigm. Although graphbased semi-supervised learning methods have been shown to be helpful in various situations, they may adversely affect performance when using unlabeled data. In this paper, we propose a new graph-based semi-supervised learning method based on instance selection in order to reduce the chances of performance degeneration. Our basic idea is that given a set of unlabeled instances, it is not the best approach to exploit all the unlabeled instances; instead, we should exploit the unlabeled instances that are highly likely to help improve the performance, while not taking into account the ones with high risk. We develop both transductive and inductive variants of our method. Experiments on a broad range of data sets show that the chances of performance degeneration of our proposed method are much smaller than those of many state-of-the-art graph-based semi-supervised learning methods.展开更多
Glaucoma is a group of ocular atrophy diseases that cause progressive vision loss by affecting the optic nerve.Because of its asymptomatic nature,glaucoma has become the leading cause of human blindness worldwide.In t...Glaucoma is a group of ocular atrophy diseases that cause progressive vision loss by affecting the optic nerve.Because of its asymptomatic nature,glaucoma has become the leading cause of human blindness worldwide.In this paper,a novel computer-aided diagnosis(CAD)approach for glaucomatous retinal image classification has been introduced.It extracts graph-based texture features from structurally improved fundus images using discrete wavelet-transformation(DWT)and deterministic tree-walk(DTW)procedures.Retinal images are considered from both public repositories and eye hospitals.Images are enhanced with image-specific luminance and gradient transitions for both contrast and texture improvement.The enhanced images are mapped into undirected graphs using DTW trajectories formed by the image’s wavelet coefficients.Graph-based features are extracted fromthese graphs to capture image texture patterns.Machine learning(ML)classifiers use these features to label retinal images.This approach has attained an accuracy range of 93.5%to 100%,82.1%to 99.3%,95.4%to 100%,83.3%to 96.6%,77.7%to 88.8%,and 91.4%to 100%on the ACRIMA,ORIGA,RIM-ONE,Drishti,HRF,and HOSPITAL datasets,respectively.The major strength of this approach is texture pattern identification using various topological graphs.It has achieved optimal performance with SVM and RF classifiers using biorthogonal DWT combinations on both public and patients’fundus datasets.The classification performance of the DWT-DTW approach is on par with the contemporary state-of-the-art methods,which can be helpful for ophthalmologists in glaucoma screening.展开更多
Recently,bio-inspired algorithms have been increasingly explored for autonomous robot path planning on grid-based maps.However,these approaches endure performance degradation as problem complexity increases,often resu...Recently,bio-inspired algorithms have been increasingly explored for autonomous robot path planning on grid-based maps.However,these approaches endure performance degradation as problem complexity increases,often resulting in lengthy search times to find an optimal solution.This limitation is particularly critical for real-world applications like autonomous off-road vehicles,where highquality path computation is essential for energy efficiency.To address these challenges,this paper proposes a new graph-based optimal path planning approach that leverages a sort of bio-inspired algorithm,improved seagull optimization algorithm(iSOA)for rapid path planning of autonomous robots.A modified Douglas–Peucker(mDP)algorithm is developed to approximate irregular obstacles as polygonal obstacles based on the environment image in rough terrains.The resulting mDPderived graph is then modeled using a Maklink graph theory.By applying the iSOA approach,the trajectory of an autonomous robot in the workspace is optimized.Additionally,a Bezier-curve-based smoothing approach is developed to generate safer and smoother trajectories while adhering to curvature constraints.The proposed model is validated through simulated experiments undertaken in various real-world settings,and its performance is compared with state-of-the-art algorithms.The experimental results demonstrate that the proposed model outperforms existing approaches in terms of time cost and path length.展开更多
Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,local...Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data sp展开更多
The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based fea...The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based features has been extensively studied in the literature.Existing flow-based detection methods involve significant computational overhead that does not completely capture network communication patterns that might reveal other features ofmalicious hosts.Recently,Graph-Based Bot Detection methods using ML have gained attention to overcome these limitations,as graphs provide a real representation of network communications.The purpose of this study is to build a botnet malware detection system utilizing centrality measures for graph-based botnet detection and ML.We propose BotSward,a graph-based bot detection system that is based on ML.We apply the efficient centrality measures,which are Closeness Centrality(CC),Degree Centrality(CC),and PageRank(PR),and compare them with others used in the state-of-the-art.The efficiency of the proposed method is verified on the available Czech Technical University 13 dataset(CTU-13).The CTU-13 dataset contains 13 real botnet traffic scenarios that are connected to a command-and-control(C&C)channel and that cause malicious actions such as phishing,distributed denial-of-service(DDoS)attacks,spam attacks,etc.BotSward is robust to zero-day attacks,suitable for large-scale datasets,and is intended to produce better accuracy than state-of-the-art techniques.The proposed BotSward solution achieved 99%accuracy in botnet attack detection with a false positive rate as low as 0.0001%.展开更多
Emotion Recognition in Conversations(ERC)is fundamental in creating emotionally intelligentmachines.Graph-BasedNetwork(GBN)models have gained popularity in detecting conversational contexts for ERC tasks.However,their...Emotion Recognition in Conversations(ERC)is fundamental in creating emotionally intelligentmachines.Graph-BasedNetwork(GBN)models have gained popularity in detecting conversational contexts for ERC tasks.However,their limited ability to collect and acquire contextual information hinders their effectiveness.We propose a Text Augmentation-based computational model for recognizing emotions using transformers(TA-MERT)to address this.The proposed model uses the Multimodal Emotion Lines Dataset(MELD),which ensures a balanced representation for recognizing human emotions.Themodel used text augmentation techniques to producemore training data,improving the proposed model’s accuracy.Transformer encoders train the deep neural network(DNN)model,especially Bidirectional Encoder(BE)representations that capture both forward and backward contextual information.This integration improves the accuracy and robustness of the proposed model.Furthermore,we present a method for balancing the training dataset by creating enhanced samples from the original dataset.By balancing the dataset across all emotion categories,we can lessen the adverse effects of data imbalance on the accuracy of the proposed model.Experimental results on the MELD dataset show that TA-MERT outperforms earlier methods,achieving a weighted F1 score of 62.60%and an accuracy of 64.36%.Overall,the proposed TA-MERT model solves the GBN models’weaknesses in obtaining contextual data for ERC.TA-MERT model recognizes human emotions more accurately by employing text augmentation and transformer-based encoding.The balanced dataset and the additional training samples also enhance its resilience.These findings highlight the significance of transformer-based approaches for special emotion recognition in conversations.展开更多
基金supported by the National Science and Technology Major Project of China(No.2011ZX05029-003)CNPC Science Research and Technology Development Project,China(No.2013D-0904)
文摘In this study, we used the multi-resolution graph-based clustering （MRGC） method for determining the electrofacies （EF） and lithofacies （LF） from well log data obtained from the intraplatform bank gas fields located in the Amu Darya Basin. The MRGC could automatically determine the optimal number of clusters without prior knowledge about the structure or cluster numbers of the analyzed data set and allowed the users to control the level of detail actually needed to define the EF. Based on the LF identification and successful EF calibration using core data, an MRGC EF partition model including five clusters and a quantitative LF interpretation chart were constructed. The EF clusters 1 to 5 were interpreted as lagoon, anhydrite flat, interbank, low-energy bank, and high-energy bank, and the coincidence rate in the cored interval could reach 85%. We concluded that the MRGC could be accurately applied to predict the LF in non-cored but logged wells. Therefore, continuous EF clusters were partitioned and corresponding LF were characteristics ＆different LF were analyzed interpreted, and the distribution and petrophysical in the framework of sequence stratigraphy.
基金Natural Science Foundation of Shaanxi Province(No.2019JQ-004)Scientific Research Plan Projects of Shaanxi Education Department(No.18JK0438)Youth Talent Promotion Project of Shaanxi Province(No.20180112)。
文摘In order to effectively reduce the uncertainty error of mobile robot localization with a single sensor and improve the accuracy and robustness of robot localization and mapping,a mobile robot localization algorithm based on multi-sensor information fusion(MSIF)was proposed.In this paper,simultaneous localization and mapping(SLAM)was realized on the basis of laser Rao-Blackwellized particle filter(RBPF)-SLAM algorithm and graph-based optimization theory was used to constrain and optimize the pose estimation results of Monte Carlo localization.The feature point extraction and quadrilateral closed loop matching algorithm based on oriented FAST and rotated BRIEF(ORB)were improved aiming at the problems of generous calculation and low tracking accuracy in visual information processing by means of the three-dimensional(3D)point feature in binocular visual reconstruction environment.Factor graph model was used for the information fusion under the maximum posterior probability criterion for laser RBPF-SLAM localization and binocular visual localization.The results of simulation and experiment indicate that localization accuracy of the above-mentioned method is higher than that of traditional RBPF-SLAM algorithm and general improved algorithms,and the effectiveness and usefulness of the proposed method are verified.
基金supported by the DOD National Defense Science and Engineering Graduate(NDSEG)Research Fellowshipsupported by the NGA under Contract No.HM04762110003.
文摘Active learning in semi-supervised classification involves introducing additional labels for unlabelled data to improve the accuracy of the underlying classifier.A challenge is to identify which points to label to best improve performance while limiting the number of new labels."Model Change"active learning quantifies the resulting change incurred in the classifier by introducing the additional label(s).We pair this idea with graph-based semi-supervised learning(SSL)methods,that use the spectrum of the graph Laplacian matrix,which can be truncated to avoid prohibitively large computational and storage costs.We consider a family of convex loss functions for which the acquisition function can be efficiently approximated using the Laplace approximation of the posterior distribution.We show a variety of multiclass examples that illustrate improved performance over prior state-of-art.
文摘Two heuristic methods are proposed to find an effective and fast solution in modern power distribution networks.For solving the service restoration problem in distribution networks,switch selection indices based on an analytic approach and a practicable heuristic graph-based method are given.The formulation of the problem includes four different objective functions:1)maximizing the total load restored;2)minimizing the number of switching operations;3)maximizing the top priority restored load;4)minimizing load shedding.A suitable evaluation of switch indices is used for all candidate tie switches(TSs)in the network to find the best solution and decrease the number of switching operations.A new graph-based approach is utilized for finding the best sectionalizes switch(SS)and minimizing the voltage drop.The accuracy and the validity of the approach are tested in two standard electrical distribution networks.The results of the approach are used for IEEE 69-bus and IEEE 119-bus test case.
文摘Many cutting-edge methods are now possible in real-time commercial settings and are growing in popularity on cloud platforms.By incorporating new,cutting-edge technologies to a larger extent without using more infrastructures,the information technology platform is anticipating a completely new level of devel-opment.The following concepts are proposed in this research paper:1)A reliable authentication method Data replication that is optimised;graph-based data encryp-tion and packing colouring in Redundant Array of Independent Disks(RAID)sto-rage.At the data centre,data is encrypted using crypto keys called Key Streams.These keys are produced using the packing colouring method in the web graph’s jump graph.In order to achieve space efficiency,the replication is carried out on optimised many servers employing packing colours.It would be thought that more connections would provide better authentication.This study provides an innovative architecture with robust security,enhanced authentication,and low cost.
文摘Graph-based semi-supervised learning is an important semi-supervised learning paradigm. Although graphbased semi-supervised learning methods have been shown to be helpful in various situations, they may adversely affect performance when using unlabeled data. In this paper, we propose a new graph-based semi-supervised learning method based on instance selection in order to reduce the chances of performance degeneration. Our basic idea is that given a set of unlabeled instances, it is not the best approach to exploit all the unlabeled instances; instead, we should exploit the unlabeled instances that are highly likely to help improve the performance, while not taking into account the ones with high risk. We develop both transductive and inductive variants of our method. Experiments on a broad range of data sets show that the chances of performance degeneration of our proposed method are much smaller than those of many state-of-the-art graph-based semi-supervised learning methods.
文摘Glaucoma is a group of ocular atrophy diseases that cause progressive vision loss by affecting the optic nerve.Because of its asymptomatic nature,glaucoma has become the leading cause of human blindness worldwide.In this paper,a novel computer-aided diagnosis(CAD)approach for glaucomatous retinal image classification has been introduced.It extracts graph-based texture features from structurally improved fundus images using discrete wavelet-transformation(DWT)and deterministic tree-walk(DTW)procedures.Retinal images are considered from both public repositories and eye hospitals.Images are enhanced with image-specific luminance and gradient transitions for both contrast and texture improvement.The enhanced images are mapped into undirected graphs using DTW trajectories formed by the image’s wavelet coefficients.Graph-based features are extracted fromthese graphs to capture image texture patterns.Machine learning(ML)classifiers use these features to label retinal images.This approach has attained an accuracy range of 93.5%to 100%,82.1%to 99.3%,95.4%to 100%,83.3%to 96.6%,77.7%to 88.8%,and 91.4%to 100%on the ACRIMA,ORIGA,RIM-ONE,Drishti,HRF,and HOSPITAL datasets,respectively.The major strength of this approach is texture pattern identification using various topological graphs.It has achieved optimal performance with SVM and RF classifiers using biorthogonal DWT combinations on both public and patients’fundus datasets.The classification performance of the DWT-DTW approach is on par with the contemporary state-of-the-art methods,which can be helpful for ophthalmologists in glaucoma screening.
文摘Recently,bio-inspired algorithms have been increasingly explored for autonomous robot path planning on grid-based maps.However,these approaches endure performance degradation as problem complexity increases,often resulting in lengthy search times to find an optimal solution.This limitation is particularly critical for real-world applications like autonomous off-road vehicles,where highquality path computation is essential for energy efficiency.To address these challenges,this paper proposes a new graph-based optimal path planning approach that leverages a sort of bio-inspired algorithm,improved seagull optimization algorithm(iSOA)for rapid path planning of autonomous robots.A modified Douglas–Peucker(mDP)algorithm is developed to approximate irregular obstacles as polygonal obstacles based on the environment image in rough terrains.The resulting mDPderived graph is then modeled using a Maklink graph theory.By applying the iSOA approach,the trajectory of an autonomous robot in the workspace is optimized.Additionally,a Bezier-curve-based smoothing approach is developed to generate safer and smoother trajectories while adhering to curvature constraints.The proposed model is validated through simulated experiments undertaken in various real-world settings,and its performance is compared with state-of-the-art algorithms.The experimental results demonstrate that the proposed model outperforms existing approaches in terms of time cost and path length.
文摘Wireless sensor Mobile ad hoc networks have excellent potential in moving and monitoring disaster area networks on real-time basis.The recent challenges faced in Mobile Ad Hoc Networks(MANETs)include scalability,localization,heterogeneous network,self-organization,and self-sufficient operation.In this background,the current study focuses on specially-designed communication link establishment for high connection stability of wireless mobile sensor networks,especially in disaster area network.Existing protocols focus on location-dependent communications and use networks based on typically-used Internet Protocol(IP)architecture.However,IP-based communications have a few limitations such as inefficient bandwidth utilization,high processing,less transfer speeds,and excessive memory intake.To overcome these challenges,the number of neighbors(Node Density)is minimized and high Mobility Nodes(Node Speed)are avoided.The proposed Geographic Drone Based Route Optimization(GDRO)method reduces the entire overhead to a considerable level in an efficient manner and significantly improves the overall performance by identifying the disaster region.This drone communicates with anchor node periodically and shares the information to it so as to introduce a drone-based disaster network in an area.Geographic routing is a promising approach to enhance the routing efficiency in MANET.This algorithm helps in reaching the anchor(target)node with the help of Geographical Graph-Based Mapping(GGM).Global Positioning System(GPS)is enabled on mobile network of the anchor node which regularly broadcasts its location information that helps in finding the location.In first step,the node searches for local and remote anticipated Expected Transmission Count(ETX),thereby calculating the estimated distance.Received Signal Strength Indicator(RSSI)results are stored in the local memory of the node.Then,the node calculates the least remote anticipated ETX,Link Loss Rate,and information to the new location.Freeway Heuristic algorithm improves the data sp
文摘The number of botnet malware attacks on Internet devices has grown at an equivalent rate to the number of Internet devices that are connected to the Internet.Bot detection using machine learning(ML)with flow-based features has been extensively studied in the literature.Existing flow-based detection methods involve significant computational overhead that does not completely capture network communication patterns that might reveal other features ofmalicious hosts.Recently,Graph-Based Bot Detection methods using ML have gained attention to overcome these limitations,as graphs provide a real representation of network communications.The purpose of this study is to build a botnet malware detection system utilizing centrality measures for graph-based botnet detection and ML.We propose BotSward,a graph-based bot detection system that is based on ML.We apply the efficient centrality measures,which are Closeness Centrality(CC),Degree Centrality(CC),and PageRank(PR),and compare them with others used in the state-of-the-art.The efficiency of the proposed method is verified on the available Czech Technical University 13 dataset(CTU-13).The CTU-13 dataset contains 13 real botnet traffic scenarios that are connected to a command-and-control(C&C)channel and that cause malicious actions such as phishing,distributed denial-of-service(DDoS)attacks,spam attacks,etc.BotSward is robust to zero-day attacks,suitable for large-scale datasets,and is intended to produce better accuracy than state-of-the-art techniques.The proposed BotSward solution achieved 99%accuracy in botnet attack detection with a false positive rate as low as 0.0001%.
文摘Emotion Recognition in Conversations(ERC)is fundamental in creating emotionally intelligentmachines.Graph-BasedNetwork(GBN)models have gained popularity in detecting conversational contexts for ERC tasks.However,their limited ability to collect and acquire contextual information hinders their effectiveness.We propose a Text Augmentation-based computational model for recognizing emotions using transformers(TA-MERT)to address this.The proposed model uses the Multimodal Emotion Lines Dataset(MELD),which ensures a balanced representation for recognizing human emotions.Themodel used text augmentation techniques to producemore training data,improving the proposed model’s accuracy.Transformer encoders train the deep neural network(DNN)model,especially Bidirectional Encoder(BE)representations that capture both forward and backward contextual information.This integration improves the accuracy and robustness of the proposed model.Furthermore,we present a method for balancing the training dataset by creating enhanced samples from the original dataset.By balancing the dataset across all emotion categories,we can lessen the adverse effects of data imbalance on the accuracy of the proposed model.Experimental results on the MELD dataset show that TA-MERT outperforms earlier methods,achieving a weighted F1 score of 62.60%and an accuracy of 64.36%.Overall,the proposed TA-MERT model solves the GBN models’weaknesses in obtaining contextual data for ERC.TA-MERT model recognizes human emotions more accurately by employing text augmentation and transformer-based encoding.The balanced dataset and the additional training samples also enhance its resilience.These findings highlight the significance of transformer-based approaches for special emotion recognition in conversations.
