{"title":"Comparing datasets by attribute alignment","authors":"Jakub Smíd, Roman Neruda","doi":"10.1109/CIDM.2014.7008148","DOIUrl":null,"url":null,"abstract":"Metalearning approach to the model selection problem - exploiting the idea that algorithms perform similarly on similar datasets - requires a suitable metric on the dataset space. One common approach compares the datasets based on fixed number of features describing the datasets as a whole. The information based on individual attributes is usually aggregated, taken for the most relevant attributes only, or omitted altogether. In this paper, we propose an approach that aligns complete sets of attributes of the datasets, allowing for different number of attributes. By supplying the distance between two attributes, one can find the alignment minimizing the sum of individual distances between aligned attributes. We present two methods that are able to find such an alignment. They differ in computational complexity and presumptions about the distance function between two attributes supplied. Experiments were performed using the proposed methods and the results were compared with the baseline algorithm.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIDM.2014.7008148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Metalearning approach to the model selection problem - exploiting the idea that algorithms perform similarly on similar datasets - requires a suitable metric on the dataset space. One common approach compares the datasets based on fixed number of features describing the datasets as a whole. The information based on individual attributes is usually aggregated, taken for the most relevant attributes only, or omitted altogether. In this paper, we propose an approach that aligns complete sets of attributes of the datasets, allowing for different number of attributes. By supplying the distance between two attributes, one can find the alignment minimizing the sum of individual distances between aligned attributes. We present two methods that are able to find such an alignment. They differ in computational complexity and presumptions about the distance function between two attributes supplied. Experiments were performed using the proposed methods and the results were compared with the baseline algorithm.