學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Search Results

Now showing 1 - 5 of 5

Mining Temporal Patterns in Interval-Based Data
(2016)
Chen, Yi-Cheng
;
Peng, Wen-Chih
;
Lee, Suh-Yin
;
資訊工程學系
;
Department of Computer Science
Sequential pattern mining is an important subfield in data mining. Recently, discovering patterns from interval events has attracted considerable efforts due to its widespread applications. However, due to the complex relation between two intervals, mining interval-based sequences efficiently is a challenging issue. In this paper, we develop a novel algorithm, P-TPMiner, to efficiently discover two types of interval-based sequential patterns. Some pruning techniques are proposed to further reduce the search space of the mining process. Experimental studies show that proposed algorithm is efficient and scalable. Furthermore, we apply proposed method to real datasets to demonstrate the practicability of discussed patterns.
Exploring Pattern-Aware Travel Routes for Trajectory Search
(2013-06-01)
Wei, Ling-Yin
;
Peng, Wen-Chih
;
Lee, Wang-Chien
;
資訊工程學系
;
Department of Computer Science
With the popularity of positioning devices, Web 2.0 technology, and trip sharing services, many users are willing to log and share their trips on the Web. Thus, trip planning Web sites are able to provide some new services by inferring Regions-Of-Interest (ROIs) and recommending popular travel routes from trip trajectories. We argue that simply providing some travel routes consisting of popular ROIs to users is not sufficient. To tour around a wide geographical area, for example, a city, some users may prefer a trip to visit as many ROIs as possible, while others may like to stop by only a few ROIs for an in-depth visit. We refer to a trip fitting the former user group as an in-breadth trip and a trip suitable for the latter user group as an in-depth trip. Prior studies on trip planning have focused on mining ROIs and travel routes without considering these different preferences. In this article, given a spatial range and a user preference of depth/breadth specified by a user, we develop a Pattern-Aware Trajectory Search (PATS) framework to retrieve the top K trajectories passing through popular ROIs. PATS is novel because the returned travel trajectories, discovered from travel patterns hidden in trip trajectories, may represent the most valuable travel experiences of other travelers fitting the user's trip preference in terms of depth or breadth. The PATS framework comprises two components: travel behavior exploration and trajectory search. The travel behavior exploration component determines a set of ROIs along with their attractive scores by considering not only the popularity of the ROIs but also the travel sequential relationships among the ROIs. To capture the travel sequential relationships among ROIs and to derive their attractive scores, a user movement graph is constructed. For the trajectory search component of PATS, we formulate two trajectory score functions, the depth-trip score function and the breadth-trip score function, by taking into account the number of ROIs in a trajectory and their attractive scores. Accordingly, we propose an algorithm, namely, Bounded Trajectory Search (BTS), to efficiently retrieve the top K trajectories based on the two trajectory scores. The PATS framework is evaluated by experiments and user studies using a real dataset. The experimental results demonstrate the effectiveness and the efficiency of the proposed PATS framework.
A Profile-based Framework for Interaction Prediction
(2012)
Liao, Zhung-Xun
;
Peng, Wen-Chih
;
Yu, Philip S.
;
資訊工程學系
;
Department of Computer Science
In this paper, we generalize the link prediction problem to an interaction prediction problem. Compared with links in social networks, interactions can occur several times repeatedly. Based on the observation, we formulate an event-triggered interaction prediction problem. For example, we may want to know when a user connects to a website (e.g. Facebook), who will also connect to the website. We propose a Profile-based Interaction Prediction Framework (PIPF) which can solve the event-triggered interaction prediction problem efficiently and effectively. In PIPF, we first transform the interaction log into a Sliding-window Evolving Graph (SEG) to reduce the data volume and incrementally update SEG as interaction log grows. Then, we build profiles designed to present users' behavior by extracting the static and surprising features from SEG. The static (respectively, surprising) feature reflects the regularity of users' behavior (respectively, the temporal behavior). When an event occurs, we compute the similarity between the event and each candidate link. We propose two similarity functions for static and surprising features and an automatic selection strategy to control the influence of the two features. We use a real dataset that records Internet connections to evaluate the scalability, efficiency, and effectiveness of PIPF. The experimental results show that PIPF is far more scalable and efficient than the previous methods to perform real-time prediction.
Mining Temporal Profiles of Mobile Applications for Usage Prediction
(2012)
Liao, Zhung-Xun
;
Lei, Po-Ruey
;
Shen, Tsu-Jou
;
Li, Shou-Chung
;
Peng, Wen-Chih
Due to the proliferation of mobile applications (abbreviated as Apps) on smart phones, users can install many Apps to facilitate their life. Usually, users browse their Apps by swiping touch screen on smart phones, and are likely to spend much time on browsing Apps. In this paper, we design an AppNow widget that is able to predict users' Apps usage. Therefore, users could simply execute Apps from the widget. The main theme of this paper is to construct the temporal profiles which identify the relation between Apps and their usage times. In light of the temporal profiles of Apps, the AppNow widget predicts a list of Apps which are most likely to be used at the current time. AppNow consists of three components, the usage logger, the temporal profile constructor and the Apps predictor. First, the usage logger records every App start time. Then, the temporal profiles are built by applying Discrete Fourier Transform and exploring usage periods and specific times. Finally, the system calculates the usage probability at current time for each App and shows a list of Apps with highest probability. In our experiments, we collected real usage traces to show that the accuracy of AppNow could reach 86% for identifying temporal profiles and 90% for predicting App usage.
AppNow: Predicting Usages of Mobile Applications on Smart Phones
(2012)
Liao, Zhung-Xun
;
Lei, Po-Ruey
;
Shen, Tsu-Jou
;
Li, Shou-Chung
;
Peng, Wen-Chih
Due to the proliferation of mobile applications (abbreviated as Apps) on smart phones, users can install many Apps to facilitate their life. Usually, users browse their Apps by swiping touch screen on smart phones, and are likely to spend much time on browsing Apps. In this paper, we design an AppNow widget that is able to predict users' Apps usage. Therefore, users could simply execute Apps from the widget. The main theme of this paper is to construct the temporal profiles which identify the relation between Apps and their usage times. In light of the temporal profiles of Apps, the AppNow widget predicts a list of Apps which are most likely to be used at the current time. In our experiments, we collected real usage traces to show that the accuracy of AppNow could reach 86% for identifying temporal profiles and 90% for predicting App usage.

學術出版;;Publications

Browse

Filters

Settings

Sort By

Results per page

🏛️國立陽明交通大學機構典藏

Search Results