Sciweavers

25 search results - page 3 / 5
» Itemset Support Queries Using Frequent Itemsets and Their Co...
Sort
View
DATAMINE
2008
89views more  DATAMINE 2008»
13 years 7 months ago
Mining conjunctive sequential patterns
Abstract. In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative examp...
Chedy Raïssi, Toon Calders, Pascal Poncelet
JIIS
2006
119views more  JIIS 2006»
13 years 7 months ago
Answering constraint-based mining queries on itemsets using previous materialized results
Abstract In recent years, researchers have begun to study inductive databases, a new generation of databases for leveraging decision support applications. In this context, the user...
Roberto Esposito, Rosa Meo, Marco Botta
CINQ
2004
Springer
116views Database» more  CINQ 2004»
13 years 11 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
ISCIS
2004
Springer
14 years 24 days ago
A Study on Answering a Data Mining Query Using a Materialized View
One of the classic data mining problems is discovery of frequent itemsets. This problem particularly attracts database community as it resembles traditional database querying. In t...
Maciej Zakrzewicz, Mikolaj Morzy, Marek Wojciechow...
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 7 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig