東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Enhanced PL-WAP tree method for incr...

Chen, Min.

Linked to FindBook

Google Book

Amazon

博客來

Enhanced PL-WAP tree method for incremental mining of sequential patterns.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Enhanced PL-WAP tree method for incremental mining of sequential patterns./
Author:	Chen, Min.
Description:	128 p.
Notes:	Source: Masters Abstracts International, Volume: 42-03, page: 0959.
Contained By:	Masters Abstracts International42-03.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ84552
ISBN:	0612845524

Enhanced PL-WAP tree method for incremental mining of sequential patterns.
Chen, Min.

Enhanced PL-WAP tree method for incremental mining of sequential patterns. - 128 p.

Source: Masters Abstracts International, Volume: 42-03, page: 0959.

Thesis (M.Sc.)--University of Windsor (Canada), 2003.

Sequential mining as web usage mining has been used in improving web site design, increasing volume of e-business and providing marketing decision support.

ISBN: 0612845524Subjects--Topical Terms:

626642
Computer Science.

Enhanced PL-WAP tree method for incremental mining of sequential patterns.
LDR:01834nmm 2200277 4500 001 1861469
005 20041111121802.5
008 130614s2003 eng d
020 $a 0612845524
035 $a (UnM)AAIMQ84552
035 $a AAIMQ84552
040 $a UnM $c UnM
100 1 $a Chen, Min. $3 704385
245 1 0 $a Enhanced PL-WAP tree method for incremental mining of sequential patterns.
300 $a 128 p.
500 $a Source: Masters Abstracts International, Volume: 42-03, page: 0959.
500 $a Adviser: Christie Ezeife.
502 $a Thesis (M.Sc.)--University of Windsor (Canada), 2003.
520 $a Sequential mining as web usage mining has been used in improving web site design, increasing volume of e-business and providing marketing decision support.
520 $a This thesis proposes PL4UP and EPL4UP algorithms which use the PLWAP tree structure to incrementally update sequential patterns. PL4UP does not scan old DB except when previous small 1-itemsets become large in updated database during which time its scans only all transactions in the old database that contain any small itemsets. EPL4UP rebuilds the old PLWAP tree using only the list of previous small itemsets once rather than scanning the entire old database twice like original PLWAP. PL4UP and EPL4UP first update old frequent patterns on the small PLWAP tree built for only the incremented part of the database, then they compare new added patterns generated from the small tree with the old frequent patterns to reduce the number of patterns to be checked on the old PLWAP tree. (Abstract shortened by UMI.)
590 $a School code: 0115.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Windsor (Canada). $3 1018526
773 0 $t Masters Abstracts International $g 42-03.
790 1 0 $a Ezeife, Christie, $e advisor
790 $a 0115
791 $a M.Sc.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MQ84552