Approximate TF–IDF based on topic extraction from massive message stream using the GPU
Authors:
- Ugo ErraUgo Erra
- Sabrina SenatoreSSSabrina Senatore
- Fernando MinnellaFMFernando Minnella
- Giuseppe CaggianeseGiuseppe Caggianese
- 1 January 2015
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 292, 143-161
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- FPGA-based hardware accelerator for high-performance data-stream processingPattern Recognition and Image Analysis, 2013
- Frequent Items Mining Acceleration Exploiting Fast Parallel Sorting on the GPUProcedia Computer Science, 2012
- Finding the frequent items in streams of dataCommunications of the ACM, 2009
- A Scalable Cluster-based Infrastructure for Edge-computing ServicesWorld Wide Web, 2006
- Modeling hypermedia-based communicationInformation Sciences, 2005
- Summarizing and Mining Skewed Data Streams2005
- Brook for GPUsACM Transactions on Graphics, 2004
- Zipf's law and the diversity of biology newsgroupsScientometrics, 2003
- Random texts exhibit Zipf's-law-like word frequency distributionIEEE Transactions on Information Theory, 1992
- A New Measure of Rank CorrelationBiometrika, 1938