東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Discovery of indirect association an...

Tan, Pang-Ning.

FindBook

Google Book

Amazon

博客來

Discovery of indirect association and its applications.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Discovery of indirect association and its applications./
作者:	Tan, Pang-Ning.
面頁冊數:	95 p.
附註:	Advisers: Jaideep Srivastava; Vipin Kumar.
Contained By:	Dissertation Abstracts International63-06B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3056359
ISBN:	0493712615

Discovery of indirect association and its applications.
Tan, Pang-Ning.

Discovery of indirect association and its applications. - 95 p.

Advisers: Jaideep Srivastava; Vipin Kumar.

Thesis (Ph.D.)--University of Minnesota, 2002.

Data mining has become an essential data analysis tool as it provides an automated procedure for the rapid discovery of novel but implicit knowledge in large databases. One of the main techniques in data mining is <italic> association pattern discovery</italic>, which attempts to find items that occur together relatively frequently in the data. This technique has been successfully applied to various application domains including business decision support, telecommunication alarm diagnosis, and molecular genomics.

ISBN: 0493712615Subjects--Topical Terms:

626642
Computer Science.

Discovery of indirect association and its applications.
LDR:03406nam 2200313 a 45 001 936761
005 20110510
008 110510s2002 eng d
020 $a 0493712615
035 $a (UnM)AAI3056359
035 $a AAI3056359
040 $a UnM $c UnM
100 1 $a Tan, Pang-Ning. $3 603698
245 1 0 $a Discovery of indirect association and its applications.
300 $a 95 p.
500 $a Advisers: Jaideep Srivastava; Vipin Kumar.
500 $a Source: Dissertation Abstracts International, Volume: 63-06, Section: B, page: 2906.
502 $a Thesis (Ph.D.)--University of Minnesota, 2002.
520 $a Data mining has become an essential data analysis tool as it provides an automated procedure for the rapid discovery of novel but implicit knowledge in large databases. One of the main techniques in data mining is <italic> association pattern discovery</italic>, which attempts to find items that occur together relatively frequently in the data. This technique has been successfully applied to various application domains including business decision support, telecommunication alarm diagnosis, and molecular genomics.
520 $a As the current association pattern discovery algorithms are focused towards finding frequent patterns, they fail to capture other forms of interesting multivariate relationships such as negative associations, which are equally valuable in many application domains. For instance, negative associations characterize the dependence relationships between competing products such as Huggies and Pampers, or the opposite outcomes of related events in an event sequence database such as FIRE_ALARM=ON but FIRE_SPRINKLER=OFF. Mining negative associations is a computationally expensive problem, especially for sparse transaction data, where a large percentage of the extracted patterns have low interest values.
520 $a This thesis introduces a new type of pattern called indirect association, which provides an effective way to discover interesting negative associations by extracting only “infrequent patterns that are expected to be frequent.” An efficient, level-wise algorithm for mining indirect associations is presented to address the computational issue. The second part of this thesis extends the concept of indirect association to sequential data. Sequential indirect association has been successfully applied to Web usage data to discover groups of Web users who share a similar browsing behavior.
520 $a Finally, every association pattern discovery task requires a metric to evaluate the interestingness of the discovered patterns. While many such metrics have been proposed in the data mining literature, the metric that is most consistent with the expectations of domain experts is rarely known. This dissertation provides an in-depth study of how to select the most appropriate metric for a given application. The results of this study will have an impact on association pattern discovery and all other data mining tasks that require the use of an objective measure for preprocessing, post-processing or within the mining algorithm itself.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Minnesota. $3 676231
773 0 $t Dissertation Abstracts International $g 63-06B.
790 $a 0130
790 1 0 $a Kumar, Vipin, $e advisor
790 1 0 $a Srivastava, Jaideep, $e advisor
791 $a Ph.D.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3056359