TY - GEN
T1 - A novel sequential pattern mining algorithm for the feature discovery of software fault
AU - Ren, Jiadong
AU - Wang, Libo
AU - Dong, Jun
AU - Hu, Changzhen
AU - Wang, Kunsheng
PY - 2009
Y1 - 2009
N2 - In order to obtain the useful sequential pattern knowledge from the historical sequence database, which reflects the characteristic behavior of software fault, a novel sequential pattern mining algorithm oriented feature discovery of software fault based on location matrix named SPM-LM is proposed. The pattern growth theory and the concept of location matrix are introduced into the new proposed algorithm. Firstly, the fault feature database is scanned and a location matrix for each event is constructed to record the frequent sequence information, which produces the frequent 1-sequence. Secondly, the sequence is extended through the dual pointer operation for the location matrix. And the frequent k-sequence for the prefix to frequent 1-sequence is generated. Finally, all of the generated frequent sequential patterns are saved into the corresponding layer of the tree structure. Therefore, the software fault sequences are matched in the tree structure to find the software failures and improve the software performance. The experimental results indicate that the algorithm improves the efficiency of pattern discovery significantly.
AB - In order to obtain the useful sequential pattern knowledge from the historical sequence database, which reflects the characteristic behavior of software fault, a novel sequential pattern mining algorithm oriented feature discovery of software fault based on location matrix named SPM-LM is proposed. The pattern growth theory and the concept of location matrix are introduced into the new proposed algorithm. Firstly, the fault feature database is scanned and a location matrix for each event is constructed to record the frequent sequence information, which produces the frequent 1-sequence. Secondly, the sequence is extended through the dual pointer operation for the location matrix. And the frequent k-sequence for the prefix to frequent 1-sequence is generated. Finally, all of the generated frequent sequential patterns are saved into the corresponding layer of the tree structure. Therefore, the software fault sequences are matched in the tree structure to find the software failures and improve the software performance. The experimental results indicate that the algorithm improves the efficiency of pattern discovery significantly.
KW - Extend sequence
KW - Location matrix
KW - Software fault
UR - http://www.scopus.com/inward/record.url?scp=77949870553&partnerID=8YFLogxK
U2 - 10.1109/CISE.2009.5367106
DO - 10.1109/CISE.2009.5367106
M3 - Conference contribution
AN - SCOPUS:77949870553
SN - 9781424445073
T3 - Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009
BT - Proceedings - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009
T2 - 2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009
Y2 - 11 December 2009 through 13 December 2009
ER -