Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re^2: RFC: Presentation on Machine Learning with Perl

by lin0 (Curate)
on Jul 05, 2007 at 21:06 UTC ( #625126=note: print w/replies, xml ) Need Help??

in reply to Re: RFC: Presentation on Machine Learning with Perl
in thread RFC: Presentation on Machine Learning with Perl

Hi bibliophile,

It is a very good thought, indeed. However, you would need to think carefully and extensively on what kind of features the articles you are interested in have in common. You could use some sort of data clustering (FCM, maybe?) to help you with this task. You would then need to find a way to extract those features consistently. Finally, you could use a classifier to filter the raw data and present you only with the stuff you are interested in. When you design the classifier, try to incorporate a confidence index that tells you how reliable the results are. In this way, you could play with the outputs until you are happy with the results. Does it make sense?


  • Comment on Re^2: RFC: Presentation on Machine Learning with Perl

Replies are listed 'Best First'.
Re^3: RFC: Presentation on Machine Learning with Perl
by bibliophile (Parson) on Jul 06, 2007 at 15:10 UTC
    It does make sense... at least as far as my (quite limited) knowledge of ML goes :-)

    One of my always-backburnered thoughts was to build a neural-net-backed "observer" that would watch my browsing habits for a few months, noting things like how long I spend on a particular page, whether I follow links from it, etc., and from that be able to make predictions on stuff I might be interested in.

    One of these days^H^H^H^Hyears....

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://625126]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (4)
As of 2020-10-27 13:13 GMT
Find Nodes?
    Voting Booth?
    My favourite web site is:

    Results (256 votes). Check out past polls.