loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Conference on Data Mining (ICDM'05)
Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm
Houston, Texas
November 27-November 30
ISBN: 0-7695-2278-5
ASCII Text
x 
 
Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima, "Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm," Data Mining, IEEE International Conference on, pp. 186-193, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ICDM.2005.60,
author = {Koji Iwanuma and Ryuichi Ishihara and Yo Takano and Hidetomo Nabeshima},
title = {Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm},
journal ={Data Mining, IEEE International Conference on},
volume = {0},
year = {2005},
issn = {1550-4786},
pages = {186-193},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.60},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Mining, IEEE International Conference on
TI - Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm
SN - 1550-4786
SP186
EP193
A1 - Koji Iwanuma,
A1 - Ryuichi Ishihara,
A1 - Yo Takano,
A1 - Hidetomo Nabeshima,
PY - 2005
KW - null
VL - 0
JA - Data Mining, IEEE International Conference on
ER -
 
Koji Iwanuma, University of Yamanashi
Ryuichi Ishihara, University of Yamanashi
Yo Takano, University of Yamanashi
Hidetomo Nabeshima, University of Yamanashi
In this paper, we study frequent-subsequence extraction from a single very-long data-sequence. First we propose a novel frequency measure, called the total frequency, for counting multiple occurrences of a sequential pattern in a single data sequence. The total frequency is anti-monotonic, and makes it possible to count up pattern occurrences without duplication. Moreover the total frequency has a good property for implementation based on the dynamic programming strategy. Second we give a simple on-line algorithm for a specialized subsequence extraction problem, i.e., a problem with the infinite window-length. This specialized problem is considered to be a relaxation of the general-case problem, thus this fast on-line algorithm is important from the view of practical applications.
Citation:
Koji Iwanuma, Ryuichi Ishihara, Yo Takano, Hidetomo Nabeshima, "Extracting Frequent Subsequences from a Single Long Data Sequence: A Novel Anti-Monotonic Measure and a Simple On-Line Algorithm," icdm, pp.186-193, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.