學術產出-期刊論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 The analysis of relationships in databases for rule derivation
作者 陳良弼
Chen,Arbee L. P.
Yen,Show-Jane
貢獻者 資科系
日期 1996-11
上傳時間 21-八月-2014 15:01:45 (UTC+8)
摘要 Owing to the rapid growth in the sizes of databases, potentially useful information may be embeded in a large amount of data. Knowledge discovery is the search for semantic relationships which exist in large databases. One of the main problems for knowledge discovery is that the number of possible relationships can be very large, thus searching for interesting relationships and reducing the search complexity are important. The relationships can be represented as rules which can be used in efficient query processing. We present a technique to analyze relationships among attribute values and to derive compact rule set. We also propose a mechanism and some heuristics to reduce the search complexity for the rule derivation process. An evaluation model is presented to evaluate the quality of the derived rules. Moreover, in real world, databases may contain uncertain data. We also propose a technique to analyze the relationships among uncertain data and derive probabilistic rules.
關聯 Journal of Intelligent Information Systems,7(3),235-259
資料類型 article
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) Chen,Arbee L. P.en_US
dc.creator (作者) Yen,Show-Janeen_US
dc.date (日期) 1996-11en_US
dc.date.accessioned 21-八月-2014 15:01:45 (UTC+8)-
dc.date.available 21-八月-2014 15:01:45 (UTC+8)-
dc.date.issued (上傳時間) 21-八月-2014 15:01:45 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/69145-
dc.description.abstract (摘要) Owing to the rapid growth in the sizes of databases, potentially useful information may be embeded in a large amount of data. Knowledge discovery is the search for semantic relationships which exist in large databases. One of the main problems for knowledge discovery is that the number of possible relationships can be very large, thus searching for interesting relationships and reducing the search complexity are important. The relationships can be represented as rules which can be used in efficient query processing. We present a technique to analyze relationships among attribute values and to derive compact rule set. We also propose a mechanism and some heuristics to reduce the search complexity for the rule derivation process. An evaluation model is presented to evaluate the quality of the derived rules. Moreover, in real world, databases may contain uncertain data. We also propose a technique to analyze the relationships among uncertain data and derive probabilistic rules.en_US
dc.format.extent 115 bytes-
dc.format.mimetype text/html-
dc.language.iso en_US-
dc.relation (關聯) Journal of Intelligent Information Systems,7(3),235-259en_US
dc.title (題名) The analysis of relationships in databases for rule derivationen_US
dc.type (資料類型) articleen