definability in logic and rough set theory 1

Tuan Fang Fan, Churn Jung Liau, Duen-Ren Liu

研究成果: Conference contribution同行評審

2 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題Frontiers in Artificial Intelligence and Applications
發行者IOS Press
頁面749-750
頁數2
ISBN(列印)978158603891
DOIs
出版狀態Published - 1 6月 2008
事件18th European Conference on Artificial Intelligence, ECAI 2008 - Patras, Greece
持續時間: 21 7月 200825 7月 2008

出版系列

名字Frontiers in Artificial Intelligence and Applications
178
ISSN(列印)0922-6389

Conference

Conference18th European Conference on Artificial Intelligence, ECAI 2008
國家/地區Greece
城市Patras
期間21/07/0825/07/08

指紋

深入研究「definability in logic and rough set theory 1」主題。共同形成了獨特的指紋。

引用此