東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Mining complex databases using the E...

Ordonez, Carlos.

FindBook

Google Book

Amazon

博客來

Mining complex databases using the EM algorithm.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Mining complex databases using the EM algorithm./
作者:	Ordonez, Carlos.
面頁冊數:	166 p.
附註:	Director: Edward Omiecinski.
Contained By:	Dissertation Abstracts International61-11B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9994440
ISBN:	0493014241

Mining complex databases using the EM algorithm.
Ordonez, Carlos.

Mining complex databases using the EM algorithm. - 166 p.

Director: Edward Omiecinski.

Thesis (Ph.D.)--Georgia Institute of Technology, 2000.

This thesis focused on developing efficient data mining algorithms based on the Expectation-Maximization (EM) algorithm. The EM algorithm is a general numerical optimization method that solves many important statistical problems. In particular it can be used to perform clustering, and that is the aspect this work concentrated on. An algorithm to mine association rules from a collection of images segmented by EM was introduced. Experiments with synthetic images show the algorithm is reasonably accurate and fast. Then the problem of programming EM inside a relational DBMS was studied. Three efficient ways to implement the EM algorithm in the SQL language and important improvements were proposed. Then this work studied the general problem of clustering large data sets with high dimensionality. A fast and robust EM clustering algorithm was proposed for that purpose. This algorithm incorporates tunable initialization, sufficient statistics, cluster splitting, outlier handling and regularization techniques. Experimental evaluation shows the algorithm is fast and accurate. Finally, this thesis proved association rule mining can be solved as a clustering problem. The fast clustering algorithm was customized to build a statistical model for association rules. This model allows efficient approximate mining of association rules. The EM algorithm has had a proven success and it is still an active research topic in the Statistics and Machine Learning communities. It will be more widely used for Data Mining applications as it is better understood and optimized by database researchers. This work is a step in that direction.

ISBN: 0493014241Subjects--Topical Terms:

626642
Computer Science.

Mining complex databases using the EM algorithm.
LDR:02500nam 2200277 a 45 001 929311
005 20110427
008 110427s2000 eng d
020 $a 0493014241
035 $a (UnM)AAI9994440
035 $a AAI9994440
040 $a UnM $c UnM
100 1 $a Ordonez, Carlos. $3 1252795
245 1 0 $a Mining complex databases using the EM algorithm.
300 $a 166 p.
500 $a Director: Edward Omiecinski.
500 $a Source: Dissertation Abstracts International, Volume: 61-11, Section: B, page: 5966.
502 $a Thesis (Ph.D.)--Georgia Institute of Technology, 2000.
520 $a This thesis focused on developing efficient data mining algorithms based on the Expectation-Maximization (EM) algorithm. The EM algorithm is a general numerical optimization method that solves many important statistical problems. In particular it can be used to perform clustering, and that is the aspect this work concentrated on. An algorithm to mine association rules from a collection of images segmented by EM was introduced. Experiments with synthetic images show the algorithm is reasonably accurate and fast. Then the problem of programming EM inside a relational DBMS was studied. Three efficient ways to implement the EM algorithm in the SQL language and important improvements were proposed. Then this work studied the general problem of clustering large data sets with high dimensionality. A fast and robust EM clustering algorithm was proposed for that purpose. This algorithm incorporates tunable initialization, sufficient statistics, cluster splitting, outlier handling and regularization techniques. Experimental evaluation shows the algorithm is fast and accurate. Finally, this thesis proved association rule mining can be solved as a clustering problem. The fast clustering algorithm was customized to build a statistical model for association rules. This model allows efficient approximate mining of association rules. The EM algorithm has had a proven success and it is still an active research topic in the Statistics and Machine Learning communities. It will be more widely used for Data Mining applications as it is better understood and optimized by database researchers. This work is a step in that direction.
590 $a School code: 0078.
650 4 $a Computer Science. $3 626642
650 4 $a Statistics. $3 517247
690 $a 0463
690 $a 0984
710 2 0 $a Georgia Institute of Technology. $3 696730
773 0 $t Dissertation Abstracts International $g 61-11B.
790 $a 0078
790 1 0 $a Omiecinski, Edward, $e advisor
791 $a Ph.D.
792 $a 2000
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=9994440