| dc.contributor | 資訊科學系 | zh_Tw |
| dc.creator (作者) | 左瑞麟 | zh_TW |
| dc.creator (作者) | Lin, Chun-Wei | en_US |
| dc.date (日期) | 2014 | en_US |
| dc.date.accessioned | 16-Aug-2017 17:04:05 (UTC+8) | - |
| dc.date.available | 16-Aug-2017 17:04:05 (UTC+8) | - |
| dc.date.issued (上傳時間) | 16-Aug-2017 17:04:05 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/111987 | - |
| dc.description.abstract (摘要) | Mining useful information or knowledge from a very large database to aid managers or decision makers to make appropriate decisions is a critical issue in recent years. In this paper, we adopted the pre-large concepts to the FUSP-tree structure for sequence insertion. A FUSP tree is built in advance to keep the large 1-sequences for later maintenance. The pre-large sequences are also kept to reduce the movement from large to small and vice versa. When the number of inserted sequences is smaller than the safety bound of the pre-large concepts, better results can be obtained by the proposed incremental algorithm for sequence insertion in dynamic databases. © Springer International Publishing Switzerland 2014. | en_US |
| dc.format.extent | 254324 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Advances in Intelligent Systems and Computing, 297, 135-144 | en_US |
| dc.relation (關聯) | 1st Euro-China Conference on Intelligent Data Analysis and Applications, ECC 2014; Shenzhen; China; 13 June 2014 到 15 June 2014; 代碼 116829 | zh_TW |
| dc.subject (關鍵詞) | Pre-large concept; dynamic databases; sequential pattern mining; sequence insertion; FUSP-tree structure | en_US |
| dc.title (題名) | An incremental algorithm for maintaining the built FUSP trees based on the pre-large concepts | en_US |
| dc.type (資料類型) | conference | |
| dc.identifier.doi (DOI) | 10.1007/978-3-319-07776-5_15 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/978-3-319-07776-5_15 | |
