[回到前頁查詢結果 | 重新搜尋]

姓名	劉應翰(Ying-Han Liu)	電子郵件信箱	E-mail 資料不公開
畢業系所	資訊管理學系研究所(Information Management)
畢業學位	碩士(Master)	畢業時期	92學年第2學期
論文名稱(中)	行動群組探勘：以原始軌跡資料為基礎
論文名稱(英)	Mining Mobile Group Patterns: A Trajectory-based Approach
檔案	etd-0730104-102312.pdf 本電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。 請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。	論文使用權限	電子論文：校內公開，校外永不公開
		論文語文/頁數	英文/53
		統計	本論文已被瀏覽 5233 次，被下載 18 次
摘要(中)	近幾年來，隨著行動設備的普及，有越來越多的地理資訊應用軟體被開發出來。因此，各式各樣的物件地理資訊被廣泛的提供。根據物件的移動位置是否接近而將其判別是否為物件群組，是一個新興的研究。現存判別行動群組的方法是以移動物件每一段固定時間所記錄的地理位置為底層資料。然而，移動物件經常會出於自願性的或非自願性的斷線，因此這些每一段固定時間記錄並非一直的適用。在本篇的研究中，我們改以跡軌來描述移動物件的位置，而非固定時間記錄的地理位置。基於這個新模式，我們必須重新定義行動群組問題與發展出有效率的演算法以找出行動群組。並使用IBM City Simulator產生的資料來對所提出的演算法做評估。
摘要(英)	In recent years, with the popularization of the mobile devices, more and more location-based applications have been developed. As a result, location data of various objects is widely available. Identifying object groups that tend to move together is an emerging research topic. Existing approaches for identifying mobile group patterns assume the existence of raw location data which records a given object’s position at every equal-spaced time point. However, a moving object may become disconnected voluntarily or involuntarily from time to time, and thus this assumption may not always valid. In this research, we describe the locations of moving object as a (non-continuous) trajectory function. Based on the new model, we re-define the mobile group mining problem and develop efficient algorithms for mining mobile groups. The proposed algorithms are evaluated via synthetic data generated by IBM City Simulator.
關鍵字(中)	探勘移動群組 移動群組 移動物件 行動資料探勘	關鍵字(英)	mobile data mining group pattern mining mobile group pattern trajectory
論文目次	Chapter 1 Introduction 1 1.1 Background 1 1.2 Motivation 2 1.3 Thesis outline 3 Chapter 2 Literature Review 4 2.1 Group Pattern Mining 4 2.1.1 AGP: Algorithm based on Apriori Property 5 2.1.2 VG-Growth: An Algorithm based on Valid Group Graph Data Structures 6 2.1.3 Evaluation of AGP and VG-growth 8 2.2 Moving object 9 2.2.1 Data Model 9 2.2.2 Query Operations 12 2.2.3 Index 14 Chapter 3 Problem Description 16 3.1 User data model 16 3.2 The group pattern mining problem 18 Chapter 4 Our Approach 21 4.1 Calculate distance between two users 21 4.2 Mining valid group 23 4.3 Algorithm based on Apriori Property 25 4.3.1 Apriori Property 25 4.3.2 ATGP Algorithm 28 4.3.3 TVG Graph and TVG-Growth Algorithm 29 Chapter 5 Performance Evaluation 35 5.1 Synthetic Dataset Generator 35 5.1.1 IBM city simulator 35 5.1.2 Translation to trajectory dataset 37 5.2 Performance of ATGP and TVG-growth 39 5.2.1 Parameter settings 39 5.2.2 Result 40 5.3 Experiments with untraceable data 43 5.3.1 Parameter settings 43 5.3.2 Result 45 Chapter 6 Conclusion 50
參考文獻	[CAA02] H. Chon, D. Agrawal, and A. E. Abbadi, “Query processing for moving objects with space-time grid storage model,” in Proc. Of Int’l. Conf. on Mobile Data Management (MDM2002), 2002. [CAA03] H. D. Chon, D. Agrawal, and A. E. Abbadi, “Fates: finding a time dependent shortest path,” MDM2003. [CHP98] X. Chen and I. Petrounias. “An architecture for temporal data mining.”, in Proc. 9th Int. Conf. and Workshop on Database and Expert Systems Applications, Vienna, Austria,1998.  [FGNS00] L. Forlizzi, R.H. Guting, E. Nardelli, and M. Schneider, “A data model and data structures for moving objects”, In Proc. of the ACM Symposium on PODS, pp.319-330, 2000. [GB00] R. H. Guting, M. H. Bohlen, et, al., “A foundation for representing and querying moving objects,” IN ACM Transactions on Database Systems, 25(1), 2000. [HH04] San-Yih Hwang and Chin-Ming Hwang,”Group pattern mining using trajectory approximate,” master thesis, National Sun Yan-sen University, Department of Information management, Jul. 2004. [KKR95] P. Kanellakis, G. Kuper, and P. Revesz., “Constraint query languages.”, J. Comput. Syst. Sci., 51(1):26-52, 1995. [KMJ01] J. H. Kaufman, J. Myllymaki, and J. Jackson. IBM Almaden Research Center. http://www.alphaworks.ibm.com/tech/citysimulator, November 2, 2001. [MSI02] H. Mokhtar, J. Su, and O.H. Ibarra, “On moving object queries”, Proceedings of the ACM Symposium on PODS, pp.188-198, 2002. [PSK03] Hyun Kyoo Park, Jin Hyun Son, Myoung-Ho Kim: “An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments.” Mobile Data Management 2003, p.78-91 [RJ79] Van Rijsbergen, C. J. (1979). Information Retrieval. 2nd edition, London, Butterworths. [SJLL00] S. Saltenis, C.S. Jensen, S.T. Leutenegger, M. A. Lopez, “Inexing the postions of continuously moving objects,” ACM SIGMOD Conference 2000. [SWCD97] A.P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. “Modeling and querying moving objects.” In Proc, Int. Conf. on Data Engineering, 1997. [SXI01] J. Su, H. Xu, and O. Ibarra, “Moving objects: Logical relationships and queries”, In Proc. Int. Sym. On Spatial and Temporal Database, Pages 3-19, 2001. [Tob79] W. Tobler, “Cellular Geography,” Philosophy in Geography, Eds., S. Gale and G. Olsson., D. Reidel Publishing Company, Holland. [VW01] M. Vazirgiannis and O. Wolfson, “A spatiotemporal model and language for moving objects on road networks”, SSTD 2001, LNCS 2121. [WLH03] Yida Wang, Ee-Peng Lim, and San-Yih Hwang, “On Mining Group Patterns of Mobile Users.” In Proc. Of the 14th International Conference on Database and Expert Systems Applications-DEXA 2003, Prague, Czech Republic, 1-5 Sep 2003. [WLH04] Yida Wang, Ee-Peng Lim, and San-Yih Hwang, “Effective Group Pattern Mining Using Data Summarization,” 9th International Conference on Database Systems for Advanced Application (DASFAA2004), 2004. [Wolf02] Ouri Wolfson, “Moving Objects Information Management: The Database Challenge.” NGITS 2002, p.75-89 [WSCY99] O. Wolfson, A. P. Sistla, S. Chamberlain, Y. Yesha, “Updating and querying databases that track mobile units,” Distributed and Parallel Databases, 1999.
口試委員	林福仁 - 召集委員 魏志平 - 委員 黃三益 - 指導教授
口試日期	2004-07-26	繳交日期	2004-07-30

[回到前頁查詢結果 | 重新搜尋]