東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Criterion functions for document clu...

Zhao, Ying.

FindBook

Google Book

Amazon

博客來

Criterion functions for document clustering.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Criterion functions for document clustering./
作者:	Zhao, Ying.
面頁冊數:	100 p.
附註:	Source: Dissertation Abstracts International, Volume: 66-06, Section: B, page: 3249.
Contained By:	Dissertation Abstracts International66-06B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3180039
ISBN:	9780542203183

Criterion functions for document clustering.
Zhao, Ying.

Criterion functions for document clustering. - 100 p.

Source: Dissertation Abstracts International, Volume: 66-06, Section: B, page: 3249.

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

Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In this thesis, we focus on a class of clustering algorithms that treat the clustering problem as an optimization process which seeks to maximize or minimize a particular clustering criterion function defined over the entire clustering solution.

ISBN: 9780542203183Subjects--Topical Terms:

626642
Computer Science.

Criterion functions for document clustering.
LDR:03426nmm 2200313 4500 001 1825867
005 20061211073550.5
008 130610s2005 eng d
020 $a 9780542203183
035 $a (UnM)AAI3180039
035 $a AAI3180039
040 $a UnM $c UnM
100 1 $a Zhao, Ying. $3 1043919
245 1 0 $a Criterion functions for document clustering.
300 $a 100 p.
500 $a Source: Dissertation Abstracts International, Volume: 66-06, Section: B, page: 3249.
500 $a Advisers: George Karypis; Ding-Zhu Du.
502 $a Thesis (Ph.D.)--University of Minnesota, 2005.
520 $a Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In this thesis, we focus on a class of clustering algorithms that treat the clustering problem as an optimization process which seeks to maximize or minimize a particular clustering criterion function defined over the entire clustering solution.
520 $a In this thesis, we present a comprehensive study on desirable characteristics and feasibility of various criterion functions under different clustering requirements raised by real world applications. In particular, we focus on seven global criterion functions for clustering large documents datasets, three of which are introduced by us.
520 $a The first part of this thesis consists of a detailed experimental evaluation using 15 different datasets and three different partitional clustering approaches, followed by a theoretical analysis of the characteristics of the various criterion functions. Our analysis shows that the criterion functions that are more robust to the difference of cluster tightness and produce more balanced clusters tend to perform well. Our three new criterion functions are among the ones achieving the best overall results.
520 $a We further discuss how the various criterion functions perform to produce hierarchical and soft clustering solutions. We present a comprehensive experimental evaluation of six partitional and nine agglomerative hierarchical clustering methods using twelve datasets. A new class of agglomerative algorithms, constrained agglomerative algorithm, is also proposed and achieves the best results. We also focus on four criterion functions, derive their soft-clustering extensions, present a comprehensive experimental evaluation involving twelve different datasets, and analyze their overall characteristics. Finally, we extend the various criterion functions to incorporate prior knowledge on natural topics existing in datasets. Specifically, we define the problem of topic-driven clustering, which organizes a document collection according to a given set of topics. We propose three topic-driven schemes that consider the similarity between documents and topics and the relationship among documents themselves simultaneously. Our experimental results show that the proposed topic-driven schemes are efficient and effective with topic prototypes of different levels of specificity.
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 66-06B.
790 1 0 $a Karypis, George, $e advisor
790 1 0 $a Du, Ding-Zhu, $e advisor
790 $a 0130
791 $a Ph.D.
792 $a 2005
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3180039