Re: Future of Frequent Pattern Mining

2014-04-27 Thread Michael Wechner
Hi Sebastian Thanks for your reply. I agree that makes sense. I am not familiar enough with the codebase of Mahout, but generally speaking it might make sense to "modularize" it somehow, such that algorithms like the fpgrowth code could be downloaded separately independent of the core codebase.

Re: Reading the wiki

2014-04-27 Thread Sebastian Schelter
Would someone be willing to open a jira ticket for this issue and fix the problem? --sebastian On 04/28/2014 01:05 AM, Ted Dunning wrote: Mathjax is both static content and server. There is an FAQ about this https problem. I think that part of the issue is that they don't use the same URL fo

Re: Future of Frequent Pattern Mining

2014-04-27 Thread Sebastian Schelter
Hi Michael, the problem is that currently nodoby is maintaining the fpgrowth code anymore or working on documentation for it, that's why we consider it to be a candidate for removal. I don't see much value in keeping algorithms in the codebase if nobody is maintaining them, answering questions

Re: Future of Frequent Pattern Mining

2014-04-27 Thread Michael Wechner
what is the alternative and if one would still want to use the "frequent pattern mining code" in the future, how would this be possible otherwise? Thanks Michael Am 28.04.14 08:19, schrieb Sebastian Schelter: > Hi, > > I'm resending this mail to also include the users list. To wrap up: We > curr

Future of Frequent Pattern Mining

2014-04-27 Thread Sebastian Schelter
Hi, I'm resending this mail to also include the users list. To wrap up: We currently have a discussion whether our frequent pattern mining package should stay in the codebase. The original author suggested to remove the original implementation and maybe retain the FPGrowth2 implementation. I

Re: Understanding LogLikelihood Similarity

2014-04-27 Thread Ted Dunning
Excellent. Look forward to hearing your reactions. On Mon, Apr 28, 2014 at 1:14 AM, Mario Levitin wrote: > Not yet, but I will. > > > > > Have you read my original paper on the topic of LLR? It explains the > > connection with chi^2 measures of association. >

Re: Understanding LogLikelihood Similarity

2014-04-27 Thread Mario Levitin
Not yet, but I will. Thanks On Mon, Apr 28, 2014 at 2:01 AM, Ted Dunning wrote: > On Mon, Apr 28, 2014 at 12:30 AM, Mario Levitin >wrote: > > > I'm trying to give it a probabilistic interpretation in order to > understand > > the logic behind. Any probabilistic interpretation should define ran

Re: Reading the wiki

2014-04-27 Thread Ted Dunning
Mathjax is both static content and server. There is an FAQ about this https problem. I think that part of the issue is that they don't use the same URL for both http and https connections. http://www.mathjax.org/resources/faqs/#problem-https The URL that they suggest to use for getting mathjax.

Re: Understanding LogLikelihood Similarity

2014-04-27 Thread Ted Dunning
On Mon, Apr 28, 2014 at 12:30 AM, Mario Levitin wrote: > I'm trying to give it a probabilistic interpretation in order to understand > the logic behind. Any probabilistic interpretation should define random > variables, events, etc. However, my attempts in this respect have been > unsuccessful. >

Understanding LogLikelihood Similarity

2014-04-27 Thread Mario Levitin
Hi, I've used LogLikelihood Similarity in user based nearest neighborhood collaborative filtering and it has given good results (better than the others). I have read the blog post by Ted Dunning ( http://tdunning.blogspot.com.tr/2008/03/surprise-and-coincidence.html) also looked at the implementa

Re: Reading the wiki

2014-04-27 Thread Dmitriy Lyubimov
install instructions (and content tree) seems to be pretty static. All JS or static files. On Sun, Apr 27, 2014 at 2:59 PM, Dmitriy Lyubimov wrote: > i think we would have to host mathjax to apease the browsers under https > handshake. I am not sure what would be associated with that, I am not

Re: Reading the wiki

2014-04-27 Thread Dmitriy Lyubimov
i think we would have to host mathjax to apease the browsers under https handshake. I am not sure what would be associated with that, I am not sure if mathjax is solely static content or it is an actual server doing something. On Sun, Apr 27, 2014 at 12:41 AM, Sebastian Schelter wrote: > What i

Re: Shopping cart Recommender (was Item-set Recommender)

2014-04-27 Thread Ted Dunning
Yeah... this Amazon hack is just a way to do multi-modal recommendations without actually having a framework capable of multi-modal operation. It is similar to taking a rating as equivalent to a fraction of a purchase. Neither has great standing and neither is necessary if you segregate the actio

Shopping cart Recommender (was Item-set Recommender)

2014-04-27 Thread Pat Ferrel
The literature has examples of building rules from item-sets, which seems pretty archaic. Also Amazon did a paper (2003?) on using individual items from the user’s cart then getting similar items and summing the weights to get ordering. Also seems wrong since the actions/user intent doesn’t real

Re: Item-Set Recommender

2014-04-27 Thread Ted Dunning
In general, any action that can be detected in a user history can be an item (column) in the user history matrix. If you find that there are item-sets that seem to occur together, then appearance of the entire item-set can be a reasonable feature to be assigned a column. Somewhat more plausible i

Re: Reading the wiki

2014-04-27 Thread Ted Dunning
That depends on whether the problem is the JS file or the AJAX call out to Latex running on the mathjax servers. It can't hurt to host the JS, I wouldn't think. On Sun, Apr 27, 2014 at 9:41 AM, Sebastian Schelter wrote: > What if we store a copy of the js file on our site and also serve it via

Re: Reading the wiki

2014-04-27 Thread Sebastian Schelter
What if we store a copy of the js file on our site and also serve it via https? On 04/27/2014 05:34 AM, Pat Ferrel wrote: Often CMSs have a way to configure https access to be used only for password or other secure areas of the site. No idea if the Apache CMS does this but worth asking. If th