Enhanced Anytime Algorithm for Induction of Oblivious Decision Trees

author: Albina Saveliev, Ben-Gurion University of the Negev
published: Jan. 29, 2008,   recorded: September 2007,   views: 4431

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

Real-time data mining of high-speed and non-stationary data streams has a large potential in such fields as efficient operation of machinery and vehicles, wireless sensor networks, urban traffic control, stock data analysis etc.. These domains are characterized by a great volume of noisy, uncertain data, and restricted amount of resources (mainly computational time). Anytime algorithmsoffer a tradeoff between solution quality and computation time, which has proveduseful in applying artificial intelligence techniques to time-critical problems. Inthis paper we are presenting a new, enhanced version of an anytime algorithm forconstructing a classification model called Information Network (IN). The algorithmimprovement is aimed at reducing its computational cost while preservingthe same level of model quality. The quality of the induced model is evaluatedby its classification accuracy using the standard 10-fold cross validation. Theimprovement in the algorithm anytime performance is demonstrated on severalbenchmark data streams.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: