Distributed Data-Mining by Probability-Based Patterns
In this paper a new method is suggested for
distributed data-mining by the probability patterns. These patterns
use decision trees and decision graphs. The patterns are cared to be
valid, novel, useful, and understandable. Considering a set of
functions, the system reaches to a good pattern or better objectives.
By using the suggested method we will be able to extract the useful
information from massive and multi-relational data bases.
@article{"International Journal of Information, Control and Computer Sciences:56822", author = "M. Kargar and F. Gharbalchi", title = "Distributed Data-Mining by Probability-Based Patterns", abstract = "In this paper a new method is suggested for
distributed data-mining by the probability patterns. These patterns
use decision trees and decision graphs. The patterns are cared to be
valid, novel, useful, and understandable. Considering a set of
functions, the system reaches to a good pattern or better objectives.
By using the suggested method we will be able to extract the useful
information from massive and multi-relational data bases.", keywords = "Data-mining, Decision tree, Decision graph, Pattern,Relationship.", volume = "4", number = "2", pages = "257-4", }