Sixth IEEE International Conference on Computer and Information Technology (CIT'06) Incremental algorithm for Distributed Data Mining Seoul, Korea September 20-September 22 ISBN: 0-7695-2687-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2006.105
The necessity of computational grid is driven by large volumes of data. Such grids are designed giving more emphasis on the efficiency of computation. Data set is divided into a number of sets and sent to a number of processing data nodes. This way of dividing the data sets for parallel computing is heavily applied in grids. But only dividing the datasets is no way, in the real sense, an improvement in efficiency. Unless we have efficient algorithms to process the data, just applying the strategy of computational parallelism will only ask for more and more computational resources. Here we present one such algorithm for the task of data classification.
Citation:
Prakash Kadel, Ho-Jin Choi, "Incremental algorithm for Distributed Data Mining," cit, pp.72, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb