Mining top-K frequent itemsets through progressive sampling

Author： Pietracaprina Andrea Riondato Matteo Upfal Eli Vandin Fabio

ISSN： 1384-5810

Source： Data Mining and Knowledge Discovery, Vol.21, Iss.2, 2010-09, pp. : 310-326

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Mining top-K frequent itemsets from data streams

By Wong Raymond Fu Ada

Data Mining and Knowledge Discovery, Vol. 13, Iss. 2, 2006-09 ,pp. : 193-217

Springer Publishing Company

Access to resources Recommend Favorite

Approximate distributed top-k queries

By Patt-Shamir Boaz Shafrir Allon

Distributed Computing, Vol. 21, Iss. 1, 2008-06 ,pp. : 1-22

Springer Publishing Company

Access to resources Recommend Favorite

Mining top − k frequent patterns without minimum support threshold

By Salam Abdus

Knowledge and Information Systems, Vol. 30, Iss. 1, 2012-01 ,pp. : 57-86

Springer Publishing Company

Access to resources Recommend Favorite

Reducing network traffic in unstructured P2P systems using Top-k queries

By Akbarinia Reza Pacitti Esther Valduriez Patrick

Distributed and Parallel Databases, Vol. 19, Iss. 2-3, 2006-05 ,pp. : 67-86

Springer Publishing Company

Access to resources Recommend Favorite

Mining top-k frequent patterns in the presence of the memory constraint

By Chuang Kun-Ta

The VLDB Journal, Vol. 17, Iss. 5, 2008-08 ,pp. : 1321-1344

Springer Publishing Company

Access to resources Recommend Favorite