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

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.

主站蜘蛛池模板: 西藏| 阿拉尔市| 庆城县| 和静县| 密山市| 遵化市| 无极县| 仪陇县| 隆昌县| 天门市| 绥化市| 娄烦县| 甘谷县| 化州市| 金坛市| 万山特区| 罗平县| 长丰县| 武山县| 西吉县| 大足县| 抚松县| 普格县| 新巴尔虎左旗| 闵行区| 江门市| 甘肃省| 漳州市| 广安市| 伊吾县| 美姑县| 阿拉善左旗| 墨竹工卡县| 双辽市| 淮南市| 信丰县| 涟水县| 五华县| 临桂县| 张掖市| 红河县|