Chun-Chi Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chun-Chi Chen has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Ding-An Chiang
Department of Information Engineering, Tamkang University, Tan‐Shui, Taipei, Taiwan, R.O.C.
1 shared publication - Ming-Hua Wang
Department of Information Management, Nanya Institute of Technology, Jung‐Li, Taoyuan, Taiwan, R.O.C.
1 shared publication - Shao-Lun Lee
Department of Information Management, Oriental Institute of Technology, Ban-Ciao, Taipei, Taiwan, ROC
1 shared publication
Latest Publications
- 1 March 2005
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 20 (3) , 359-373
Mining interval sequential patterns
The main task of mining sequential patterns is to analyze the transaction database of a company in order to find out the priorities of items that most customers take when consuming. In this article, we propose a new method—the ISP Algorithm. With this method, we can find out not only the order of consumer items of each customer, but also offer the periodic interval of consumer items of each customer. Compared with other previous periodic association rules, the difference is that the period the algorithm provides is not the repeated purchases in a regular time, but the possible repurchases within a certain time frame. The algorithm utilizes the transaction time interval of individual customers and that of all the customers to find out when and who will buy goods, and what items of goods they will buy. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 359–373, 2005.
- 1 March 2005
- Published by Hindawi Limited in International Journal of Intelligent Systems
- Vol. 20 (3) , 359-373
Mining interval sequential patterns
The main task of mining sequential patterns is to analyze the transaction database of a company in order to find out the priorities of items that most customers take when consuming. In this article, we propose a new method—the ISP Algorithm. With this method, we can find out not only the order of consumer items of each customer, but also offer the periodic interval of consumer items of each customer. Compared with other previous periodic association rules, the difference is that the period the algorithm provides is not the repeated purchases in a regular time, but the possible repurchases within a certain time frame. The algorithm utilizes the transaction time interval of individual customers and that of all the customers to find out when and who will buy goods, and what items of goods they will buy. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 359–373, 2005.