Skip to main content

Why Use Machine Learning?

Consider how you would write a spam filter using traditional programming techniques (Figure 1-1):

1. First you would look at what spam typically looks like. You might notice that

some words or phrases (such as “4U,” “credit card,” “free,” and “amazing”) tend to

come up a lot in the subject. Perhaps you would also notice a few other patterns

in the sender’s name, the email’s body, and so on.

2. You would write a detection algorithm for each of the patterns that you noticed,

and your program would flag emails as spam if a number of these patterns are

detected.

3. You would test your program, and repeat steps 1 and 2 until it is good enough.


Since the problem is not trivial, your program will likely become a long list of com‐

plex rules—pretty hard to maintain.

In contrast, a spam filter based on Machine Learning techniques automatically learns

which words and phrases are good predictors of spam by detecting unusually fre‐

quent patterns of words in the spam examples compared to the ham examples

(Figure 1-2). The program is much shorter, easier to maintain, and most likely more

accurate 


Moreover, if spammers notice that all their emails containing “4U” are blocked, they

might start writing “For U” instead. A spam filter using traditional programming

techniques would need to be updated to flag “For U” emails. If spammers keep work‐

ing around your spam filter, you will need to keep writing new rules forever.

In contrast, a spam filter based on Machine Learning techniques automatically noti‐

ces that “For U” has become unusually frequent in spam flagged by users, and it starts

flagging them without your intervention (Figure 1-3).


Another area where Machine Learning shines is for problems that either are too com‐

plex for traditional approaches or have no known algorithm. For example, consider

speech recognition: say you want to start simple and write a program capable of dis‐

tinguishing the words “one” and “two.” You might notice that the word “two” starts

with a high-pitch sound (“T”), so you could hardcode an algorithm that measures

high-pitch sound intensity and use that to distinguish ones and twos. Obviously this

technique will not scale to thousands of words spoken by millions of very different

people in noisy environments and in dozens of languages. The best solution (at least

today) is to write an algorithm that learns by itself, given many example recordings

for each word.

Finally, Machine Learning can help humans learn (Figure 1-4): ML algorithms can be

inspected to see what they have learned (although for some algorithms this can be

tricky). For instance, once the spam filter has been trained on enough spam, it can

easily be inspected to reveal the list of words and combinations of words that it

believes are the best predictors of spam. Sometimes this will reveal unsuspected cor‐

relations or new trends, and thereby lead to a better understanding of the problem.

Applying ML techniques to dig into large amounts of data can help discover patterns

that were not immediately apparent. This is called data mining.

To summarize, Machine Learning is great for:
• Problems for which existing solutions require a lot of hand-tuning or long lists of
rules: one Machine Learning algorithm can often simplify code and perform bet‐
ter.
• Complex problems for which there is no good solution at all using a traditional
approach: the best Machine Learning techniques can find a solution.
• Fluctuating environments: a Machine Learning system can adapt to new data.
• Getting insights about complex problems and large amounts of data.


Comments

Popular posts from this blog

What is Machine Learning

 The term machine learning (ML) as a part of artificial intelligence is ubiq- uitous nowadays. The term is used for a wide number of various appli- cations and methods that deal with the “generation of knowledge from experience”. The well-known US computer scientist Tom Mitchell defines machine learning as follows: A computer program is said to learn from experience E with respect to some class of tasks T and performance measure P, if its performance at tasks in T, as measured by P, improves with experience E (Mitchell 1997). An illustrative example of this would be a chess computer program that improves its performance (P) in playing chess (the task T) by experience (E), by playing as many games as possible (even against itself ) and analysing them (Mitchell 1997). Machine learning is not a fundamentally new approach for machines to generate “knowledge” from experience. Machine learning technology was used to filter out junk e-mails a long time ago. Whilst spam filters that tack- ...

Possible Limitations of AI-Based Bots

 The examples above already show the present-day potential of AI-based bots. At present, these systems are still in an early stage and still have certain limitations and potentials for optimisation. Twitter Bot Tay by Microsoft Most bots at present are reactive service bots. Engagement bots that actively interact with the users as market and brand ambassadors go one step further. The most famous example here is the chatbot Tay by Microsoft. Microsoft removed Tay from the web apologetically within one day. The example shows that the uncontrolled training of bots by the community can lead to fatal consequences. AI systems still have to learn ethical standards. It thus becomes apparent that even bots require a kind of guideline. Like a journalist has to observe editorial guidelines, bots have to observe certain standards. The next generation of AI-based bots must control and create the possible room for communication. IBM Watson has been able to celebrate quite a few respectable resul...

Random Forest Classifier

  The algorithm gradient boosted regression trees, also called random forests, belong to the ensemble learning methods This classifier uses an ensemble of weak regression trees that have a low hit quota when considered in isola- tion. The quality of the prediction can be improved significantly when vari- ous trees are trained with different parameters or samples. The results of the individual trees are aggregated to a total result which then enables a more balanced and high-quality prediction. The so-called bagging triggered a boom of the traditional regression trees. As aggregation, either a majority vote or a probability function is chosen (Fig. 5.5). The lead prediction generates high-conversion leads because • The entire spectrum of information available about a company is inte- grated into the decision-making; • The data is highly topical and without bias; • The random forest is capable of abstracting complex correlations in the data; and • The method learns iteratively from t...