Fast frequent string mining using suffix arrays

被引：8
|
作者：
Fischer, J [1 ]
Heun, V [1 ]
Kramer, S [1 ]
机构：
[1] Univ Munich, Inst Informat, D-80333 Munich, Germany
来源：
FIFTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS | 2005年
关键词：
D O I：
10.1109/ICDM.2005.62
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We present a method to mine strings that are frequent in one database and infrequent in another The method uses suffix- and lcp-arrays that can be computed extremely fast and space efficiently, and further exhibit a good locality behavior Experiments with several biologically relevant data sets show that our approach out performs existing inethods in terms of time and space.
引用
收藏
页码：609 / 612
页数：4
相关论文
共 50 条
  • [41] Mining frequent trajectory patterns for activity monitoring using radio frequency tag arrays
    Liu, Yunhao
    Chen, Lei
    Pei, Jian
    Chen, Qiuxia
    Zhao, Yiyang
    FIFTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS, PROCEEDINGS, 2007, : 37 - +
  • [42] A new algorithm for fast mining frequent itemsets using N-lists
    DENG ZhiHong
    ScienceChina(InformationSciences), 2012, 55 (09) : 2008 - 2030
  • [43] Mining Frequent Trajectory Patterns for Activity Monitoring Using Radio Frequency Tag Arrays
    Liu, Yunhao
    Zhao, Yiyang
    Chen, Lei
    Pei, Jian
    Han, Jinsong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2012, 23 (11) : 2138 - 2149
  • [44] A new algorithm for fast mining frequent itemsets using N-lists
    Deng ZhiHong
    Wang ZhongHui
    Jiang JiaJian
    SCIENCE CHINA-INFORMATION SCIENCES, 2012, 55 (09) : 2008 - 2030
  • [45] A new algorithm for fast mining frequent itemsets using N-lists
    ZhiHong Deng
    ZhongHui Wang
    JiaJian Jiang
    Science China Information Sciences, 2012, 55 : 2008 - 2030
  • [46] SUFFIX ARRAYS WITH A TWIST
    Kowalski, Tomasz M.
    Grabowski, Szymon
    Fredriksson, Kimmo
    COMPUTING AND INFORMATICS, 2019, 38 (03) : 555 - 574
  • [47] Suffix arrays on words
    Ferragina, Paolo
    Fischer, Johannes
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 328 - +
  • [48] Suffix arrays in parallel
    Marín, M
    Navarro, G
    EURO-PAR 2003 PARALLEL PROCESSING, PROCEEDINGS, 2003, 2790 : 338 - 341
  • [49] Fast Keyword Detection Using Suffix Array
    Katsurada, Kouichi
    Teshima, Shigeki
    Nitta, Tsuneo
    INTERSPEECH 2009: 10TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION 2009, VOLS 1-5, 2009, : 2071 - 2074
  • [50] On the combinatorics of suffix arrays
    Kucherov, Gregory
    Tothmeresz, Lilla
    Vialette, Stephane
    INFORMATION PROCESSING LETTERS, 2013, 113 (22-24) : 915 - 920
12345