2020 6th International Conference on Web Research (ICWR)最新文献_第2页

Automatic Duplicate Bug Report Detection using Information Retrieval-based versus Machine Learning-based Approaches 基于信息检索与基于机器学习方法的自动重复Bug报告检测

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122288

Behzad Soleimani Neysiani, Seyed Morteza Babamir

{"title":"Automatic Duplicate Bug Report Detection using Information Retrieval-based versus Machine Learning-based Approaches","authors":"Behzad Soleimani Neysiani, Seyed Morteza Babamir","doi":"10.1109/ICWR49608.2020.9122288","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122288","url":null,"abstract":"Nowadays, there are many software repositories, especially on the web, which have many challenges to be automated. Duplicate bug report detection (DBRD) is an excellent problem of software triage systems like Bugzilla since 2004 as an essential online software repository. There are two main approaches for automatic DBRD, including information retrieval (IR)-based and machine learning (ML)-based. Many related works are using both approaches, but it is not clear which one is more useful and has better performance. This study focuses on introducing a methodology for comparing the validation performance of both approaches in a particular condition. The Android dataset is used for evaluation, and about 2 million pairs of bug reports are analyzed for 59 bug reports, which were duplicate. The results show that the ML-based approach has better validation performance, incredibly about 40%. Besides, the ML-based approach has a more reliable criterion for evaluation like accuracy, precision, and recall versus an IR-based approach, which has just mean average precision (MAP) or rank metrics.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126633732","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}

引用次数: 13

A Local Optimum Matrix Construction for Matrix Embedding Steganography 矩阵嵌入隐写的局部最优矩阵构造

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122280

Peyman Masjedi, M. Taheri

{"title":"A Local Optimum Matrix Construction for Matrix Embedding Steganography","authors":"Peyman Masjedi, M. Taheri","doi":"10.1109/ICWR49608.2020.9122280","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122280","url":null,"abstract":"Steganography is the task of embedding a secret message in a cover media (e.g. image, video and voice) such that the stego media is not intuitively separable from the original ones. It is one of the interesting fields of security especially in transferring digital media as the major components of the web sites, emails and any web-based communications. Matrix embedding is a general approach used in many steganography schemes, especially where the cover size is small e.g. Voice Over IP (VOIP) packets. In this approach, the message is mapped to a series of bits (stego) to replace the same number of low significant bits in the cover. The embedding matrix is used for extracting the message by a linear combination of the stego bits. For a given matrix and secret message, there are specific series of stego-bits from which the message can be extracted. Embedding is done by an inverse problem to minimize a cost as the difference between the stego and the original bits. Hence, each message has a specific embedding cost based on the matrix. In this paper, a method is proposed to find an embedding matrix which minimizes the expectation of embedding cost for a uniform distribution of messages. To that end; a dynamic programming algorithm is proposed to efficiently find the expected cost for a given matrix. By use of this algorithm, any search method may be used to solve the problem. In this paper, a fast Hill-climbing search strategy is designed to find a local optimum matrix in an allowable time.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132709808","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}

引用次数: 0

Application of 1-D CNN to Predict Epileptic Seizures using EEG Records 一维CNN在脑电图记录预测癫痫发作中的应用

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122300

Simin Khalilpour, Amin Ranjbar, M. Menhaj, Afshin Sandooghdar

引用次数: 5

EmHash: Hashtag Recommendation using Neural Network based on BERT Embedding EmHash:基于BERT嵌入的神经网络标签推荐

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122275

Mohadese Kaviani, H. Rahmani

引用次数: 21

Producing An Instagram Dataset For Persian Language Sentiment Analysis Using Crowdsourcing Method 使用众包方法生成用于波斯语情感分析的Instagram数据集

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122270

Mahsa Heidari, P. Shamsinejad

引用次数: 5

Low-Cost Interactive Device for Virtual Reality 低成本的虚拟现实交互设备

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122307

Afsoon Asadzadeh, Taha Samad-Soltani, Peyman Rezaei-Hachesu, Z. Salahzadeh

引用次数: 3

A Review of the Most Important Studies on Automated Text Simplification Evaluation Metrics 自动文本简化评价指标研究综述

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122325

Behrooz Janfada, B. Minaei-Bidgoli

{"title":"A Review of the Most Important Studies on Automated Text Simplification Evaluation Metrics","authors":"Behrooz Janfada, B. Minaei-Bidgoli","doi":"10.1109/ICWR49608.2020.9122325","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122325","url":null,"abstract":"Text Simplification is described as the process of transforming natural language text, both lexical and syntactic. The structure and grammar of the output must be considerably simplified, and understandability and readability should be improved, while original meaning and information are maintained. Text simplification is a fast-growing domain and can be used for several applications, such as preprocessing tool in the pipeline of natural language processing tasks as well as helping people with special needs. While the automated text simplification operation itself is challenging, the bench-marking and evaluating of this task is even more elaborate and controversial. Although there have been some reviews in the context of text simplification, no specific survey has been done on the question of evaluation metrics and methods of text simplification. In this paper, we review the most significant studies identified out of more than 300 studies of the last three decades in the field of text simplification, focusing on evaluation metrics, methods and corpora. There are different evaluation metrics, methods and corpora for text simplification based on approaches, datasets, and algorithms used to perform simplification task. We made a review of these different metrics and provided results of high-quality research studies on each criterion.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917930","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}

引用次数: 1

An Extension of the Apriori Algorithm for Finding Frequent Items 查找频繁项的Apriori算法的扩展

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122282

Noorollah Karimtabar, Mohammad Javad Shayegan Fard

{"title":"An Extension of the Apriori Algorithm for Finding Frequent Items","authors":"Noorollah Karimtabar, Mohammad Javad Shayegan Fard","doi":"10.1109/ICWR49608.2020.9122282","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122282","url":null,"abstract":"The main purpose of data mining is to discover hidden and valuable knowledge from data. The Apriori algorithm is inefficient due to bulky deals of searching in a dataset. Bearing this in mind, this paper proposes an improved algorithm from Apriori using an intelligent method. Proposing an intelligent method in this study is to fulfill two purposes: First, we demonstrated that to create itemsets, instead of adding one item at each step, several items could be added. With this operation, the number of k-itemset steps will decline. Secondly, we have proved that by storing the transaction number of each itemset, there would be a diminishment in the time required for the dataset searches to find the frequent k-itemset in each step. To evaluate the performance, the Intelligent Apriori (lAP) algorithm has been compared with the MDC algorithm. The results of this experiment exhibit that since the transaction scans used to obtain the itemset momentously reduced in number, there was a considerable fall in the runtime needed to obtain a frequent itemset by the proposed algorithm. In this study, the time required to generate frequent items had a 46% reduction compared to that of the MDC_ Apriori algorithm.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129212828","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}

引用次数: 3

Utilizing Cellular Learning Automata for Finding Communities in Weighted Networks 利用元胞学习自动机寻找加权网络中的社区

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122290

Mohammad Mehdi Daliri Khomami, Alireza Rezvanian, A. Saghiri, M. Meybodi

{"title":"Utilizing Cellular Learning Automata for Finding Communities in Weighted Networks","authors":"Mohammad Mehdi Daliri Khomami, Alireza Rezvanian, A. Saghiri, M. Meybodi","doi":"10.1109/ICWR49608.2020.9122290","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122290","url":null,"abstract":"The tremendous increase in Web usage led to the appearance of different network structures. One of the essential issues in the field of network science and engineering is to find and utilize network structures such as community structures by community detection. Although most of the current algorithms for detection of community use on the binary representation of the networks, some networks can encode more information instead of the topological structure, in which this information can be applied appropriately in detecting communities. Network information can be represented in the form of weights and identified as the weighted social network. This paper proposes a new algorithm using irregular CLA (cellular learning automaton) for finding the community in weighted networks called CLA-WCD. The CLA-WCD can find near-optimal community structures with reasonable running-time by taking advantage of the parallel capability and learning ability of the cellular automata and learning automaton, respectively. The CLA-WCD is also evaluated on real and synthetic networks in comparison with popular community discovery methods. The simulation results demonstrated that the CLA-WCD outperforms other methods.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123556360","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}

引用次数: 3

A Qualitative Study of Various Aspects of the Application of IoT in Disaster Management 物联网在灾害管理中应用的各个方面的定性研究

2020 6th International Conference on Web Research (ICWR) Pub Date : 2020-04-01 DOI: 10.1109/ICWR49608.2020.9122323

Parisa Ghasemi, N. Karimian

{"title":"A Qualitative Study of Various Aspects of the Application of IoT in Disaster Management","authors":"Parisa Ghasemi, N. Karimian","doi":"10.1109/ICWR49608.2020.9122323","DOIUrl":"https://doi.org/10.1109/ICWR49608.2020.9122323","url":null,"abstract":"Considering the vital issue of disaster management and the requirement of its additional development due to the increase in the rate of disasters over the recent years, using new technologies in all stages of disaster management including preparation stages for pre-disaster periods, reaction to disaster during its occurrence as well as the post-disaster reconstruction is very important. Therefore, the capacity of IoT in creating intelligence in objects to investigate different environmental parameters, the capacity of analyzing information, the intelligence required to predict some events and consequently, responding timely to any event and even proposing programs and systems for human performance are very effective in managing disasters. The existing resources for investigating the usages of Internet of Things (IoT) in disaster management could each address a particular aspect of this application. This paper has attempted to present a comprehensive view regarding the different dimensions of application of IoT in disaster management. The advantages and disadvantages of this application are mentioned, some instances of previous systems and models have also been discussed. The novelty of this work is the extent of examined dimensions and also addressing what can be done in different kinds of disasters.","PeriodicalId":231982,"journal":{"name":"2020 6th International Conference on Web Research (ICWR)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130802705","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}

引用次数: 8