Abstract | ||
---|---|---|
Distributed Data Mining (DDM) generally deals with the mining of data within a distributed framework such as local area and wide area networks. One strong case for DDM systems is the need to mine for patterns in very large databases. This requires mandatory partitioning or splitting of databases into smaller sets which can be mined locally over distributed hosts. Data Distribution implies communication costs associated with the need to combine the results from processing local databases. This paper considers the development of a DDM system on a cluster. In specific we approach the problem of data partitioning for data mining. We present a prototype system for DDM using a data partitioning mechanism based on Bayesian mixture modeling. Results from comparison with standard techniques show plausible support for our system and its applicability. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11539506_151 | FSKD (1) |
Keywords | Field | DocType |
ddm system,data mining,large databases,data distribution,local area,prototype system,local databases,bayesian mixture modeling,wide area network,mandatory partitioning,very large database,mixture model | Data mining,Cluster (physics),Minimum message length,Regular expression,Mixture modeling,Computer science,Information extraction,Wide area network,Data partitioning,Distributed computing,Bayesian probability | Conference |
Volume | ISSN | ISBN |
3613 | 0302-9743 | 3-540-28312-9 |
Citations | PageRank | References |
3 | 0.52 | 2 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Murlikrishna Viswanathan | 1 | 21 | 6.30 |
Y. K. Yang | 2 | 4 | 1.22 |
T. K. Whangbo | 3 | 7 | 1.30 |