Data and task parallelism in ILP using MapReduce

Machine Learning

Volumn 86, Issue 1, 2012, Pages 141-168

  Srinivasan, Ashwin ^a   Faruquie, Tanveer A ^b   Joshi, Sachindra ^b  

^a SOUTH ASIAN UNIVERSITY   (India)

^b IBM RESEARCH INDIA   (India)

Author keywords

ILP; MapReduce; Parallelism; Scaling up

Indexed keywords

COMPLEX PROBLEMS; CONSTRUCT MODELS; DATA PARALLELISM; DATA SET SIZE; DATA SETS; DIVERSE DOMAINS; EASE OF USE; ILP; MACHINE READABLE FORM; MAP-REDUCE; MULTIPLE SEARCH; PARALLELISM; PROGRAMMING MODELS; REAL-WORLD DATASETS; SCALING-UP; SEARCH SPACE SIZE; SEARCH SPACES; SET COVERINGS; TASK PARALLEL; TASK PARALLELISM; THEORETICAL FOUNDATIONS;

COMPUTER PROGRAMMING; ONTOLOGY; SEARCH ENGINES;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 84855678613     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-011-5245-8     Document Type: Conference Paper

References (40)

1. Appice, A.; Ceci, M.; Turi, A.; & Malerba, D. (2010). A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets. In Intelligent data analysis.
2. H. Blockeel L. De Raedt 1998 Top-down induction of first-order logical decision trees Artificial Intelligence 101 285 297 10.1016/S0004-3702(98)00034-4 0909.68034 1641475 (Pubitemid 128387397)
3. Botta, M.; Giordana, A.; Saitta, L.; & Sebag, M. (1999). Relational learning: Hard problems and phase transitions. In LNAI: Vol. 1792. Proceedings of the sixth congress AI AI (pp. 178-189). Berlin: Springer.
4. Camacho, R. (1994). Learning stage transition rules with Indlog. In S. Wrobel (Ed.), Proceedings of the fourth international inductive logic programming workshop. Gesellschaft für Mathematik und Datenverarbeitung MBH, GMD-Studien Nr. 237.
5. Cardoso, P. M.; & Zaverucha, G. (2006). Comparative evaluation of approaches to scale up ilp. In International conference on inductive logic programming (pp. 37-39).
6. Chu, C. T.; Kim, S. K.; Lin, Y. A.; Yu, Y.; Bradski, G. R.; Ng, A. Y.; & Olukotun, K. (2006). Map-reduce for machine learning on multicore. In NIPS (pp. 281-288).
7. Chu, C.-T.; Kim, S. K.; Lin, Y.-A.; Yu, Y.; Bradski, G. R.; Ng, A. Y.; & Olukotun, K. (2006). Map-reduce for machine learning on multicore. In NIPS (pp. 281-288). Cambridge: MIT Press.
8. Clare, A.; & King, R. D. (2003). Data mining the yeast genome in a lazy functional language. In Proceedings of the 5th international symposium on practical aspects of declarative languages (pp. 19-36). (Pubitemid 137629995)
9. V. S. Costa A. Srinivasan R. C. Camacho H. Blockeel B. Demoen G. Janssens J. Struyf H. Vandecasteele W. Van Laer 2003 Query transformations for improving the efficiency of ILP systems Journal of Machine Learning Research 4 8 465 491 (Aug)
10. De Raedt, L.; & Bruynooghe, M. (1991). Clint: a multistrategy interactive concept-learner and theory revision system. In Proceedings of the 1st international workshop on multistrategy learning (pp. 175-191).
11. J. Dean S. Ghemawat 2008 Mapreduce: simplified data processing on large clusters Communications of the ACM 51 1 107 113 10.1145/1327452.1327492
12. N. Fonseca A. Srinivasan F. Silva R. Camacho 2008 Parallel ILP for distributed-memory architectures Machine Learning Journal 10.1007/s10994-008- 5094-2
13. C. A. R. Hoare 1993 Programs are predicates ICOT Journal 38 2 15
14. Hoefler, T.; Lumsdaine, A.; & Dongarra, J. (2009). Towards efficient mapreduce using mpi. In Proceedings of the 16th European PVM/MPI users' group meeting on recent advances in parallel virtual machine and message passing interface (pp. 240-249).
15. J. J. Irwin B. K. Shoichet 2004 Zinc-a free database of commercially available compounds for virtual screening Journal of Chemical Information and Modeling 45 1 177 182 10.1021/ci049714+ (Pubitemid 40736970)
16. M. Kearns 1998 Efficient noise-tolerant learning from statistical queries Journal of the ACM 45 983 1006 10.1145/293347.293351 1065.68605 1678849
17. King, R. D.; Muggleton, S. H.; Srinivasan, A.; & Sternberg, M. J. E. (1996). Structure-activity relationships derived by machine learning: the use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. In Proc. of the national academy of sciences (Vol. 93, pp. 438-442). (Pubitemid 26038172)
18. R. D. King A. Srinivasan 1996 Prediction of rodent carcinogenicity bioassays from molecular structure using inductive logic programming Environmental Health Perspectives 104 5 1031 1040 10.1289/ehp.96104s51031 (Pubitemid 26402347)
19. Ho, E. K. Y.; Knobbe, A.; & Malik, R. (2005). Ilp 2005 challenge: the safarii mrdm environment. In Proceedings late-breaking papers track ILP (p. 2005).
20. R. Lämmel 2007 Google's mapreduce programming model-revisited Science of Computer Programming 68 3 208 237
21. Miceli, C.; Miceli, M.; Jha, S.; Kaiser, H.; & Merzky, A. (2009). Programming abstractions for data intensive computing on clouds and grids. In Proceedings of the 2009 9th IEEE/ACM international symposium on cluster computing and the grid, CCGRID'09 (pp. 478-483).
22. G. A. Miller R. Beckwith C. Fellbaum D. Gross K. J. Miller 1990 Introduction to wordnet: an on-line lexical database International Journal of Lexicography 3 4 235 244 10.1093/ijl/3.4.235
23. S. Muggleton 1994 Inductive logic programming: derivations, successes and shortcomings SIGART Bulletin 5 1 5 11 10.1145/181668.181671
24. S. Muggleton 1995 Inverse entailment and progol New Generation Computing 13 245 286 10.1007/BF03037227
25. Muggleton, S. H.; & Feng, C. (1990). Efficient induction of logic programs. In Proceedings of the first conference on algorithmic learning theory. Tokyo: Ohmsha.
26. Muggleton, S. H.; Almeida Santos, J. C.; & Tamaddoni-Nezhad, A. (2008). Toplog: ILP using a logic program declarative bias. In ICLP (pp. 687-692).
27. Lavrač, N.; Flach, P.; & Zupan, B. (1999). Rule evaluation measures: a unifying view. In Proceedings of ninth international workshop on ILP (Vol. 1634, pp. 174-185). Berlin: Springer.
28. Naish, L.; & Sterling, L. (2000). Stepwise enhancement and higher-order programming in prolog. Journal of Functional and Logic Programming, 4. MIT Press, March.
29. Pavlo, A.; Paulson, E.; Rasin, A.; Abadi, D. J.; DeWitt, D. J.; Madden, S.; & Stonebraker, M. (2009). A comparison of approaches to large-scale data analysis. In Proceedings of the 35th SIGMOD international conference on management of data, SIGMOD'09 (pp. 165-178).
30. Plotkin, G. D. (1971). Automatic methods of inductive inference. Ph.D. thesis, Edinburgh University, August.
31. J. R. Quinlan 1990 Learning logical definitions from relations Machine Learning 5 239 266
32. Shi, Y. (1996). Re-evaluating Amdahl's law and Gustafson's law. Available at http://www.cis.temple.edu/shi/docs/amdahl/amdahl.html.
33. Specia, L.; Srinivasan, A.; Ramakrishnan, G.; & Nunes, M. (2007). Word sense disambiguation with ILP. In LNAI: Vol. 4455. Proceedings of the sixteenth international conference on inductive logic programming (pp. 409-423).
34. A. Srinivasan 1999 A study of two sampling methods for analysing large datasets with ILP Data Mining and Knowledge Discovery 3 1 95 123 10.1023/A:1009824123462
35. Srinivasan, A. (1999). The Aleph manual. Available at http://www.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/.
36. Srinivasan, A. (2000). A study of two probabilistic methods for searching large spaces with ILP. Technical Report PRG-TR-16-00, Oxford University Computing Laboratory, Oxford.
37. Srinivasan, A.; & Kothari, R. (2005). A study of applying dimensionality reduction to restrict the size of a hypothesis space. In LNAI: Vol. 3625. Proceedings of the fifteenth international conference on inductive logic programming (ILP2005) (pp. 348-365). Berlin: Springer. (Pubitemid 41480002)
38. N. A. Fonseca R. Camacho R. Rocha V. S. Costa 2008 Compile the hypothesis space: do it once, use it often Fundamenta Informaticae 89 45 67 1155.68485 Special issue on multi-relational data mining
39. Wang, Y.; & Skillicorn, D. (2000). Parallel inductive logic for data mining. In Proceedings on distributed and parallel knowledge discovery, KDD2000. New York: ACM.
40. Zelezny, F.; Srinivasan, A.; & Page, C. D. (2002). Lattice-search runtime distributions may be heavy-tailed. In LNAI. Proceedings of the twelfth international conference on inductive logic programming (ILP2002).