|Title:||Knowledge discovery by spatial clustering rule mining|
|Subject:||Hong Kong Polytechnic University -- Dissertations.|
Spatial data infrastructures.
Geographic information systems.
|Department:||Department of Land Surveying and Geo-Informatics|
|Pages:||iv, 65 leaves : ill. ; 30 cm.|
|Abstract:||In recent years, with the development of data collection technique, data can be obtained form satellite image, X-ray crystallography, and so on. Data is now exploding. We are drowning in information, but starving for knowledge. Spatial data mining is proposed for the knowledge discovery for large data sets. Clustering as one of the major ramification of spatial data mining is in an important status. Clustering has been recognized as a primary data mining method for knowledge discovery in spatial databases. Clustering analysis is widely considered as one of the most important tasks in different research areas. In this paper, a general review of spatial data mining is done first. Second, different representative algorithms of different categories are introduced separately. The general principle, the basic characters, the advantages and the disadvantages of each algorithm are also introduced. At last, a general comparison of these algorithms is done; we also recommend the further directions of clustering algorithms.|
|Rights:||All rights reserved|
Files in This Item:
|b21167874.pdf||For All Users (off-campus access for PolyU Staff & Students only)||5.93 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: