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

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.

主站蜘蛛池模板: 榆中县| 喀喇沁旗| 柳州市| 乐亭县| 南通市| 嘉祥县| 凤阳县| 乳山市| 宁津县| 南靖县| 凤阳县| 阳城县| 漾濞| 云南省| 津市市| 海伦市| 楚雄市| 安义县| 贡嘎县| 五原县| 理塘县| 凤山县| 平利县| 克什克腾旗| 略阳县| 周宁县| 五华县| 灵武市| 梨树县| 牟定县| 香港| 格尔木市| 建水县| 东至县| 毕节市| 延边| 蒙山县| 凤山县| 桑日县| 彩票| 肥乡县|