Pattern discovery in distributed databases

Authors:
Raj Bhatnagar;Sriram Srinivasan
Affiliations:
ECECS Department,, University of Cincinnati, Cincinnati, OH;ECECS Department,, University of Cincinnati, Cincinnati, OH
Venue:
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Year:
1997

Citing 8
Cited 8

Optimization of distributed tree queries

Journal of Computer and System Sciences
A Further Comparison of Splitting Rules for Decision-Tree Induction

Machine Learning
BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Intelligent Query Answering by Knowledge Discovery Techniques

IEEE Transactions on Knowledge and Data Engineering
On the Complexity of Distributed Query Optimization

IEEE Transactions on Knowledge and Data Engineering
An Empirical Comparison of Pruning Methods for Decision Tree Induction

Machine Learning
An Empirical Comparison of Selection Measures for Decision-Tree Induction

Machine Learning
Induction of Decision Trees

Machine Learning

High performance data mining (tutorial PM-3)

Tutorial notes of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Distributed, Collaborative Data Analysis from Heterogeneous Sites Using a Scalable Evolutionary Technique

Applied Intelligence
Analysis and synthesis of agents that learn from distributed dynamic data sources

Emergent neural computational architectures based on neuroscience
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources

Emergent Neural Computational Architectures Based on Neuroscience - Towards Neuroscience-Inspired Computing
Parallel and Distributed Data Mining: An Introduction

Revised Papers from Large-Scale Parallel Data Mining, Workshop on Large-Scale Parallel KDD Systems, SIGKDD
A Framework for Learning from Distributed Data Using Sufficient Statistics and Its Application to Learning Decision Trees

International Journal of Hybrid Intelligent Systems
Decomposable algorithms for nearest neighbor computing

Journal of Parallel and Distributed Computing
Algorithms and software for collaborative discovery from autonomous, semantically heterogeneous, distributed information sources

ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most algorithms for learning and pattern discovery in data assume that all the needed data is available on one computer at a single site. This assumption does not hold in situations where a number of independent databases reside on geographically distributed nodes of a computer network. These databases cannot be moved to a single site due to size, security, privacy and data-ownership concerns but all of them together constitute the dataset in which patterns must be discovered. Some pattern discovery algorithms can be adapted to such situations and some others become inefficient or inapplicable. In this paper we show how a decision-tree induction algorithm may be adapted for distributed data situations. We also discuss some general issues relating to the adaptability of other pattern discovery algorithms to distributed data situations