An exact data mining method for finding center strings and all their instances
文献类型：期刊论文
| 作者 | Lu, Ruqian ; Jia, Caiyan; Zhang, Shaofang; Chen, Lusheng; Zhang, Hongyu
|
| 刊名 | IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
 |
| 出版日期 | 2007-04-01 |
| 卷号 | 19期号:4页码:509-522 |
| 关键词 | data mining frequent pattern common approximate substring center string Bpriori algorithm |
| ISSN号 | 1041-4347 |
| DOI | 10.1109/TDKE.2007.1001 |
| 英文摘要 | 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. |
| WOS研究方向 | Computer Science ; Engineering |
| 语种 | 英语 |
| WOS记录号 | WOS:000244332000006 |
| 出版者 | IEEE COMPUTER SOC |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/5024]  |
| 专题 | 数学所 |
| 通讯作者 | Lu, Ruqian |
| 作者单位 | 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 |
| 推荐引用方式 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。