Sciweavers

873 search results - page 5 / 175
» Reducing the Frequent Pattern Set
Sort
View
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 8 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
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 9 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
14 years 5 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
ICDE
2007
IEEE
104views Database» more  ICDE 2007»
14 years 2 months ago
Filtering Frequent Spatial Patterns with Qualitative Spatial Reasoning
In frequent geographic pattern mining a large amount of patterns can be non-novel and non-interesting. This problem has been addressed recently, and background knowledge is used t...
Vania Bogorny, Bart Moelans, Luis Otávio Al...
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 2 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu