漁船監控系統(Vessel Monitoring System; VMS)對於船隻的監控、管制與偵察(Monitoring, Control and Surveillance; MCS)是一項很有用的工具，它能夠幫助海岸巡防單位更有效率的執行海岸巡邏工作。當各國、各區域漁業管理組織廣泛應用VMS，有越來越多的研究與應用集中在挖掘VMS的資料庫，以從VMS資料庫中挖掘出更多更有用的資訊，並運用這些資訊增進VMS的效益與實用性，我們稱之為資料探勘。在文中，會特別介紹資料探勘中的群聚技術演算法。
本篇論文最初的目的是為了找出在方圓3海浬範圍內，至少包含3艘船隻的船隻密集區域，為達此目的，我們使用了資料探勘中，以密度為基礎的群聚演算法－DBSCAN(Density Based Spatial Clustering of Applications with Noise) [1]。研究並發展DBSCAN應用於台灣的船隻VMS，以找出船隻的密集區域。論文中，我們探討了DBSCAN群聚分類所需花費的時間成本與分類的準確性，並嘗試使用不同的方法改進DBSCAN群聚分類效能以及解決問題的整體準確性，如估測船隻的即時位置、使用切割資料表或建立鄰近點資料表等。最後，並利用密集區域偵測系統所得的結果，應用於非法運搬船與平行船隻問題的偵測上，並討論判別出運搬船與平行船隻的準確性與實用性。

Fishing Vessel Monitoring System (VMS) is an effective tool of fisheries monitoring, control and surveillance measures to counter over-fishing. It can also help the coast guard to safeguard vessels more efficiently. As VMS is widely implemented, more and more efforts focus on mining the VMS database to discover knowledge and clues that would further enhance the benefits. This thesis is focused on data mining VMS database with clustering technology developed for and implemented into the VMS of Taiwan. The initial request form the Fisheries Administration was to constantly identify wherever there are at least three fishing vessels within 3 nautical miles of range. The proposed solution was based on DBSCAN [1] clustering algorithm. The performances in accuracy and run-time were evaluated and improved with vessel position prediction, partitioning of datasets, data structure and algorithm design. With the promising results, this solution has been recognized by the fisheries management and VMS operation experts to be of many extended use in VMS.
Finally, this Density Area Detection System was applied to the detection of at-sea transshipment and parallel-track vessels. Then, the performance in accuracy and practicability would be discussed.

誌謝 I
摘要 III
ABSTRACT IV
目錄 V
圖目錄 VIII
表目錄 X
第一章 緒論 - 1 -
1.1 研究背景 - 1 -
1.2 研究動機 - 3 -
1.3 論文架構 - 4 -
第二章 研究方法與文獻回顧 - 6 -
2.1 文獻回顧 - 6 -
2.2 群聚技術演算法 - 7 -
2.2.1 切割式群聚演算法 - 7 -
2.2.2 格子基礎群聚演算法 - 9 -
2.2.3 密度基礎群聚演算法 - 11 -
2.3 文獻探討 - 14 -
2.4 研究方法 - 17 -
第三章 目標資料庫分析與模擬 - 21 -
3.1 空間資料庫 - 21 -
3.1.1 沿近海VMS測試資料庫 - 21 -
3.1.2 遠洋VMS測試資料庫 - 23 -
3.1.3 參考比較用的均勻分佈資料庫 - 25 -
3.2 異常之資料篩選偵測 - 27 -
3.3 船位估測 - 29 -
3.3.1 船位估測之需求 - 29 -
3.3.2 船位估測之實作 - 30 -
3.3.3 船位估測的效能 - 32 -
第四章 系統設計、實作與效能改進 - 36 -
4.1 程式實作 - 36 -
4.2 程式效能改進 - 41 -
4.3 群聚分類結果 - 46 -
4.4 整體應用管理系統設計 - 49 -
第五章 延伸應用之評估 - 57 -
5.1 偵測運搬船的應用 - 57 -
5.1.1 偵測運搬船的問題 - 57 -
5.1.2 偵測運搬船的結果 - 60 -
5.2 偵測平行船隻的應用 - 63 -
5.2.1 偵測平行船隻的問題 - 63 -
5.2.2 偵測平行船隻的結果 - 64 -
第六章 結論與未來發展 - 68 -
參考文獻 - 70 -

[1] Ester M., Kriegel H.-P., Sander J., Xu X., “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, 1996, pp. 226-231.
[2] Kardi Teknomo’s Page, K-Mean Clustering Tutorials, http://people.revoledu.com/kardi/tutorial/kMean/index.html
[3] Wang W.,Yang J., Muntz R., “STING: A Statistical Information Grid Approach to Spatial Data Mining”, Proc. of the 23rd VLDB Conf. Athens, Greece, 1997.
[4] 維基百科, http://zh.wikipedia.org/w/index.php?title=%E9%A6%96%E9%A1%B5&variant=zh-tw
[5] Ester M., Kriegel H.-P., Sander J., Wimmer M., Xu X., “Incremental Clustering for Mining in a Data Warehousing Environment”, Proc. of the 24th VLDB Conf., New York, USA, 1998.
[6] Beckmann N., Kriegel H.-P., Schneider R., Seeger B., “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles”, Proc. ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, 1990, pp. 322-331.
[7] Wu Y.-P., Guo J.-J., Zhang X.-J., “A Linear DBSCAN Algorithm Based on LSH”, Proc. of the 6th International Conf. on Machine Learning and Cybernetics, Hong Kong, 19-22 August 2007
[8] Moreira A., Santos M. Y., Cameiro S., “Density-based Clustering Algorithms-DBSCAN and SNN”, University of Minho-Portugal, 2005.
[9] Zhang T., Ramakrishnan R., Livny M., “BIRCH: An Efficient Data Clustering Method for Very Large Databases”, Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 103-114, Montreal, Canada, June 1996.
[10] Ester M., Kriegel H.-P., Sander J., Xu X., “Clustering for Mining in Large Spatial Databases”, Published in Special Issue on Data Mining, KI-Journal, ScienTec Publishing, Vol. 1, 1998.
[11] Ng R. T., Han J., “Efficient and Effective Clustering Methods for Spatial Data Mining”, Proc. 20th Int. Conf. on Very Large Data Bases, pp. 144-155, Santiago, Chile, 1994.
[12] Stonebraker M., Frew J., Gardels K., Meredith J., “The SEQUOIA 2000 Storage Benchmark”, Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, DC, pp. 2-11, 1993.
[13] 林育臣, “群聚技術之研究”, 朝陽科技大學, 資訊管理研究所, 2002.
[14] 中華民國對外漁業合作發展協會, http://www.ofdc.org.tw/INDEX.htm
[15] 張淑淨, “漁船監控政策法規與技術之研究—研究成果報告書”, 行政院農業委員會漁業署, 國立臺灣海洋大學.
[16] MapInfo, http://www.mapinfo.com/
[17] Java, http://www.sun.com/
[18] MySQL 中文參考手冊, http://linux.tnc.edu.tw/techdoc/mysql/mysql_doc/manual_toc.html
[19] MySQL 5.1參考手冊, http://dev.mysql.com/doc/refman/5.1/zh/index.html
[20] 蔡明宗 譯, 陳彥仲 譯, “Java 2 教學手冊—JDK 5版”, �眳p資訊股份有限公司, 2005.
[21] 侯捷 譯, “實戰Java 9個別具特色的實作經驗”, 上奇科技股份有限公司, 2005.
[22] 鄧瑋敦 譯, 博碩文化 譯, “MySQL 5徹底研究”, 博碩文化股份有限公司, 2006.
[23] 良辰資訊工作室, “輕鬆搞定SQL Server 2000程式設計”, 華彩軟體股份有限公司, 2001.