CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
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
发表期刊IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
ISSN1041-4347
卷号19期号:4页码:509-522
摘要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.
关键词data mining frequent pattern common approximate substring center string Bpriori algorithm
DOI10.1109/TDKE.2007.1001
收录类别SCI
语种英语
WOS研究方向Computer Science ; Engineering
WOS类目Computer Science, Artificial Intelligence ; Computer Science, Information Systems ; Engineering, Electrical & Electronic
WOS记录号WOS:000244332000006
出版者IEEE COMPUTER SOC
引用统计
被引频次:5[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/11014
专题中国科学院计算技术研究所期刊论文_英文
通讯作者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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Lu, Ruqian]的文章
[Jia, Caiyan]的文章
[Zhang, Shaofang]的文章
百度学术
百度学术中相似的文章
[Lu, Ruqian]的文章
[Jia, Caiyan]的文章
[Zhang, Shaofang]的文章
必应学术
必应学术中相似的文章
[Lu, Ruqian]的文章
[Jia, Caiyan]的文章
[Zhang, Shaofang]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。