Sciweavers

1217 search results - page 59 / 244
» On compressing frequent patterns
Sort
View
111
Voted
COMPSAC
2005
IEEE
15 years 5 months ago
A Novel Method for Protecting Sensitive Knowledge in Association Rules Mining
Discovering frequent patterns from huge amounts of data is one of the most studied problems in data mining. However, some sensitive patterns with security policies may cause a thr...
En Tzu Wang, Guanling Lee, Yu Tzu Lin
135
Voted
ICDM
2008
IEEE
130views Data Mining» more  ICDM 2008»
15 years 10 months ago
Mining Temporal Patterns with Quantitative Intervals
In this paper we consider the problem of discovering frequent temporal patterns in a database of temporal sequences, where a temporal sequence is a set of items with associated da...
Thomas Guyet, Rene Quiniou
127
Voted
CSB
2002
IEEE
221views Bioinformatics» more  CSB 2002»
15 years 8 months ago
DNA Sequence Compression Using the Burrows-Wheeler Transform
-- We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns i...
Donald A. Adjeroh, Yong Zhang, Amar Mukherjee, Mat...
107
Voted
SPIRE
2001
Springer
15 years 8 months ago
Speed-up of Aho-Corasick Pattern Matching Machines by Rearranging States
Thispaper describes speed-up of string pattern matchingby rearrangingstates inAho-Corasickpattern matching machine, which is a kind of afinite automaton. Werealized speed-up of st...
T. Nishimura, Shuichi Fukamachi, Takeshi Shinohara
140
Voted
CVPR
2004
IEEE
15 years 7 months ago
Midstream Content Access of Visual Pattern Coded Imagery
Multimedia retrieval is going to play an increasingly important role in the future. Since the availability of digital media seems ever rising, not only the retrieval performance i...
Gerald Schaefer