Finding associations and computing similarity via biased pair sampling
- 17 June 2011
- journal article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 31 (3) , 505-526
Abstract
No abstract availableKeywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Fast sparse matrix multiplicationACM Transactions on Algorithms, 2005
- What's hot and what's not: tracking most frequent items dynamicallyACM Transactions on Database Systems, 2005
- Efficient mining of both positive and negative association rulesACM Transactions on Information Systems, 2004
- Advances in frequent itemset mining implementationsACM SIGKDD Explorations Newsletter, 2004
- Alternative interest measures for mining associations in databasesIEEE Transactions on Knowledge and Data Engineering, 2003
- Finding interesting associations without support pruningIEEE Transactions on Knowledge and Data Engineering, 2001
- A Small Approximately Min-Wise Independent Family of Hash FunctionsJournal of Algorithms, 2001
- KDD-Cup 2000 organizers' reportACM SIGKDD Explorations Newsletter, 2000
- Approximating Matrix Multiplication for Pattern Recognition TasksJournal of Algorithms, 1999
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988