Language:
繁體中文
English
日文
說明(常見問題)
南開科技大學
圖書館首頁
編目中圖書申請
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Comprehensive density-based cluster ...
~
North Dakota State University.
Comprehensive density-based cluster analysis.
紀錄類型:
書目-電子資源 : 單行本
正題名/作者:
Comprehensive density-based cluster analysis./
作者:
Wang, Baoying (Elizabeth).
面頁冊數:
99 p.
附註:
Source: Dissertation Abstracts International, Volume: 66-07, Section: B, page: 3809.
Contained By:
Dissertation Abstracts International66-07B.
標題:
Computer Science. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3181832
ISBN:
9780542226663
Comprehensive density-based cluster analysis.
Wang, Baoying (Elizabeth).
Comprehensive density-based cluster analysis.
- 99 p.
Source: Dissertation Abstracts International, Volume: 66-07, Section: B, page: 3809.
Thesis (Ph.D.)--North Dakota State University, 2005.
Clustering is one of the primary techniques in data mining. Clustering in data mining is a discovery process that partitions the data set into groups such that data points within a group have high similarity in comparison to one another but are very dissimilar to points in other groups. Clustering has the following several challenges: (1) clusters with arbitrary shapes, (2) minimal domain knowledge to determine the input parameters, and (3) scalability for large data sets.
ISBN: 9780542226663Subjects--Topical Terms:
1000005419
Computer Science.
Comprehensive density-based cluster analysis.
LDR
:01983nmm 2200277 4500
001
1000004721
005
20061114130246.5
008
061114s2005 eng d
020
$a
9780542226663
035
$a
(UnM)AAI3181832
035
$a
AAI3181832
040
$a
UnM
$c
UnM{me_controlnum}
100
1
$a
Wang, Baoying (Elizabeth).
$3
1000005787
245
1 0
$a
Comprehensive density-based cluster analysis.
300
$a
99 p.
500
$a
Source: Dissertation Abstracts International, Volume: 66-07, Section: B, page: 3809.
500
$a
Major Professor: William Perrizo.
502
$a
Thesis (Ph.D.)--North Dakota State University, 2005.
520
$a
Clustering is one of the primary techniques in data mining. Clustering in data mining is a discovery process that partitions the data set into groups such that data points within a group have high similarity in comparison to one another but are very dissimilar to points in other groups. Clustering has the following several challenges: (1) clusters with arbitrary shapes, (2) minimal domain knowledge to determine the input parameters, and (3) scalability for large data sets.
520
$a
Density-based clustering has been recognized as a powerful approach for discovering arbitrary-shape clusters. However, the other two challenges still remain in most existing clustering algorithms. The goal of this dissertation is to explore comprehensive clustering methods to meet the current challenges. We conquer the second challenge by two attempts: (1) to reduce input parameters in the density-based partitioning algorithm and (2) to eliminate input parameters by means of hierarchical clustering. We meet the third challenge by improving the speed by means of the vertical P-tree structures and pruning techniques.
590
$a
School code: 0157.
650
4
$a
Computer Science.
$3
1000005419
690
$a
0984
710
2 0
$a
North Dakota State University.
$3
1000005788
773
0
$t
Dissertation Abstracts International
$g
66-07B.
790
1 0
$a
Perrizo, William,
$e
advisor
790
$a
0157
791
$a
Ph.D.
792
$a
2005
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3181832
$z
0 筆讀者評論
館藏地:
全部
線上資料庫
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約人數
備註欄
附件
OE0000696
線上資料庫
線上資源
線上電子書
OE
一般(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
建立或儲存個人書籤
書目轉出
取書館別
處理中
...
變更密碼
登入