{"title":"最小覆盖层的公差距离","authors":"Catalin Zara, D. Simovici","doi":"10.1109/ISMVL.2016.13","DOIUrl":null,"url":null,"abstract":"We define distances on the space of minimal coverings of a finite set that generalize entropy distances on partitions, and establish connections between these spaces. The metric space of minimal coverings has multiple applications in machine learning and data mining, in areas such as multi-label classifications and determination of frequent item sets.","PeriodicalId":246194,"journal":{"name":"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tolerance Distances on Minimal Coverings\",\"authors\":\"Catalin Zara, D. Simovici\",\"doi\":\"10.1109/ISMVL.2016.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define distances on the space of minimal coverings of a finite set that generalize entropy distances on partitions, and establish connections between these spaces. The metric space of minimal coverings has multiple applications in machine learning and data mining, in areas such as multi-label classifications and determination of frequent item sets.\",\"PeriodicalId\":246194,\"journal\":{\"name\":\"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2016.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2016.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We define distances on the space of minimal coverings of a finite set that generalize entropy distances on partitions, and establish connections between these spaces. The metric space of minimal coverings has multiple applications in machine learning and data mining, in areas such as multi-label classifications and determination of frequent item sets.