Sciweavers

376 search results - page 17 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
DAWAK
2005
Springer
14 years 2 months ago
Optimizing a Sequence of Frequent Pattern Queries
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
Mikolaj Morzy, Marek Wojciechowski, Maciej Zakrzew...
ENC
2004
IEEE
14 years 6 days ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
IEAAIE
2009
Springer
14 years 3 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
JIIS
2007
150views more  JIIS 2007»
13 years 8 months ago
Towards a new approach for mining frequent itemsets on data stream
Mining frequent patterns on streaming data is a new challenging problem for the data mining community since data arrives sequentially in the form of continuous rapid streams. In t...
Chedy Raïssi, Pascal Poncelet, Maguelonne Tei...
SSD
2001
Springer
218views Database» more  SSD 2001»
14 years 27 days ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos