Journal of Competitiveness

Total Page:16

File Type:pdf, Size:1020Kb

Journal of Competitiveness Journal of Competitiveness The scientific periodical Journal of Competitiveness published by the Faculty of Management and Economics of Tomas Bata University in Zlín offers results of basic and applied economic research of domestic and international authors in the English language. As it is evident from the title, the journal concentrates on the field of competitiveness of individual companies, clusters of companies, regions or national economies from different angles of view. Problems of competitiveness represent the sub- ject which stretches across the individual branches of economic theory and practice. Therefore, we welcome articles focusing on microeconomics, management, marketing, personnel, financial man- agement as well on problems of national economy and regions or other economic subjects connected with competitiveness. Editorial Board Editor-in-Chief: assoc. prof. David Tuček, Ph.D. Tomas Bata University in Zlín Czech Republic Members of Editorial Board: Prof. John R. Anchor, Ph.D., Prof. Léo-Paul Dana, University of Huddersfield Business School, Montpellier Business School, France, Princeton United Kingdom University New Jersey, United States of America Prof. dr. Sanja Bauk, Dr. Pradeep Dharmadasa, PhD. University of Montenegro, University of Colombo, RWTH Aachen University, Sri Lanka Germany Prof. Veselin Draškovič, Ph.D., Adam P. Balcerzak, Ph.D., University of Montenegro, Montenegro, MGU Nicolaus Copernicus University Toruň, „M. V. Lomonosova“, Moskow, Russia Poland assoc. prof. Ján Dobrovič, PhD., Prof. Jaroslav Belás, Ph.D., University of Presov, Tomas Bata University in Zlín, Slovak Republic Czech Republic assoc. prof. Ida Ercsey Ph.D., Prof. dr habil Andrea Bencsik, CSc., Széchenyi István University, Szechényi István University, Hungary Hungary Dr. Tomasz Bernat, assoc. prof. Jozef Habánik, Ph.D., University of Szczecin, Alexander Dubček University of Trenčín, Poland Slovak Republic Dr. Yuriy Bilan, assoc. prof. Eva Happ Ph.D., University of Szczecin, Széchenyi István University, Poland Hungary Dr. Tatyana Vladimirovna Chubarova, Prof. Ahasanul Haque, Institute of Economics of Russian Academy International Islamic University, of Sciences, Malaysia Russia assoc. prof. Alžbeta Kiráľová, Ph.D., Prof. Le Vinh Danh, University College of Business Prague, Ton Duc Thang University, Czech Republic Vietnam joc3-2016_v3.indd 1 10.10.2016 13:56:10 Dr. Aleksandr Ključnikov, prof. Ing. Róbert Štefko, Ph.D. Pan-European University Bratislava, University of Presov, Slovak Republic Slovak Republic assoc. prof. Adriana Knápková, Ph.D., Prof. habil. Dr. Dalia Štreimikienė, Tomas Bata University in Zlín, Czech Republic Mykolo Romerio Universitetas Vilnius, Lithuania Dr. Nguyen Thi Bich Loan, Ton Duc Thang University, assoc. prof. dr. Karin Širec, Vietnam University of Maribor, Slovenia assoc. prof. Athanasios Mandilas, Dr. Piotr Tworek, Eastern Macedonia and Thrace Institute University of Economics in Katowice, of Technology, Poland Greece Prof. Dr. Manuela Tvaronavičienė, Dr. Mohammad Dulal Miah, Vilnius Gediminas Technical University, University of Nizwa, Lithuania Sultanate of Oman Prof. RNDr. René Wokoun, CSc., Prof. Zdeněk Mikoláš, CSc., The College of Regional Development Prague, University of Entrepreneurship and Law Prague, Czech Republic Czech Republic assoc. prof. Rastislav Rajnoha, Ph.D. Prof. Ivan Mihajlović, PhD., Tomas Bata University in Zlin, University of Belgrade, Serbia Czech republic assoc. prof. Ladislav Mura, PhD. assoc. prof. Veland Ramadani, Ph.D., University of Ss Cyril and Methodius in Trnava, South-East European University, Slovak Republic Macedonia Dr. Valentina Yurievna Muzychuk, Prof. Dr. Rodica Milena Zaharia, Institute of Economics of Russian Academy University of Economics in Bucharest of Sciences, Romania Russia Dr. Mehran Nejati, Ph.D., Universiti Sains Malaysia, Malaysia Dr. Jiří Novosák, Tomas Bata University in Zlín, Czech Republic Prof. Yuriy Osipov, Lomonosov’s Moscow State University, Russia Dr. José Martí-Parreño, Universidad Europea de Valencia, Spain prof. Dr. Ing. Drahomíra Pavelková, Tomas Bata University in Zlín, Czech Republic assoc. prof. Boris Popesko, Ph.D., Tomas Bata University in Zlín, Czech Republic Prof. Dr. Bruno S. Sergi, Harvard Extension School, United States of America Dr. Maman Setiawan, University of Padjadjaran, Indonesia assoc. prof. Juraj Sipko, Ph.D., Institute of Economic Research Slovak Academy of Sciences, Bratislava, Slovak Republic assoc. prof. Jiří Strouhal, Ph.D., University of Economics, Prague, Czech Republic Journal of Competitiveness joc3-2016_v3.indd 2 10.10.2016 13:56:10 Journal of Competitiveness Content Requirements for Brand Managers and Product Managers Responsible for Competitiveness of Product and Brands Wroblowská Zuzana 5 Internal Branding and the Competitive Performance of Private Universities in Ghana Amegbe Hayford 22 Risk Factors of Young Graduates in the Competitive E.U. Labour Market at the End of the Current Economic Crisis Kačerová Eliška 38 Relevant Drivers for Customers` Churn and Retention Decision in the Nigerian Mobile Telecommunication Industry Adebiyi Sulaimon Olanrewaju, Oyatoye Emmanuel Olateju, Amole Bilqis Bolanle 52 The Impact of EU Funds on the Development of a Business Model for Small and Medium-Sized Enterprises Olinski Marian, Szamrowski Piotr, Luty Lidia 68 Y and Z Generations at Workplaces Bencsik Andrea, Horváth-Csikós Gabriella, Juhász Tímea 90 Strategic Performance Management System and Corporate Sustainability Concept - Specific Parametres in Slovak Enterprises Rajnoha Rastislav, Lesníková Petra 107 The Relationship between the Risk of a Change of the Interest Rate and the Age of Entrepreneurs among Slovak SMEs Sobeková Majková Monika 125 joc3-2016_v3.indd 3 10.10.2016 13:56:10 Editor’s Letter Dear readers, Let us introduce the third issue of the eight volume of the Journal of Competitiveness (2016). This issue offers contributions focused on topics of product management, internal branding of private universities, labour market and young graduates, and labour market connected with Z and Y generation. Firm strategy, market performance, the impact of EU funds on the development of a business model, business economics and investment decisions are topics which were chosen to be published in this issue as well. You can find contributions from the Czech Republic, Ghana, Nigeria, Poland, Hungary and Slo- vakia. The aim of the first paper is to present partial results of an independent research, and connect them with the knowledge base of knowledgeable management and human factors in product manage- ment. The paper focuses on a set of requirements for qualifications, experience, knowledge and skills that are imposed on candidates for the position of “Brand Manager”. The conclusion of the second study is that performance of private universities and brand equity depend on a high loyalty among students. The author of the following contribution focuses on two areas including the analysis of perception of graduates as drifters, and their demands for high starting salaries. A partial conclusion of this study indicated that future graduates, in comparison with the initial risk factor of high turnover, see much higher risk in their inability to solve problems, high initial costs of training or lack of independence. The purpose of Nigerian author´s study is to ascertain the relevant drivers of customers` churn and retention in the growing Nigerian mobile telecommunication industry. The aim of the fifth paper is to assess the impact of grants received by companies on the formation of a business model. The main question of the sixth research was how to approach the new generations from the view of HR´s perspective. The next paper focuses on the analysis and identification of specific factors regarding localiza- tion, turnover of enterprise and others which may have a potential impact on performance. In this context, the attention is drawn to the orientation of enterprises on particular dimensions of corporate sustainability concept and factors such as company size or capital structure in relation to its application. The main objective of the last paper is to bring scientific evidence that the age of an entrepreneur should be considered as a factor having significant impact on one part of the credit risk of a com- pany– the risk of a change of the interest change. The research was carried out among 438 Slovak companies in 2016. We would like to thank members of the editorial staff, peer reviewers and members of the editorial board for preparing this issue, and we are looking forward to our further cooperation. On behalf of the journal’s editorial staff, Assoc. Prof. David Tuček, Ph.D. Editor-in-Chief joc3-2016_v3.indd 4 10.10.2016 13:56:10 Requirements for Brand Managers and Product Managers Responsible for Competitiveness of Product and Brands ▪ Wroblowská Zuzana Abstract Competitiveness of a product and care of a brand value are mainly the work of product man- agers and brand managers who play a major role in creating a competitive advantage of their companies. The aim of the paper is to present partial results of an independent research and connect them with the knowledge base of knowledgable management and human factors in product management. The paper focuses on a set of requirements for qualifications, experience, knowledge and skills that are imposed on candidates for the position of “Brand Manager”. For the purposes of defining the research objectives, an assumption was made that a set of require- ments for candidates
Recommended publications
  • Evolutionary Data Mining Approach to Creating Digital Logic
    EVOLUTIONARY DATA MINING APPROACH TO CREATING DIGITAL LOGIC James F. Smith III, ThanhVu H. Nguyen Code 5741, Naval Research Laboratory, Washington, DC, 20375-5320, USA Keywords: Optimization problems in signal processing, signal reconstruction, system identification, time series and system modeling. Abstract: A data mining based procedure for automated reverse engineering has been developed. The data mining algorithm for reverse engineering uses a genetic program (GP) as a data mining function. A genetic program is an algorithm based on the theory of evolution that automatically evolves populations of computer programs or mathematical expressions, eventually selecting one that is optimal in the sense it maximizes a measure of effectiveness, referred to as a fitness function. The system to be reverse engineered is typically a sensor. Design documents for the sensor are not available and conditions prevent the sensor from being taken apart. The sensor is used to create a database of input signals and output measurements. Rules about the likely design properties of the sensor are collected from experts. The rules are used to create a fitness function for the genetic program. Genetic program based data mining is then conducted. This procedure incorporates not only the experts’ rules into the fitness function, but also the information in the database. The information extracted through this process is the internal design specifications of the sensor. Significant mathematical formalism and experimental results related to GP based data mining for reverse engineering will be provided. 1 INTRODUCTION The rules are used to create a fitness function for the genetic program. Genetic program based data An engineer must design a signal that will yield a mining is then conducted (Bigus 1996, Smith 2003a, particular type of output from a sensor device (SD).
    [Show full text]
  • A Genetic Algorithm Solution Approach Introd
    A new optimization model for market basket analysis with allocation considerations: A genetic algorithm solution approach Majeed HEYDARI University of Zanjan, Zanjan, Iran [email protected] Amir YOUSEFLI Imam Khomeini International University, Qazvin, Iran [email protected] Abstract. Nowadays market basket analysis is one of the interested research areas of the data mining that has received more attention by researchers. But, most of the related research focused on the traditional and heuristic algorithms with limited factors that are not the only influential factors of the basket market analysis. In this paper to efficient modeling and analysis of the market basket data, the optimization model is proposed with considering allocation parameter as one of the important and effectual factors of the selling rate. The genetic algorithm approach is applied to solve the formulated non-linear binary programming problem and a numerical example is used to illustrate the presented model. The provided results reveal that the obtained solutions seem to be more realistic and applicable. Keywords: market basket analysis, association rule, non-linear programming, genetic algorithm, optimization. Please cite the article as follows: Heydary, M. and Yousefli, A. (2017), “A new optimization model for market basket analysis with allocation considerations: A genetic algorithm solution approach”, Management & Marketing. Challenges for the Knowledge Society, Vol. 12, No. 1, pp. 1- 11. DOI: 10.1515/mmcks-2017-0001 Introduction Nowadays, data mining is widely used in several aspects of science such as manufacturing, marketing, CRM, retail trade etc. Data mining or knowledge discovery is a process for data analyzing to extract information from large databases.
    [Show full text]
  • Optimization-Based Evolutionary Data Mining Techniques for Structural Health Monitoring
    Journal of Civil Engineering and Construction 2020;9(1):14-23 https://doi.org/10.32732/jcec.2020.9.1.14 Optimization-Based Evolutionary Data Mining Techniques for Structural Health Monitoring Meisam Gordan, Zubaidah Binti Ismail, Hashim Abdul Razak, Khaled Ghaedi, Haider Hamad Ghayeb Department of Civil Engineering, University of Malaya, 50603, Kuala Lumpur, Malaysia E-mail: [email protected] Received: 27 July 2019; Accepted: 24 August 2019; Available online: 20 November 2019 Abstract: In recent years, data mining technology has been employed to solve various Structural Health Monitoring (SHM) problems as a comprehensive strategy because of its computational capability. Optimization is one the most important functions in Data mining. In an engineering optimization problem, it is not easy to find an exact solution. In this regard, evolutionary techniques have been applied as a part of procedure of achieving the exact solution. Therefore, various metaheuristic algorithms have been developed to solve a variety of engineering optimization problems in SHM. This study presents the most applicable as well as effective evolutionary techniques used in structural damage identification. To this end, a brief overview of metaheuristic techniques is discussed in this paper. Then the most applicable optimization-based algorithms in structural damage identification are presented, i.e. Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Imperialist Competitive Algorithm (ICA) and Ant Colony Optimization (ACO). Some related examples are also detailed in order to indicate the efficiency of these algorithms. Keywords: Structural damage detection; Data mining; Metaheuristic algorithms; Optimization. 1. Introduction In-service aerospace, mechanical, and civil structures are damage-prone during their service life.
    [Show full text]
  • Multi Objective Optimization of Classification Rules Using Cultural Algorithms
    Available online at www.sciencedirect.com Procedia Engineering Procedia Engineering 00 (2011) 000–000 Procedia Engineering 30 (2012) 457 – 465 www.elsevier.com/locate/procedia International Conference on Communication Technology and System Design 2011 Multi Objective Optimization of classification rules using Cultural Algorithms Sujatha Srinivasana, Sivakumar Ramakrishnana, a* aDept. of Computer Science, AVVM Sri Pushpam College, Poondi, Tanjore-613503, Tamil Nadu, India Abstract Classification rule mining is the most sought out by users since they represent highly comprehensible form of knowledge. The rules are evaluated based on objective and subjective metrics. The user must be able to specify the properties of the rules. The rules discovered must have some of these properties to render them useful. These properties may be conflicting. Hence discovery of rules with specific properties is a multi objective optimization problem. Cultural Algorithm (CA) which derives from social structures, and which incorporates evolutionary systems and agents, and uses five knowledge sources (KS’s) for the evolution process better suits the need for solving multi objective optimization problem. In the current study a cultural algorithm for classification rule mining is proposed for multi objective optimization of rules. © 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of ICCTSD 2011 Keywords: Multi-objective-optimization; Classification; Cultural Algorithm; Data mining. 1. Introduction Classification rule mining is a class of problems which is the most sought out by decision makers since they produce comprehensible form of knowledge. The rules produced by the rule mining approach are evaluated using various metrics which are called the properties of the rule.
    [Show full text]
  • Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction
    International Journal of Machine Learning and Computing, Vol. 2, No. 3, June 2012 Efficient Evolutionary Data Mining Algorithms Applied to the Insurance Fraud Prediction Jenn-Long Liu, Chien-Liang Chen, and Hsing-Hui Yang instances of insurance cases for data mining. The 5000 Abstract—This study proposes two kinds of Evolutionary instances are divided into 4000 instances to be the training set Data Mining (EvoDM) algorithms to the insurance fraud and 1000 instances to be the test set. Furthermore, this work prediction. One is GA-Kmeans by combining K-means applies K-means, GA-Kmeans and MPSO-Kmeans algorithm with genetic algorithm (GA). The other is algorithms to evaluate the fraud or not from the training set MPSO-Kmeans by combining K-means algorithm with Momentum-type Particle Swarm Optimization (MPSO). The and also evaluate the accuracy of fraud prediction for the test dataset used in this study is composed of 6 attributes with 5000 set. instances for car insurance claim. These 5000 instances are divided into 4000 training data and 1000 test data. Two II. CRISP-DM different initial cluster centers for each attribute are set by means of (a) selecting the centers randomly from the training CRISP-DM (Cross Industry Standard Process for Data set and (b) averaging all data of training set, respectively. Mining) is a data mining process model that describes Thereafter, the proposed GA-Kmeans and MPSO-Kmeans are commonly used approaches for expert data miners use to employed to determine the optimal weights and final cluster solve problems. CRISP-DM was conceived in late 1996 by centers for attributes, and the accuracy of prediction for test set SPSS (then ISL), NCR and DaimlerChrysler (then is computed based on the optimal weights and final cluster Daimler-Benz).
    [Show full text]
  • Evolutionary Data Mining for Link Analysis: Preliminary Experiments on a Social Network Test Bed
    Evolutionary Data Mining for Link Analysis: Preliminary Experiments on a Social Network Test Bed William H. Hsu Andrew L. King Martin S. R. Paradesi Tejaswi Pydimarri Tim Weninger Department of Computing and Information Sciences, Kansas State University 234 Nichols Hall, Manhattan, KS 66506 (785) 532-6350 {bhsu | aking | pmsr | tejaswi | weninger}@ksu.edu ABSTRACT between communities and users they denote accepted members In this paper, we address the problem of graph feature extraction and moderator privileges. Specific recommendation targets for and selection for link analysis in weblogs and similar social weblogs include links (new friends and subscriberships), security networks. First, we present an approach based on collaborative levels (link strength), requests for reciprocal links (trust, recommendation using the link structure of a social network and membership and moderatorship applications), and definition of content-based recommendation using mutual declared interests. security levels (filters). There are analogous applicatons of this Next, we describe the application of this approach to a small functionality in social networks such as citation and collaboration representative subset of a large real-world social network: the networks. user/community network of the blog service LiveJournal. We We investigate the problem of link recommendation in such then discuss the ground features available in LiveJournal’s public weblog-based social networks and describe an annotated graph- user information pages and describe some graph algorithms for based representation for such networks. Our approach uses graph analysis of the social network along with a feature set for feature analysis to recommend links (u, v) given structural classifying users as friends or non-friends.
    [Show full text]
  • Novel Evolutionary Algorithms for Supervised Classification Problems: an Experimental Study
    Evolutionary Intelligence manuscript No. (will be inserted by the editor) Novel Evolutionary Algorithms for Supervised Classification Problems: An Experimental Study Pu Wang · Thomas Weise · Raymond Chiong Received: date / Accepted: date This is a preview version of paper [64] (see page 24 for the reference). It is posted here for your personal use and not for redistribution. The final publication and definite version is available from Springer (who hold the copyright) at http://link.springer.com/. See also http://dx.doi.org/10.1007/s12065-010-0047-7. Abstract Evolutionary Algorithms (EAs) are population-based, stochastic search al- gorithms that mimic natural evolution. Over the years, EAs have been successfully applied to many classification problems. In this paper, we present three novel evolu- tionary approaches and analyze their performances for synthesizing classifiers with EAs in supervised data mining scenarios. The first approach is based on encoding rule sets with bit string genomes, while the second one utilizes Genetic Programming (GP) to create decision trees with arbitrary expressions attached to the nodes. The novelty of these two approaches lies in the use of solutions on the Pareto front as an ensemble. The third approach, EDDIE-101, is also based on GP but uses a new, advanced fitness measure and some novel genetic operators. We compare these approaches to a number of well-known data mining methods, including C4.5 and Random-Forest, and show that the performances of our evolved classifiers can be very competitive as far as the solution quality is concerned. In addition, the proposed approaches work well across a wide range of configurations, and EDDIE-101 particularly has been highly efficient.
    [Show full text]
  • Comprehensive Taxonomies of Nature- and Bio-Inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis and Recommendations
    Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations Daniel Molina*1, Javier Poyatos1, Javier Del Ser2,3,4, Salvador García1, Amir Hussain5, and Francisco Herrera1,6 1 Department of Computer Science, DaSCI Andalusian Institute of Data Science and Computation Intelligence, University of Granada, Spain, {[email protected], [email protected], [email protected], [email protected]} 2 TECNALIA, Spain, [email protected] 3 Dept. of Communications Engineering, University of the Basque Country (UPV/EHU), Spain 4 Basque Center for Applied Mathematics (BCAM), Spain 5 Edinburgh Napier University, United Kingdom, [email protected] 6 Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia Abstract Introduction: In recent years, a great variety of nature- and bio-inspired algorithms has been reported in the literature. This algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. Method: This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary arXiv:2002.08136v3 [cs.AI] 30 Apr 2021 of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper.
    [Show full text]
  • Genetic Algorithms and Evolutionary Computation
    126 IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.12, December 2010 Genetic Algorithms and Evolutionary Computation Ms.Nagori Meghna, Faculty of EngineeringGovernment EnggCollege Aurangabad, -431432, India Ms. KaleJyoti Faculty of Engineering MGM’c Engg College Nanded, -411402, India Abstract from the wild type), and dairy cows (with immense udders Generally speaking, genetic algorithms are simulations of far larger than would be required just for nourishing evolution, of what kind ever. In most cases, however, genetic offspring).Critics might charge that creationists can algorithms are nothing else than probabilistic optimization explain these things without recourse to evolution. For methods which are based on the principles of evolution. Using example, creationists often explain the development of simulation and Genetic Algorithms to improve cluster tool resistance to antibiotic agents in bacteria, or the changes performance, Mooring Pattern Optimization using Genetic wrought in domesticated animals by artificial selection, by Algorithms. This paper is designed to cover a few important application aspects of genetic algorithm under a single umbrella. presuming that God decided to create organisms in fixed Key words: groups, called "kinds" or baramin. Though natural Genetic Algorithm microevolution or human-guided artificial selection can bring about different varieties within the originally created "dog-kind," or "cow-kind," or "bacteria-kind" (!), Introduction no amount of time or genetic change can transform one "kind" into another. However, exactly how the creationists determine what a "kind" is, or what mechanism prevents Creationists occasionally charge that evolution is useless living things from evolving beyond its boundaries, is as a scientific theory because it produces no practical invariably never explained.
    [Show full text]
  • Conference Program
    Genn etic and Evolutionary Computation Conference (GECCO-2004) CONFERENCE PROGRAM June 26 – 30, 2004 Red Lion Hotel on Fifth Avenue Seattle, Washington, USA A Recombination of the Ninth Annual Genetic Programming Conference and the Thirteenth International Conference on Genetic Algorithms International Society for Genetic and Evolutionary Computation, Inc. In Association with the American Association for Artificial Intelligence Table of Contents GECCO Organizers ................................................................................................................................................... 2 Program Committee................................................................................................................................................... 3 Best Paper Awards..................................................................................................................................................... 4 About the Evolutionary Computation in Industry Track ........................................................................................... 5 Hotel Floor Plan......................................................................................................................................................... 5 Saturday Workshops and Tutorials............................................................................................................................ 6 Sunday Workshops, Tutorials and Human-competitive Results ..............................................................................
    [Show full text]
  • Improving Selection Methods for Evolutionary Algorithms by Clustering
    Improving Selection Methods for Evolutionary Algorithms by Clustering Kaikuo Xu1, ChangjieTang1, Yintian Liu1, Chuan Li1, Jiang Wu1, Jun Zhu2, Li Dai2 1School of Computer Science, Sichuan University, Chengdu, 610065, China 2National Center for Birth Defects Monitoring, Chengdu, 610065, China {xukaikuo, tangchangjie}@cs.scu.edu.cn Abstract characteristics of the population, hence the performance is still far from practice requirement. This study applies clustering in population selection to In this work, we apply clustering to selection improve the efficiency of evolutionary algorithms. The methods to better balance these two primary factors. (a) main contributions include: (a) Proposes a novel This selection framework is a combination of clustering selection framework that uses the number of clusters for a [7, 8] and classic selection schemes [6]. It first clusters the population as the measurement the population diversity. population according to the fitness distribution, then (b) Proposes clustering-ranking selection, an instance of carries out selection on the clusters using the classic this framework, and discusses its mathematical principle selection methods, at last selects individuals from the by PD-SP equation. (c) Gives experiments over CLPSO selected clusters according to uniform distribution; (b) (Comprehensive Learning Particle Swarm Optimization). Ranking selection is chosen to form an instance of the Experiment result shows that the proposed selection framework. The mathematical analysis shows that since method outperforms canonical exponential ranking on all the results of the clustering vary with the evolutional the sixteen-benchmark functions for both 10-D and 30-D progress, the selective pressure and population diversity problems except a function for 30-D problem.
    [Show full text]
  • Exploration of Customer Churn Routes Using Machine Learning Probabilistic Models
    UNIVERSITAT POLITECNICA` DE CATALUNYA Exploration of Customer Churn Routes Using Machine Learning Probabilistic Models DOCTORAL THESIS Author: David L. Garc´ıa Advisors: Dra. Angela` Nebot and Dr. Alfredo Vellido Soft Computing Research Group Departament de Llenguatges i Sistemes Informatics` Universitat Politecnica` de Catalunya. BarcelonaTech Barcelona, 10th April 2014 A bird doesn’t sing because it has an answer, it sings because it has a song. Maya Angelou AMonica,´ Olivia, Pol i Jana 1 Acknowledgments Siempre he pensado que las cosas, en la vida, no ocurren por casualidad; son el conjunto de pequenas˜ (y grandes) aportaciones, casualidades, ideas, retos, azar, amor, exigencia y apoyo, animo´ y desanimo,´ es- fuerzo, inspiracion,´ reflexiones y cr´ıticas y, en definitiva, de todo aquello que nos configura como personas. Y la presente Tesis Doctoral no es una excepcion.´ Sin la aportacion´ en pequenas˜ dosis de estos ingredientes por parte de muchas personas esta Tesis no hubiera visto nunca la luz. A todos ellos mi publica´ gratitud. A los Dres. Angela` Nebot y Alfredo Vellido, en primer lugar por reconocer algun´ tipo de ’valor’ difer- encial en un perfil como el m´ıo y aceptarme en el Soft Computing Group como estudiante de doctorado. Y en segundo lugar, y mas´ importante, por ser el alma de este trabajo. Si os fijais´ observareis´ su presencia e ideas a lo largo de la Tesis Doctoral. Para ellos mi gratitud y admiracion.´ A mis clientes y colegas en el mundo empresarial, con los que he compartido infinitas horas y problemas y cuya exigencia ha puesto a prueba, cada d´ıa, el sentido y utilidad practica´ de las ideas y metodolog´ıas aqu´ı presentadas.
    [Show full text]