博碩士論文 etd-0721105-165723 詳細資訊


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

姓名 陳志吉(Chih-Chi Chen) 電子郵件信箱 E-mail 資料不公開
畢業系所 資訊管理學系研究所(Information Management)
畢業學位 碩士(Master) 畢業時期 93學年第2學期
論文名稱(中) 從不確定性資料庫裡探勘移動群組型態
論文名稱(英) Mining Mobile Groups from Uncertain Location Databases
檔案
  • etd-0721105-165723.pdf
  • 本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
    請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
    論文使用權限

    電子論文:校內公開,校外永不公開

    論文語文/頁數 英文/51
    統計 本論文已被瀏覽 5357 次,被下載 19 次
    摘要(中) 隨著行動通訊裝置的普及,要取得不同物件的地理位置資料比以往更加方便與容易。也因為如此,藉由辨識在空間或時間上接近的移動群組以便進行商業行銷、犯罪偵測或者是學術性研究的應用也越來越普遍。雖然目前最先進的定位儀器可以將量測誤差降低至十公尺以下,但也只限定於特殊用途並且收費昂貴,例如:軍事科技。在我們一般用途與日常使用的定位儀器,其誤差可能由十到一百公尺不等。這樣的誤差相對來說可能致使我們在發掘群組的精確度上產生懷疑。也因為如此,本篇論文驗證了由量測誤差所造成對於辨識移動群組正確性的影響,並採用Kalman Filter 和 RTS smoothing 的修正方式,企圖將由量測所產生的誤差降至最低,以提高發掘群組資訊的精確度與可信度。在大部分的情況下,修正後的資料能產生更多正確的移動群組,然而,當量測誤差很小且物體移動的速度較緩和時,由量測的資料直接產生的移動群組反而能得到較佳的結果。
    摘要(英) As the mobile communication devices become popular, getting the location data of various objects is more convenient than before. Mobile groups that exhibit spatial and temporal proximities can be used for marketing, criminal detection, and ecological studies, just to name a few. Although nowadays the most advanced position equipments are capable of achieving a high accuracy with the measurement error less than 10 meters, they are still expensive. Positioning equipments using different technologies incur different amount of measurement errors ranging from 10 meters to a few hundred meters. In this thesis, we examine the impact of measurement errors on the accuracy of identified valid mobile groups and apply Kalman Filter and RTS smoothing as the one-way and two-way correction to correct the measurement data. In most settings, the corrected location data yield more accurate valid mobile groups. However, when the measurement error is small and users do not make abrupt change in their speed, mining mobile groups directly on the measurement data, however, yield better results.
    關鍵字(中)
  • Smooth
  • Kalman Filter
  • 行動群組
  • 關鍵字(英)
  • Kalman Filter
  • Mobile group mining
  • Smooth
  • 論文目次 CHAPTER 1. INTRODUCTION 1
    1.1 BACKGROUND 1
    1.2 MOTIVATION 2
    1.3 ORGANIZATION OF THIS THESIS 3
    CHAPTER 2. LITERATURE REVIEW 5
    2.1 GROUP PATTERN MINING 5
    2.2 TRAJECTORY-BASED MINING GROUP PATTERN 8
    2.3 KALMAN FILTER 12
    2.4 SMOOTHING 17
    CHAPTER 3. APPLYING KALMAN FILTER TO GENERATE FIXED-POINT LOCATION DATA 20
    3.1 ONE-WAY CORRECTION 20
    3.1.1 KALMAN FILTER PARAMETER SETTINGS 20
    3.1.2 THE PROCEDURE OF KALMAN FILTER 22
    3.2 TWO-WAY CORRECTION 23
    CHAPTER 4. MINING GROUP PATTERNS WITH LOCATION CORRECTION 25
    4.1 MINING MOBILE GROUP PATTERNS ON LOCATION DATA AT FIXED TIME POINTS 25
    4.2 MINING MOBILE GROUP PATTERNS ON LOCATION DATA WITH TRAJECTORIES 26
    4.3 SUMMARY 30
    CHAPTER 5. PERFORMANCE EVALUATION 32
    5.1 SYNTHETIC DATASET GENERATOR 32
    5.2 THE EFFECT OF DATA CORRECTION 36
    5.2.1 PARAMETER SETTINGS 36
    5.2.2 RESULT 37
    5.3 ACCURACY OF MINED MOBILE GROUPS 40
    5.3.1 PARAMETER SETTINGS 41
    5.3.2 EXPERIMENTAL RESULTS 41
    5.4 RUNNING TIMES 45
    5.4.1 PARAMETER SETTINGS 45
    5.4.2 RESULTS 46
    CHAPTER 6. CONCLUSIONS 48
    REFERENCES 49
    參考文獻 [BH97] Brown,R.G., and Hwang,P.Y.C.(1997). Introduction to Random Signals and Applied Kalman Filtering : with MATLAB Exercises and Solutions(Third ed.): Wiley & Sons, Inc.
    [BWHJ94] B.Hofmann-Wellenhof, H.Lichtenegger, and J.Collins. Global Positioning System:Theory and Practice, volume I. Springer-Verlag Wien New York, third revised edition,April, 1994.
    [CK00] Guanling Chen and David Kotz. A Survey of Context-Aware Mobile Computing Research. Dartmouth Computer Science Technical Report TR2000-381, Department of Computer Science, Dartmouth College, 2000.
    [GKT02] G. Giaglis, P. Kourouthanasis, and A. Tsamakos. Mobile Commerce: Technology, Theory, and Applications, chapter Towards a Classification Network for Mobile Location Services. Idea Group Publishing, 2002.
    [GS00] V. Guralnik, J. Srivastava. “Event Detection from Time Series Data.” Proceedings of ACM International Conference on Knowledge Discovery and Data Mining (KDD2000), 2000.
    [HH04] San-Yih Hwang and Chin-Ming Hwang, “Mining Mobile Group Patterns: A Trajectory-based Approach”, master thesis, National Sun Yan-sen University, Department of Information management, Jul. 2004.
    [HLCL05] Ying-Han Liu, ”Mining Mobile Group Patterns: A Trajectory-based Approach”, master thesis, National Sun Yan-sen University, Department of Information management, Jul. 2004.
    [Kal60] Kalman, R.E., 1960; “A new approach to linear filtering and prediction problems”, Trans. ASME, Series D, J. Basic Eng., V. 82, March, pp. 35 - 45
    [May79]  Maybeck, Peter S. 1979.Stochastic Models, Estimation, and Control, Volume 1, Chapter 1, Academic Press, Inc.
    [Med69] S. Meditch, Stochastic optimal Linear Estimation and Control, New York: McGraw-Hill, 1969.
    [Mur04] K. Murphy. Computer Science and Artificial Intelligence Laboratory in MIT. http://www.cs.ubc.ca/~murphyk/Software/Kalman/
    kalman.html, June 7, 2004.
    [WB04] Greg Welch and Gary Bishop, “An Introduction to Kalman Filter”, Department of Computer Science University of North Carolina at Chapel Hill.
    [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.
    [WSCY99] O. Wolfson, A. P. Sistla, S. Chamberlain, Y. Yesha, “Updating and querying databases that track mobile units,” Distributed and Parallel Databases, 1999.
    [Zar96] Paul Zarchan. Global Positioning System: Theory and Applications, volume I. American Institute of Aeronautics and Astronautics, 1996.
    [ZGL03] Vasileios Zeimpekis, George M. Giaglis, and George Lekakos. “A Taxonomy of Indoor and Outdoor Positioning Techniques for Mobile Location Services,” SIGecom Exchanges, ACM, Volume 3.4, 2003.
    口試委員
  • 魏志平 - 召集委員
  • 林福仁 - 委員
  • 黃三益 - 指導教授
  • 口試日期 2005-07-19 繳交日期 2005-07-21

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


    如有任何問題請與論文審查小組聯繫