Paras: A parameter space framework for online association mining

Proceedings of the VLDB Endowment

Volumn 6, Issue 3, 2013, Pages 193-204

  Lin, Xika ^a   Mukherji, Abhishek ^a   Rundensteiner, Elke A ^a   Ruiz, Carolina ^a   Ward, Matthew O ^a  

^a Worcester Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DATA MINING; DECISION MAKING;

ASSOCIATION MINING; BENCHMARK DATASETS; COMPACT REPRESENTATION; EXPERIMENTAL EVALUATION; ORDERS OF MAGNITUDE; PARAMETER SPACES; REAL TIME DECISION-MAKING; REDUNDANCY RESOLUTION;

REDUNDANCY;

EID: 84875098491     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2535569.2448953     Document Type: Article

References (21)

1. C. C. Aggarwal and P. S. Yu. A new approach to online generation of association rules. IEEE Trans. Knowl. Data Eng., 13(4):527-540, 2001.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487-499, 1994.
3. A. Asuncion and D. Newman. UCI ML repository. http://www.ics.uci.edu/mlearn/MLRepository.html, 2007.
4. C. Borgelt. Efficient apriori, eclat & fp-growth. http://www.borgelt.net.
5. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: generalizing association rules to correlations. SIGMOD Rec., 26(2):265-276, 1997.
6. S. Chaudhuri, H. Lee, and V. R. Narasayya. Variance aware optimization of parameterized queries. In SIGMOD, pages 531-542, 2010.
7. S. Duan, V. Thummala, and S. Babu. Tuning database configuration parameters with ituned. PVLDB, 2(1):1246-1257, 2009.
8. R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1994.
9. J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. VLDB '95, pages 420-431, 1995.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, pages 1-12, 2000.
11. M. Kaya and R. Alhajj. Online mining of fuzzy multidimensional weighted association rules. Applied Intelligence, 29:13-34, 2008.
12. M. Kubat, A. Hafez, V. V. Raghavan, J. R. Lekkala, and W. K. Chen. Itemset trees for targeted association querying. IEEE Trans. Knowl. Data Eng., 15(6):1522-1534, 2003.
13. X. Lin, A. Mukherji, E. A. Rundensteiner, C. Ruiz, and M. O. Ward. Paras. http://users.wpi.edu/mukherab/Dissertation/WPI-TR.pdf, 2012.
14. C. Lucchese, S. Orlando, R. Perego, and F. Silvestri. Webdocs: a real-life huge transactional dataset. In FIMI'04, 2004.
15. B. Nag, P. M. Deshpande, and D. J. DeWitt. Using a knowledge cache for interactive discovery of association rules. In KDD, pages 244-253, 1999.
16. R. Ng, L. V. S. Lakshmanan, J. Han, and T. Mah. Exploratory mining via constrained frequent set queries. SIGMOD Rec., 1999.
17. S. Sahar. Interestingness preprocessing. In ICDM, pages 489-496, 2001.
18. Wikipedia. Association rule mining wikipage. http://en.wikipedia.org/wiki/Associationrulelearning.
19. T. Wu, Y. Chen, and J. Han. Association mining in large databases: A re-examination of its measures. In PKDD, pages 621-628, 2007.
20. Xmdvtool home page. http://davis.wpi.edu/xmdv/, July 2012.
21. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD, 1997.