EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/1932

Full metadata record

DC FieldValueLanguage
dc.contributor.authorGupta, S K-
dc.contributor.authorSomayajulu, D V L N-
dc.contributor.authorArora, J K-
dc.contributor.authorVasudha, B-
dc.identifier.citationDatabase and Expert Systems Applications, Proceedings Ninth International Workshop on, 246 - 251p.en
dc.description.abstractThe paper presents an algorithm to solve the problem of classification for data mining applications. This is a decision tree classifier which uses modified gini index as the partitioning criteria. A pre-sorting technique is used to overcome the problem of sorting at each node of the tree. This technique is integrated with a breadth first tree growth strategy which enables us to calculate the best partition for each of the leaf nodes in a single scan of a database. We have implemented this algorithm using depth first tree growth strategy also. The algorithm uses a dynamic pruning approach which reduces the number of scans of the database and does away with a separate tree pruning phase. The proof of correctness, analysis and performance study are also presenteden
dc.format.extent64569 bytes-
dc.subjectdata mining applicationsen
dc.subjectdynamic pruningen
dc.titleScalable classifiers with dynamic pruningen
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
guptasca1998.pdf63.06 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback