Distributed Nearest Neighbor-Based Condensation of Very Large Data Sets

In this work, the parallel fast condensed nearest neighbor (PFCNN) rule, a distributed method for computing a consistent subset of a very large data set for the nearest neighbor classification rule is presented. In order to cope with the communication overhead typical of distributed environments and...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on knowledge and data engineering Vol. 19; no. 12; pp. 1593 - 1606
Main Authors:	Angiulli, F., Folino, G.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2007 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms and association rules Cellular neural networks Classification Clustering Collection Computation Concurrent computing Condensing Cost analysis Costs Data mining Data reduction Distributed algorithms Distributed computing Distributed systems Grid computing Nearest neighbor searches Neural networks Clustering classification Data mining Distributed systems and association rules
ISSN:	1041-4347, 1558-2191
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!