Pub Date : 2021-03-08DOI: 10.22044/JADM.2020.9949.2143
Majid Asgari-Bidhendi, Behrooz Janfada, O. Talab, B. Minaei-Bidgoli
Named Entity Recognition (NER) is one of the essential prerequisites for many natural language processing tasks. All public corpora for Persian named entity recognition, such as ParsNERCorp and ArmanPersoNERCorpus, are based on the Bijankhan corpus, which is originated from the Hamshahri newspaper in 2004. Correspondingly, most of the published named entity recognition models in Persian are specially tuned for the news data and are not flexible enough to be applied in different text categories, such as social media texts. This study introduces ParsNER-Social, a corpus for training named entity recognition models in the Persian language built from social media sources. This corpus consists of 205,373 tokens and their NER tags, crawled from social media contents, including 10 Telegram channels in 10 different categories. Furthermore, three supervised methods are introduced and trained based on the ParsNER-Social corpus: Two conditional random field models as baseline models and one state-of-the-art deep learning model with six different configurations are evaluated on the proposed dataset. The experiments show that the Mono-Lingual Persian models based on Bidirectional Encoder Representations from Transformers (MLBERT) outperform the other approaches on the ParsNER-Social corpus. Among different Configurations of MLBERT models, the ParsBERT+BERT-TokenClass model obtained an F1-score of 89.65%.
{"title":"ParsNER-Social: A Corpus for Named Entity Recognition in Persian Social Media Texts","authors":"Majid Asgari-Bidhendi, Behrooz Janfada, O. Talab, B. Minaei-Bidgoli","doi":"10.22044/JADM.2020.9949.2143","DOIUrl":"https://doi.org/10.22044/JADM.2020.9949.2143","url":null,"abstract":"Named Entity Recognition (NER) is one of the essential prerequisites for many natural language processing tasks. All public corpora for Persian named entity recognition, such as ParsNERCorp and ArmanPersoNERCorpus, are based on the Bijankhan corpus, which is originated from the Hamshahri newspaper in 2004. Correspondingly, most of the published named entity recognition models in Persian are specially tuned for the news data and are not flexible enough to be applied in different text categories, such as social media texts. This study introduces ParsNER-Social, a corpus for training named entity recognition models in the Persian language built from social media sources. This corpus consists of 205,373 tokens and their NER tags, crawled from social media contents, including 10 Telegram channels in 10 different categories. Furthermore, three supervised methods are introduced and trained based on the ParsNER-Social corpus: Two conditional random field models as baseline models and one state-of-the-art deep learning model with six different configurations are evaluated on the proposed dataset. The experiments show that the Mono-Lingual Persian models based on Bidirectional Encoder Representations from Transformers (MLBERT) outperform the other approaches on the ParsNER-Social corpus. Among different Configurations of MLBERT models, the ParsBERT+BERT-TokenClass model obtained an F1-score of 89.65%.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46451939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-03-06DOI: 10.22044/JADM.2020.9518.2085
J. Hamidzadeh, M. Moradi
Recommender systems extract unseen information for predicting the next preferences. Most of these systems use additional information such as demographic data and previous users' ratings to predict users' preferences but rarely have used sequential information. In streaming recommender systems, the emergence of new patterns or disappearance a pattern leads to inconsistencies. However, these changes are common issues due to the user's preferences variations on items. Recommender systems without considering inconsistencies will suffer poor performance. Thereby, the present paper is devoted to a new fuzzy rough set-based method for managing in a flexible and adaptable way. Evaluations have been conducted on twelve real-world data sets by the leave-one-out cross-validation method. The results of the experiments have been compared with the other five methods, which show the superiority of the proposed method in terms of accuracy, precision, recall.
{"title":"Online Recommender System Considering Changes in User's Preference","authors":"J. Hamidzadeh, M. Moradi","doi":"10.22044/JADM.2020.9518.2085","DOIUrl":"https://doi.org/10.22044/JADM.2020.9518.2085","url":null,"abstract":"Recommender systems extract unseen information for predicting the next preferences. Most of these systems use additional information such as demographic data and previous users' ratings to predict users' preferences but rarely have used sequential information. In streaming recommender systems, the emergence of new patterns or disappearance a pattern leads to inconsistencies. However, these changes are common issues due to the user's preferences variations on items. Recommender systems without considering inconsistencies will suffer poor performance. Thereby, the present paper is devoted to a new fuzzy rough set-based method for managing in a flexible and adaptable way. Evaluations have been conducted on twelve real-world data sets by the leave-one-out cross-validation method. The results of the experiments have been compared with the other five methods, which show the superiority of the proposed method in terms of accuracy, precision, recall.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44980024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-17DOI: 10.22044/JADM.2020.8857.2020
Z. Shojaee, S. A. S. Fazeli, E. Abbasi, F. Adibnia
Today, feature selection, as a technique to improve the performance of the classification methods, has been widely considered by computer scientists. As the dimensions of a matrix has a huge impact on the performance of processing on it, reducing the number of features by choosing the best subset of all features, will affect the performance of the algorithms. Finding the best subset by comparing all possible subsets, even when n is small, is an intractable process, hence many researches approach to heuristic methods to find a near-optimal solutions. In this paper, we introduce a novel feature selection technique which selects the most informative features and omits the redundant or irrelevant ones. Our method is embedded in PSO (Particle Swarm Optimization). To omit the redundant or irrelevant features, it is necessary to figure out the relationship between different features. There are many correlation functions that can reveal this relationship. In our proposed method, to find this relationship, we use mutual information technique. We evaluate the performance of our method on three classification benchmarks: Glass, Vowel, and Wine. Comparing the results with four state-of-the-art methods, demonstrates its superiority over them.
{"title":"Feature Selection based on Particle Swarm Optimization and Mutual Information","authors":"Z. Shojaee, S. A. S. Fazeli, E. Abbasi, F. Adibnia","doi":"10.22044/JADM.2020.8857.2020","DOIUrl":"https://doi.org/10.22044/JADM.2020.8857.2020","url":null,"abstract":"Today, feature selection, as a technique to improve the performance of the classification methods, has been widely considered by computer scientists. As the dimensions of a matrix has a huge impact on the performance of processing on it, reducing the number of features by choosing the best subset of all features, will affect the performance of the algorithms. Finding the best subset by comparing all possible subsets, even when n is small, is an intractable process, hence many researches approach to heuristic methods to find a near-optimal solutions. In this paper, we introduce a novel feature selection technique which selects the most informative features and omits the redundant or irrelevant ones. Our method is embedded in PSO (Particle Swarm Optimization). To omit the redundant or irrelevant features, it is necessary to figure out the relationship between different features. There are many correlation functions that can reveal this relationship. In our proposed method, to find this relationship, we use mutual information technique. We evaluate the performance of our method on three classification benchmarks: Glass, Vowel, and Wine. Comparing the results with four state-of-the-art methods, demonstrates its superiority over them.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43777557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-17DOI: 10.22044/JADM.2021.9898.2121
M. R. Fallahzadeh, F. Farokhi, A. Harimi, R. Sabbaghi‐Nadooshan
Facial Expression Recognition (FER) is one of the basic ways of interacting with machines and has been getting more attention in recent years. In this paper, a novel FER system based on a deep convolutional neural network (DCNN) is presented. Motivated by the powerful ability of DCNN to learn features and image classification, the goal of this research is to design a compatible and discriminative input for pre-trained AlexNet-DCNN. The proposed method consists of 4 steps: first, extracting three channels of the image including the original gray-level image, in addition to horizontal and vertical gradients of the image similar to the red, green, and blue color channels of an RGB image as the DCNN input. Second, data augmentation including scale, rotation, width shift, height shift, zoom, horizontal flip, and vertical flip of the images are prepared in addition to the original images for training the DCNN. Then, the AlexNet-DCNN model is applied to learn high-level features corresponding to different emotion classes. Finally, transfer learning is implemented on the proposed model and the presented model is fine-tuned on target datasets. The average recognition accuracy of 92.41% and 93.66% were achieved for JAFEE and CK+ datasets, respectively. Experimental results on two benchmark emotional datasets show promising performance of the proposed model that can improve the performance of current FER systems.
{"title":"Facial Expression Recognition based on Image Gradient and Deep Convolutional Neural Network","authors":"M. R. Fallahzadeh, F. Farokhi, A. Harimi, R. Sabbaghi‐Nadooshan","doi":"10.22044/JADM.2021.9898.2121","DOIUrl":"https://doi.org/10.22044/JADM.2021.9898.2121","url":null,"abstract":"Facial Expression Recognition (FER) is one of the basic ways of interacting with machines and has been getting more attention in recent years. In this paper, a novel FER system based on a deep convolutional neural network (DCNN) is presented. Motivated by the powerful ability of DCNN to learn features and image classification, the goal of this research is to design a compatible and discriminative input for pre-trained AlexNet-DCNN. The proposed method consists of 4 steps: first, extracting three channels of the image including the original gray-level image, in addition to horizontal and vertical gradients of the image similar to the red, green, and blue color channels of an RGB image as the DCNN input. Second, data augmentation including scale, rotation, width shift, height shift, zoom, horizontal flip, and vertical flip of the images are prepared in addition to the original images for training the DCNN. Then, the AlexNet-DCNN model is applied to learn high-level features corresponding to different emotion classes. Finally, transfer learning is implemented on the proposed model and the presented model is fine-tuned on target datasets. The average recognition accuracy of 92.41% and 93.66% were achieved for JAFEE and CK+ datasets, respectively. Experimental results on two benchmark emotional datasets show promising performance of the proposed model that can improve the performance of current FER systems.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44191421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-02-07DOI: 10.22044/JADM.2021.9618.2100
H. Sadr, M. Pedram, M. Teshnehlab
With the rapid development of textual information on the web, sentiment analysis is changing to an essential analytic tool rather than an academic endeavor and numerous studies have been carried out in recent years to address this issue. By the emergence of deep learning, deep neural networks have attracted a lot of attention and become mainstream in this field. Despite the remarkable success of deep learning models for sentiment analysis of text, they are in the early steps of development and their potential is yet to be fully explored. Convolutional neural network is one of the deep learning methods that has been surpassed for sentiment analysis but is confronted with some limitations. Firstly, convolutional neural network requires a large number of training data. Secondly, it assumes that all words in a sentence have an equal contribution to the polarity of a sentence. To fill these lacunas, a convolutional neural network equipped with the attention mechanism is proposed in this paper which not only takes advantage of the attention mechanism but also utilizes transfer learning to boost the performance of sentiment analysis. According to the empirical results, our proposed model achieved comparable or even better classification accuracy than the state-of-the-art methods.
{"title":"Convolutional Neural Network Equipped with Attention Mechanism and Transfer Learning for Enhancing Performance of Sentiment Analysis","authors":"H. Sadr, M. Pedram, M. Teshnehlab","doi":"10.22044/JADM.2021.9618.2100","DOIUrl":"https://doi.org/10.22044/JADM.2021.9618.2100","url":null,"abstract":"With the rapid development of textual information on the web, sentiment analysis is changing to an essential analytic tool rather than an academic endeavor and numerous studies have been carried out in recent years to address this issue. By the emergence of deep learning, deep neural networks have attracted a lot of attention and become mainstream in this field. Despite the remarkable success of deep learning models for sentiment analysis of text, they are in the early steps of development and their potential is yet to be fully explored. Convolutional neural network is one of the deep learning methods that has been surpassed for sentiment analysis but is confronted with some limitations. Firstly, convolutional neural network requires a large number of training data. Secondly, it assumes that all words in a sentence have an equal contribution to the polarity of a sentence. To fill these lacunas, a convolutional neural network equipped with the attention mechanism is proposed in this paper which not only takes advantage of the attention mechanism but also utilizes transfer learning to boost the performance of sentiment analysis. According to the empirical results, our proposed model achieved comparable or even better classification accuracy than the state-of-the-art methods.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49497230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-18DOI: 10.22044/JADM.2020.9992.2136
S. S. Sadeghi, Hassan Khotanlou, M. R. Mahand
In the modern age, written sources are rapidly increasing. A growing number of these data are related to the texts containing the feelings and opinions of the users. Thus, reviewing and analyzing of emotional texts have received a particular attention in recent years. A System which is based on combination of cognitive features and deep neural network, Gated Recurrent Unit has been proposed in this paper. Five basic emotions used in this approach are: anger, happiness, sadness, surprise and fear. A total of 23,000 Persian documents by the average length of 24 have been labeled for this research. Emotional constructions, emotional keywords, and emotional POS are the basic cognitive features used in this approach. On the other hand, after preprocessing the texts, words of normalized text have been embedded by Word2Vec technique. Then, a deep learning approach has been done based on this embedded data. Finally, classification algorithms such as Naive Bayes, decision tree, and support vector machines were used to classify emotions based on concatenation of defined cognitive features, and deep learning features. 10-fold cross validation has been used to evaluate the performance of the proposed system. Experimental results show the proposed system achieved the accuracy of 97%. Result of proposed system shows the improvement of several percent’s in comparison by other results achieved GRU and cognitive features in isolation. At the end, studying other statistical features and improving these cognitive features in more details can affect the results.
{"title":"Automatic Persian Text Emotion Detection using Cognitive Linguistic and Deep Learning","authors":"S. S. Sadeghi, Hassan Khotanlou, M. R. Mahand","doi":"10.22044/JADM.2020.9992.2136","DOIUrl":"https://doi.org/10.22044/JADM.2020.9992.2136","url":null,"abstract":"In the modern age, written sources are rapidly increasing. A growing number of these data are related to the texts containing the feelings and opinions of the users. Thus, reviewing and analyzing of emotional texts have received a particular attention in recent years. A System which is based on combination of cognitive features and deep neural network, Gated Recurrent Unit has been proposed in this paper. Five basic emotions used in this approach are: anger, happiness, sadness, surprise and fear. A total of 23,000 Persian documents by the average length of 24 have been labeled for this research. Emotional constructions, emotional keywords, and emotional POS are the basic cognitive features used in this approach. On the other hand, after preprocessing the texts, words of normalized text have been embedded by Word2Vec technique. Then, a deep learning approach has been done based on this embedded data. Finally, classification algorithms such as Naive Bayes, decision tree, and support vector machines were used to classify emotions based on concatenation of defined cognitive features, and deep learning features. 10-fold cross validation has been used to evaluate the performance of the proposed system. Experimental results show the proposed system achieved the accuracy of 97%. Result of proposed system shows the improvement of several percent’s in comparison by other results achieved GRU and cognitive features in isolation. At the end, studying other statistical features and improving these cognitive features in more details can affect the results.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44019482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.22044/JADM.2020.9358.2071
N. Alibabaie, A. Latif
Periodic noise reduction is a fundamental problem in image processing, which severely affects the visual quality and subsequent application of the data. Most of the conventional approaches are only dedicated to either the frequency or spatial domain. In this research, we propose a dual-domain approach by converting the periodic noise reduction task into an image decomposition problem. We introduced a bio-inspired computational model to separate the original image from the noise pattern without having any a priori knowledge about its structure or statistics. Experiments on both synthetic and non-synthetic noisy images have been carried out to validate the effectiveness and efficiency of the proposed algorithm. The simulation results demonstrate the effectiveness of the proposed method both qualitatively and quantitatively.
{"title":"Bio-inspired Computing Paradigm for Periodic Noise Reduction in Digital Images","authors":"N. Alibabaie, A. Latif","doi":"10.22044/JADM.2020.9358.2071","DOIUrl":"https://doi.org/10.22044/JADM.2020.9358.2071","url":null,"abstract":"Periodic noise reduction is a fundamental problem in image processing, which severely affects the visual quality and subsequent application of the data. Most of the conventional approaches are only dedicated to either the frequency or spatial domain. In this research, we propose a dual-domain approach by converting the periodic noise reduction task into an image decomposition problem. We introduced a bio-inspired computational model to separate the original image from the noise pattern without having any a priori knowledge about its structure or statistics. Experiments on both synthetic and non-synthetic noisy images have been carried out to validate the effectiveness and efficiency of the proposed algorithm. The simulation results demonstrate the effectiveness of the proposed method both qualitatively and quantitatively.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68374736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.22044/JADM.2020.9691.2101
A. Fakhari, K. Kiani
Image restoration and its different variations are important topics in low-level image processing. One of the main challenges in image restoration is dependency of current methods to the corruption characteristics. In this paper, we have proposed an image restoration architecture that enables us to address different types of corruption, regardless of type, amount and location. The main intuition behind our approach is restoring original images from abstracted perceptual features. Using an encoder-decoder architecture, image restoration can be defined as an image transformation task. Abstraction of perceptual features is done in the encoder part of the model and determines the sampling point within original images' Probability Density Function (PDF). The PDF of original images is learned in the decoder section by using a Generative Adversarial Network (GAN) that receives the sampling point from the encoder part. Concretely, sampling from the learned PDF restores original image from its corrupted version. Pretrained network extracts perceptual features and Restricted Boltzmann Machine (RBM) makes the abstraction over them in the encoder section. By developing a new algorithm for training the RBM, the features of the corrupted images have been refined. In the decoder, the Generator network restores original images from abstracted perceptual features while Discriminator determines how good the restoration result is. The proposed approach has been compared with both traditional approaches like BM3D and with modern deep models like IRCNN and NCSR. We have also considered three different categories of corruption including denoising, inpainting and deblurring. Experimental results confirm performance of the model.
{"title":"An Image Restoration Architecture using Abstract Features and Generative Models","authors":"A. Fakhari, K. Kiani","doi":"10.22044/JADM.2020.9691.2101","DOIUrl":"https://doi.org/10.22044/JADM.2020.9691.2101","url":null,"abstract":"Image restoration and its different variations are important topics in low-level image processing. One of the main challenges in image restoration is dependency of current methods to the corruption characteristics. In this paper, we have proposed an image restoration architecture that enables us to address different types of corruption, regardless of type, amount and location. The main intuition behind our approach is restoring original images from abstracted perceptual features. Using an encoder-decoder architecture, image restoration can be defined as an image transformation task. Abstraction of perceptual features is done in the encoder part of the model and determines the sampling point within original images' Probability Density Function (PDF). The PDF of original images is learned in the decoder section by using a Generative Adversarial Network (GAN) that receives the sampling point from the encoder part. Concretely, sampling from the learned PDF restores original image from its corrupted version. Pretrained network extracts perceptual features and Restricted Boltzmann Machine (RBM) makes the abstraction over them in the encoder section. By developing a new algorithm for training the RBM, the features of the corrupted images have been refined. In the decoder, the Generator network restores original images from abstracted perceptual features while Discriminator determines how good the restoration result is. The proposed approach has been compared with both traditional approaches like BM3D and with modern deep models like IRCNN and NCSR. We have also considered three different categories of corruption including denoising, inpainting and deblurring. Experimental results confirm performance of the model.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68374957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.22044/JADM.2020.9389.2075
S. Shadravan, H. Naji, V. Khatibi
The SailFish Optimizer (SFO) is a metaheuristic algorithm inspired by a group of hunting sailfish that alternates their attacks on group of prey. The SFO algorithm takes advantage of using a simple method for providing the dynamic balance between exploration and exploitation phases, creating the swarm diversity, avoiding local optima, and guaranteeing high convergence speed. Nowadays, multi agent systems and metaheuristic algorithms can provide high performance solutions for solving combinatorial optimization problems. These methods provide a prominent approach to reduce the execution time and improve of the solution quality. In this paper, we elaborate a multi agent based and distributed method for sailfish optimizer (DSFO), which improves the execution time and speedup of the algorithm while maintaining the results of optimization in high quality. The Graphics Processing Units (GPUs) using Compute Unified Device Architecture (CUDA) are used for the massive computation requirements in this approach. In depth of the study, we present the implementation details and performance observations of DSFO algorithm. Also, a comparative study of distributed and sequential SFO is performed on a set of standard benchmark optimization functions. Moreover, the execution time of distributed SFO is compared with other parallel algorithms to show the speed of the proposed algorithm for solving unconstrained optimization problems. The final results indicate that the proposed method is executed about maximum 14 times faster than other parallel algorithms and shows the ability of DSFO for solving non-separable, non-convex and scalable optimization problems.
{"title":"A Distributed Sailfish Optimizer Based on Multi-Agent Systems for Solving Non-Convex and Scalable Optimization Problems Implemented on GPU","authors":"S. Shadravan, H. Naji, V. Khatibi","doi":"10.22044/JADM.2020.9389.2075","DOIUrl":"https://doi.org/10.22044/JADM.2020.9389.2075","url":null,"abstract":"The SailFish Optimizer (SFO) is a metaheuristic algorithm inspired by a group of hunting sailfish that alternates their attacks on group of prey. The SFO algorithm takes advantage of using a simple method for providing the dynamic balance between exploration and exploitation phases, creating the swarm diversity, avoiding local optima, and guaranteeing high convergence speed. Nowadays, multi agent systems and metaheuristic algorithms can provide high performance solutions for solving combinatorial optimization problems. These methods provide a prominent approach to reduce the execution time and improve of the solution quality. In this paper, we elaborate a multi agent based and distributed method for sailfish optimizer (DSFO), which improves the execution time and speedup of the algorithm while maintaining the results of optimization in high quality. The Graphics Processing Units (GPUs) using Compute Unified Device Architecture (CUDA) are used for the massive computation requirements in this approach. In depth of the study, we present the implementation details and performance observations of DSFO algorithm. Also, a comparative study of distributed and sequential SFO is performed on a set of standard benchmark optimization functions. Moreover, the execution time of distributed SFO is compared with other parallel algorithms to show the speed of the proposed algorithm for solving unconstrained optimization problems. The final results indicate that the proposed method is executed about maximum 14 times faster than other parallel algorithms and shows the ability of DSFO for solving non-separable, non-convex and scalable optimization problems.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68374898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.22044/JADM.2020.8337.1973
Ali Hashemi, M. Z. Chahooki
Social networks are valuable sources for marketers. Marketers can publish campaigns to reach target audiences according to their interest. Although Telegram was primarily designed as an instant messenger, it is used as a social network in Iran due to censorship of Facebook, Twitter, etc. Telegram neither provides a marketing platform nor the possibility to search among groups. It is difficult for marketers to find target audience groups in Telegram, hence we developed a system to fill the gap. Marketers use our system to find target audience groups by keyword search. Our system has to search and rank groups as relevant as possible to the search query. This paper proposes a method called GroupRank to improve the ranking of group searching. GroupRank elicits associative connections among groups based on membership records they have in common. After detailed analysis, five-group quality factors have been introduced and used in the ranking. Our proposed method combines TF-IDF scoring with group quality scores and associative connections among groups. Experimental results show improvement in many different queries.
{"title":"GroupRank: Ranking Online Social Groups Based on User Membership Records","authors":"Ali Hashemi, M. Z. Chahooki","doi":"10.22044/JADM.2020.8337.1973","DOIUrl":"https://doi.org/10.22044/JADM.2020.8337.1973","url":null,"abstract":"Social networks are valuable sources for marketers. Marketers can publish campaigns to reach target audiences according to their interest. Although Telegram was primarily designed as an instant messenger, it is used as a social network in Iran due to censorship of Facebook, Twitter, etc. Telegram neither provides a marketing platform nor the possibility to search among groups. It is difficult for marketers to find target audience groups in Telegram, hence we developed a system to fill the gap. Marketers use our system to find target audience groups by keyword search. Our system has to search and rank groups as relevant as possible to the search query. This paper proposes a method called GroupRank to improve the ranking of group searching. GroupRank elicits associative connections among groups based on membership records they have in common. After detailed analysis, five-group quality factors have been introduced and used in the ranking. Our proposed method combines TF-IDF scoring with group quality scores and associative connections among groups. Experimental results show improvement in many different queries.","PeriodicalId":32592,"journal":{"name":"Journal of Artificial Intelligence and Data Mining","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68375031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：