官术网_书友最值得收藏!

Product recommendations

One of the issues with moving a traditional business online, such as commerce, is that tasks that used to be done by humans need to be automated for the online business to scale and compete with existing automated businesses. One example of this is up-selling, or selling an extra item to a customer who is already buying. Automated product recommendations through data mining are one of the driving forces behind the e-commerce revolution that is turning billions of dollars per year into revenue.

In this example, we are going to focus on a basic product recommendation service. We design this based on the following idea: when two items are historically purchased together, they are more likely to be purchased together in the future. This sort of thinking is behind many product recommendation services, in both online and offline businesses.

A very simple algorithm for this type of product recommendation algorithm is to simply find any historical case where a user has brought an item and to recommend other items that the historical user brought. In practice, simple algorithms such as this can do well, at least better than choosing random items to recommend. However, they can be improved upon significantly, which is where data mining comes in.

To simplify the coding, we will consider only two items at a time. As an example, people may buy bread and milk at the same time at the supermarket. In this early example, we wish to find simple rules of the form:

If a person buys product X, then they are likely to purchase product Y

More complex rules involving multiple items will not be covered such as people buying sausages and burgers being more likely to buy tomato sauce.

主站蜘蛛池模板: 巴林左旗| 太谷县| 灵石县| 七台河市| 大同县| 利津县| 永靖县| 仁化县| 新河县| 镇远县| 榆社县| 亳州市| 镇远县| 芒康县| 临海市| 洛阳市| 庆云县| 年辖:市辖区| 荥经县| 威远县| 南召县| 星子县| 镇远县| 大丰市| 拉萨市| 无为县| 莱芜市| 黎平县| 宣威市| 凤庆县| 宁明县| 温州市| 黔西| 思茅市| 崇仁县| 弋阳县| 襄垣县| 巨野县| 太仆寺旗| 白银市| 普安县|