Electronic Notes in Discrete Mathematics最新文献_第6页

An Evolutionary Algorithm for Automatic Recommendation of Clustering Methods and its Parameters 一种自动推荐聚类方法及其参数的进化算法

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.030

Jessica A. Carballido , Macarena A. Latini , Ignacio Ponzoni , Rocío L. Cecchini

{"title":"An Evolutionary Algorithm for Automatic Recommendation of Clustering Methods and its Parameters","authors":"Jessica A. Carballido , Macarena A. Latini , Ignacio Ponzoni , Rocío L. Cecchini","doi":"10.1016/j.endm.2018.07.030","DOIUrl":"10.1016/j.endm.2018.07.030","url":null,"abstract":"<div><p>One of the main problems being faced at the time of performing data clustering consists in the deteremination of the best clustering method together with defining the ideal amount (k) of groups in which these data should be separated. In this paper, a preliminary approximation of a clustering recommender method is presented which, starting from a set of standardized data, suggests the best clustering strategy and also proposes an advisable k value. For this aim, the algorithm considers four indices for evaluating the final structure of clusters: Dunn, Silhouette, Widest Gap and Entropy. The prototype is implemented as a Genetic Algorithm in which individuals are possible configurations of the methods and their parameters. In this first prototype, the algorithm suggests between four partitioning methods namely K-means, PAM, CLARA and, Fanny. Also, the best set of parameters to execute the suggested method is obtained. The prototype was developed in an R environment, and its findings could be corroborated as consistent when compared with a combination of results provided by other methods with similar objectives. The idea of this prototype is to serve as the initial basis for a more complex framework that also incorporates the reduction of matrices with vast numbers of rows.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.030","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123985568","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

A heuristic Approach for the k-Traveling Repairman Problem with Profits under Uncertainty 不确定条件下具有利润的k-旅行修理工问题的一种启发式方法

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.029

M.E. Bruni, P. Beraldi, S. Khodaparasti

引用次数: 16

On a Stackelberg Subset Sum Game 关于Stackelberg子集和博弈

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.018

Ulrich Pferschy , Gaia Nicosia , Andrea Pacifici

引用次数: 3

Shortest Path Problem variants for the Hydro Unit Commitment Problem 水电机组投用问题的最短路径问题变体

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.040

Wim van Ackooij , Claudia D'Ambrosio , Leo Liberti , Raouia Taktak , Dimitri Thomopulos , Sonia Toubaline

引用次数: 6

Optimization of transition rules in a Bonus-Malus system 奖惩系统中过渡规则的优化

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.002

Márton Gyetvai , Kolos Cs. Ágoston

引用次数: 3

Unconstraining the Passenger Demand for Rail Yield Management at Trenitalia 意大利铁路收益管理中的无约束客运需求

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.035

Alessandra Berto, Stefano Gliozzi

引用次数: 4

Comparison of Multiobjective Evolutionary Algorithms for Prioritized Urban Waste Collection in Montevideo, Uruguay 乌拉圭蒙得维的亚城市垃圾优先收集的多目标进化算法比较

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.013

Sergio Nesmachnow , Diego Rossit , Jamal Toutouh

引用次数: 23

An Approximation Algorithm for the Two-Node-Connected Star Problem with Steiner Nodes 具有Steiner节点的两节点连通星型问题的近似算法

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.023

Graciela Ferreira, Franco Robledo, Pablo Romero

{"title":"An Approximation Algorithm for the Two-Node-Connected Star Problem with Steiner Nodes","authors":"Graciela Ferreira, Franco Robledo, Pablo Romero","doi":"10.1016/j.endm.2018.07.023","DOIUrl":"10.1016/j.endm.2018.07.023","url":null,"abstract":"<div><p>The goal in topological network design is to build a minimum-cost topology meeting specific real-life constraints. There is a cost-robustness trade-off under single and multiple failures.</p><p>Previous works in the field suggest that a backbone composed by a two-node-connected toplogy provides savings with respect to elementary cycles. Consequently, we introduce the Two-Node Connected Star Problem with Steiner Nodes (2NCSP-SN). The goal is to design a minimum-cost topology, where the backbone is two-node connected, the access network is connected in a <em>star</em> topology or by direct links to the backbone, and optional nodes (called Steiner nodes) could be included in the solution. The 2NCSP-SN belongs to the class of NP-Hard problems. This promotes the development of heuristics and approximation algorithms.</p><p>An approximation algorithm of factor 4<em>α</em> for the 2NCSP-SN is introduced, being <span><math><mi>α</mi><mo>≥</mo><mn>1</mn><mo>/</mo><mn>2</mn></math></span> the cost-ratio between backbone and access links. This is a generalization of the well-known factor 2 for the design of minimum-cost two-connected spanning networks (if we fix <span><math><mi>α</mi><mo>=</mo><mn>1</mn><mo>/</mo><mn>2</mn></math></span>). Finally, an exact Integer Linear Programming (ILP) formulation is proposed in order to highlight the effectiveness of the approximation algorithm. The results confirm a small gap between the globally optimum solution and the topology offered by our approximation algorithm when the ratio <em>α</em> is close to 1/2.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.023","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120893532","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

Biclustering as Strategy for Improving Feature Selection in Consensus QSAR Modeling 改进共识QSAR建模特征选择的双聚类策略

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.016

María Jimena Martínez , Julieta Sol Dussaut , Ignacio Ponzoni

引用次数: 15

Average Longest Path and Maximum Cost Network Flows with Multiple-Criteria Weights 具有多准则权值的平均最长路径和最大代价网络流

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.024

Jeremy D. Jordan, Jeffery D. Weir

引用次数: 2