Orange Forum • View topic - Real Time Orange

Real Time Orange

A place to ask questions about methods in Orange and how they are used and other general support.

Real Time Orange

Postby Guest » Wed Apr 27, 2005 10:45

Hi there,

My project has a time critical consideration of processing within 330ms. I realize that to comment on an application specific instance would be difficult at best, but if you might offer any info as best you can...

Generally speaking, and taking in to consideration very astute pre-processing by me, would orange's algorithms' be viable for time critical criteria?

What would be the algorithm(s) with the least computational time /memory cost?

I have a 3.6Ghz, 800fsb, and 3G ram on an optimized linux kernel

Thank you very much for your input.

Postby Blaz » Wed Apr 27, 2005 12:08

Your qustion is hard, if not impossible to answer. Namely, it all depends what you do, and how much data you will process. Orange is in principle very fast (C++ core), but there is no guarantee that this would be fast enough for what you need. Best is to do some experimentation first. Also, wrt "real time", you should be able to predict runtime for some algorithms (like naive bayes), but not for the others (like decision trees, or any iterative algorithms).

Postby Guest » Wed Apr 27, 2005 13:32

Thanks Blaz,

You've helped.

Return to Questions & Support