Shian-Shyong Tseng
Research Subjects
Shian-Shyong Tseng has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Tzung-Pei Hong
Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811726, Taiwan
5 shared publications - Ching-Yao Wang
National Chiao-Tung University, Taiwan
3 shared publications - Tzung-Pei Hong
Department of Information Management, I-Shou University, Kaohsiung, 84008, Taiwan, R.O.C.
3 shared publications - Chao-Tung Yang
Tunghai University
2 shared publications - Ching-Hung Wang
Chunghwa Telecommunication Laboratories, Chung-Li 32617, Taiwan, ROC
2 shared publications Wei-Chou Chen
Department of Computer and Information Science, National Chiao Tung University, Hsinchu 300, Taiwan, ROC
2 shared publications
Latest Publications
- 1 June 2011
- Published by Elsevier in Expert Systems with Applications
- Vol. 38 (6) , 7051-7058
An incremental mining algorithm for maintaining sequential patterns using pre-large sequences
- 1 June 2011
- Published by Elsevier in Expert Systems with Applications
- Vol. 38 (6) , 7051-7058
An incremental mining algorithm for maintaining sequential patterns using pre-large sequences
- 31 March 2009
- Published by Elsevier in Expert Systems with Applications
- Vol. 36 (2) , 2699-2710
An intelligent questionnaire analysis expert system
- 31 March 2009
- Published by Elsevier in Expert Systems with Applications
- Vol. 36 (2) , 2699-2710
An intelligent questionnaire analysis expert system
- 31 May 2008
- Published by Elsevier in Expert Systems with Applications
- Vol. 34 (4) , 2858-2869
An efficient bit-based feature selection method
- 31 May 2008
- Published by Elsevier in Expert Systems with Applications
- Vol. 34 (4) , 2858-2869
An efficient bit-based feature selection method
- 29 February 2008
- Published by Elsevier in Expert Systems with Applications
- Vol. 34 (2) , 833-844
Dynamic EMCUD for knowledge acquisition
- 29 February 2008
- Published by Elsevier in Expert Systems with Applications
- Vol. 34 (2) , 833-844
Dynamic EMCUD for knowledge acquisition
- 9 September 2007
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 44 (1) , 1-23
Dynamic partitioning of loop iterations on heterogeneous PC clusters
- 9 September 2007
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 44 (1) , 1-23
Dynamic partitioning of loop iterations on heterogeneous PC clusters
- 4 June 2005
- Published by Elsevier in Information Sciences
- Vol. 176 (12) , 1752-1780
Flexible online association rule mining based on multidimensional pattern relations
- 4 June 2005
- Published by Elsevier in Information Sciences
- Vol. 176 (12) , 1752-1780
Flexible online association rule mining based on multidimensional pattern relations
- 1 August 2004
- Published by Elsevier in Expert Systems with Applications
- Vol. 27 (2) , 223-236
Design and implementation of an intelligent DNS management system
- 1 August 2004
- Published by Elsevier in Expert Systems with Applications
- Vol. 27 (2) , 223-236
Design and implementation of an intelligent DNS management system
- 26 June 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Maintenance of sequential patterns for record modification using pre-large sequences
In previous work we proposed incremental mining algorithms for maintenance of sequential patterns based on the concept of pre-large sequences as records were inserted or deleted. Although maintenance of sequential patterns for record modification can be performed by using the deletion procedure and then the insertion procedure, double the computation time of a single procedure is needed. In this paper, we attempt to apply the concept of pre-large sequences to maintain sequential patterns as records are modified. The proposed algorithm does not require rescanning original databases until the accumulative number of modified customer sequences exceeds a safety bound derived by a pre-large concept. As databases grow larger, the number of modified customer sequences allowed before database rescanning also needs to grow.
- 26 June 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Maintenance of sequential patterns for record modification using pre-large sequences
In previous work we proposed incremental mining algorithms for maintenance of sequential patterns based on the concept of pre-large sequences as records were inserted or deleted. Although maintenance of sequential patterns for record modification can be performed by using the deletion procedure and then the insertion procedure, double the computation time of a single procedure is needed. In this paper, we attempt to apply the concept of pre-large sequences to maintain sequential patterns as records are modified. The proposed algorithm does not require rescanning original databases until the accumulative number of modified customer sequences exceeds a safety bound derived by a pre-large concept. As databases grow larger, the number of modified customer sequences allowed before database rescanning also needs to grow.
- 15 November 2002
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 6 (5) , 399-410
Maintenance of discovered sequential patterns for record deletion1
Mining sequential patterns from temporal transaction databases attempts to find customer behavior models and to assist managers in making correct and effective decisions. The sequential patterns discovered may, however, become invalid or inappropriat
- 15 November 2002
- Published by SAGE Publications in Intelligent Data Analysis: An International Journal
- Vol. 6 (5) , 399-410
Maintenance of discovered sequential patterns for record deletion1
Mining sequential patterns from temporal transaction databases attempts to find customer behavior models and to assist managers in making correct and effective decisions. The sequential patterns discovered may, however, become invalid or inappropriat
- 31 August 2002
- Published by Elsevier in Expert Systems with Applications
- Vol. 23 (2) , 95-102
A parallelized indexing method for large-scale case-based reasoning
- 31 August 2002
- Published by Elsevier in Expert Systems with Applications
- Vol. 23 (2) , 95-102
A parallelized indexing method for large-scale case-based reasoning