東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

The use of tree-based data structure...

Li, Yu.

FindBook

Google Book

Amazon

博客來

The use of tree-based data structure in association mining.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	The use of tree-based data structure in association mining./
作者:	Li, Yu.
面頁冊數:	185 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2159.
Contained By:	Dissertation Abstracts International66-04B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3171218
ISBN:	9780542075629

The use of tree-based data structure in association mining.
Li, Yu.

The use of tree-based data structure in association mining. - 185 p.

Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2159.

Thesis (Ph.D.)--University of Miami, 2005.

Data Mining is the process of discovering valuable information from large databases. One popular sub-field of data mining is the area of association mining that studies algorithms capable of discovering frequently co-occurring groups of items in transaction databases. Answering targeted query refers to constrain the search to those association rules that contain certain user-specified items. One recent approach proposed a mechanism that converts the database into a data structure called an itemset tree (IT-tree) that facilitates speedy processing of such queries.

ISBN: 9780542075629Subjects--Topical Terms:

626642
Computer Science.

The use of tree-based data structure in association mining.
LDR:03296nmm 2200289 4500 001 1829633
005 20070201101133.5
008 130610s2005 eng d
020 $a 9780542075629
035 $a (UnM)AAI3171218
035 $a AAI3171218
040 $a UnM $c UnM
100 1 $a Li, Yu. $3 1263331
245 1 4 $a The use of tree-based data structure in association mining.
300 $a 185 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-04, Section: B, page: 2159.
500 $a Supervisor: Miroslav Kubat.
502 $a Thesis (Ph.D.)--University of Miami, 2005.
520 $a Data Mining is the process of discovering valuable information from large databases. One popular sub-field of data mining is the area of association mining that studies algorithms capable of discovering frequently co-occurring groups of items in transaction databases. Answering targeted query refers to constrain the search to those association rules that contain certain user-specified items. One recent approach proposed a mechanism that converts the database into a data structure called an itemset tree (IT-tree) that facilitates speedy processing of such queries.
520 $a This dissertation addresses several research questions related to the IT-tree framework. The main goal is to improve IT-tree approach for the need of association mining.
520 $a First, we extend the IT-tree to general query answering rectifying its major deficiency. The theoretical analysis and experimental results show that proposed IT-Mining algorithm is very efficient and scales roughly linear with the size of the database. It outperforms another tree-based algorithm, DepthProject, for mining long frequent itemsets with high pair-wise overlaps. Second, we propose TF-Mining algorithm to achieve significant reduction in processing time for answering targeted queries. TF-Mining runs faster than the original methods by two orders of magnitude. Third, we compare the IT-tree approach to similar tree-structure approaches, [AAP1999] and [HPY2000]. We introduce targeted query concept into these two approaches by proposing AAP-QueriedMining and FP-QueriedMining algorithms respectively. Experimental results indicate that IT-tree has distinct advantages when querying with variant minimum support while the other two are better when queried minimum support is fixed. Fourth, we explore the effect of pruning heuristics designed for further speeding up query processing. Our research show that as long as the user is interested only in itemsets with very low supports, the size of the tree and the costs of query processing can be significantly reduced at the small price of missing acceptable percentage of frequent itemsets. Finally we extend the IT-tree paradigm to another type of specialized query, item constraints. The proposed IC-Mining is very efficient and scalable with the size of the database. The performance analysis demonstrates that IC-Mining would outperform another similar approach, Direct algorithm, in very large databases.
590 $a School code: 0125.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Miami. $3 1017483
773 0 $t Dissertation Abstracts International $g 66-04B.
790 1 0 $a Kubat, Miroslav, $e advisor
790 $a 0125
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3171218