Name
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 |
Year | Venue | Keywords |
|---|---|---|
1997 | AAAI/IAAI | single site,data-ownership concern,data situation,pattern discovery algorithm,pattern discovery,general issue,decision-tree induction algorithm,independent databases,computer network,needed data,distributed database |
Field | DocType | ISBN |
Adaptability,Data mining,Information retrieval,Computer science,Artificial intelligence,Distributed database,Machine learning | Conference | 0-262-51095-2 |
Citations | PageRank | References |
15 | 1.44 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raj Bhatnagar | 1 | 191 | 39.25 |
| Sriram Srinivasan | 2 | 379 | 27.92 |