{"title":"基本有向图的颗粒计算","authors":"G. Chiaselotti, T. Gentile, F. Infusino","doi":"10.2298/aadm180615001c","DOIUrl":null,"url":null,"abstract":"In the present paper we investigate (p,q)-directed complete bipartite graphs ?K p,q, n-directed paths ?Pn and n-directed cycles ?C n from the perspective of Granular Computing. For each model, we establish the general form of all possible indiscernibility relations, analyze the classical rough approximation functions of rough set theory and provide a close formula for the global accuracy average. Finally, we completely determine the attribute dependency function and the global dependency average for both ?C n and ?Kp,q.","PeriodicalId":51232,"journal":{"name":"Applicable Analysis and Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Granular computing on basic digraphs\",\"authors\":\"G. Chiaselotti, T. Gentile, F. Infusino\",\"doi\":\"10.2298/aadm180615001c\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the present paper we investigate (p,q)-directed complete bipartite graphs ?K p,q, n-directed paths ?Pn and n-directed cycles ?C n from the perspective of Granular Computing. For each model, we establish the general form of all possible indiscernibility relations, analyze the classical rough approximation functions of rough set theory and provide a close formula for the global accuracy average. Finally, we completely determine the attribute dependency function and the global dependency average for both ?C n and ?Kp,q.\",\"PeriodicalId\":51232,\"journal\":{\"name\":\"Applicable Analysis and Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Analysis and Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2298/aadm180615001c\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Analysis and Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2298/aadm180615001c","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
In the present paper we investigate (p,q)-directed complete bipartite graphs ?K p,q, n-directed paths ?Pn and n-directed cycles ?C n from the perspective of Granular Computing. For each model, we establish the general form of all possible indiscernibility relations, analyze the classical rough approximation functions of rough set theory and provide a close formula for the global accuracy average. Finally, we completely determine the attribute dependency function and the global dependency average for both ?C n and ?Kp,q.
期刊介绍：
Applicable Analysis and Discrete Mathematics is indexed, abstracted and cover-to cover reviewed in: Web of Science, Current Contents/Physical, Chemical & Earth Sciences (CC/PC&ES), Mathematical Reviews/MathSciNet, Zentralblatt für Mathematik, Referativny Zhurnal-VINITI. It is included Citation Index-Expanded (SCIE), ISI Alerting Service and in Digital Mathematical Registry of American Mathematical Society (http://www.ams.org/dmr/).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
