Sciweavers

1217 search results - page 69 / 244
» On compressing frequent patterns
Sort
View
148
Voted
AAAI
2006
15 years 5 months ago
Minimum Description Length Principle: Generators Are Preferable to Closed Patterns
The generators and the unique closed pattern of an equivalence class of itemsets share a common set of transactions. The generators are the minimal ones among the equivalent items...
Jinyan Li, Haiquan Li, Limsoon Wong, Jian Pei, Guo...
161
Voted
DASFAA
2005
IEEE
154views Database» more  DASFAA 2005»
15 years 9 months ago
Mining Positive and Negative Association Rules from XML Query Patterns for Caching
Recently, several approaches that mine frequent XML query patterns and cache their results have been proposed to improve query response time. However, frequent XML query patterns m...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
136
Voted
DMIN
2006
239views Data Mining» more  DMIN 2006»
15 years 5 months ago
Mining of Stock Data: Intra- and Inter-Stock Pattern Associative Classification
In this paper, a pattern-based stock data mining approach which transforms the numeric stock data to symbolic sequences, carries out sequential and non-sequential association analy...
Jo Ting, Tak-Chung Fu, Fu-Lai Chung
SIGIR
1998
ACM
15 years 8 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
126
Voted
IDEAS
2007
IEEE
138views Database» more  IDEAS 2007»
15 years 10 months ago
On Transversal Hypergraph Enumeration in Mining Sequential Patterns
The transversal hypergraph enumeration based algorithms can be efficient in mining frequent itemsets, however it is difficult to apply them to sequence mining problems. In this ...
Dong (Haoyuan) Li, Anne Laurent, Maguelonne Teisse...