Sciweavers

376 search results - page 1 / 76
» Efficient Indexing Structures for Mining Frequent Patterns
Sort
View
ICDE
2002
IEEE
92views Database» more  ICDE 2002»
14 years 6 months ago
Efficient Indexing Structures for Mining Frequent Patterns
Bin Lan, Beng Chin Ooi, Kian-Lee Tan
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
13 years 10 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni
DKE
2006
126views more  DKE 2006»
13 years 4 months ago
FRACTURE mining: Mining frequently and concurrently mutating structures from historical XML documents
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
13 years 6 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,...
IDEAL
2003
Springer
13 years 9 months ago
Improving the Efficiency of Frequent Pattern Mining by Compact Data Structure Design
Mining frequent patterns has been a topic of active research because it is computationally the most expensive step in association rule discovery. In this paper, we discuss the use ...
Raj P. Gopalan, Yudho Giri Sucahyo