I work on Dendritic Cell Algorithm (DCA) for classification of binary data, but I do not understand some of its parts:

I'm going to use DCA for detecting spam SMS. So, I generate signals from the output of two ML algorithms (for example Naive Bayes and SVM) with confidence for each SMS. After that, run DCA for select DC that migrate. (Training phase)

Well, now, how do I determine the type of new SMS? (Test phase) Suppose the new SMS is not like any previous one.

I need an implementation in Python, C++ or Java.

Jason Brownlee provides an example of the Dendritic Cell Algorithm implemented in the Ruby Programming Language. The problem is a contrived anomaly-detection problem with ordinal inputs x range [0,50), where values that divide by 10 with no remainder are considered anomalies. Probabilistic safe and danger signal functions are provided, suggesting danger signals correctly with P(danger)=0.70, and safe signals correctly with P(safe)=0.95. (http://www.cleveralgorithms.com/nature-inspired/immune/dca.html), But my previous ambiguity has not been resolved yet. 

When he wants to test its implementation, it uses the same data as previously trained the system. This is a mistake when new data is entered.

Can anybody explain this situation for me?

Thanks

More Mohsen Rahmanian's questions See All
Similar questions and discussions