Comments on: Cloudalicious suggestions http://blog.pietrosperoni.it/2005/06/01/cloudalicious-suggestions/ Pietro Speroni di Fenizio's web log Sat, 26 Nov 2011 18:15:24 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Pietro http://blog.pietrosperoni.it/2005/06/01/cloudalicious-suggestions/comment-page-1/#comment-181 Pietro Tue, 07 Jun 2005 10:33:02 +0000 http://blog.pietrosperoni.it/2005/06/01/cloudalicious-suggestions/#comment-181 Hello Adam, sorry if I answer you so late, but I was out. I described the other formula at the end of the last post: <a href="http://blog.pietrosperoni.it/2005/06/07/tag-clouds-and-spam/" rel="nofollow">tag clouds are hard to spam</a>. Thanks for the important link. My understanding is that power law don't always have an average, yet finite power law always have one. And this is a fundamental difference if we don't want to overemphasize the long tail. I carefully avoided the discussion on the various possible metric that could replace the euclidean one, because I know is a big topic, and deserve full attention. I would start by testing the various Ln metrics. But is useless to think about it right now. We first need to have some tool that given a URL finds us other URL that are near in <em>any</em> metric. Than switching from Euclidean metric (aka L2) to another Ln will be easy. It could even be a variable in the search form. Hello Adam,
sorry if I answer you so late, but I was out. I described the other formula at the end of the last post: tag clouds are hard to spam. Thanks for the important link. My understanding is that power law don’t always have an average, yet finite power law always have one. And this is a fundamental difference if we don’t want to overemphasize the long tail.

I carefully avoided the discussion on the various possible metric that could replace the euclidean one, because I know is a big topic, and deserve full attention. I would start by testing the various Ln metrics. But is useless to think about it right now. We first need to have some tool that given a URL finds us other URL that are near in any metric. Than switching from Euclidean metric (aka L2) to another Ln will be easy. It could even be a variable in the search form.

]]> By: Adam http://blog.pietrosperoni.it/2005/06/01/cloudalicious-suggestions/comment-page-1/#comment-180 Adam Sat, 04 Jun 2005 16:55:49 +0000 http://blog.pietrosperoni.it/2005/06/01/cloudalicious-suggestions/#comment-180 Hi Pietro, Thanks for all the ideas you've been writing about, great stuff. I suggested some ideas for tag related graphs <a href="http://www.econometa.com/archives/12" rel="nofollow">here</a> that you might be interested in; they are more about state than time evolution though. I also wanted to follow up on some things you've mentioned: in this post you mention possible alternatives to calculating weight so as to keep the "point" corresponding to a URL on the surface of the n-simplex in tag space; what would they be? Also, you previously suggested using metrics besides the Euclidean metric in calculating "distances" between URLs in tag space; which metrics would you consider, and how do you think they would more accurately describe this distance? Hi Pietro,

Thanks for all the ideas you’ve been writing about, great stuff. I suggested some ideas for tag related graphs here that you might be interested in; they are more about state than time evolution though.

I also wanted to follow up on some things you’ve mentioned: in this post you mention possible alternatives to calculating weight so as to keep the “point” corresponding to a URL on the surface of the n-simplex in tag space; what would they be? Also, you previously suggested using metrics besides the Euclidean metric in calculating “distances” between URLs in tag space; which metrics would you consider, and how do you think they would more accurately describe this distance?

]]>