Amazon user item temporal bipartite rating network

This bipartite network contains product ratings from the Amazon online shopping website. The rating scale ranges from 1 to 5, where 5 denotes the most positive rating. Nodes represent users and products, and edges represent individual ratings.

More information about the network is provided here:
http://konect.uni-koblenz.de/networks/amazon-ratings

Files:
meta.amazon-ratings -- Metadata about the network
out.amazon-ratings -- The adjacency matrix of the network in space separated values format, with one edge per line
The meaning of the columns in out.amazon-ratings are:
First column: ID of from node
Second column: ID of to node
Third column: edge weight
Fourth column: timestamp of the edge

Complete documentation about the file format can be found in the KONECT
handbook, in the section File Formats, available at:

http://konect.uni-koblenz.de/publications

All files are licensed under a Creative Commons Attribution-ShareAlike 2.0 Germany License.
For more information concerning license visit http://konect.uni-koblenz.de/license.

Use the following References for citation:

@MISC{konect:2016:amazon-ratings,
title = {Amazon ratings network dataset -- {KONECT}},
month = oct,
year = {2016},
url = {http://konect.uni-koblenz.de/networks/amazon-ratings}
}

@inproceedings{konect:lim2010,
author = {Lim, Ee-Peng and Nguyen, Viet-An and Jindal, Nitin and Liu, Bing and Lauw, Hady Wirawan},
title = {Detecting Product Review Spammers Using Rating Behaviors},
booktitle = {Proc. Int. Conf. on Information and Knowledge Management},
year = {2010},
pages = {939--948},
}

@inproceedings{konect:jindal2008,
author = {Jindal, Nitin and Liu, Bing},
title = {Opinion Spam and Analysis},
booktitle = {Proc. Int. Conf. on Web Search and Web Data Mining},
year = {2008},
pages = {219--230},
}

@inproceedings{konect:mukherjee2012,
author = {Mukherjee, Arjun and Liu, Bing and Glance, Natalie},
title = {Spotting Fake Reviewer Groups in Consumer Reviews},
booktitle = {Proc. Int. Conf. on World Wide Web},
year = {2012},
pages = {191--200},
}

@inproceedings{konect,
title = {{KONECT} -- {The} {Koblenz} {Network} {Collection}},
author = {Jérôme Kunegis},
year = {2013},
booktitle = {Proc. Int. Conf. on World Wide Web Companion},
pages = {1343--1350},
url = {http://userpages.uni-koblenz.de/~kunegis/paper/kunegis-koblenz-network-collection.pdf},
url_presentation = {http://userpages.uni-koblenz.de/~kunegis/paper/kunegis-koblenz-network-collection.presentation.pdf},
}

本二分网络包含了来自亚马逊在线购物网站的 产品评分数据。评分范围从1至5，其中5代表最积极的评分。节点代表用户和产品，边则表示单个评分。关于该网络的更多信息可在此处获取：
http://konect.uni-koblenz.de/networks/amazon-ratings

文件列表：
meta.amazon-ratings -- 网络的元数据
out.amazon-ratings -- 以空格分隔的值格式提供的网络的邻接矩阵，每行一个边
out.amazon-ratings中的列含义如下：
第一列：出节点的ID
第二列：入节点的ID
第三列：边权重
第四列：边的时间戳

关于文件格式的完整文档可在KONECT手册的文件格式部分找到，可在以下链接获取：
http://konect.uni-koblenz.de/publications

所有文件均受Creative Commons Attribution-ShareAlike 2.0 Germany许可证的约束。有关许可证的更多信息，请访问以下链接：
http://konect.uni-koblenz.de/license.

以下为引用文献：
@MISC{konect:2016:amazon-ratings,
title = {亚马逊评分网络数据集 -- {KONECT}},
month = oct,
year = {2016},
url = {http://konect.uni-koblenz.de/networks/amazon-ratings}
}
@inproceedings{konect:lim2010,
author = {Lim, Ee-Peng and Nguyen, Viet-An and Jindal, Nitin and Liu, Bing and Lauw, Hady Wirawan},
title = {利用评分行为检测产品评论垃圾邮件者},
booktitle = {国际信息与知识管理会议论文集},
year = {2010},
pages = {939--948}
}
@inproceedings{konect:jindal2008,
author = {Jindal, Nitin and Liu, Bing},
title = {意见垃圾邮件及其分析},
booktitle = {国际网络搜索与网络数据挖掘会议论文集},
year = {2008},
pages = {219--230}
}
@inproceedings{konect:mukherjee2012,
author = {Mukherjee, Arjun and Liu, Bing and Glance, Natalie},
title = {在消费者评论中识别虚假评论者群体},
booktitle = {国际万维网会议论文集},
year = {2012},
pages = {191--200}
}
@inproceedings{konect,
title = {{KONECT} -- {科布伦茨} {网络} {集合}},
author = {Jérôme Kunegis},
year = {2013},
booktitle = {国际万维网伴随会议论文集},
pages = {1343--1350},
url = {http://userpages.uni-koblenz.de/~kunegis/paper/kunegis-koblenz-network-collection.pdf},
url_presentation = {http://userpages.uni-koblenz.de/~kunegis/paper/kunegis-koblenz-network-collection.presentation.pdf}
}