Skip navigation

DSpace JSPUI

DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets

Learn More
DSpace logo
English
中文
  • Browse
    • Communities
      & Collections
    • Publication Year
    • Author
    • Title
    • Subject
    • Advisor
  • Search TDR
  • Rights Q&A
    • My Page
    • Receive email
      updates
    • Edit Profile
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電機工程學系
Please use this identifier to cite or link to this item: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/29172
Title: 應用於廣泛網路應用之資訊勘測
Mining Framework for Pervasive Applications
Authors: Shih-Hsiang Lo
羅仕翔
Advisor: 陳銘憲(Ming-Syan Chen)
Keyword: 資訊勘測,決策樹,個人化搜尋,經緯度叢集法,
pervasive applications,data mining,decision tree,personalized search,geotagged clustering,
Publication Year : 2007
Degree: 博士
Abstract: A pervasive web application is a server providingmany web services for its registered users. Nowadays,
three of basic services that a typical pervasive web application offers are membership management,
search service and map-enabled photo service. In this thesis, we design a data mining framework
composed of three different data mining techniques to improve the performance of three services. In
order to improve the performance of membership management, in the second chapter, we develop a
categorical decision tree classifier to classify users efficiently. It noted that the data of user profiles has
an unique phenomenon. Its characteristic is that few attributes of user profiles have higher information
gains to distinguish users. By exploiting this characteristic that a traditional decision tree classifier does
not consider, our designed classifier can reduce the execution time in generating a decision tree for user
classification. As a result, the decision tree generated by our classifier can identify users efficiently
for special marketing needs of an advertisement. For the improvement of a search service, in the third
chapter, we propose a sequential web search algorithm that leverages the sequential queries issued
by users to search the required information. Compared with previous works, our approach uses the
additional feedback data on result pages of sequential queries where prior works only use feedback
data of a query. Thus, our approach can provide a better ranking of result pages for sequential queries.
For the efficiency of retrieving geotagged photos, in the fourth chapter, we design a clustering algorithm
that incrementally clusters geotagged photos in accordance to thresholds of different scales. Compared
with other applications, we show the photo clusters instead of all photos where the number of photo
clusters is much less than that of all photos. As a result, the performance of map-enabled photo service
is improved efficiently.
URI: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/29172
Fulltext Rights: 有償授權
Appears in Collections:電機工程學系

Files in This Item:
File SizeFormat 
ntu-96-1.pdf
  Restricted Access
3 MBAdobe PDF
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved