完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Fan, Tuan-Fang | en_US |
dc.contributor.author | Liau, Churn-Jung | en_US |
dc.contributor.author | Liu, Duen-Ren | en_US |
dc.date.accessioned | 2018-08-21T05:56:29Z | - |
dc.date.available | 2018-08-21T05:56:29Z | - |
dc.date.issued | 2008-01-01 | en_US |
dc.identifier.issn | 0922-6389 | en_US |
dc.identifier.uri | http://dx.doi.org/10.3233/978-1-58603-891-5-749 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/146260 | - |
dc.description.abstract | Rough set theory is an effective tool for data mining. According to the theory, a concept is definable if it can be written as a Boolean combination of equivalence classes induced from classification attributes. On the other hand, definability in logic has been explicated by Beth's theorem. In this paper, we propose two data representation formalisms, called first-order data logic (FODL) and attribute value-sorted logic (AVSL), respectively. Based on these logics, we explore the relationship between logical definability and rough set definability. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Definability in Logic and Rough Set Theory | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.doi | 10.3233/978-1-58603-891-5-749 | en_US |
dc.identifier.journal | ECAI 2008, PROCEEDINGS | en_US |
dc.citation.volume | 178 | en_US |
dc.citation.spage | 749 | en_US |
dc.contributor.department | 資訊管理與財務金融系 註:原資管所+財金所 | zh_TW |
dc.contributor.department | Department of Information Management and Finance | en_US |
dc.identifier.wosnumber | WOS:000273903100151 | en_US |
顯示於類別: | 會議論文 |