Sciweavers

56 search results - page 2 / 12
» Mining Frequent Patterns with Counting Inference
Sort
View
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
DAWAK
2008
Springer
13 years 9 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
ADBIS
2003
Springer
108views Database» more  ADBIS 2003»
14 years 26 days ago
Evaluation of Common Counting Method for Concurrent Data Mining Queries
Data mining queries are often submitted concurrently to the data mining system. The data mining system should take advantage of overlapping of the mined datasets. In this paper we ...
Marek Wojciechowski, Maciej Zakrzewicz
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 17 days ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
ICDM
2005
IEEE
157views Data Mining» more  ICDM 2005»
14 years 1 months ago
Blocking Anonymity Threats Raised by Frequent Itemset Mining
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...