History of lastfm_aminer
The changes to the source code of this entry in the repository, newest first, each with the differences it made to the entry's files. They are also listed on GitLab.
[entries] Add the date when each entry was added, and remove icon_hash beff7c9
The dates are those of the commits that first added the entries' files (2020-08-11 for the entries of the initial commit); renamed entries keep the date of their first name. Changed: none
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 59d3f9a..c3cd3f4 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -31,7 +31,7 @@ citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. "Is more always
('D. Perito, C. Castelluccia, M. A. Kaafar, and P. Manils. "How unique and traceable are usernames?" In Privacy Enhancing Technologies, pages 1–17. Springer, 2011', 'https://doi.org/10.1007/978-3-642-22263-4_1'),
('H. Kwak, C. Lee, H. Park, and S. Moon. "What is Twitter, a social network or a news media?" In WWW ’10: Proceedings of the 19th international conference on World wide web, pages 591–600, New York, NY, USA, 2010. ACM.','https://doi.org/10.1145/1772690.1772751'),
('Yutao Zhang, Jie Tang, "Social Network Integration: Towards Constructing the Social Graph", arxiv:1311.2670','https://arxiv.org/abs/1311.2670')]
-icon_hash = '595b194b549f067e0263b535'
+date_added = '2020-08-11'
upstream_license = None
upstream_prefix = 'https://lfs.aminer.cn/lab-datasets/multi-sns'
files = [(("lastfm.tar.gz:lastfm.edges", "lastfm.tar.gz:lastfm.nodes"), None, None)]
[entries] Prefix the properties in the descriptions with (Node), (Edge) or (Graph) bc3dbbd
The lists of properties at the end of the descriptions marked edge properties with "Edge" but left node properties unmarked, or grouped them in "Nodes: `a`, ...; `b`, ..." items, so the kind of a property was often unclear. Every item now starts with (Node), (Edge) or (Graph), followed by the property names, a colon and the explanation, one item per property or group of properties; qualifications (kinds of nodes, networks) follow the names in parentheses. Properties that were only named got a short explanation, and a few items that named the wrong kind of property were corrected.
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 4689e90..59d3f9a 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -23,8 +23,8 @@ description = r"""A snapshot of the social network of Last.fm, a music website a
The network has the following properties:
-- `name`: the user ID in the source data.
-- `username`: the user name."""
+- (Node) `name`: the user ID in the source data.
+- (Node) `username`: the user name."""
tags = ['Social', 'Online', 'Unweighted']
url = 'https://lfs.aminer.cn/lab-datasets/multi-sns/'
citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. "Is more always merrier?: a deep dive into online social footprints." In 2012 ACM workshop on Workshop on online social networks, pages 67–72, 2012.', 'https://doi.org/10.1145/2342549.2342565'),
[entries] Remove unneeded code from the entries 2c69f19
Unneeded "global files" statements, unused imports and variables, f-strings without placeholders, duplicate keys in foodweb_little_rock (keeping the order and the values used), and the second definition of get_lines() in twitter_higgs. Nothing changes in the networks or descriptions. Changed: none
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 7899434..4689e90 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -44,7 +44,6 @@ def fetch_upstream(force=False):
@coerce_props()
@annotate()
def parse(alts=None):
- global files
name = __name__.split(".")[-1]
for (efname, nfname), alt, fmt in files:
g = Graph(directed=False)
[entries] Fix parse bugs and improve descriptions and metadata 6bb6851
- parse fixes from the review of the descriptions, e.g. us_patents (directed), celegans_2019 (synapse direction), ecoli_transcription and yeast_transcription (regulator to target), bitcoin (direction, phantom node), ego_social (Google+ features and circles), scotus_majority, arxiv_authors and social_location (as in SNAP), caida_as, dnc, dom, mist, reuters and bibsonomy (names on the right nodes), uci_zoo - every description now states explicitly what the nodes and edges represent; corrected titles, years, tags, citations and licences - the "Hypergraph" tag is removed; very large entries are marked `huge = True` (see --skip-huge) - ICON ids of partial duplicates added (hiv_transmission, congress_bills, openflights, dutch_school)
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 4deec76..7899434 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -19,7 +19,7 @@
from .. import *
title = "Last.fm social graph"
-description = r"""A snapshot of the social network of Last.fm, a music website and streaming radio service, where users can connect as friends. The network is part of a collection of several online social networks distributed by AMiner (Tsinghua University) for research on social network integration, i.e. on identifying the accounts of the same person across different services (Y. Zhang and J. Tang); judging from the references given with the data, parts of it originate from earlier studies on linking user accounts across services (D. Perito et al., 2011; T. Chen et al., 2012). The crawling procedure is not documented. According to the ICON index, the data were collected in late 2013. Nodes are users, identified by integer IDs, and include all users listed in the source data, 11 of which have no connections. In the source data each connected pair of users is listed only once, always with the smaller ID first, and the source does not document whether the relationship is directed; the edges are therefore stored as undirected.
+description = r"""A snapshot of the social network of Last.fm, a music website and streaming radio service, where users can connect as friends. The network is part of a collection of several online social networks distributed by AMiner (Tsinghua University) for research on social network integration, i.e. on identifying the accounts of the same person across different services (Y. Zhang and J. Tang); judging from the references given with the data, parts of it originate from earlier studies on linking user accounts across services (D. Perito et al., 2011; T. Chen et al., 2012). The crawling procedure is not documented. According to the ICON index, the data were collected in late 2013. Nodes are users, identified by integer IDs, and include all users listed in the source data, 11 of which have no connections. An edge connects two users who are connected in the social network; the type of connection (presumably friendship) is not documented by the source. In the source data each connected pair of users is listed only once, always with the smaller ID first, and the source does not document whether the relationship is directed; the edges are therefore stored as undirected.
The network has the following properties:
[entries] Fix parse bugs and improve the metadata of existing entries c996a0e
From a review of the dataset descriptions against the upstream sources and papers, and from user reports: - parse fixes (wrong edge direction or directedness, shifted or misnamed properties, merged node identities, duplicated or missing edges and nodes, wrong types), e.g. arxiv_citation (the HepTh dates were a copy of the HepPh ones; now from the KDD Cup 2003 data), eu_procurements, foursquare_global, hiv_transmission, genetic_multiplex, gnutella (adds the 05 snapshot), roadnet, macaque_neural, python_dependency - descriptions rewritten from the upstream sources, documenting every property - corrected titles, citations and DOIs, licences (ustream_license typo, the data's own terms), tags and ICON ids - url lists for entries with several sources or dataset pages - SocioPatterns entries moved to the site's new data location, with the daily networks of sp_infectious and sp_primary_school - the Michael Fire entries marked as orphans (served from the mirror) - redundant type forcings removed after the graph-tool coercion fixes
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index fdf207a..4deec76 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -19,8 +19,12 @@
from .. import *
title = "Last.fm social graph"
-description = """This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.[^icon]
-[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
+description = r"""A snapshot of the social network of Last.fm, a music website and streaming radio service, where users can connect as friends. The network is part of a collection of several online social networks distributed by AMiner (Tsinghua University) for research on social network integration, i.e. on identifying the accounts of the same person across different services (Y. Zhang and J. Tang); judging from the references given with the data, parts of it originate from earlier studies on linking user accounts across services (D. Perito et al., 2011; T. Chen et al., 2012). The crawling procedure is not documented. According to the ICON index, the data were collected in late 2013. Nodes are users, identified by integer IDs, and include all users listed in the source data, 11 of which have no connections. In the source data each connected pair of users is listed only once, always with the smaller ID first, and the source does not document whether the relationship is directed; the edges are therefore stored as undirected.
+
+The network has the following properties:
+
+- `name`: the user ID in the source data.
+- `username`: the user name."""
tags = ['Social', 'Online', 'Unweighted']
url = 'https://lfs.aminer.cn/lab-datasets/multi-sns/'
citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. "Is more always merrier?: a deep dive into online social footprints." In 2012 ACM workshop on Workshop on online social networks, pages 67–72, 2012.', 'https://doi.org/10.1145/2342549.2342565'),
@@ -28,9 +32,9 @@ citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. "Is more always
('H. Kwak, C. Lee, H. Park, and S. Moon. "What is Twitter, a social network or a news media?" In WWW ’10: Proceedings of the 19th international conference on World wide web, pages 591–600, New York, NY, USA, 2010. ACM.','https://doi.org/10.1145/1772690.1772751'),
('Yutao Zhang, Jie Tang, "Social Network Integration: Towards Constructing the Social Graph", arxiv:1311.2670','https://arxiv.org/abs/1311.2670')]
icon_hash = '595b194b549f067e0263b535'
-ustream_license = None
+upstream_license = None
upstream_prefix = 'https://lfs.aminer.cn/lab-datasets/multi-sns'
-files = [("lastfm.tar.gz:lastfm.edges", None, None)]
+files = [(("lastfm.tar.gz:lastfm.edges", "lastfm.tar.gz:lastfm.nodes"), None, None)]
def fetch_upstream(force=False):
return fetch_upstream_files(__name__.split(".")[-1], upstream_prefix, files,
@@ -42,13 +46,21 @@ def fetch_upstream(force=False):
def parse(alts=None):
global files
name = __name__.split(".")[-1]
- for fname, alt, fmt in files:
- with open_upstream_file(name, fname, "r") as f:
- def get_line():
- for line in f:
- vals = [int(x) for x in line.split()]
- vals[0], vals[1] = vals[1], vals[0]
- yield vals
- g = Graph(directed=True)
- g.vp.name = g.add_edge_list(get_line(), hashed=True)
+ for (efname, nfname), alt, fmt in files:
+ g = Graph(directed=False)
+ # user IDs are consecutive integers starting at zero
+ with open_upstream_file(name, nfname, "r") as f:
+ rows = [line.rstrip("\n").split("\t", 1) for line in f]
+ assert all(int(r[0]) == i for i, r in enumerate(rows))
+ g.add_vertex(len(rows))
+ g.vp.name = g.new_vp("int64_t", vals=range(len(rows)))
+ g.vp.username = g.new_vp("string", vals=[r[1] for r in rows])
+ del rows
+ with open_upstream_file(name, efname, "r") as f:
+ while True:
+ lines = f.readlines(1 << 24)
+ if not lines:
+ break
+ g.add_edge_list(numpy.array("".join(lines).split(),
+ dtype="int64").reshape(-1, 2))
yield alt, g
Update copyright information 73a4f0d
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index b252458..fdf207a 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2020-2024 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2026 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Update copyright information 3d288ea
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 1f56164..b252458 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2020-2023 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2024 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Update copyright information 8d005ae
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index f3ee49a..1f56164 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2021 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2023 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Update copyright info db2efcc
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 1b9151f..f3ee49a 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2021 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Update citations to use DOIs e878874
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 65a902e..1b9151f 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -23,10 +23,10 @@ description = """This network contains the social graph of last.fm, a site that
[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
tags = ['Social', 'Online', 'Unweighted']
url = 'https://lfs.aminer.cn/lab-datasets/multi-sns/'
-citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. Is more always merrier?: a deep dive into online social footprints. In 2012 ACM workshop on Workshop on online social networks, pages 67–72, 2012.', 'https://doi.org/10.1145/2342549.2342565'),
- ('D. Perito, C. Castelluccia, M. A. Kaafar, and P. Manils. How unique and traceable are usernames? In Privacy Enhancing Technologies, pages 1–17. Springer, 2011', 'https://doi.org/10.1007/978-3-642-22263-4_1'),
- ('H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In WWW ’10: Proceedings of the 19th international conference on World wide web, pages 591–600, New York, NY, USA, 2010. ACM.','https://doi.org/10.1145/1772690.1772751'),
- ('Yutao Zhang, Jie Tang, Social Network Integration: Towards Constructing the Social Graph, arxiv:1311.2670','https://arxiv.org/abs/1311.2670')]
+citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. "Is more always merrier?: a deep dive into online social footprints." In 2012 ACM workshop on Workshop on online social networks, pages 67–72, 2012.', 'https://doi.org/10.1145/2342549.2342565'),
+ ('D. Perito, C. Castelluccia, M. A. Kaafar, and P. Manils. "How unique and traceable are usernames?" In Privacy Enhancing Technologies, pages 1–17. Springer, 2011', 'https://doi.org/10.1007/978-3-642-22263-4_1'),
+ ('H. Kwak, C. Lee, H. Park, and S. Moon. "What is Twitter, a social network or a news media?" In WWW ’10: Proceedings of the 19th international conference on World wide web, pages 591–600, New York, NY, USA, 2010. ACM.','https://doi.org/10.1145/1772690.1772751'),
+ ('Yutao Zhang, Jie Tang, "Social Network Integration: Towards Constructing the Social Graph", arxiv:1311.2670','https://arxiv.org/abs/1311.2670')]
icon_hash = '595b194b549f067e0263b535'
ustream_license = None
upstream_prefix = 'https://lfs.aminer.cn/lab-datasets/multi-sns'
Change license from GPLv3 to AGPLv3 d754be5
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index 0aaf09f..65a902e 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -3,18 +3,18 @@
#
# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
#
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
+# This program is free software: you can redistribute it and/or modify it under
+# the terms of the GNU Affero General Public License as published by the Free
+# Software Foundation, either version 3 of the License, or (at your option) any
+# later version.
#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-# GNU General Public License for more details.
+# This program is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more
+# details.
#
-# You should have received a copy of the GNU General Public License
-# along with this program. If not, see <http://www.gnu.org/licenses/>.
+# You should have received a copy of the GNU Affero General Public License along
+# with this program. If not, see <http://www.gnu.org/licenses/>.
from .. import *
Add explicit attribution to descriptions obtained from ICON 1645314
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
index f86255d..0aaf09f 100644
--- a/entries/lastfm_aminer/__init__.py
+++ b/entries/lastfm_aminer/__init__.py
@@ -19,7 +19,8 @@
from .. import *
title = "Last.fm social graph"
-description = "This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j."
+description = """This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.[^icon]
+[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
tags = ['Social', 'Online', 'Unweighted']
url = 'https://lfs.aminer.cn/lab-datasets/multi-sns/'
citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. Is more always merrier?: a deep dive into online social footprints. In 2012 ACM workshop on Workshop on online social networks, pages 67–72, 2012.', 'https://doi.org/10.1145/2342549.2342565'),
Initial commit cc85872
diff --git a/entries/lastfm_aminer/__init__.py b/entries/lastfm_aminer/__init__.py
new file mode 100644
index 0000000..f86255d
--- /dev/null
+++ b/entries/lastfm_aminer/__init__.py
@@ -0,0 +1,53 @@
+#! /usr/bin/env python
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+from .. import *
+
+title = "Last.fm social graph"
+description = "This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j."
+tags = ['Social', 'Online', 'Unweighted']
+url = 'https://lfs.aminer.cn/lab-datasets/multi-sns/'
+citation = [('T. Chen, M. A. Kaafar, A. Friedman, and R. Boreli. Is more always merrier?: a deep dive into online social footprints. In 2012 ACM workshop on Workshop on online social networks, pages 67–72, 2012.', 'https://doi.org/10.1145/2342549.2342565'),
+ ('D. Perito, C. Castelluccia, M. A. Kaafar, and P. Manils. How unique and traceable are usernames? In Privacy Enhancing Technologies, pages 1–17. Springer, 2011', 'https://doi.org/10.1007/978-3-642-22263-4_1'),
+ ('H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In WWW ’10: Proceedings of the 19th international conference on World wide web, pages 591–600, New York, NY, USA, 2010. ACM.','https://doi.org/10.1145/1772690.1772751'),
+ ('Yutao Zhang, Jie Tang, Social Network Integration: Towards Constructing the Social Graph, arxiv:1311.2670','https://arxiv.org/abs/1311.2670')]
+icon_hash = '595b194b549f067e0263b535'
+ustream_license = None
+upstream_prefix = 'https://lfs.aminer.cn/lab-datasets/multi-sns'
+files = [("lastfm.tar.gz:lastfm.edges", None, None)]
+
+def fetch_upstream(force=False):
+ return fetch_upstream_files(__name__.split(".")[-1], upstream_prefix, files,
+ force)
+
+@cache_network()
+@coerce_props()
+@annotate()
+def parse(alts=None):
+ global files
+ name = __name__.split(".")[-1]
+ for fname, alt, fmt in files:
+ with open_upstream_file(name, fname, "r") as f:
+ def get_line():
+ for line in f:
+ vals = [int(x) for x in line.split()]
+ vals[0], vals[1] = vals[1], vals[0]
+ yield vals
+ g = Graph(directed=True)
+ g.vp.name = g.add_edge_list(get_line(), hashed=True)
+ yield alt, g