Sciweavers

1217 search results - page 35 / 244
» On compressing frequent patterns
Sort
View
232
Voted
ICDE
2004
IEEE
116views Database» more  ICDE 2004»
16 years 5 months ago
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount ...
Ding-Ying Chiu, Yi-Hung Wu, Arbee L. P. Chen
161
Voted
ADC
2008
Springer
156views Database» more  ADC 2008»
15 years 10 months ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang
139
Voted
DKE
2006
126views more  DKE 2006»
15 years 3 months ago
FRACTURE mining: Mining frequently and concurrently mutating structures from historical XML documents
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
171
Voted
DAWAK
2006
Springer
15 years 7 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin
103
Voted
DAWAK
2000
Springer
15 years 8 months ago
Mining Frequent Binary Expressions
In data mining, searching for frequent patterns is a common basic operation. It forms the basis of many interesting decision support processes. In this paper we present a new type ...
Toon Calders, Jan Paredaens