大葉大學圖書館 |

Polygonal spatial clustering.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
書名/作者:	Polygonal spatial clustering.
作者:	Joshi, Deepti.
面頁冊數:	215 p.
附註:	Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: 3528.
Contained By:	Dissertation Abstracts International72-06B.
標題:	Geodesy.
標題:	Computer Science.
ISBN:	9781124568942
摘要、提要註:	Clustering, the process of grouping together similar objects, is a fundamental task in data mining to help perform knowledge discovery in large datasets. With the growing number of sensor networks, geospatial satellites, global positioning devices, and human networks tremendous amounts of spatio-temporal data that measure the state of the planet Earth are being collected every day. This large amount of spatio-temporal data has increased the need for efficient spatial data mining techniques. Furthermore, most of the anthropogenic objects in space are represented using polygons, for example - counties, census tracts, and watersheds. Therefore, it is important to develop data mining techniques specifically addressed to mining polygonal data. In this research we focus on clustering geospatial polygons with fixed space and time coordinates.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3449543

Polygonal spatial clustering.
Joshi, Deepti.

Polygonal spatial clustering. - 215 p.

Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: 3528.

Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2011.

Clustering, the process of grouping together similar objects, is a fundamental task in data mining to help perform knowledge discovery in large datasets. With the growing number of sensor networks, geospatial satellites, global positioning devices, and human networks tremendous amounts of spatio-temporal data that measure the state of the planet Earth are being collected every day. This large amount of spatio-temporal data has increased the need for efficient spatial data mining techniques. Furthermore, most of the anthropogenic objects in space are represented using polygons, for example - counties, census tracts, and watersheds. Therefore, it is important to develop data mining techniques specifically addressed to mining polygonal data. In this research we focus on clustering geospatial polygons with fixed space and time coordinates.

ISBN: 9781124568942Subjects--Topical Terms:

475200
Geodesy.

Polygonal spatial clustering.
LDR:03273nam 2200337 4500 001 365225
005 20120516132918.5
008 121018s2011 ||||||||||||||||| ||eng d
020 $a 9781124568942
035 $a (UMI)AAI3449543
035 $a AAI3449543
040 $a UMI $c UMI
100 1 $a Joshi, Deepti. $3 475198
245 1 0 $a Polygonal spatial clustering.
300 $a 215 p.
500 $a Source: Dissertation Abstracts International, Volume: 72-06, Section: B, page: 3528.
500 $a Advisers: Ashok K. Samal; Leen-Kiat Soh.
502 $a Thesis (Ph.D.)--The University of Nebraska - Lincoln, 2011.
520 $a Clustering, the process of grouping together similar objects, is a fundamental task in data mining to help perform knowledge discovery in large datasets. With the growing number of sensor networks, geospatial satellites, global positioning devices, and human networks tremendous amounts of spatio-temporal data that measure the state of the planet Earth are being collected every day. This large amount of spatio-temporal data has increased the need for efficient spatial data mining techniques. Furthermore, most of the anthropogenic objects in space are represented using polygons, for example - counties, census tracts, and watersheds. Therefore, it is important to develop data mining techniques specifically addressed to mining polygonal data. In this research we focus on clustering geospatial polygons with fixed space and time coordinates.
520 $a Polygonal datasets are more complex than point datasets because polygons have topological and directional properties that are not relevant to points, thus rendering most state-of-the-art point-based clustering techniques not readily applicable. We have addressed four important sub-problems in polygonal clustering. (1) We have developed a dissimilarity function that integrates both non-spatial attributes and spatial structure and context of the polygons. (2) We have extended DBSCAN, the state-of-the-art density based clustering algorithm for point datasets, to polygonal datasets and further extended it to handle polygonal obstacles. (3) We have designed a suite of algorithms that incorporate user-defined constraints in the clustering process. (4) We have developed a spatio-temporal polygonal clustering algorithm that uniquely treats both space and time as first-class citizens, and developed an algorithm to analyze the movement patterns in the spatio-temporal polygonal clusters. In order to evaluate our algorithms we applied our algorithms on real-life datasets from several diverse domains to solve practical problems such as congressional redistricting, spatial epidemiology, crime mapping, and drought analysis. The results show that our algorithms are effective in finding spatially compact and conceptually coherent clusters.
590 $a School code: 0138.
650 4 $a Geodesy. $3 475200
650 4 $a Computer Science. $3 423143
690 $a 0370
690 $a 0984
710 2 $a The University of Nebraska - Lincoln. $b Computer Science. $3 475199
773 0 $t Dissertation Abstracts International $g 72-06B.
790 1 0 $a Samal, Ashok K., $e advisor
790 1 0 $a Soh, Leen-Kiat, $e advisor
790 1 0 $a Revesz, Peter Z. $e committee member
790 1 0 $a Marx, David B. $e committee member
790 1 0 $a Chen, Xun-Hong $e committee member
790 $a 0138
791 $a Ph.D.
792 $a 2011
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3449543