|
EPrints@IIT Delhi >
Faculty Research Publicatons >
Computer Science and Engineering >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2074/1932
|
| Title: | Scalable classifiers with dynamic pruning |
| Authors: | Gupta, S K
Somayajulu, D V L N
Arora, J K
Vasudha, B |
| Keywords: | data mining applications
dynamic pruning |
| Issue Date: | 1998 |
| Citation: | Database and Expert Systems Applications, Proceedings Ninth International Workshop on, 246 - 251p. |
| Abstract: | The 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 presented |
| URI: | http://eprint.iitd.ac.in/dspace/handle/2074/1932 |
| Appears in Collections: | Computer Science and Engineering
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| guptasca1998.pdf | | 63Kb | Adobe PDF | View/Open |
|
Show full item record
All items in DSpace are protected by copyright, with all rights reserved.
|
