東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Efficient mining and maintenance of ...

Song, Yu.

FindBook

Google Book

Amazon

博客來

Efficient mining and maintenance of association rules in large datasets.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Efficient mining and maintenance of association rules in large datasets./
作者:	Song, Yu.
面頁冊數:	88 p.
附註:	Source: Masters Abstracts International, Volume: 44-01, page: 0409.
Contained By:	Masters Abstracts International44-01.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR04450
ISBN:	9780494044506

Efficient mining and maintenance of association rules in large datasets.
Song, Yu.

Efficient mining and maintenance of association rules in large datasets. - 88 p.

Source: Masters Abstracts International, Volume: 44-01, page: 0409.

Thesis (M.Comp.Sc.)--Concordia University (Canada), 2005.

Data mining is the exploration and analysis of large quantities of data to discover meaningful patterns and rules. Mining frequent itemsets plays an essential role in many data mining tasks, which attempts to find interesting associations or correlations among a large set of data items. Efficient discovery of frequent large itemsets and its dual problem of mining association rules are well studied and efficient solution techniques have been developed and deployed in data analysis and mining tools. When new transactions are added to the dataset, it is important to maintain such discovered patterns and rules without requiring processing the whole dataset and re-computing from scratch.

ISBN: 9780494044506Subjects--Topical Terms:

626642
Computer Science.

Efficient mining and maintenance of association rules in large datasets.
LDR:02011nmm 2200253 4500 001 1821687
005 20061113090130.5
008 130610s2005 eng d
020 $a 9780494044506
035 $a (UnM)AAIMR04450
035 $a AAIMR04450
040 $a UnM $c UnM
100 1 $a Song, Yu. $3 1910854
245 1 0 $a Efficient mining and maintenance of association rules in large datasets.
300 $a 88 p.
500 $a Source: Masters Abstracts International, Volume: 44-01, page: 0409.
502 $a Thesis (M.Comp.Sc.)--Concordia University (Canada), 2005.
520 $a Data mining is the exploration and analysis of large quantities of data to discover meaningful patterns and rules. Mining frequent itemsets plays an essential role in many data mining tasks, which attempts to find interesting associations or correlations among a large set of data items. Efficient discovery of frequent large itemsets and its dual problem of mining association rules are well studied and efficient solution techniques have been developed and deployed in data analysis and mining tools. When new transactions are added to the dataset, it is important to maintain such discovered patterns and rules without requiring processing the whole dataset and re-computing from scratch.
520 $a In this research, we first focus on the maintenance problem and propose an in-memory technique to identify frequent large itemsets when the data set grows by addition of new transactions. The basic solution idea is to identify and use negative borders for maintenance. We then use this idea and develop a divide-and-conquer technique, based on partitioning , to compute frequent itemsets in large datasets, which do not fit into the main memory. Our experimental results show that the proposed techniques are efficient and scalable.
590 $a School code: 0228.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a Concordia University (Canada). $3 1018569
773 0 $t Masters Abstracts International $g 44-01.
790 $a 0228
791 $a M.Comp.Sc.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=MR04450