Browsing by Author "Gu, Jia-Yuan"

Now showing 1 - 2 of 2

A Scalable Complex Event Analytical System with Incremental Episode Mining over Data Streams
(2016)
Tseng, Jerry C. C.
;
Gu, Jia-Yuan
;
Tseng, Vincent S.
;
Wang, P. F.
;
Chen, Ching-Yu
Episode pattern mining is a very powerful technique to get high-valued information for people to solve real-life cross-disciplinary problems, such as for the analysis of manufacturing, stock markets, weather records and so on. As data grows, the mining process must be re-triggered again and again to obtain the most updated information. However, periodically re-mining the full dataset is not cost-effective, and thus a number of incremental mining approaches arise for the growing data. However, to our best knowledge, there exist few studies targeted on the problem of incremental episode mining. Moreover, streaming data of complex events is more and more popular because digital sensors always collect data around us in this big data age. Now the challenge is not only mining valuable episode patterns of incremental dataset, but also mining episode patterns over data streams of complex events. To address this research problem, we adopt the Lambda Architecture to design a scalable complex event analytical system that could be used to facilitate the incremental episode mining process over complex event sequences of data streams. Apache Spark and Apache Spark Streaming are applied as the development framework of the batch layer and the speed layer, respectively. To take both the efficiency and accuracy into consideration, we develop a series of modules and three algorithms, namely, batch episode mining, delta episode mining and pattern merging. Results from the experimental validation on a real dataset show that the proposed system carries high scalability and delivers excellent performance in terms of efficiency and accuracy.
Mining Closed(+) High Utility Itemsets without Candidate Generation
(2015)
Wu, Cheng-Wei
;
Fournier-Viger, Philippe
;
Gu, Jia-Yuan
;
Tseng, Vincent S.
;
資訊工程學系
High utility itemsets (HUIs) mining refers to discovering sets of items that not only co-occur but also carry high utilities (e.g., high profits). HUI mining receives extensive attentions in recent years due to the wide applications in various domains like commerce and biomedicine. However, huge number of HUls might be produced to users, which degrades the efficiency of the mining process. A promising solution to this problem is to mine closed(+) high utility itemset (CHUI), a compact and lossless representation of HUls. Nevertheless, existing algorithms incur the problem of producing a large amount of candidates, which degrades the mining performance in terms of time and space. In this paper, a novel algorithm named CHUI-Miner (Closed(+) High Utility ltemset mining without candidates) for mining CHUls is proposed, which directly computes the utility of itemsets without producing candidates. To our best knowledge, this is the first work addressing the issue of mining CHUls without candidate generation. Experimental results show that CHUl-Miner is several orders of magnitude faster than the state-of-the-art algorithms.