| Summary: | 碩士 === 南台科技大學 === 資訊管理系 === 92 === Along with time fast vicissitude, the former information is not easy the seal society which circulates, gradually transforms the open society which the information explodes. All information could get by information science and technology. For example, the television, broadcast or Internet and so on.But so huge information quantity has surpassed the limit which the people brains can process.Therefore, how to avoid “GIGO (Garbage In Garbage Out)”, needs to depend on the information science and technology to solve. Data Mining is a very good method. The goal is extracts particular and useful information or knowledge of users from huge data. And data mining may divide into very variously, this paper is does take “Sequential Pattern” as the research subject.
Therefore, this paper is proposed a new algorithm-Fast Sequence Decomposition algorithm (bellow all by FSD abbreviation). Its advantage as follows：1. Only scan database a time. 2. Reduces to production the massive candidate sequences. 3. Could use to in Incremental Mining. By above these characteristics, enable the user to obtain the sequence pattern in a shorter time and get the best substantive benefit.Finally, achieved the user and the consumer double win aspect.
Moreover, because the network environment utilization ratio more and more frequent.For example, applied to network auction or network teaching and so on.Therefore this paper focus on teaching website to propose a new algorithm-Fast Learning Sequence Decomposition algorithm (bellow all by FLSD abbreviation).By fast discovers the Learning Sequence as network designer’s reference, then revises the website construction so as to attract more and more people using it. It advantage as follows：1. Only scan database a time. 2. The permission has the repetition travel behavior the occurrence. 3. Using Pattern Mapping to produce candidate learning sequence.By above these characteristics, enables the learning sequence fast to come out by mining and improve performance of algorithm.
|
|---|
