S.S. Anand, C.M. Shapcott, D.A. Bell, J.G. Hughes. Data Mining in Parallel, World Occam and Transputer User Group Conference, April, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Parallel, Multithreaded Decision Tree Builder - Narlikar (1998) (1 citation) (Correct)
....(MB) Problem Size (in thousands) p=1 p=4 p=8 Figure 5: The variation of the memory requirement with the size of the input data, for different numbers of processors. 5 Related Work In the recent past, there has been a fair amount of research on parallelizing data mining applications in general [11, 34, 19, 2, 4, 8, 5, 9, 24, 38, 10, 23]. However, a fewer number of parallel decision tree builders have been presented [33, 12, 22, 18] For example, the SPRINT tree building algorithm [33] is designed to efficiently handle out of core data. Because sorts on out of core data are expensive, it pre sorts the data at the beginning of the ....
S. S. Anand, C. Shapcott, D. Bell, and J. Hughes. Data mining in parallel. In Proceedings of WoTUG18: Transputer and occam Developments, volume 44, pages 113--124, April 1995.
Evidential Techniques in Parallel Database Mining - Anand Bell Hughes Self-citation (Anand Shapcott Bell Hughes) (Correct)
....due to the fact that methods required to achieve the goal of discovering knowledge are complex and data intensive. In this paper we explain how high performance computing can play a vital role in DM and discuss the implementation of a specific algorithm, STRIP (Strong Rule Induction in Parallel) [ANAN94b, ANAN95] developed by the authors for the discovery of Strong or almost exact rules from databases. STRIP is the first algorithm to be implemented within a parallel framework for Database Mining based on Evidence Theory (EDM) ANAN94a] developed by the authors. In an earlier paper we discussed the ....
....STRIP is the first algorithm to be implemented within a parallel framework for Database Mining based on Evidence Theory (EDM) ANAN94a] developed by the authors. In an earlier paper we discussed the different levels of parallelism within STRIP and demonstrated them using a transputer network [ANAN95]. In this paper we discuss the implementation of STRIP on a cluster of Silicon Graphics Workstations connected using an ATM network. 1. INTRODUCTION Traditionally, organisations have used databases to record details of their day to day activities and to produce reports for management. The mass ....
[Article contains additional citation context not shown here]
S.S. Anand, C.M. Shapcott, D.A. Bell, J.G. Hughes. Data Mining in Parallel, World Occam and Transputer User Group Conference, April, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC