Abstract
AbstractThis paper provides a unified description of Widening, a framework for the use of parallel (or otherwise abundant) computational resources to improve model quality. We discuss different theoretical approaches to Widening with and without consideration of diversity. We then soften some of the underlying constraints so that Widening can be implemented in real world algorithms. We summarize earlier experimental results demonstrating the potential impact as well as promising implementation strategies before concluding with a survey of related work.
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference66 articles.
1. Agrawal R (1994) Fast algorithms for mining association rules. In: the Proceedings of 20th international conference on very large databases (VLDB), pp 487–499
2. Agrawal R, Shafer JC (1996) Parallel mining of association rules. IEEE Trans Knowl Data Eng 8(6):962–969
3. Akbar Z, Ivanova VN, Berthold MR (2012) Parallel data mining revisited. better, not faster. In: Hollmén J, Klawonn F, Tucker A (eds) Advances in intelligent data analysis XI. Springer Berlin Heidelberg, Berlin, pp 23–34
4. Akl SG (2002) Parallel real-time computation: sometimes quantity means quality. Comput Inform 21:455–487
5. Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献