{"title":"Using parametric regression and KNN algorithm with missing handling for software effort prediction","authors":"Fereshteh Soltanveis, S. H. Alizadeh","doi":"10.1109/RIOS.2016.7529494","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529494","url":null,"abstract":"Estimating the software development costs, budget and resources such as the time and effort is one of the most important activities in the software project management. The error rate, at the estimating costs, has a sizable portion in success or fail of a project. In general, it is used from similar project histories for project estimation. One of the challenges in this approach is missing values. in this research, first, for handling missing values the K nearest neighbor (KNN) algorithm and Mean Imputation has been used, then for effort prediction, the parametric model based methods, the nonlinear and polynomial regression(quadratic) is used. The proposed method is performed on the CM1 dataset and the results show that the combination of KNN and nonlinear regression (quadratic) has the best response, signifying accuracy improvement and relative error reduction, in comparing with other approaches.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131806996","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":"Identify human personality parameters based on handwriting using neural network","authors":"Behnam Fallah, Hassan Khotanlou","doi":"10.1109/RIOS.2016.7529501","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529501","url":null,"abstract":"The survey of person's handwriting and its parameters anatomy will lead the psychologists to investigate the psychological principles of behavior, temperament, character, personality and the nervous and social aspects of a person's brain. The human's handwritings in different psychological states including: anger, calm, happiness, excitement and different emotional states will show one's reaction or behavior at the same situations or same states. Analyzing one's handwriting is one of the scientific methods for evaluating and understanding one's personality. When a person's personality is analyzed, the effect of his personality or character on his/her handwriting is obvious and remarkable. The purpose of this method is to identify a person's personality through his/her handwriting. The literature shows that the identification and verification of human's identity from handwriting is common and relatively useful. Moreover, identification of one's identity from signature is more common. In this paper, in order to identify the character parameters in training stage, The Minnesota Multiphasic Personality Inventory was applied, and for identification of one's personality from his/her handwriting, a hidden Markov model and neural network (MLP) to perform classification was used so that MLP was used to identify those properties which are not related to the writer and a hidden Markov model was used to classify those properties which are related to the target writer. In this stage, in order to select the most similar image to the image of the input context, the image of input context after eliciting its property will be compared with all existing patterns in database. Finally the test output regarding the personality of the image of the target text which is recommended by the system will be introduced as the parameters of the output character.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127595506","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":"License Plate Automatic Recognition based on edge detection","authors":"Pooya Sagharichi Ha, M. Shakeri","doi":"10.1109/RIOS.2016.7529509","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529509","url":null,"abstract":"In this paper, we present an Automatic License Plate Recognition System (ALPRS) to identify license plates which is an application of image processing. The main process of ALPRS is divided into four steps: The noise in the image is removed by using FMH filter. A simple algorithm is used for background subtraction. Canny edge detection is used to localize the license plate location. Finally, letters and digits are extracted through template matching technique. The proposed algorithms have two advantages: First, the method has strong robustness against noise. Second, it can deal with license plates with different colors. The performance of the algorithm is tested in a real-time video stream. Based on the result, our algorithm shows the missing rate is almost 16% from 70 vehicle images.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116426663","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":"Adaptive search in unstructured peer-to-peer networks based on ant colony and Learning Automata","authors":"A. Ahmadi, M. Meybodi, A. Saghiri","doi":"10.1109/RIOS.2016.7529503","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529503","url":null,"abstract":"An unstructured peer-to-peer network is an overlay network where all nodes play equal roles, and the topology and data location do not follow restrictive rules. So, in a traditional file search mechanism, such as flooding, a peer broadcasts a query to its neighbors through an unstructured peer-to-peer (P2P) network until the time-to-live decreases to zero. A major disadvantage of flooding is that, in a large-scale network, this blind-choice strategy usually incurs an enormous traffic overhead. AntP2PR is a protocol to search based on the ant colony in unstructured peer to peer networks, which faces with some problems such as high communication overhead and low success rate due to the lack of an appropriate decision-making mechanism. In this paper, two adaptive improved version of AntP2PR named DLAntP2P and LAntP2P to improve the search problem in unstructured peer-to-peer networks are proposed. The DLAntP2P and LAntP2P protocols utilize the Distributed Learning Automata (DLA) and Learning Automata (LA), respectively, as an adaptive decision-making mechanism to determine number of ant and enhance the way of selecting the neighbors to forward the query messages. Simulations show the effectiveness of proposed protocols in terms of communication overhead and success rate, compared to AntP2PR and K-walker random walk.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124324656","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}
M. D. Khomami, Negin Bagherpour, H. Sajedi, M. Meybodi
{"title":"A new distributed learning automata based algorithm for maximum independent set problem","authors":"M. D. Khomami, Negin Bagherpour, H. Sajedi, M. Meybodi","doi":"10.1109/RIOS.2016.7529512","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529512","url":null,"abstract":"Maximum independent set problem is an NP-Hard one with the aim of finding the set of independent vertices with maximum possible cardinality in a graph. In this paper, we investigate a learning automaton based algorithm that finds a maximum independent set in the graph. Initially, a learning automaton is assigned to each vertex of graph. In order to find candidate independent set, a set of distributed learning automata collaborate with each other. The proposed algorithm based on learning automata is guided iteratively to the maximum independent set by updating the action probability vector. In order to study the performance of the proposed algorithm, we conducted some experiments. The reported numerical results confirm the superiority of our proposed algorithm in terms of cardinality of the obtained solution.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116978644","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}
Nader Zare, A. Keshavarzi, Hadi Mowla, S. E. Beheshtian
{"title":"Intelligent and dynamic method to specify chronological order of the games to improve the excitement and fairness of the champions in simulation league","authors":"Nader Zare, A. Keshavarzi, Hadi Mowla, S. E. Beheshtian","doi":"10.1109/RIOS.2016.7529510","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529510","url":null,"abstract":"RoboCup champions aimed at improving artificial intelligence methods. Competition formats include elimination, double elimination and round-robin. In soccer simulation league an agents' energy and knowledge in each game is independent of previous or simultaneous games. So when the format is round-robin the result is fair and the chronological order of holding games doesn't affect the result. In this paper, by using three heuristic functions, a new intelligent method for providing a dynamic table for specifying chronological order of holding games is presented. By using this method the important and determinative games were held at the end of the competitions. It can make championships more exciting and avoid extra games after round-robin; Therefore total evaluation specify the winner, the ranks are fairer and the RoboCup champions get closer to its' scientific goals. The evaluation showed that this dynamic method improved excitement in comparison to static methods and was 66% closer to the most exciting state evaluation.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127005164","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 extension of multinomial choice model for customer purchase behavior analysis","authors":"Parinaz Norouzi, S. H. Alizadeh","doi":"10.1109/RIOS.2016.7529491","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529491","url":null,"abstract":"Nowadays customers with various preferences and needs are interested in online shopping but companies with variety of services and products have limited space to present their products in internet pages. So choosing the order of showing products to customers is one of the difficult challenges in e-commerce websites. Although several successful models to analyze customers' behavior have been proposed, most of them have not paid attention to purchase variety, time between purchases and primacy and recency between different purchase categories. In this paper a new hybrid method based on hidden Markov model and multinomial choice model is proposed to analyze customer choice behavior. To justify the proposed method we applied it on the retail store data set.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132969076","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":"A hierarchical feature learning for isolated Farsi handwritten digit recognition using sparse autoencoder","authors":"Reza Safdari, M. Moin","doi":"10.1109/RIOS.2016.7529492","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529492","url":null,"abstract":"In recent years, the recognition of Farsi handwritten digits is drawing increasing attention. Feature extraction is a very important stage in handwritten digit recognition systems. Recently deep feature learning got promising results in English handwritten digit recognition, though there are very few papers in this area for Farsi handwritten digits. The contribution of this paper is to propose a new framework utilizing a two layer sparse autoencoder for feature learning directly from data and using the learned weights for feature extraction. In the classification stage of our proposed framework Softmax regression is applied. This recognition method is applied to Farsi handwritten digits in the HODA dataset. The experimental results support our claim that use of deep feature learning as feature extraction stage improves the performance compared with conventional methods.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128959958","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":"Particle Swarm Optimization based feature selection with novel fitness function for image steganalysis","authors":"Vahid Rostami, Azar Shahmoradi Khiavi","doi":"10.1109/RIOS.2016.7529499","DOIUrl":"https://doi.org/10.1109/RIOS.2016.7529499","url":null,"abstract":"One of the most effective issues on the performance of steganalysis is feature selection that aims to select the most significant and influential feature elements. In this paper, a new method of feature selection is proposed based on optimization process of Particle Swarm Optimization (PSO) with novel Area Under Area the receiver operating characteristics Curve (AUC) measure as the fitness function to improve the performance of detecting stego images from the cover images in steganalysis problem. Due to the high convergence rate and specific search strategy of PSO, it is able to find the best feature subset and so, the performance of steganalysis will be improved. The proposed method is evaluated on Breaking Out Steganography System (BOSS) benchmark and the obtained results proves the ability of the proposed method in feature selection for steganalysis problem.","PeriodicalId":416467,"journal":{"name":"2016 Artificial Intelligence and Robotics (IRANOPEN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125732550","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}