| A rough association rule is applicable for knowledge | |
|---|---|
| 學年 | 98 |
| 學期 | 1 |
| 發表日期 | 2009-11-01 |
| 作品名稱 | A rough association rule is applicable for knowledge |
| 作品名稱（其他語言） | |
| 著者 | Liao, S. H.; Chen, Y. |
| 作品所屬單位 | 淡江大學管理科學學系 |
| 出版者 | |
| 會議名稱 | Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on |
| 會議地點 | ShangHai, China |
| 摘要 | The traditional association rule which should be fixed in order to avoid both that only trivial rules are retained and also that interesting rules are not discarded. In fact, the situations which use the relative comparison to express are more complete than to use the absolute comparison. Through relative comparison we proposes a new approach for mining association rule, which has the ability to handle the uncertainty in the classing process, so that we can reduce information loss and enhance the result of data mining. In this paper, the new approach can be applied in find association rules, which has the ability to handle the uncertainty in the classing process and suitable for all data types. |
| 關鍵字 | Association rule;Data mining;Electronic commerce;Rough set |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | |
| 研討會時間 | |
| 通訊作者 | |
| 國別 | CHN |
| 公開徵稿 | Y |
| 出版型式 | |
| 出處 | Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on, pp.557-561 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/92001 ) |
GoogleAnalytics