Decomposable algorithms for data mining

Most data mining algorithms have been designed and developed with the assumption that all the relevant data is resident at a single node of a computer network. In a networked environment the data relevant for a mining task may reside, in components, on a number of geographically distributed computer nodes. These databases cannot be easily moved to other network sites due to their size, ownership and security considerations. Mining algorithms, therefore, are needed that can decompose themselves to match the nature of data distribution across nodes and execute partial computations at local data sites and then compose these local summaries to construct global results. We present some mining algorithms having such dynamic decomposition capability.