Sciweavers

573 search results - page 25 / 115
» Mining Frequent Itemsets from Uncertain Data
Sort
View
CLA
2007
13 years 9 months ago
ZART: A Multifunctional Itemset Mining Algorithm
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznets...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 15 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
IEEEHPCS
2010
13 years 6 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
14 years 2 months ago
Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams
Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algor...
Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun ...
KES
2004
Springer
14 years 1 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran