Algorithms and models for network data and link analysis:
Network data are produced automatically by everyday interactions - social networks, power grids, and links between data sets are a few examples. Such data capture social and economic behavior in a form that can be analyzed using powerful computational tools. This book is a guide to both basic and ad...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York
Cambridge University Press
2016
|
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | Network data are produced automatically by everyday interactions - social networks, power grids, and links between data sets are a few examples. Such data capture social and economic behavior in a form that can be analyzed using powerful computational tools. This book is a guide to both basic and advanced techniques and algorithms for extracting useful information from network data. The content is organized around 'tasks', grouping the algorithms needed to gather specific types of information and thus answer specific types of questions. Examples include similarity between nodes in a network, prestige or centrality of individual nodes, and dense regions or communities in a network. Algorithms are derived in detail and summarized in pseudo-code. The book is intended primarily for computer scientists, engineers, statisticians and physicists, but it is also accessible to network scientists based in the social sciences. Matlab/Octave code illustrating some of the algorithms will be available at: http://www.cambridge.org/9781107125773 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 04 Jul 2016) |
| Beschreibung: | 1 online resource (xxv, 521 pages) |
| ISBN: | 9781316418321 |
| DOI: | 10.1017/CBO9781316418321 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043946092 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2016 |||| o||u| ||||||eng d | ||
| 020 | |a 9781316418321 |c Online |9 978-1-316-41832-1 | ||
| 024 | 7 | |a 10.1017/CBO9781316418321 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781316418321 | ||
| 035 | |a (OCoLC)967605918 | ||
| 035 | |a (DE-599)BVBBV043946092 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 004.6/5 |2 23 | |
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 100 | 1 | |a Fouss, François |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms and models for network data and link analysis |c François Fouss, Marco Saerens, Masashi Shimbo |
| 264 | 1 | |a New York |b Cambridge University Press |c 2016 | |
| 300 | |a 1 online resource (xxv, 521 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 04 Jul 2016) | ||
| 520 | |a Network data are produced automatically by everyday interactions - social networks, power grids, and links between data sets are a few examples. Such data capture social and economic behavior in a form that can be analyzed using powerful computational tools. This book is a guide to both basic and advanced techniques and algorithms for extracting useful information from network data. The content is organized around 'tasks', grouping the algorithms needed to gather specific types of information and thus answer specific types of questions. Examples include similarity between nodes in a network, prestige or centrality of individual nodes, and dense regions or communities in a network. Algorithms are derived in detail and summarized in pseudo-code. The book is intended primarily for computer scientists, engineers, statisticians and physicists, but it is also accessible to network scientists based in the social sciences. Matlab/Octave code illustrating some of the algorithms will be available at: http://www.cambridge.org/9781107125773 | ||
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Network analysis (Planning) / Mathematics | |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Saerens, Marco |e Sonstige |4 oth | |
| 700 | 1 | |a Shimbo, Masashi |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-12577-3 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-56481-7 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781316418321 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029355063 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781316418321 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781316418321 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176893060055040 |
|---|---|
| any_adam_object | |
| author | Fouss, François |
| author_facet | Fouss, François |
| author_role | aut |
| author_sort | Fouss, François |
| author_variant | f f ff |
| building | Verbundindex |
| bvnumber | BV043946092 |
| classification_rvk | ST 200 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781316418321 (OCoLC)967605918 (DE-599)BVBBV043946092 |
| dewey-full | 004.6/5 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6/5 |
| dewey-search | 004.6/5 |
| dewey-sort | 14.6 15 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9781316418321 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03120nmm a2200517zc 4500</leader><controlfield tag="001">BV043946092</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2016 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781316418321</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-316-41832-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781316418321</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781316418321</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967605918</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043946092</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6/5</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fouss, François</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and models for network data and link analysis</subfield><subfield code="c">François Fouss, Marco Saerens, Masashi Shimbo</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxv, 521 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 04 Jul 2016)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Network data are produced automatically by everyday interactions - social networks, power grids, and links between data sets are a few examples. Such data capture social and economic behavior in a form that can be analyzed using powerful computational tools. This book is a guide to both basic and advanced techniques and algorithms for extracting useful information from network data. The content is organized around 'tasks', grouping the algorithms needed to gather specific types of information and thus answer specific types of questions. Examples include similarity between nodes in a network, prestige or centrality of individual nodes, and dense regions or communities in a network. Algorithms are derived in detail and summarized in pseudo-code. The book is intended primarily for computer scientists, engineers, statisticians and physicists, but it is also accessible to network scientists based in the social sciences. Matlab/Octave code illustrating some of the algorithms will be available at: http://www.cambridge.org/9781107125773</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning) / Mathematics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Saerens, Marco</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shimbo, Masashi</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-12577-3</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-56481-7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781316418321</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029355063</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781316418321</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781316418321</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043946092 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:25Z |
| institution | BVB |
| isbn | 9781316418321 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029355063 |
| oclc_num | 967605918 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xxv, 521 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Fouss, François Verfasser aut Algorithms and models for network data and link analysis François Fouss, Marco Saerens, Masashi Shimbo New York Cambridge University Press 2016 1 online resource (xxv, 521 pages) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 04 Jul 2016) Network data are produced automatically by everyday interactions - social networks, power grids, and links between data sets are a few examples. Such data capture social and economic behavior in a form that can be analyzed using powerful computational tools. This book is a guide to both basic and advanced techniques and algorithms for extracting useful information from network data. The content is organized around 'tasks', grouping the algorithms needed to gather specific types of information and thus answer specific types of questions. Examples include similarity between nodes in a network, prestige or centrality of individual nodes, and dense regions or communities in a network. Algorithms are derived in detail and summarized in pseudo-code. The book is intended primarily for computer scientists, engineers, statisticians and physicists, but it is also accessible to network scientists based in the social sciences. Matlab/Octave code illustrating some of the algorithms will be available at: http://www.cambridge.org/9781107125773 Mathematik Network analysis (Planning) / Mathematics Rechnernetz (DE-588)4070085-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Saerens, Marco Sonstige oth Shimbo, Masashi Sonstige oth Erscheint auch als Druckausgabe 978-1-107-12577-3 Erscheint auch als Druckausgabe 978-1-107-56481-7 https://doi.org/10.1017/CBO9781316418321 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Fouss, François Algorithms and models for network data and link analysis Mathematik Network analysis (Planning) / Mathematics Rechnernetz (DE-588)4070085-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4070085-9 (DE-588)4001183-5 |
| title | Algorithms and models for network data and link analysis |
| title_auth | Algorithms and models for network data and link analysis |
| title_exact_search | Algorithms and models for network data and link analysis |
| title_full | Algorithms and models for network data and link analysis François Fouss, Marco Saerens, Masashi Shimbo |
| title_fullStr | Algorithms and models for network data and link analysis François Fouss, Marco Saerens, Masashi Shimbo |
| title_full_unstemmed | Algorithms and models for network data and link analysis François Fouss, Marco Saerens, Masashi Shimbo |
| title_short | Algorithms and models for network data and link analysis |
| title_sort | algorithms and models for network data and link analysis |
| topic | Mathematik Network analysis (Planning) / Mathematics Rechnernetz (DE-588)4070085-9 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Mathematik Network analysis (Planning) / Mathematics Rechnernetz Algorithmus |
| url | https://doi.org/10.1017/CBO9781316418321 |
| work_keys_str_mv | AT foussfrancois algorithmsandmodelsfornetworkdataandlinkanalysis AT saerensmarco algorithmsandmodelsfornetworkdataandlinkanalysis AT shimbomasashi algorithmsandmodelsfornetworkdataandlinkanalysis |