Abstract
The paper presents computer system, named Decision Tree Builder and Visualizer (DTB&V), that allows to use large databases as source for whole process of decision tree generation and visualization. The system works with discrete and continuous attributes. DTB&V is a general tool allowing for: data preprocessing, generation of decision tree using developed algorithm, post processing (cutting the tree), and visualization of the obtained tree. DTB&V was tested using a number of databases commonly used for such tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agraval R., Ghosh S., Imielinski T., Iyer B., Swami A., “An Interval Classifier for Database Mining Applications”, VLDB 92, Vancouver, 1992, 560–573.
Agrawal R., Srikant R., “Fast algorithms for mining association rules in large databases”, in VLDB ‘84, 1994
Database TCPIP — http://kdd.ics.uci.edu/databases/kddcup99.
Databases STATLOG — http://www.ics.uci.edu/—mlearn/MLRepository.html.
Doczekalski M., “Techniki pozyskiwania wiedzy z baz danych” (Data Mining Techniques), Master Thesis, Department of Computer Science, Wroclaw, 2001.
Fayyad U.M., Piatetetsky-Shapiro G., Smyth P., Uthurusamy R., “Advances in Knowledge Discovery and Data Mining”, Cambridge MA, 1996.
IBM’s Data Mining Technology, White Paper, 1996.
Mehta M., Agrawal R., Risanen J., “SLIQ: A fast scalable classifier for data mining”, In Proc. of the Fifth International Conference on Extending Database Technology, Avi-gnon, 1996.
Mehta M., Rissanen J., Agrawal R., “MDL-based decision tree pruning”, in International Conference on Knowledge Discovery in Databases and Data Mining, Montreal, 1995.
Piatetsky-Shapiro G., Frawley W., “Knowledge Discovery from Databases”, Cambridge, 1991.
Quinlan J. R., “Induction of decision trees”, in Machine Learning, 1986.
Shafer J. C., Agrawal R., Mehta M., “SPRINT: A scalable parallel classifier for data min-ing”, Proc. of International Conference on Very Large Databases, Bombay, 1996.
Srikant R., Agrawal R., “Mining Generalized Association Rules”, w Proceedings of the 21“ International Conference on Very Large Databases, September 1995.
Stolfo J. S., Fan W., Lee W., Prodromidis A., Chan P. K. K., “Cost-based Modeling and Evaluation for Data Mining With Application to Fraud and Intrusion Detection: Results from the JAM Project”, 1999.
Wallace C., Patrick J., “Coding decision trees”, in Machine Learning, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwaśnicka, H., Doczekalski, M. (2002). Decision Tree Builder and Visualizer. In: Kłopotek, M.A., Wierzchoń, S.T., Michalewicz, M. (eds) Intelligent Information Systems 2002. Advances in Soft Computing, vol 17. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1777-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1777-5_4
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1509-2
Online ISBN: 978-3-7908-1777-5
eBook Packages: Springer Book Archive