R. Asgarnezhad, Safaa Saad Abdull Majeed, Zainab Aqeel Abbas, Sarah Sinan Salman
{"title":"An Effective Algorithm to Improve Recommender Systems using Evolutionary Computation Algorithms and Neural Network","authors":"R. Asgarnezhad, Safaa Saad Abdull Majeed, Zainab Aqeel Abbas, Sarah Sinan Salman","doi":"10.31185/wjcm.vol1.iss1.20","DOIUrl":"https://doi.org/10.31185/wjcm.vol1.iss1.20","url":null,"abstract":"Abstract \u0000The growing Internet access and easy access to it have resulted in a significant increase in e-content, which, along with many benefits, has caused problems for users. Internet users simply cannot find the content they need from this massive amount of data. Users are faced with a lot of suggestions for choosing goods, buying items, selecting music and videos, and more. Advantage systems can be used to overcome these problems. Today, with the spread of people's use of cyberspace, such as web sites and social networks, and increasing the need for conscious and clever selection of people, recommender systems has been extensively investigated. Although the neural network can identify the connections between the inputs and outputs of a dataset, but in order to achieve the proper performance of the neural network, a proper structure should be considered. We will use the mantle algorithm to determine this structure. The mantle algorithm is a form of traditional genetic algorithm that uses local search to reduce the time to achieve optimal response. Genetic algorithms are created to search across the search space, while the local search, the neighborhood of the neighborhood, finds every response found by the genetic algorithm to find better answers. This algorithm seeks to find the optimal values for the parameters of the neural network method, so optimal solutions of the memetic algorithm is considered to be used to set parameters for the neural network method. The results of this study show the desirable performance of the proposed approach in this study. \u0000 ","PeriodicalId":224730,"journal":{"name":"Wasit Journal of Computer and Mathematics Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122181212","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}
R. Asgarnezhad, Ali Naseer Kadhim alwali, Mhmood Hamid sahar alsaedi, Samer Alwan zaboon albwhusseinsarr
{"title":"Development of an Anomaly Detection Algorithm in Distributed Systems based on Runtime and System Status","authors":"R. Asgarnezhad, Ali Naseer Kadhim alwali, Mhmood Hamid sahar alsaedi, Samer Alwan zaboon albwhusseinsarr","doi":"10.31185/wjcm.vol1.iss1.25","DOIUrl":"https://doi.org/10.31185/wjcm.vol1.iss1.25","url":null,"abstract":"Computational grades have emerged as a new approach to solving large-scale problems in the fields of science, engineering, and commerce. The computing grid is a hardware and software infrastructure that provides affordable, reliable, comprehensive, and affordable access to the computational abilities of others. A computational grid is associated with a set of resources on a large scale. Computational grades have emerged as a new approach to solving large-scale problems in the fields of science, engineering, and commerce. The computing grid is a hardware and software infrastructure that provides affordable, reliable, comprehensive, and affordable access to the computational abilities of others. A computational grid is associated with a set of resources on a large scale. The purpose of this thesis is to provide a method that optimizes resource management and scheduling in at least one direction. The main focus of the research is on the time criterion, the deadline for doing things and receiving the response from the grid are parameters that can be examined. From a more general perspective, the aim of the research is to get the answer as quickly as possible from the calculation grid. The proposed algorithm improves the scheduling and resource management of the grid in the direction of improvement, and the structure and form of this problem have not yet been resolved. The proposed solution has been considered hypothesis and removed some of the definitions of grid scheduling, such as cost, quality of service, architectures, and others, but ultimately heed it and timed the grid in some ways.","PeriodicalId":224730,"journal":{"name":"Wasit Journal of Computer and Mathematics Science","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131040343","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}
{"title":"An Effective Algorithm to Improve the Accuracy of Recommender System based on Comments using Classification Techniques in Data Mining","authors":"Asgarnezhad Asgarnezhad, Ali Naseer Kadhim alwali, Mhmood Hamid sahar alsaedi, Samer Alwan zaboon albwhusseinsarr","doi":"10.31185/wjcm.vol1.iss1.27","DOIUrl":"https://doi.org/10.31185/wjcm.vol1.iss1.27","url":null,"abstract":"With the development of information systems, data has become one of the most important sources of organizations. Therefore, methods and techniques are needed to efficiently access data, share data, extract data from data, and use this information. By creating and expanding the Web and a significant increase in the volume of information and web development, the need for methods and techniques that can provide data efficiently and extract information from them is felt more than ever. Web mining is one of the areas of research that uses data mining techniques to automatically discover information from web services and documents. In fact, Web mining is a process of discovery of unknown and useful information from web data. Web mining methods are categorized into three types of web content exploration, exploration of Web structures, and exploration of the use of the Web, based on what type of data they are exploring. This research investigates the relationship between the idea of mining and other research fields and examines some of the previous methods used. Finally, a method is proposed based on two decision tree and machine model algorithms that will improve the results of the idea of mining. The results of the simulation of the proposed method were evaluated and compared with the previous methods. The results show that the proposed method has higher accuracy and speed","PeriodicalId":224730,"journal":{"name":"Wasit Journal of Computer and Mathematics Science","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126066116","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}
R. Asgarnezhad, Safaa Saad Abdull Majeed, Zainab Aqeel Abbas, Sarah Sinan Salman
{"title":"Providing an Efficient Method to Identify Structural Balanced Social Network Charts using Data Mining Techniques","authors":"R. Asgarnezhad, Safaa Saad Abdull Majeed, Zainab Aqeel Abbas, Sarah Sinan Salman","doi":"10.31185/wjcm.vol1.iss1.22","DOIUrl":"https://doi.org/10.31185/wjcm.vol1.iss1.22","url":null,"abstract":"As social communications become widespread, social networks are expanding day by day, and the number of members is increasing. In this regard, one of the most important issues on social networks is the prediction of the link or the friend's suggestion, which is usually done using similarities among users. In the meantime, clustering methods are very popular, but because of the high convergence velocity dimensions, clustering methods are usually low. In this research, using spectral clustering and diminishing dimensions, reducing the amount of information, reduces clustering time and reduces computational complexity and memory. In this regard, the spectroscopic clustering method, using a balanced index, determines the number of optimal clusters, and then performs clustering on the normal values of the normalized Laplace matrix. First, the clusters are divided into two parts and computed for each cluster of the harmonic distribution index. Each cluster whose index value for it is greater than 1 will be redistributed to two other clusters, and this will continue until the cluster has an index of less than 1. Finally, the similarity between the users within the cluster and between the clusters is calculated and the most similar people are introduced together. The best results for the Opinions, Google+ and Twitter data sets are 95.95, 86.44 and 95.45, respectively. The computational results of the proposed method and comparison with previous valid methods showed the superiority of the proposed approach.","PeriodicalId":224730,"journal":{"name":"Wasit Journal of Computer and Mathematics Science","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130454696","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}
{"title":"Implementation Patterns of AquaSim for Simulation of Underwater Acoustic Wireless Sensor Networks","authors":"Karim Hashem Kreidi","doi":"10.31185/WJCM.VOL1.ISS1.11","DOIUrl":"https://doi.org/10.31185/WJCM.VOL1.ISS1.11","url":null,"abstract":"Now days, a number of corporate as well as social applications are connected with wireless technologies which are covered under the domain of Internet of Things (IoT) and Cloud of Things (CoT). To work with the development and implementation of these scenarios, there is need of high performance costly gadgets which are difficult for the self finance researchers and small organizations. To cope up with the financial aspects of developing and getting the results from advanced wireless environment, the use of simulators and software libraries is done. In wireless environment, the segment of Underwater Wireless Sensor (UWSN) or Underwater Acoustic Network (UAN) is quite prominent which are used for the underwater applications including Military, Naval and Underwater Surveillance. Underwater sensor networks are famous for researchers and engineers in wireless technology. This field offers a lot of academic work in different disciplines. The main challenge of this UWSN is the energy saving for sensor nodes. For this cause, the location of sensor nodes shifts about regularly. There are several algorithms for energy production and collection, but this area is still in need of study due to political and national security concerns.","PeriodicalId":224730,"journal":{"name":"Wasit Journal of Computer and Mathematics Science","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133100240","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}