Log. J. IGPL最新文献_第8页

Slope-to-optimal-solution-based evaluation of the hardness of travelling salesman problem instances 基于斜率至最优解的旅行商问题实例硬度评价

Log. J. IGPL Pub Date : 2020-01-24 DOI: 10.1093/jigpal/jzz070

M. Cárdenas-Montes

{"title":"Slope-to-optimal-solution-based evaluation of the hardness of travelling salesman problem instances","authors":"M. Cárdenas-Montes","doi":"10.1093/jigpal/jzz070","DOIUrl":"https://doi.org/10.1093/jigpal/jzz070","url":null,"abstract":"The travelling salesman problem is one of the most popular problems in combinatorial optimization. It has been frequently used as a benchmark of the performance of evolutionary algorithms. For this reason, nowadays practitioners request new and more difficult instances of this problem. This leads to investigate how to evaluate the intrinsic difficulty of the instances and how to separate ease and difficult instances. By developing methodologies for separating easy- from difficult-to-solve instances, researchers can fairly test the performance of their combinatorial optimizers. In this work, a methodology for evaluating the difficulty of instances of the travelling salesman problem near the optimal solution is proposed. The question is if the fitness landscape near the optimal solution encodes enough information to separate instances in function of their intrinsic difficulty. This methodology is based on the use of a random walk to explore the closeness of the optimal solution. The optimal solution is modified by altering one connection between two cities at each step, at the same time that the fitness of the altered solution is evaluated. This permits evaluating the slope of the fitness landscape. Later, and using the previous information, the difficulty of the instance is evaluated with random forests and artificial neural networks. In this work, this methodology is confronted with a wide set of instances. As a consequence, a methodology to separate the instances of the travelling salesman problem by their degree of difficulty is proposed and evaluated.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127709927","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 HMM-based synthetic view generator to improve the efficiency of ensemble systems 一种基于hmm的综合视图生成器，以提高集成系统的效率

Log. J. IGPL Pub Date : 2020-01-24 DOI: 10.1093/jigpal/jzz067

María Lourdes Borrajo Diz, A. S. Vieira, E. L. Iglesias

{"title":"An HMM-based synthetic view generator to improve the efficiency of ensemble systems","authors":"María Lourdes Borrajo Diz, A. S. Vieira, E. L. Iglesias","doi":"10.1093/jigpal/jzz067","DOIUrl":"https://doi.org/10.1093/jigpal/jzz067","url":null,"abstract":"One of the most active areas of research in semi-supervised learning has been to study methods for constructing good ensembles of classifiers. Ensemble systems are techniques that create multiple models and then combine them to produce improved results. These systems usually produce more accurate solutions than a single model would. Specially, multi-view ensemble systems improve the accuracy of text classification because they optimize the functions to exploit different views of the same input data. However, despite being more promising than the single-view approaches, document datasets often have no natural multiple views available. This study proposes an algorithm to generate a synthetic view from a standard text dataset. The model generates a new view from the standard bag-of-words approach using an algorithm based on hidden Markov models (HMMs). To show the effectiveness of the proposed HMM-based synthetic view generation method, it has been integrated in a co-training ensemble system and tested with four text corpora: Reuters, 20 Newsgroup, TREC Genomics and OHSUMED. The results obtained are promising, showing a significant increase in the efficiency of the ensemble system compared to a single-view approach.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123688555","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

Comparative Study of Imputation Algorithms Applied to the Prediction of Student Performance 应用于学生成绩预测的归算算法比较研究

Log. J. IGPL Pub Date : 2020-01-24 DOI: 10.1093/jigpal/jzz071

Concepción Crespo-Turrado, J. Casteleiro-Roca, F. Lasheras, J. López-Vázquez, F. J. D. C. Juez, F. Castelo, J. Calvo-Rolle, E. Corchado

引用次数: 12

Novel email spam detection method using sentiment analysis and personality recognition 基于情感分析和人格识别的垃圾邮件检测新方法

Log. J. IGPL Pub Date : 2020-01-24 DOI: 10.1093/jigpal/jzz073

Enaitz Ezpeleta, Iñaki Vélez de Mendizabal, J. M. G. Hidalgo, Urko Zurutuza

引用次数: 10

Probability as a modal operator: the possibilities of its combination with other modalities 作为模态算子的概率:它与其他模态结合的可能性

Log. J. IGPL Pub Date : 2020-01-19 DOI: 10.1093/jigpal/jzz044

Nino Guallart

引用次数: 0

Identification of Li-ion battery models through monotonic echo serial networks for coarse data 基于粗数据单调回波序列网络的锂离子电池模型识别

Log. J. IGPL Pub Date : 2020-01-15 DOI: 10.1093/jigpal/jzz075

Antonio Álvarez-Caballero, C. B. Viejo, Inés Couso, L. Sánchez

引用次数: 0

On epistemic and ontological interpretations of intuitionistic and paraconsistent paradigms 论直觉主义和副一致范式的认识论和本体论解释

Log. J. IGPL Pub Date : 2020-01-15 DOI: 10.1093/jigpal/jzz041

W. Carnielli, A. Rodrigues

引用次数: 7

Economical connections between several European countries based on TSP data 基于TSP数据的几个欧洲国家之间的经济联系

Log. J. IGPL Pub Date : 2019-12-31 DOI: 10.1093/jigpal/jzz069

G. Crişan, C. Pintea, P. Pop, Oliviu Matei

{"title":"Economical connections between several European countries based on TSP data","authors":"G. Crişan, C. Pintea, P. Pop, Oliviu Matei","doi":"10.1093/jigpal/jzz069","DOIUrl":"https://doi.org/10.1093/jigpal/jzz069","url":null,"abstract":"A fluent economical collaboration between countries is a major need. European flows of trade and people are supported by efficient connections between main localities from a geographic region, in many cases overriding national borders. This paper introduces three traveling salesmen problem instances based on freely available geographic coordinates of the main cities of France, Portugal and Spain. These instances are unified, generating other four larger instances: three with all pairs of countries and one instance with the settlements from all the three countries. The study includes an analysis of quality of solutions for a version of branch & cut algorithm and some hybrid heuristics including the Lin–Kernighan algorithm. $Bormathring{u}vka$, Quick$Bormathring{u}vka$ and Greedy algorithms are also used in the hybrid approaches in order to obtain a potential beneficent initial solution for the Lin–Kernighan algorithm. Concorde solver, nowadays state-of-the-art exact software, together with the already mentioned algorithms, is used to test and furthermore analyze the new TSP instances. Some results are represented using online services such as Google Maps, showing the potential integration of the Concorde’s optimum results into commercial routing applications. The very good results provided by the Lin–Kernighan method allow its usage for real medium-sized routing instances.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132718287","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}

引用次数: 2

Deep packet inspection for intelligent intrusion detection in software-defined industrial networks: A proof of concept 软件定义工业网络中用于智能入侵检测的深度包检测:概念验证

Log. J. IGPL Pub Date : 2019-12-31 DOI: 10.1093/jigpal/jzz060

M. Sainz, Iñaki Garitano, Mikel Iturbe, Urko Zurutuza

引用次数: 9

Argument evaluation in multi-agent justification logics 多智能体论证逻辑中的论证评估

Log. J. IGPL Pub Date : 2019-12-23 DOI: 10.1093/jigpal/jzz046

A. Burrieza, Antonio Yuste-Ginel

{"title":"Argument evaluation in multi-agent justification logics","authors":"A. Burrieza, Antonio Yuste-Ginel","doi":"10.1093/jigpal/jzz046","DOIUrl":"https://doi.org/10.1093/jigpal/jzz046","url":null,"abstract":"\u0000 Argument evaluation , one of the central problems in argumentation theory, consists in studying what makes an argument a good one. This paper proposes a formal approach to argument evaluation from the perspective of justification logic. We adopt a multi-agent setting, accepting the intuitive idea that arguments are always evaluated by someone. Two general restrictions are imposed on our analysis: non-deductive arguments are left out and the goal of argument evaluation is fixed: supporting a given proposition. Methodologically, our approach uses several existing tools borrowed from justification logic, awareness logic, doxastic logic and logics for belief dependence. We start by introducing a basic logic for argument evaluation, where a list of argumentative and doxastic notions can be expressed. Later on, we discuss how to capture the mentioned form of argument evaluation by defining a preference operator in the object language. The intuitive picture behind this definition is that, when assessing a couple of arguments, the agent puts them to a test consisting of several criteria (filters). As a result of this process, a preference relation among the evaluated arguments is established by the agent. After showing that this operator suffers a special form of logical omniscience, called preferential omniscience, we discuss how to define an explicit version of it, more suitable to deal with non-ideal agents. The present work exploits the formal notion of awareness in order to model several informal phenomena: awareness of sentences, availability of arguments and communication between agents and external sources (advisers). We discuss several extensions of the basic logic and offer completeness and decidability results for all of them.","PeriodicalId":304915,"journal":{"name":"Log. J. IGPL","volume":"54 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113957842","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