{"title":"Feature selection based on the rough set theory and dispersed system with dynamically generated disjoint clusters","authors":"Małgorzata Przybyła-Kasperek","doi":"10.1109/INISTA.2017.8001161","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001161","url":null,"abstract":"In this paper, a method for attribute selection is used in a dispersed decision-making system with dynamically generated disjoint clusters. The system that is used has been proposed in the earlier studies of the author. The aim of the paper is to apply in this system, the method of attribute selection that is based on the rough set theory. Another objective is to compare the results obtained with and without the use of attribute selection method.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124839397","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":"Towards facts extraction from text in Polish language","authors":"Tomasz Boinski, A. Chojnowski","doi":"10.1109/INISTA.2017.8001124","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001124","url":null,"abstract":"Natural Language Processing (NLP) finds many usages in different fields of endeavor. Many tools exists allowing analysis of English language. For Polish language the situation is different as the language itself is more complicated. In this paper we show differences between NLP of Polish and English language. Existing solutions are presented and TEAMS software for facts extraction is described. The paper shows also evaluation of the proposed solution and the tools used. Finally some conclusions are given.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115986038","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":"Mastering strategies in a board game of imperfect information for different search techniques","authors":"Michael Przybylski, Dariusz Król","doi":"10.1109/INISTA.2017.8001156","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001156","url":null,"abstract":"To the best authors' knowledge this work is the first to develop a full computer implementation of The Great Turtle Race (GTR), a complex board game characterized by several uncertainties that uses computational techniques to evaluate board positions and select the best move. In the game, a novel combination of popular propagation-based optimization techniques and four playing strategies is implemented. One of the main goals of this study is to determine how to generate opponents that are quick and safe to play against, rather than being necessarily superior. The paper starts by a brief overview of the game and its rules, followed by some analytical results that emerge from its characteristics. It then moves to provide relevant reinforcement learning methods by which Monte Carlo tree search, minimax and alpha-beta pruning were implemented. The validity of the concept is finalized by a series of experiments, in which these algorithms and strategies were successfully verified against each other.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114798409","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":"SDP algorithm for network reliability evaluation","authors":"P. Cașcaval, S. Floria","doi":"10.1109/INISTA.2017.8001143","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001143","url":null,"abstract":"This paper addresses the issue of the two-terminal reliability evaluation of medium-to-large networks and proposes a new method to solve the problem of ‘sum of disjoint products’ (SDP) algebraically. This method uses a ‘multiple variables inversion’ (MVI) technique for transforming a structure function into a sum of disjoint products which has a one-to-one correspondence with the reliability expression. The results of our method for several network models are compared with those obtained by means of other well-known MVI techniques. For large-scale networks, our method offers a better solution.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"323 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114791403","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":"Solution of fuzzy differential equations using fuzzy Sumudu transforms","authors":"R. Jafari, S. Razvarz","doi":"10.1109/INISTA.2017.8001137","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001137","url":null,"abstract":"This paper highlights the concepts related to the fuzzy Sumudu transform (FST). Few important theorems are illustrated for uncovering the properties of FST. By utilizing the generalized FST, the fuzzy differential equations (FDEs) are resolved. The suggested technique is validated by laying down two real examples.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123441969","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":"Influence of social communication on content-based recommendation","authors":"Bernadetta Maleszka, Marcin Maleszka","doi":"10.1109/INISTA.2017.8001147","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001147","url":null,"abstract":"One of basic divisions of information retrieval systems is content-based and collaborative filtering. Some hybrid methods exist combining both of them, but certain aspects still remain unexplored. In this paper we explore one: the influence of users communicating via social media on content-based recommendation systems. While in the system users do not know each other, outside they may make their own preferences known (e.g. tweeting recommendations), thus influencing the preferences of other users. Here we simulate several different types of such communication and its influence on content-based recommendation system. We intend to use this results for improving the quality of such systems.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117093415","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 robust genetic programming model for a dynamic portfolio insurance strategy","authors":"Siamak Dehghanpour, A. Esfahanipour","doi":"10.1109/INISTA.2017.8001157","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001157","url":null,"abstract":"In this paper, we propose a robust genetic programming model for a dynamic strategy of stock portfolio insurance. With portfolio insurance strategy, we need to allocate part of the money in risky asset and the other part in risk-free asset. Our applied strategy is based on constant proportion portfolio insurance (CPPI) strategy. For determining the amount for investing in risky assets, the critical parameter is a constant risk multiplier which is used in traditional CPPI method so that it may not reflect the changes occurring in market condition. Thus, we propose a model in which, the risk multiplier is calculated with robust genetic programming. In our model, risk variables are used to generate equation trees for calculating the risk multiplier. We also implement an artificial neural network to enhance our model's robustness. We also combine the portfolio insurance strategy with a well-known portfolio optimization model to get the best possible portfolio weights of risky assets for insurance. Experimental results using five stocks from New York Stock Exchange (NYSE) show that our proposed robust genetic programming model outperforms the other two models: the basic genetic programming for portfolio insurance without portfolio optimization, and the basic genetic programming for portfolio insurance with portfolio optimization.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129039271","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":"The evaluation of heterogeneous classifier ensembles for Turkish texts","authors":"Z. H. Kilimci, S. Akyokuş, S. İ. Omurca","doi":"10.1109/INISTA.2017.8001176","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001176","url":null,"abstract":"The basic idea behind the classifier ensembles is to use more than one classifier by expecting to improve the overall accuracy. It is known that the classifier ensembles boost the overall classification performance by depending on two factors namely, individual success of the base learners and diversity. One way of providing diversity is to use the same or different type of base learners. When the same type of base learners is used, the diversity is realized by using different training data subsets for each of base classifiers. When different type of base classifiers used to achieve diversity, then ensemble system is called heterogeneous. In this paper, we focus on the heterogonous ensembles that use different types of base learners. An ensemble system based on classification algorithms, naïve Bayes, support vector machine and random forest is used to measure the effectiveness of heterogeneous classifier ensembles by conducting experiments on Turkish texts. Experiment results demonstrate that the usage of heterogeneous ensembles improves classification performance for Turkish texts and encourages to evaluate the impact of heterogeneous ensembles for the other agglutinative languages.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121389092","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":"Chaotic Moth Swarm Algorithm","authors":"U. Güvenc, S. Duman, Yunus Hinislioglu","doi":"10.1109/INISTA.2017.8001138","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001138","url":null,"abstract":"Moth Swarm Algorithm (MSA) is one of the newest developed nature-inspired heuristics for optimization problem. Nevertheless MSA has a drawback which is slow convergence. Chaos is incorporated into MSA to eliminate this drawback. In this paper, ten chaotic maps have been embedded into MSA to find the best numbers of prospectors for increase the exploitation of the best promising solutions. The proposed method is applied to solve the well-known seven benchmark test functions. Simulation results show that chaotic maps can improve the performance of the original MSA in terms of the convergence speed. At the same time, sinusoidal map is the best map for improving the performance of MSA significantly.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125103880","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":"Evaluation of agents' management impact on performances in coalition-based cooperation","authors":"Kaouther Bouzouita, W. Chaari, M. Tagina","doi":"10.1109/INISTA.2017.8001149","DOIUrl":"https://doi.org/10.1109/INISTA.2017.8001149","url":null,"abstract":"We study within this paper the effect of agents' management on the global performance of a multiagent system (MAS). Cooperative systems working under coalition formation strategies have been considered in this work. Our evaluation approach uses representation tools of the coalition formation process in addition to mathematical modeling techniques using utility functions. An empirical study has been led to validate this approach and present a benchmarking of three different cooperative strategies: Binary Max-Sum, Distributed Stochastic Algorithm and Greedy algorithm. Each strategy aims at solving the problem of task allocation in search and rescue scenarios.","PeriodicalId":314687,"journal":{"name":"2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications (INISTA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134478215","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}