Distributed Communication Decision Tree Algorithm for Disseminated and Heterogeneous Environment

Chandra Chandra; P. Ajitha

doi:10.4028/www.scientific.net/AMR.403-408.1002

Paper Titles

Spectral Splitting of Speech by Wavelet Packets to Shrink Simultaneous Masking
p.970

Image Processing Method Based on GIS System for Better Disaster Manag Ement
p.976

Communication and Control through Words and Power
p.982

An Advanced Security and Data Integrity Protocol for Vehicular Ad-Hoc Networks
p.994

Distributed Communication Decision Tree Algorithm for Disseminated and Heterogeneous Environment
p.1002

Techniques for Refreshing Images in Web Documents
p.1008

HMM Based Enhanced Security System for ATM Payments
p.1014

Comparative Study of Frequent Pattern Mining Techniques
p.1022

BER Performance Improvement in Coded-OFDM Systems Using Equalization Algorithms
p.1028

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 403-408Distributed Communication Decision Tree Algorithm...

Distributed Communication Decision Tree Algorithm for Disseminated and Heterogeneous Environment

Abstract:

Current Classification algorithms require large amounts of data to be stored enduringly in the memory for long assortment and amount of time. Diverse classification techniques had been already proposed in the literature for both in the run of the mill environment and distributed environment. Mining of decision trees in the distributed environment can be able to handle the large amount of data but with high communication cost. A new distributed communication decision tree algorithm is proposed here which reduces the communication cost for the transmission of the data in the distributed and heterogeneous environment.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

1002-1007

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.403-408.1002

Citation:

Cite this paper

Online since:

November 2011

Authors:

Chandra Chandra, P. Ajitha

Keywords:

Communication Cost, Decision Tree, Distributed Data Mining, Distributed Decision Trees Algorithms

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Amir Bar-Or, Assaf Schuster, Ran Wolff, Daniel Keren, Decision Tree Induction in High Dimensional, Hierarchically Distributed Databases.

DOI: 10.1137/1.9781611972757.42

Google Scholar

[2] Chris Gianella, Kun Liu, Todd Olsen, Hillol Kargupta, Communication efficient construction of Decision trees over heterogeneously distributed data, proceedings of the fourth IEEE international Conference on data mining.

DOI: 10.1109/icdm.2004.10114

Google Scholar

[3] Dietterich, T, An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, Boosting and randomization,. Machine Learning, 40(2): 139-158.

Google Scholar

[4] Hairong Qi, Tsei-Wei Wang,J. Douglas Birdwell, Global Principal Component Analysis for Dimensionality Reduction in distributed data mining.

DOI: 10.1201/9780203497159.ch19

Google Scholar

[5] Mevlut Ture, Fusun Tokatli, Imran Kurt, Using Kaplan-Meir analysis together with decision tree methods in determining recurrence free survival of breast cancer patients, Expert Systems with applications 36(2009) 2017-(2026).

DOI: 10.1016/j.eswa.2007.12.002

Google Scholar

[6] Shonali Krishnasamy, Seng W. Loke, Arkady Zaslasvky, "A Hybrid Model for improving Response Time in Distributed Data.

Google Scholar