| An exact data mining method for finding center strings and all their instances | |
Lu, Ruqian ; Jia, Caiyan; Zhang, Shaofang; Chen, Lusheng; Zhang, Hongyu
| |
| 2007-04-01 | |
| Source Publication | IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
 |
| ISSN | 1041-4347 |
| Volume | 19Issue:4Pages:509-522 |
| Abstract | Common substring problems allowing errors are known to be NP-hard. The main challenge of the problems lies in the combinatorial explosion of potential candidates. In this paper, we propose and study a Generalized Center String (GCS) problem, where not only all models (center strings) of any length, but also the positions of all their (degenerative) instances in input sequences are searched for. Inspired by frequent pattern mining techniques in data mining field, we present an exact and efficient method to solve GCS. First, a highly parallelized TRIE-like structure, consensus tree, is proposed. Based on this structure, we present three Bpriori algorithms step by step. Bpriori algorithms can solve GCS with reasonable time and/or space complexities. We have proved that GCS is fixed parameter tractable with respect to fixed symbol set size and fixed length of input sequences. Experiment results on both artificial and real data have shown the correctness of the algorithms and the validity of our complexity analysis. A comparison with some current algorithms for solving Common Approximate Substring problems is also given. |
| Keyword | data mining frequent pattern common approximate substring center string Bpriori algorithm |
| DOI | 10.1109/TDKE.2007.1001 |
| Language | 英语 |
| WOS Research Area | Computer Science ; Engineering |
| WOS Subject | Computer Science, Artificial Intelligence ; Computer Science, Information Systems ; Engineering, Electrical & Electronic |
| WOS ID | WOS:000244332000006 |
| Publisher | IEEE COMPUTER SOC |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/5025 |
| Collection | 数学所 |
| Corresponding Author | Lu, Ruqian |
| Affiliation | 1.Acad Sinica, Inst Math, AMSS, Beijing 100080, Peoples R China 2.Fudan Univ, Shanghai Key Lab Intelligent Informat Proc, Shanghai 200433, Peoples R China 3.Acad Sinica, Inst Comp Technol, Beijing 100080, Peoples R China |
| Recommended Citation GB/T 7714 | Lu, Ruqian,Jia, Caiyan,Zhang, Shaofang,et al. An exact data mining method for finding center strings and all their instances[J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,2007,19(4):509-522. |
| APA | Lu, Ruqian,Jia, Caiyan,Zhang, Shaofang,Chen, Lusheng,&Zhang, Hongyu.(2007).An exact data mining method for finding center strings and all their instances.IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,19(4),509-522. |
| MLA | Lu, Ruqian,et al."An exact data mining method for finding center strings and all their instances".IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 19.4(2007):509-522. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment