Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Efficient probability density balancing for supporting distributed knowledge discovery in large databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Obradovic, D. ; Corp. Technol., Inf. & Commun., Siemens AG, Munich, Germany ; Obradovic, Z.

For the data received online from a source with an unknown probability distribution, the question addressed in this article is how to efficiently partition it to smaller representative subsets (databases) and how to organize these data subsets in order to minimize the computational cost of the later data analysis. The proposed linear-time, online problem decomposition method achieves these objectives through balancing probability distributions of the individual disjoint data subsets, each aimed at approximating the original data-source distribution. Consequently, computationally efficient statistical data analysis and neural network modelling on data subsets fitting into a computer central memory will produce results similar to these obtained through a global, computationally infeasible data analysis. In addition, the proposed decomposition scheme enables for an effective distributed data analysis on a network of workstations

Published in:

Neural Networks, 1999. IJCNN '99. International Joint Conference on  (Volume:4 )

Date of Conference: