Going to RecSys 2015 this year? I’ll be there, giving several talks:

• On Wednesday, I’ll present a paper on what happens when you give users a ‘pick recommender’ menu (work with Joe Konstan, Max Harper, and Daniel Kluver).

• On Saturday, I’ll be speaking with the doctoral symposium on finishing out a recommender systems Ph.D and moving to the next step in your career.

• On Sunday, I am giving a talk to the Large Scale Recommender Systems workshop on scalability challenges in recommender systems research. This might be a bit of an odd talk, but I plan to talk about what happens when the thing you want to scale is experimental capability, possibly over smaller data sets, and some of the things we’ve done in LensKit to support that kind of work, as well as capabilities and challenges in different kinds of experimental setups for understanding recommender systems and user behavior.

Slides for each of my talks will be published on my talks page.

Mixed in with all this, of course, is a lot of meetings with various friends and colleagues (waves to CrowdRec) and talking about research. I look forward to seeing you all in Vienna.

It’s hard, I think, for a recommender system to beat a good library shelf. The wonderful serendipity of browsing the stacks of books, be they the New Arrivals rack or section Z1002, is a high bar to match, or at least they’ve been very good to me.

I basically owe my career to finding Christopher Lampton’s Programming in BASIC on the shelves of the children’s nonfiction section of the Pocahontas Public Library¹. My programming skill grew through additional books from its shelves, and those of the libraries in larger neighboring towns.

Also at the Pocahontas library, I discovered The Cuckoo’s Egg, one of my favorite books in high school. A footnote therein presented a recipe for chocolate chocolate chip cookies, dubbed ‘Hacker Cookies’ as they entered my family’s repertoire.

The core of an item-item collaborative filter is the item similarity function: a function of two items $s(i,j): \mathcal{i}\times\mathcal{i} \to [-1,1]$ that measures how similar those items are. Common choices are vector similarity functions over the vectors of users’ ratings of each item, such as the cosine similarity or Pearson correlation.

Early on, Sarwar et al. tested a few choices:

• The Pearson correlation from statistics:

  $$\frac{\sum{(r_{ui} - \mu_i) (r_{uj} - \mu_j)}}{\sqrt{\sum{(r_{ui} - \mu_i)^2}} \sqrt{\sum{(r_{uj} - \mu_j)^2}}}$$

• The cosine similarity between raw vectors:

  $$\frac{\vec{r_i}\cdot\vec{r_j}}{\|\vec{r_i}\|_2\|\vec{r_j}\|_2} = \frac{\sum{r_{ui} r_{uj}}}{\sqrt{\sum{r_{ui}^2}} \sqrt{\sum{r_{uj}^2}}}$$

• The adjusted cosine similarity between vectors normalized by subtracting the user’s mean rating:

  $$\frac{\vec{\hat{r}_i}\cdot\vec{\hat{r}_j}}{\|\vec{\hat{r}_i}\|_2\|\vec{\hat{r}_j}\|_2} = \frac{\sum{(r_{ui} - \mu_u) (r_{uj} - \mu_u)}}{\sqrt{\sum{(r_{ui} - \mu_u)^2}} \sqrt{\sum{(r_{uj} - \mu_u)^2}}}$$

They found adjusted cosine to work better, and so far as I know, it has been the dominant similarity function for rating-based item-item CF systems.

For the good of yourself and your friends, family, and neighbors, it’s important to keep your computer (and phone) as secure as you practically can. But how do you do this? There is a lot of security advice floating around; a lot of it is confusing, and some of it is inaccurate. I get things wrong, too!

I’m pretty excited for Decent Security; it’s very much a work in progress, but as Taylor Swift continues to fill it out, I expect that it will be a very good resource.

But until then, and perhaps as something of a Cliff’s Notes, here are some of my top suggestions. Basic things that I’d suggest to any friends and family.

These also aren’t just limited to your desktop or laptop PC; some of them pertain to online accounts and mobile devices. This guide is also more of a ‘what to do’ than ‘how to do’; it assumes you are comfortable with clicking through settings pages, but don’t know what settings to check.

Tried a culinary experiment tonight!

Here’s the recipe (serves 2-3):

• 1 medium onion, chopped
• ½ medium jalapeño, diced
• 2 tsp Satay spices, ground
• Dash of paprika
• 1 tsp salt (I didn’t measure, this is a guess)
• 8oz seitan strips
• Frozen broccoli (1–2C)
• ½C water or stock
• 4 large-ish baby bella mushrooms, sliced
• Oil (I used vegatable)