| dc.contributor | 資管系 | |
| dc.creator (作者) | Kuo, Chan-Sheng | |
| dc.date (日期) | 2001 | |
| dc.date.accessioned | 10-Dec-2015 18:09:00 (UTC+8) | - |
| dc.date.available | 10-Dec-2015 18:09:00 (UTC+8) | - |
| dc.date.issued (上傳時間) | 10-Dec-2015 18:09:00 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/79642 | - |
| dc.description.abstract (摘要) | Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most conventional data-mining algorithms identify the relationships among transactions using binary values. Transactions with quantitative values are however commonly seen in real-world applications. We proposed a fuzzy mining algorithm by which each attribute used only the linguistic term with the maximum cardinality int he mining process. The number of items was thus the same as that of the original attributes, making the processing time reduced. The fuzzy association rules derived in this way are not complete. This paper thus modifies it and proposes a new fuzzy data-mining algorithm for extrating interesting knowledge from transactions stored as quantitative values. The proposed algorithm can derive a more complete set of rules but with more computation time than the method proposed. Trade-off thus exists between the computation time and the completeness of rules. Choosing an appropriate learning method thus depends on the requirement of the application domains. | |
| dc.format.extent | 2320181 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , Volume 09, Issue 05, October 2001 | |
| dc.title (題名) | TRADE-OFF BETWEEN COMPUTATION TIME AND NUMBER OF RULES FOR FUZZY MINING FROM QUANTITATIVE DATA | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1142/S0218488501001071 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1142/S0218488501001071 | |
