Inspection 发现 crawl space water pond !! - 未名空间MITBBS历史存档

国际科技财经博客移民网络热点娱乐民生时事公众号

Redian新闻

>未名空间

>Living

Inspection 发现 crawl space water pond !!

Inspection 发现 crawl space water pond !!# Living

B*12011-05-04 07:05

1 楼

Amazon.com has the feature that if users search for particular CD or books
etc then it also tells what other related books/CDs users bought.
Example, if a user search for the book "Introduction to Algorithms" then it
also shows users who bought this book also bought "Robert Sedgewick -
Alogrithms in C++" or "Fundamentals in Data Structures".
Assuming everything is maintained in memory & file system what algorithm
will give this set of related intersection/connection ?

j*y2011-05-04 07:05

2 楼

东湾的townhouse, 价钱面积啥都不错。
但是这个crawl space的积水太多了。照片的左上边的黑色部分全是水。这个crawl
space是沙石
铺得。
咋办？有没有必要找专业人士看看有没有救？还是简单的 walk away ?

d*d2011-05-04 07:05

3 楼

我觉得这是个图论结构题,问的是你要怎么建立这个图.
algorithm好像用不上什么特别的.

it

【在 B*******1 的大作中提到】

: Amazon.com has the feature that if users search for particular CD or books
: etc then it also tells what other related books/CDs users bought.
: Example, if a user search for the book "Introduction to Algorithms" then it
: also shows users who bought this book also bought "Robert Sedgewick -
: Alogrithms in C++" or "Fundamentals in Data Structures".
: Assuming everything is maintained in memory & file system what algorithm
: will give this set of related intersection/connection ?

m*y2011-05-04 07:05

4 楼

Since it's exterior, should be covered by HOA.

B*12011-05-04 07:05

5 楼

我也觉得是，
譬如A书，用户甲买了A+B，用户乙买了A+C
amazon怎么提示B还是C啊，是不是A和B之间的weight根据多少用户买了A+B来定，然后
给提示的时候就根据所有从A出来的的edge给出weight最高那个node啊？

g*y2011-05-04 07:05

6 楼

If A buy book b, find all users buy book b. Count these users' order, find
top two books to recommend.
In real, I believe they have better logic, like restrict books to same
category of book b.

★ 发自iPhone App: ChineseWeb - 中文网站浏览器

【在 B*******1 的大作中提到】

: 我也觉得是，
: 譬如A书，用户甲买了A+B，用户乙买了A+C
: amazon怎么提示B还是C啊，是不是A和B之间的weight根据多少用户买了A+B来定，然后
: 给提示的时候就根据所有从A出来的的edge给出weight最高那个node啊？