東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Association rule mining and quantita...

Zhou, Ling.

FindBook

Google Book

Amazon

博客來

Association rule mining and quantitative association rule mining among infrequent items.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Association rule mining and quantitative association rule mining among infrequent items./
作者:	Zhou, Ling.
面頁冊數:	63 p.
附註:	Adviser: Stephen Yau.
Contained By:	Dissertation Abstracts International68-07B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3274161
ISBN:	9780549148593

Association rule mining and quantitative association rule mining among infrequent items.
Zhou, Ling.

Association rule mining and quantitative association rule mining among infrequent items. - 63 p.

Adviser: Stephen Yau.

Thesis (Ph.D.)--University of Illinois at Chicago, 2007.

This thesis presents some exploration in the field of data mining. Data mining is popularly referred to as knowledge discovery in databases (KDD), and is the automated or convenient extraction of patterns representing knowledge implicitly stored in databases, data warehouses, and other massive information repositories. This thesis explores association rule and quantitative association rule mining among infrequent items in the field of data mining.

ISBN: 9780549148593Subjects--Topical Terms:

626642
Computer Science.

Association rule mining and quantitative association rule mining among infrequent items.
LDR:02538nam 2200289 a 45 001 963621
005 20110831
008 110831s2007 ||||||||||||||||| ||eng d
020 $a 9780549148593
035 $a (UMI)AAI3274161
035 $a AAI3274161
040 $a UMI $c UMI
100 1 $a Zhou, Ling. $3 1286683
245 1 0 $a Association rule mining and quantitative association rule mining among infrequent items.
300 $a 63 p.
500 $a Adviser: Stephen Yau.
500 $a Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4617.
502 $a Thesis (Ph.D.)--University of Illinois at Chicago, 2007.
520 $a This thesis presents some exploration in the field of data mining. Data mining is popularly referred to as knowledge discovery in databases (KDD), and is the automated or convenient extraction of patterns representing knowledge implicitly stored in databases, data warehouses, and other massive information repositories. This thesis explores association rule and quantitative association rule mining among infrequent items in the field of data mining.
520 $a Association rule mining, playing a critical role in the field of data mining, searches for interesting relationships among items in a given data set. Association rule mining among frequent items has been extensively studied in data mining research. However, in the recent years, there is an increasing demand of mining the infrequent items (such as rare but expensive items). Since exploring interesting relationship among infrequent items has not been discussed much in the literature, in this thesis, we propose two practical and effective schemes, Matrix-Based Scheme and Hash-Based Scheme, to mine association rules among rare items. These two methods can also be applied to efficiently capture interesting association patterns among frequent items with bounded length. Experiments are conducted to test behaviors of our algorithms.
520 $a Quantitative association rule mining has been mainly studied in relational database. In this thesis, we explore quantitative association rule mining in relational database among infrequent items. We reanalyze association rules with quantity incorporated. Experiments are drawn to illustrate the more interesting and informative rules captured.
590 $a School code: 0799.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a University of Illinois at Chicago. $3 1020478
773 0 $t Dissertation Abstracts International $g 68-07B.
790 $a 0799
790 1 0 $a Yau, Stephen, $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3274161